ISYE6661 [at Georgia Tech]

Linear Optimization, 3 credit hours — 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.

Prereqs: MATH2406

Taught by:

• Arkadi Nemirovski (from CIOS): 8.2 hours per week on average; 7.7 in Spring 2023; 8 in Fall 2018; 9.5 in Spring 2018.

Main sections