ORI 391Q.5
Linear Programming
Models, algorithms, and theory of linear programming. Linear programming geometry, primal, dual and revised simplex algorithms, duality theory, optimality conditions, sensitivity analyses, interior point methods, and computer implementations.
Prerequisites & course information
Models, algorithms, and theory of linear programming. Linear programming geometry, primal, dual and revised simplex algorithms, duality theory, optimality conditions, sensitivity analyses, interior point methods, and computer implementations.
Sources
- Course catalogue ↗2026-2027