Lecture 13: Duality in Linear Programming
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.
Course Info
Instructors
Departments
As Taught In
Spring
2024
Level
Topics
Learning Resource Types
theaters
Lecture Videos
notes
Lecture Notes
assignment
Problem Sets
Editable Files
