Linear Programming Explained
Optimize linear objectives over polyhedral feasible regions. Simplex walks vertices; duality offers economic interpretation.
📚 Fundamentals
- Feasible region: intersection of half-spaces (a polytope)
- Simplex method: pivot along edges to improve objective
- Duality: bounds and shadow prices