Reference : Lift-and-project inequalities

	Document type :	Parts of books : Contribution to encyclopedias, dictionaries...
	Discipline(s) :	Physical, chemical, mathematical & earth Sciences : Mathematics
	To cite this reference:	http://hdl.handle.net/2268/38279

Title :	Lift-and-project inequalities
Language :	English
Author, co-author :	Louveaux, Quentin [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Optimisation discrète >]
Publication date :	2011
Main document title :	Wiley Encylopedia of Operations Research and Management Science
Publisher :	John Wiley & sons
Keywords :	[en] Mixed-integer programming ; cutting planes
Abstract :	[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.
Target :	Researchers ; Professionals
Permalink :	http://hdl.handle.net/2268/38279
DOI :	10.1002/9780470400531.eorms0463

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access LiftAndProject.pdf Author preprint 122.76 kB View/Open

All documents in ORBi are protected by a user license.

 

© ULg Library Network |  Feedback |  ORBi legal notices

Dspace v1.5