Journal
COMPUTERS & CHEMICAL ENGINEERING
Volume 122, Issue -, Pages 105-113Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2018.06.019
Keywords
Convex MINLP; Cutting plane techniques; Center-cut algorithm; Primal heuristics; Outer approximation
Funding
- GAMS Development Corporation
- Center for Advanced Process Decision-making (CAPD)
Ask authors/readers for more resources
Here we present a center-cut algorithm for convex mixed-integer nonlinear programming (MINLP) that can either be used as a primal heuristic or as a deterministic solution technique. Like several other algorithms for convex MINLP, the center-cut algorithm constructs a linear approximation of the original problem. The main idea of the algorithm is to use the linear approximation differently in order to find feasible solutions within only a few iterations. The algorithm chooses trial solutions as the center of the current linear outer approximation of the nonlinear constraints, making the trial solutions more likely to satisfy the constraints. The ability to find feasible solutions within only a few iterations makes the algorithm well suited as a primal heuristic, and we prove that the algorithm finds the optimal solution within a finite number of iterations. Numerical results show that the algorithm obtains feasible solutions quickly and is able to obtain good solutions. (C) 2018 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available