"Polyhedral Theory and Integer Programming"
Ivan Terziev 2002
Abstract
This thesis describes Linear Programming (LP) and Integer Programming (IP) using polyhedral theory. The usual approach is to use the simplex algorithm as a tool for proving properties of polyhedra. The author investigates the reverse approach to give a better understanding of the general simplex algorithm and the modeling limits of LP and IP. Polyhedral theory is also the core for other faster polynomial time LP algorithms and it is convenient to describe and determine properties of any model that deals with points satisfying a set of constraints.