[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.
Disciplines :
Mathematics
Author, co-author :
Louveaux, Quentin ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Optimisation discrète
Language :
English
Title :
Lift-and-project inequalities
Publication date :
2011
Main work title :
Wiley Encylopedia of Operations Research and Management Science
