On solving generalized convex MINLP problems using supporting hyperplane techniques

Solution methods for convex mixed integer nonlinear programming (MINLP) problems have, usually, proven convergence properties if the functions involved are differentiable and convex. For other classes of convex MINLP problems fewer results have been given. Classical differential calculus can, though...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 71; no. 4; pp. 987 - 1011
Main Authors:	Westerlund, Tapio, Eronen, Ville-Pekka, Mäkelä, Marko M.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2018 Springer Springer Nature B.V
Subjects:	Algorithms Calculus Computer Science Convergence Convex analysis Differential calculus Mathematics Mathematics and Statistics Methods Mixed integer Nonlinear programming Operations Research/Decision Theory Optimization Properties (attributes) Real Functions Mixed-integer nonlinear programming Cutting planes 90C25 90C11 Nonsmooth optimization Supporting hyperplanes Generalized convexities
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!