martes, 17 de enero de 2017

Ficha del recurso:


Vínculo original en COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 52 (2):537-558; 10.1007/s10589-011-9424-0 JUN 2012
Hijazi, H; Bonami, P; Cornuejols, G; Ouorou, A

Última actualización:

jueves, 28 de junio de 2012

Entrada en el observatorio:

jueves, 28 de junio de 2012



Archivado en:

Mixed-integer nonlinear programs featuring "on/off" constraints

In this paper, we study MINLPs featuring "on/off" constraints. An "on/off" constraint is a constraint f(x)a parts per thousand currency sign0 that is activated whenever a corresponding 0-1 variable is equal to 1. Our main result is an explicit characterization of the convex hull of the feasible region when the MINLP consists of simple bounds on the variables and one "on/off" constraint defined by an isotone function f. When extended to general convex MINLPs, we show that this result yields tight lower bounds compared to classical formulations. This allows us to introduce new models for the delay-constrained routing problem in telecommunications. Numerical results show gains in computing time of up to one order of magnitude compared to state-of-the-art approaches.