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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming computation Jg. 11; H. 1; S. 95 - 118
Hauptverfasser:	Schewe, Lars, Schmidt, Martin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 14.03.2019 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!