Approximation AlgorithmsCovers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Hedging for LPsCovers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Relations Between EventsExplores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
KKT and Convex OptimizationCovers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.