Introduction 
Wednesday 
September 14 
Lecture 1

Geometry of Linear Programming 
Tuesday 
September 20 
Lecture 2

Simplex Algorithm 
Tuesday 
September 27 
Lecture 3

Pivot Rules and Degeneracy 
Friday 
September 30 
Lecture 4
Homework 1

Duality 
Tuesday 
October 4 
Lecture 5

Integer Solutions 
Tuesday 
October 18 
Lecture 6

MIDTERM EXAM 
Tuesday 
October 25 
Midterm
Solutions

Efficient Convex Optimization 
Tuesday 
November 8 
Lecture 7

LP Rounding 
Tuesday 
November 15 
Lecture 8

PrimalDual/Dual Fitting 
Tuesday 
November 22 
Lecture 9
Homework 2
Solutions

SDP and Graph Partitioning 
Tuesday 
December 6 
Lecture 10

Coloring via SDP 
Tuesday 
December 13 
Lecture 11

Deterministic Rounding 
Tuesday 
January 3 
Lecture 12

Rounding via Rank Lemma 
Tuesday 
January 10 
Lecture 13

Convex Combinations + TSP Algorithms 
Tuesday 
January 31 
Lecture 14

FINAL EXAM 
Tuesday 9h12h

February 7 
Final Exam I
Solutions
Final Exam II
