This course covers the mathematical theory underlying linear programming and some of the more important algorithms. Specific topics include the basic properties of polyhedra, separation and duality lemmas, some complexity results, various versions of the simplex method, interior point methods and postoptimality analysis.

This page will contain some of the material (syllabus, hws, etc.) that will be used in the course.