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 not been taught since Fall 2020 and will not be taught in the academic year 2022-2023.