Video details loaded
HomeMIT 18.200 Principles of Discrete Applied Mathematics, Spring 2024Lecture 13: Duality in Linear Programming
Lecture 13: Duality in Linear Programming
1:16:12
We show how to take duals for arbitrary linear programs (not just ones in canonical form). We introduce the complementary slackness. Next, we give a physics-inspired proof of strong duality. Finally, we use strong duality to prove Koenig’s theorem.