Abstract
The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our results have implications for finite dimensional corner polyhedra. One consequence is that nonnegative continuous functions suffice to describe finite dimensional corner polyhedra with rational data. We also discover new facts about corner polyhedra with non-rational data.
Cite
CITATION STYLE
Basu, A., Conforti, M., Di Summa, M., & Paat, J. (2017). The structure of the infinite models in integer programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10328 LNCS, pp. 63–74). Springer Verlag. https://doi.org/10.1007/978-3-319-59250-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
