18.200 Principles of Discrete Applied Mathematics
18.200 Principles of Discrete Applied Mathematics (Spring 2024, MIT OCW). Instructors: Prof. Ankur Moitra, Prof. Peter Shor, and Susan Ruff. This course will teach you illustrative topics in discrete applied mathematics, including counting, generating functions, probability, linear optimization, algebraic structures, basic number theory, information theory, and coding theory. It is a CI-M (Communication Intensive in the Major) course and thus includes a writing component. (from ocw.mit.edu)
| 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.
Go to the Course Home or watch other lectures: