Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.
Explores finding the initial Basic Feasible Solution (BFS) in a linear program.
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
