Theory and application of linear programming. Includes formulation of linear programming models, simplex, revised simplex and dual simplex algorithms, duality, parametric procedures, interpretation of results, and the decomposition principle.
Prerequisite: consent of instructor.