AMS 540 - Linear Programming

Formulation of linear programming problems and solutions by simplex method. Duality, sensitivity analysis, dual simplex algorithm, decomposition. Applications to the transportation problem, two-person games, assignment problem, and introduction to integer and nonlinear programming.

3 credits

Grading Letter graded (A, A-, B+, etc.)