IEMS 454-0
Large Scale Optimization
Algorithms for large-scale optimization. Ellipsoid method and complexity of linear programming; equivalence of separation and optimization; path-following interior point methods, including self-dual methods; decomposition algorithms, including column generation and row generation for linear, nonlinear, and integer programming; selected applications.
Prerequisites & course information
Prerequisite: Graduate students who have completed IEMS 450-1 .
Sources
- Course catalogue ↗2026–2027