Catalog · Design and Analysis of Algorithms Lecture 15 of 34 Lecture 15: Linear Programming: LP, reductions, Simplex ← Previous Lecture 14: Incremental Improvement: Matching Next → Lecture 16: Complexity: P, NP, NP-completeness, Reductions ✓ Mark complete Materials Transcript (PDF) ↗ transcript