Class 17, C&O 466/666



  1. Theory of Constrained Optimization, Chap. 12, cont...
    (with basic convex analysis/duality added)
    1. generalized Farkas' Lemma (with respect to cone ordering - with examples e.g. semidefinite programming)
    2. examples where Farkas' lemma fails