Video Lectures

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 Ax=b and x0 
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: X chooses rows of payoff matrix, Y chooses columns.

Related sections in textbook: VI.2–VI.3

Instructor: Prof. Gilbert Strang

Problems for Lecture 24
From textbook Section VI.2

1. Minimize F(x)=12xTSx=12x12+2x22 subject to ATx=x1+3x2=b.

  1. What is the Lagrangian L(x,λ) for this problem?
  2. What are the three equations “derivative of L= zero” ?
  3. Solve those equations to find x=(x1,x2) and the multiplier λ.
  4. Draw Figure VI.4 for this problem with constraint line tangent to cost circle.
  5. Verify that the derivative of the minimum cost is F/b=λ.

From textbook Section VI.3

2. Suppose the constraints are x1+x2+2x3=4 and x10,x20,x30.
Find the three corners of this triangle in R3. Which corner minimizes the cost cTx=5x1+3x2+8x3?

5. Find the optimal (minimizing) strategy for X to choose rows. Find the optimal (maximizing) strategy for Y to choose columns. What is the payoff from X to Y at this optimal minimax point x,y?

Payoffmatrices[1248][1482]

Course Info

Departments
As Taught In
Spring 2018
Learning Resource Types
Lecture Videos
Problem Sets
Instructor Insights