Discrete optimization: KnapsackExplores modeling classic optimization problems as mixed integer linear problems, focusing on the knapsack problem and its applications.
Hedging for LPsCovers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.