Lecture 24: Linear Programming
We discussed linear programming and problems such as scheduling, diet optimization, shortest paths, max flows, min-cost max flows, and zero-sum games which can be expressed as an LP.
This video contains parts of L25 as well.
- LP, Guns and Butter
- Dantzig, Berlin
- Stigler/UVA diet
- Shortest paths as LP
- Max flow as LP
- Min cost flow as LP
- Standard form
- Zero-sum games
- Simplex and example
To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video