Mathematics – Combinatorics
Scientific paper
2010-11-16
Mathematics
Combinatorics
12 pages
Scientific paper
There are many examples of optimization problems whose associated polyhedra can be described much nicer, and with way less inequalities, by projections of higher dimensional polyhedra than this would be possible in the original space. However, currently not many general tools to construct such extended formulations are available. In this paper, we develop a framework of polyhedral relations that generalizes inductive constructions of extended formulations via projections, and we particularly elaborate on the special case of reflection relations. The latter ones provide polynomial size extended formulations for several polytopes that can be constructed as convex hulls of the unions of (exponentially) many copies of an input polytope obtained via sequences of reflections at hyperplanes. We demonstrate the use of the framework by deriving small extended formulations for the G-permutahedra of all finite reflection groups G (generalizing both Goeman's extended formulation of the permutahedron of size O(n log n) and Ben-Tal and Nemirovski's extended formulation with O(k) inequalities for the regular 2^k-gon) and for Huffman-polytopes (the convex hulls of the weight-vectors of Huffman codes).
Kaibel Volker
Pashkovich Kanstantsin
No associations
LandOfFree
Constructing Extended Formulations from Reflection Relations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Constructing Extended Formulations from Reflection Relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing Extended Formulations from Reflection Relations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-463765