Lift-and-project cuts for convex mixed integer nonlinear programs Linear programming based separation and extended formulations

We describe a computationally effective method for generating lift-and-project cuts for convex mixed-integer nonlinear programs (MINLPs). The method relies on solving a sequence of cut-generating linear programs and in the limit generates an inequality as strong as the lift-and-project cut that can...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical programming computation Jg. 9; H. 4; S. 499 - 526
Hauptverfasser:	Kılınç, Mustafa R., Linderoth, Jeff, Luedtke, James
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017
Schlagworte:	Full Length Paper Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Optimization Theory of Computation Extended formulations 90C30 Mixed-integer nonlinear programming 90C57 Lift-and-project cuts 90C11
ISSN:	1867-2949, 1867-2957
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!