Applications of Linear Programming 12 February 2019 cs4501/econ4559 Spring 2019 David Evans and Denis Nekipelov https://uvammm.github.io Zinedine Zidane’s penalty in 2006 World Cup Final
subject to ) ≥ ≥ 0 primal problem dual problem T = T Proof sketch: roughly – show that simplex algorithm for both problems produces same result. if both feasible:
course: https://www.cs.cmu.edu/~avrim/451f11/lectures/lect1101.pdf hi ≤ 4 hj ≤ 4 ik ≤ 3 jk ≤ 2 kj ≤ 1 kl ≤ 2 jm ≤ 3 ml ≤ 4 maximize kl + ml subject to: hi = ik kl + kj = ik hj + kj = jm + jk ml = jm