Explores fundamental groups, homotopy classes, and coverings in connected manifolds.
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Explores the Branch and Bound algorithm in discrete optimization, efficiently finding optimal solutions by calculating lower bounds on subsets.
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
