Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.
Explores the Branch and Bound algorithm in discrete optimization, efficiently finding optimal solutions by calculating lower bounds on subsets.
Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.
