Linear Programming Duality - Lecture 17b of CS Theory Toolkit

Explore the fundamental concepts of Linear Programming duality, the Farkas Lemma, and Fourier-Motzkin elimination in this 22-minute graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Delve into essential math and computer science fundamentals for research in theoretical computer science. Learn from Professor Ryan O'Donnell as he covers proof unsatisfiability, observations, and engages in discussion on these advanced topics. Utilize recommended resources such as "Understanding and Using Linear Programming" by Matoušek and Gärtner, and "Geometric Algorithms and Combinatorial Optimization" by Grötschel, Lovász, and Schrijver to enhance your understanding. Access additional course materials through CMU's Diderot system for a comprehensive learning experience in theoretical computer science.

Proof
Unsatisfiability
Fourier Motzkin elimination
Observations
Discussion