Explores greedy heuristics in optimization, integrality constraints, and comparison of optimization methods.
Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
Explores the concept of duality in linear programming, discussing the relationship between primal and dual problems.
Explores duality in linear programming, strong duality, complementary slackness, and the economic interpretation of dual variables as prices.
