Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791)
From MaRDI portal
scientific article; zbMATH DE number 7298146
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization |
scientific article; zbMATH DE number 7298146 |
Statements
Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (English)
0 references
19 January 2021
0 references
bilevel optimization
0 references
mathematical programs with complementarity constraints (MPCC)
0 references
bounding polyhedra
0 references
big-\(M\)
0 references
hardness
0 references
0 references
0 references
0 references
0 references
