On refinement strategies for solving MINLP s by piecewise linear relaxations: a generalized red refinement

Burlacu R (2021)

Publication Type: Journal article

Publication year: 2021

Journal

Optimization Letters Springer Verlag (Germany)

DOI: 10.1007/s11590-021-01740-1

Abstract

We investigate the generalized red refinement for n-dimensional simplices that dates back to Freudenthal (Ann Math 43(3):580–582, 1942) in a mixed-integer nonlinear program (MINLP) context. We show that the red refinement meets sufficient convergence conditions for a known MINLP solution framework that is essentially based on solving piecewise linear relaxations. In addition, we prove that applying this refinement procedure results in piecewise linear relaxations that can be modeled by the well-known incremental method established by Markowitz and Manne (Econometrica 25(1):84–110, 1957). Finally, numerical results from the field of alternating current optimal power flow demonstrate the applicability of the red refinement in such MIP -based MINLP solution frameworks.

Authors with CRIS profile

Robert Burlacu Economics - Discrete Optimization - Mathematics (EDOM)

How to cite

APA:

Burlacu, R. (2021). On refinement strategies for solving MINLP s by piecewise linear relaxations: a generalized red refinement. Optimization Letters. https://dx.doi.org/10.1007/s11590-021-01740-1

MLA:

Burlacu, Robert. "On refinement strategies for solving MINLP s by piecewise linear relaxations: a generalized red refinement." Optimization Letters (2021).

BibTeX: Download