Linear Programming: Optimization and Duality

Related lectures (32)

Covers the application of the two-phase Simplex algorithm to solve linear programming problems.

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.

Delves into duality in optimization, weak duality, cost certificates, and transforming non-linear programs into linear ones.

Explores certificates, proving solution existence, constraints, and linear programming duality.

Explores strong duality, complementary slackness, economic interpretation, and stochastic problem scenarios in linear programming.

Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.

Explains network flows, LP formulations, simplex method, duality, and practical applications.

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.

Explores finding the initial Basic Feasible Solution (BFS) in a linear program.

Covers exercises on the Simplex Algorithm, optimizing solutions subject to linear constraints.

Covers weak and strong duality in optimization problems, focusing on Lagrange multipliers and KKT conditions.

Page 2 of 2