Linear Programming Duality
A note on primal-dual linear programs, weak duality, strong duality, complementary slackness, and economic interpretations.
Download PDF
Academic Notes · Optimization
Linear Programming
Notes on linear optimization, feasible regions, duality, complementary slackness, simplex geometry, and sensitivity analysis.
Linear Programming
Notes and drafts.
This section collects notes on primal-dual structure, geometric interpretation, algorithmic ideas, and sensitivity analysis in linear optimization.
Simplex Method: Geometry Before Algorithm
A geometric introduction to vertices, bases, adjacent basic feasible solutions, and simplex pivots.
Coming soonSensitivity Analysis
A short note on shadow prices, reduced costs, right-hand-side perturbations, and objective coefficient changes.
Coming soon