We study Mixed-Integer Non-Linear Programming with piecewise- convex functions and compare two different formulations: the incre- mental and the multiple-choice model. We show with computational re- sults that the continuous relaxation of the two formulations is equiv- alent for two pieces but not for four.
Formulations for piecewise-convex problems
A Frangioni;C Gentile
2022
Abstract
We study Mixed-Integer Non-Linear Programming with piecewise- convex functions and compare two different formulations: the incre- mental and the multiple-choice model. We show with computational re- sults that the continuous relaxation of the two formulations is equiv- alent for two pieces but not for four.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
