A center-cut algorithm for solving convex mixed-integer nonlinear programming problems

In this paper, we present a new algorithm for solving convex mixed-integer nonlinear programming problems. Similarly to other linearization-based methods, the algorithm generates a polyhedral approximation of the feasible region. The main idea behind the algorithm is to use a different approach for...

Full description

Saved in:

Bibliographic Details
Published in:	Computer Aided Chemical Engineering Vol. 40; pp. 2131 - 2136
Main Authors:	Kronqvist, Jan, Lundell, Andreas, Westerlund, Tapio
Format:	Book Chapter
Language:	English
Published:	01.01.2017
Subjects:	Center-cut algorithm Convex MINLP Cutting plane Primal heuristic Convex MINLP Primal heuristic Center-cut algorithm Cutting plane
ISBN:	9780444639653, 0444639659
ISSN:	1570-7946
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!