.png){kind=icon}
.png){kind=icon}
Return
Improved quadratic cuts for convex mixed-integer nonlinear programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2017.10.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents scaled quadratic cuts based on scaling the second-order Taylor expansion terms for the decomposition methods Outer Approximation and Partial Surrogate Cuts for solving convex Mixed Integer Nonlinear Programing problems. The scaled quadratic cut is proved to be a stricter and tighter underestimation for convex nonlinear functions than classical supporting hyperplanes, which results in the improvement of Outer Approximation and Partial Surrogate Cuts based solution methods. We integrate the strategies of scaled quadratic cuts with multi-generation cuts for Outer Approximation and Partial Surrogate Cuts and develop six types of Mixed Integer Nonlinear Programming solution methods with scaled quadratic cuts. These cuts are incorporated in the master problem of the decomposition methods leading to a Mixed Integer Quadratically Constrained Programming problem. Numerical results of benchmark Mixed Integer Nonlinear Programming problems demonstrate the effectiveness of the proposed Mixed Integer Nonlinear Programming solution methods with scaled quadratic cuts. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
MINLP
Outer Approximation (OA)
Quadratic cut
MIQCP
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W