For n ~> 2, the boolean quadric polytope ~, is the convex hull in d:= (~ l) dimensions of the binary solutions xixj = Yo, for all i < j in N := { I. 2 ..... n}. The polytope is naturally modeled by a somewhat larger polytope; namely, .~ the solution set of Yo <~x~, yo<~xj. x~ + xj <<. 1 + Yo, Yo >1
The cut polytope and the Boolean quadric polytope
β Scribed by Caterina De Simone
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 264 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In 1983 Barahona defined the class of cut polytopes; recently Padberg defined the class of Boolean quadric polytopes.
We show that every Boolean quadric polytope is the image of a cut polytope under a bijective linear transformation, and so studying Boolean quadric polytopes reduces to studying special cut polytopes.
Our proof uses an idea introduced in 1965 by Hammer.
π SIMILAR VOLUMES
The cyclic polytope C (n, d) is the convex hull of any n points on the moment curve {(t, t 2 , . . . , t d ) : we consider the fiber polytope (in the sense of Billera and Sturmfels [6]) associated to the natural projection of cyclic polytopes Ο : C(n, d ) β C(n, d) which 'forgets' the last dd coord