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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 11; no. 1; pp. 95 - 118
Main Authors:	Schewe, Lars, Schmidt, Martin
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 14.03.2019 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!