Zurück zu den Preprints des Jahres 2011


2011-16

Basic Polyhedral Theory

by Kaibel, V..


Series: 2011-16, Preprints

MSC:
90C10 Integer programming
52B12 Special polytopes (linear programming, centrally symmetric, etc.)

Abstract:
This is a chapter (written for Wiley's Encyclopedia of Operations Research and Management Science) describing parts of the theory of convex polyhedra that are particularly important for optimization. The topics include polyhedral and finitely generated cones, the Weyl-Minkowski Theorem, faces of polyhedra, projections of polyhedra, integral polyhedra, total dual integrality, and total unimodularity.

Keywords:
Convex Polyhedra, Optimization