Technical note : there's no free lunch : on the hardness of choosing a correct big-M in bilevel optimization
Thomas Kleinert, Martine Labbé, Fränk Plein, Martin Schmidt
| Year of publication: |
2020
|
|---|---|
| Authors: | Kleinert, Thomas ; Labbé, Martine ; Plein, Fränk ; Schmidt, Martin |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 6, p. 1716-1721
|
| Subject: | bilevel optimization | mathematical programs with complementarity constraints (MPCC) | bounding polyhedra | big-M | hardness | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/opre.2019.1944 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012392157