INE501 Linear Programming

[3–0, 3 cr.]

Formulation of linear programming problems; Simplex method; Duality and sensitivity analysis. Prerequisites: GNE333 Engineering Analysis I and consent of instructor.