Linear Programming: Optimization Reduces to Feasibility || @ CMU || Lecture 17d of CS Theory Toolkit @RyanODonnellTeaching
Linear Programming: Optimization Reduces to Feasibility || @ CMU || Lecture 17d of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 2 hours ago
Showing how if you can efficiently decide if an LP is feasible, you can also efficiently optimize an LP, and find a vertex achieving the optimum. Warning: some number theory (!) required. Lecture 17d 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: Optimization Reduces to Feasibility || @ CMU || Lecture 17d of CS Theory Toolkit#8/100: Path diagrams/matrices for instructions || Quantum Computer Programming in 100 Easy Lessons#26/100: Programming If f then Minus || Quantum Computer Programming in 100 Easy LessonsLinear Programming problems, and Convex Programming || @ CMU || Recitation 9 of CS Theory Toolkit#67/100: Rotation Estimation: n digits, 10ⁿ steps | Quantum Computer Programming in 100 Easy Lessons#63/100: Factor-1% Rotation Estimation loose ends | Quantum Computer Programming in 100 Easy Lessons#38/100: Every rotation is 2-D rotations || Quantum Computer Programming in 100 Easy LessonsQuantum Computing with Just 1 Qubit  |  The Elitzur Vaidman Bomb Algorithm#56/100: Grovers SAT speedup is unimprovable || Quantum Computer Programming in 100 Easy Lessons#45/100: Discriminating 2 qubits, 2-sided error || Quantum Computer Programming in 100 Easy LessonsRandomized Communication Complexity || @ CMU || Lecture 23c of CS Theory Toolkit#72/100: Ops on separate qubits: order doesnt matter || Quantum Computer Prog. in 100 Easy Lessons
Ryan ODonnell |

Linear Programming: Optimization Reduces to Feasibility || @ CMU || Lecture 17d of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER