A Geometric Perspective on Lifting

Michele Conforti (), Gérard Cornuéjols () and Giacomo Zambelli ()
Additional contact information
Michele Conforti: Dipartimento di Matematica Pura ed Applicata, Università di Padova, 35121 Padova, Italy
Gérard Cornuéjols: Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Giacomo Zambelli: London School of Economics and Political Sciences, London WC2A 2AE, United Kingdom

Operations Research, 2011, vol. 59, issue 3, 569-577

Abstract: Recently it has been shown that minimal inequalities for a continuous relaxation of mixed-integer linear programs are associated with maximal lattice-free convex sets. In this paper, we show how to lift these inequalities for integral nonbasic variables by considering maximal lattice-free convex sets in a higher dimensional space. We apply this approach to several examples. In particular, we identify cases in which the lifting is unique.

Keywords: programming/integer/cutting; plane (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1110.0916 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:59:y:2011:i:3:p:569-577

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().