On unions and dominants of polytopes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Programming Year : 2004

On unions and dominants of polytopes


A well-known result on unions of polyhedra in the same space gives an extended formulation in a higher-dimensional space whose projection is the convex hull of the union. Here in contrast we study the unions of polytopes in different spaces, giving a complete description of the convex hull without additional variables. When the underlying polytopes are monotone, the facets are described explicitly, generalizing results of Hong and Hooker on cardinality rules, and an efficient separation algorithm is proposed. These results are based on an explicit representation of the dominant of a polytope, and an algorithm for the separation problem for the dominant. For non-monotone polytopes, both the dominant and the union are characterized. We also give results on the unions of polymatroids both on disjoint ground sets and on the same ground set generalizing results of Conforti and Laurent.

Dates and versions

inria-00100114 , version 1 (26-09-2006)



Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence Wolsey. On unions and dominants of polytopes. Mathematical Programming, 2004, 99, pp.223-239. ⟨10.1007/s10107-003-0432-4⟩. ⟨inria-00100114⟩
73 View
0 Download



Gmail Facebook Twitter LinkedIn More