Reference : Lift-and-project inequalities
Parts of books : Contribution to encyclopedias, dictionaries...
Physical, chemical, mathematical & earth Sciences : Mathematics
Lift-and-project inequalities
Louveaux, Quentin mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Optimisation discrète >]
Wiley Encylopedia of Operations Research and Management Science
John Wiley & sons
[en] Mixed-integer programming ; cutting planes
[en] The lift-and-project technique is a systematic way to generate valid inequalities
for a mixed binary program. The technique is interesting both on the theoretical and
on the practical point of view. On the theoretical side it allows one to construct the
inequality description of the convex hull of all mixed-{0,1}
solutions of a binary MIP in n repeated applications of the technique, where
n is the number of binary variables.
On the practical side, a variant of the method allows one to derive some cutting planes
from the simplex tableau rather efficiently.
Researchers ; Professionals

File(s) associated to this reference

Fulltext file(s):

Open access
LiftAndProject.pdfAuthor preprint122.76 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.