Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of Linear Programming (LP) Duality, exploring the relationship between primal and dual linear programs. It discusses the weak duality theorem, complementary slackness, and strong duality theorem. The instructor explains the interpretation of Lagrange multipliers, optimal solutions, and the relationship between primal and dual values. Examples and generic dual maps are used to illustrate the concepts, emphasizing the optimization process and feasibility constraints. The lecture concludes with insights on polyhedrons and basis feasible solutions.