Polyhedral Computation

by David Bremner David Avis (Editor), David Bremner (Editor), Antoine Deza (Editor)

Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general-purpose algorithms. They are, however, highly structured, and attention has turned to exploiting this structure, particularly symmetry. Initial applications of this approach have permitted computations previously far out of reach, but much remains to be understood and validated experimentally. The papers in this volume give a good snapshot of the ideas discussed at a Workshop on Polyhedral Computation held at the CRM in Montreal in October 2006 and, with one exception, the current state of affairs in this area. The exception is the inclusion of an often cited 1980 technical report of Norman Zadeh, which was never published in a journal and has passed into the folklore of the discipline. This paper illustrates beautifully the work still to be done in the it gives a simple pivot rule for the simplex method for which it is still unknown if it yields a polynomial time algorithm.

147 pages, Paperback

First published January 1, 2009