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...

Celý popis

Podrobná bibliografia

Vydané v:	Mathematical programming computation Ročník 9; číslo 4; s. 499 - 526
Hlavní autori:	Kılınç, Mustafa R., Linderoth, Jeff, Luedtke, James
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!