ORIE 3300 Optimization I
Fall and summer. 4 credits. Prerequisite: grade of C– or better in MATH 2210 or 2940.
Formulation of linear programming problems and solutions by the simplex method. Related topics such as sensitivity analysis, duality, and network programming. Applications include such models as resource allocation and production planning. Introduction to interior-point methods for linear programming.