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