ACM724 Linear Programming

[3–0, 3 cr.]

Topics covered are: Simplex method, degeneracy, cycling, fundamental theorem of linear programming, weak and strong duality theorems, dual simplex method, resource allocation, sensitivity analysis, simplex method in matrix notation, parametric analysis, and applications.

Note: This course has been unavailable since 2016–2017.