IEMS 450-1
Mathematical Optimization I
Linear programming formulation, simplex algorithm, optimality conditions, duality, sensitivity analysis, robust optimization, network flow, discrete optimization, Lagrangian method.
Prerequisites & course information
Prerequisites: Graduate students with an understanding of linear algebra and calculus.
Sources
- Course catalogue ↗2026–2027