In this program
- Linear programming problems: standard form and geometry
- Feasible regions and vertices
- The fundamental theorem of LP
- Simplex method
- Termination
- Duality: weak and strong duality (statements)
- Sensitivity analysis
- Shadow prices (introduction)
Linear programming
Linear programming problems: standard form and geometry
Optimization & linear programming · Standard syllabus
Topic
Linear programming problems: standard form and geometry
Undergraduate Optimization & Linear Programming — scope drawn from open optimization / LP materials (e.g. Boyd convex-optimization companion undergrad tracks) and typical US syllabi.