Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization (Q5144791)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7298146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.788288414478302
0 references
0.7634422779083252
0 references
0.7492653131484985
0 references
0.7402086853981018
0 references
0.7391120791435242
0 references
