Lecture 24: Linear Programming and Two-Person Games
Description
This lecture focuses on several topics that are specific parts of optimization. These include linear programming (LP), the max-flow min-cut theorem, two-person zero-sum games, and duality.
Summary
Linear program: Minimize cost subject to
Inequalities make the problem piecewise linear.
Simplex method reduces cost from corner point to corner point.
Dual linear program is a maximization: Max = Min!
Game:
Related sections in textbook: VI.2–VI.3
Instructor: Prof. Gilbert Strang
Problems for Lecture 24
From textbook Section VI.2
1. Minimize
- What is the Lagrangian
for this problem? - What are the three equations “derivative of
zero” ? - Solve those equations to find
and the multiplier . - Draw Figure VI.4 for this problem with constraint line tangent to cost circle.
- Verify that the derivative of the minimum cost is
.
From textbook Section VI.3
2. Suppose the constraints are
Find the three corners of this triangle in R3. Which corner minimizes the cost
5. Find the optimal (minimizing) strategy for