Class 19, C&O 367



  1. Duality for Convex Programs (Sect. 5.4, pgs 199-210)
    1. Weak and Strong duality for convex programs, (i.e. min-max and max-min type of formulation).
    2. linear and quadratic program examples
    3. Duffin's example of a duality gap