Prerequisite:
A basic knowledge of linear programming is
assumed.
Assessment:
Grading
Methods
and Evaluation Criteria: Deadlines posted on
announcements page.
1. Each student will write up lecture notes
for one lecture using latex template supplied here.(20%)
2. Students will write solutions to exercises given in class and posted
on the lecture summaries page.(20%)
3. Each student will write a final report on an application chosen by
the student, that uses methods taught in the course.(60%)
The following topics are covered, each in one
to three lectures.
1.Examples of polyhedral computation problems arising in various fields.
2.Basic problems in polyhedral computation.
3.Polyhedral problems solvable by linear programming.
4.The vertex enumeration problem and its relatives.
5.Algorithms for vertex enumeration.
6.Applications to game theory, triangulations, Voronoi diagrams, etc.
7.Connections with integer programming.