• Reading: Chapter 7
  • Lecture note: part 1 (April 9), part 2 (April 16)
  • Practice problem set:
    • 7.08 (Introduce a variable to represent max|.|, and minimize that variable. See page 212. )
    • 7.10 (Follow the steps in pages 202-203)
    • 7.14 (Follow section 7.5 to setup two linear programs, one for Joey and one for Tony. Solve the linear programs using simplex.)
    • 7.23 (See the hint in the textbook. It's also related to matching.)
    • 7.25 (See Figure 7.11 to convert your linear program to its dual.)