ISYE 6661
Linear Optimization
Theory, algorithms, and applications of linear programming. Topics include the simplex method and resolution of degeneracy, duality and sensitivity analysis, basis factorization, the dual and revised simplex methods, and geometry of polyhedra. Intended for Ph.D. students.
Topics
- the simplex method and resolution of degeneracy
- duality and sensitivity analysis
- basis factorization
- the dual and revised simplex methods
- and geometry of polyhedra
Topics explicitly listed in official catalogue description
Sources
- Course catalogue ↗2026-2027