Class 16, C&O 466/666



  1. Theory of Constrained Optimization, Chap. 12, cont...
    (with basic convex analysis/duality added)
    1. Basic separation theorem
    2. Lemma: K is a ccc iff K=K++ and proof using separation theorem
    3. derivation of Farkas' Lemma (using above lemma)