Linear Programming Duality || @ CMU || Lecture 17b of CS Theory Toolkit @RyanODonnellTeaching
Linear Programming Duality || @ CMU || Lecture 17b of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 3 hours ago
Linear Programming duality, the Farkas Lemma, and Fourier-Motzkin elimination. Lecture 17b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Resources for this lecture:
"Understanding and Using Linear Programming" by Matoušek and Gärtner
"Geometric Algorithms and Combinatorial Optimization" by Grötschel, Lovász, and Schrijver

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/

Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
Linear Programming Duality || @ CMU || Lecture 17b of CS Theory ToolkitThe Switching Lemma#6/100: Creating and destroying qubits || Quantum Computer Programming in 100 Easy LessonsEntropy || @ CMU || Lecture 24a of CS Theory ToolkitExpander Graph Application 2: Derandomization || @ CMU || Lecture 16c of CS Theory ToolkitHardness Assumptions Beyond NP ≠ P || @ CMU || Lecture 26a of CS Theory ToolkitDinurs proof of the PCP Theorem: the Powering step || @ CMU || Lecture 27d of CS Theory ToolkitFrom One-Way Functions to Symmetric Key Encryption || @ CMU || Lecture 25c of CS Theory Toolkit#44/100: Discriminating 2 qubits, no false poss || Quantum Computer Programming in 100 Easy LessonsDinurs Proof of the PCP Theorem: outline || @ CMU || Lecture 27b of CS Theory Toolkit#91/100: All the planes of rotation for IncrL || Quantum Computer Programming in 100 Easy LessonsExponential Time Hypotheses: ETH and SETH || @ CMU || Lecture 26d of CS Theory Toolkit
Ryan ODonnell |

Linear Programming Duality || @ CMU || Lecture 17b of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER