course
OPER 213 : Linear Programming
Definitions and formulation of linear programs. Review of linear algebra and convex analysis. Algebra of the simplex method. The simplex method. Sensitivity analysis. Duality theory. The dual simplex method. The revised simplex method. Some applications of linear programming.