The Reformulation-based aGO Algorithm for Solving Nonconvex MINLP Problems – Some Improvements
The a-reformulation (aR) technique can be used to transform any nonconvex twice-differentiable mixed-integer nonlinear programming problem to a convex relaxed form. By adding a quadratic function to the nonconvex function it is possible to convexify it, and by subtracting a piecewise linearization o...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIDIC Servizi S.r.l.
2013-06-01
|
| Series: | Chemical Engineering Transactions |
| Online Access: | https://www.cetjournal.it/index.php/cet/article/view/6615 |