Abstract
This note presents a theoretical analysis of disjunctive constraints featuring unbounded variables. In this framework, classical modeling techniques, including big-M approaches, are not applicable. We introduce a lifted second-order cone formulation of such on/off constraints and discuss related constraint qualification issues. A solution is proposed to avoid solvers' failure.
| Original language | English |
|---|---|
| Pages (from-to) | 503-506 |
| Number of pages | 4 |
| Journal | Operations Research Letters |
| Volume | 44 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Jul 2016 |
Keywords
- Constraint qualification
- Disjunctive programming
- Mixed-integer nonlinear programming
- On/off constraints
- Second-order cone programming