Handling separable non-convexities using disjunctive cuts
2020
D'Ambrosio, Lee, and Wachter (2009, 2012) introduced an algorithmic approach for handling separable non-convexities in the context of global optimization. That algorithmic framework calculates lower bounds (on the optimal min objective value) by solving a sequence of convex MINLPs. We propose a method for addressing the same setting, but employing disjunctive cuts (generated via LP), and solving instead a sequence of convex NLPs. We present computational results which demonstrate the viability of our approach.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI