Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Invited paper with foreword by G. Cornuéjols and W.R. Pulleyblank. Disc. Appl. Math. 89, 1–44 (1998)
Balas, E.: Logical Constraints as Cardinality Rules: Tight Representations. #MSRR-628, Carnegie Mellon University, 2000
Balas, E., Fischetti, M.: On the monotonization of polyhedra. Math. Program. 78, 59–84 (1997)
Boyd, S.C., Pulleyblank, W.R.: Facet generating techniques, Department of Combinatorics and Optimization. University of Waterloo, 1991
Conforti, M., Laurent, M.: On the facial structure of independence system polyhedra. Math. Oper. Res. 13, 543–555 (1988)
Cunningham, W.H.: Testing membership in matroid polyhedra. J. Combin. Theory B 36, 161–188 (1984)
Cunningham, W.H.: On submodular function minimization. Combinatorica 5, 185–192 (1985)
Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Schönheim, J., eds. Combinatorial Structures and their applications, Gordon and Breach, New York, 1970, pp. 69–87
Edmonds, J.: Matroids and the Greedy Algorithm. Math. Program. 1, 127–136 (1971)
Edmonds, J., Fulkerson, D.R.: Transversals and matroid partition. J. Res. Nat. Bur. Standards 69B, 147–153 (1965)
Fulkerson, D.R.: Blocking and Antiblocking Pairs of Polyhedra. Math. Program. 1, 168–194 (1971)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer Verlag 1988
Hong, Y., Hooker, J.N.: Tight representation of logical constraints as cardinality rules. Math. Program. 85, 363–377 (1999)
Iwata, S., Fleisher, L., Fujishige, S.: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 48, 761–777 (2001)
Padberg, M.W.: (1,k)-Configurations and facets for packing problems. Math. Program. 18, 94–99 (1980)
Rockafellar, T.: Convex analysis. Princeton University Press, 1970
Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory, Ser. B 80, 346–355 (2000)
Author information
Authors and Affiliations
Additional information
The first author’s research was supported by the National Science Foundation through grant # DMI-0098423 and by the Office of Naval Research through contract # N00014-97-1-0196. The last three authors’ research was supported in part by the LISCOS, GROWTH Project GRDI-1999-10056 of the European Union.
Rights and permissions
About this article
Cite this article
Balas, E., Bockmayr, A., Pisaruk, N. et al. On unions and dominants of polytopes. Math. Program., Ser. A 99, 223–239 (2004). https://doi.org/10.1007/s10107-003-0432-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-003-0432-4