On Refinement Strategies for Solving MINLPs by Piecewise Linear Relaxations: A Generalized Red Refinement

Burlacu R (2021)

Publication Language: English

Publication Status: Submitted

Publication Type: Other publication type

Future Publication Type: Journal article

Publication year: 2021

DOI: 10.1007/s11590-021-01740-1

Abstract

We investigate the generalized red refinement for n-dimensional simplices that dates back to Freudenthal 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.

Authors with CRIS profile

Robert Burlacu

Related research project(s)

Energiemarktdesign (EMD) Energie Campus Nürnberg (EnCN2) Jan. 1, 2017 - Dec. 31, 2021

How to cite

APA:

Burlacu, R. (2021). On Refinement Strategies for Solving MINLPs by Piecewise Linear Relaxations: A Generalized Red Refinement.

MLA:

Burlacu, Robert. On Refinement Strategies for Solving MINLPs by Piecewise Linear Relaxations: A Generalized Red Refinement. 2021.

BibTeX: Download