Reformulations for utilizing separability when solving convex MINLP problems

Several deterministic methods for convex mixed integer nonlinear programming generate a polyhedral approximation of the feasible region, and utilize this approximation to obtain trial solutions. Such methods are, e.g., outer approximation, the extended cutting plane method and the extended supportin...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 71; no. 3; pp. 571 - 592
Main Authors:	Kronqvist, Jan, Lundell, Andreas, Westerlund, Tapio
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2018 Springer Springer Nature B.V
Subjects:	Approximation Computer Science Mathematics Mathematics and Statistics Mixed integer Nonlinear programming Norms Operations Research/Decision Theory Optimization Real Functions Solvers Transformations (mathematics) Lifted polyhedral approximation Extended cutting plane algorithm Convex MINLP Outer approximation Extended supporting hyperplane algorithm Separable MINLP
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!