Linear programming
Optimization & linear programming · Standard syllabus
Linear programming problems: standard form and geometry
Objectives
- Linear programming problems: standard form and geometry
- Feasible regions, vertices, and the fundamental theorem of LP
- Simplex method: pivoting, optimality, and termination
- Duality: weak and strong duality (statements)
- Sensitivity analysis and shadow prices (introduction)
Study materials
- Practice testComing soon