Lectures

Tentative course schedule

• [Week 1] Introduction and Standard Model of Linear Programming (Papadimitriou Chapter 1)
  [Introduction][Week 1 Slides][ TA Notes: Introduction ]
• [Week 2] Simplex Intuition and Mathematical Foundations
  [Week 2 ][ TA Notes: LPs = LPk ][ TA Notes: LPs ][ TA Notes: Convexity ]
• [Week 3] LP Formats
  [ Week 3][ TA Notes: CPLEX ][ TA Notes: LP Forms ]
• [Week 4] Simplex Algorithm and Duality (Papadimitriou Chapter 2)
  [ Week 4 ][ TA Notes: BFS ][ TA Notes: Corners, BFS, Extreme points are the same ][ TA Notes: Simplex ]
• [Week 5] Duality (Papadimitriou Chapter 3)
  [Week 5][Week 5 Games][Week 5 (Duality 1)][ Week 5 (Duality 2) ][ TA Notes: Duality ][ TA Notes: Bland's Anti-Cycling ]
• Slack, Review, and Midterm
• Primal-Dual Algorithm and Elementary Graph Algorithms (Papadimitriou Chapter 5)
  [Slides: Primal Dual][ TA Notes: Primal Dual Example ][TA Notes: More Primal Dual ]
• Total Unimodularity and Integer Programming (Papadimitriou Chapters 13 and 18)
[Slides: Total Unimodularity][Slides: Branch and Bound][ TA Notes: IP+TUM ][ TA Notes: Branch and Bound ]
• Advanced Methods
[ Slides: Advanced Methods ][ TA Notes: LDS ]
• Constraint Programming and Review
[ Slides: CP + Arc Consistency ][ Slides: CP ]
• Review
• Ellipsoid Method and Local Search
[ Slides: Ellipsoid and Interior Point Algorithms ]
• Review and Final Examination