Computing feasible points for binary MINLPs with MPECs

Nonconvex mixed-binary nonlinear optimization problems frequently appear in practice and are typically extremely hard to solve. In this paper we discuss a class of primal heuristics that are based on a reformulation of the problem as a mathematical program with equilibrium constraints. We then use d...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming computation Ročník 11; číslo 1; s. 95 - 118
Hlavní autori:	Schewe, Lars, Schmidt, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 14.03.2019 Springer Nature B.V
Predmet:	Feasibility studies Full Length Paper Iterative methods Iterative solution Mathematics Mathematics and Statistics Mathematics of Computing Nonlinear programming Operations Research/Decision Theory Optimization Production methods Regularization Solvers Theory of Computation Primal heuristic Complementarity constraints MPEC 90C11 90C33 90-08 MINLP 90C59 Mixed-integer nonlinear optimization
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!

Buďte prvý, kto okomentuje tento záznam!