next up previous contents
Next: Polyhedra and parallelization techniques Up: Introduction Previous: On polyhedra   Contents

What is Polylib useful for?

Polyhedra, linear inequalities and linear programming can be seen as three views of the same concept. Polyhedra represent a geometrical point of view, linear inequalities - the algebraic point of view, and linear programming the optimization point of view. Basic results in polyhedral description are due to Farkas, Minkovski, Caratheodory, Weyl, Motzkin and Chernikova. Farkas' Lemma, the Duality Theorem, the Decomposition Theorem for polyhedra and the Finite Basis theorem for polytopes are theoretical results that stand behind any implementation. See A. Schrijver's book [SCH86] for more details. A polyhedral library can be used in various fields, some of them are listed here:
next up previous contents
Next: Polyhedra and parallelization techniques Up: Introduction Previous: On polyhedra   Contents
Sorin Olaru 2002-04-24