Lecture notes:

Lecture 1, 10 April 2002:
The Linear Algebra of Linear Programs.

Lecture 2, 24 April 2002:
The Geometry of Linear Programs.

Lectures 3 and 4, 1 May and 8 May 2002:
The Simplex Algorithm.

Lecture 5, 15 May 2002:
Linear Programming Duality.

Lecture 6 (by Moni Naor), 22 May 2002:
Diameter of polytopes, and subexponential randomized versions of the simplex
algorithm. No lecture notes. See the paper "The simplex algorithm and
simple polytopes", by Gil Kalai, Math. Prog. (ser. B) 79 (1997) 217-234.

Lectures 7 and 8, 29 May and 5 June 2002:
The Ellipsoid Algorithm.

Lecture 9, 12 June 2002, + June 19:
Some more on LP duality.

Lectures 10 and 11, 19 June and 26 June 2002:
Perfect graphs and the theta function of Lovasz.

Lectures 12 and 13 (by Moni Naor), 3 July and 10 July 2002:
Lattice problems.

Handouts (homework) for course.

Handout 1, 10 April 2002:
Introduction to Linear Programming.

Handout 2, 24 April 2002:
The Geometry of Linear Programming.

Handout 3 (and 4), 1 May and 8 May 2002:
The Simplex Algorithm.

Handout 5, 15 May 2002:
Linear Programming Duality.

Handout 7, 29 May 2002:
The Ellipsoid Algorithm.

Handout 8, 5 June 2002:
The Ellipsoid Algorithm and Positive Definite Matrices.

Handout 9, 12 June 2002:
Applications of LP duality.

Handout 10 (and 11), 19 June and 26 June 2002:
Perfect graphs, and the Lovasz theta function.

Take home exam, 10 July 2002.