On complexity of finding strong-weak solutions in bilevel linear programming (Q6556186)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On complexity of finding strong-weak solutions in bilevel linear programming |
scientific article; zbMATH DE number 7865915
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of finding strong-weak solutions in bilevel linear programming |
scientific article; zbMATH DE number 7865915 |
Statements
On complexity of finding strong-weak solutions in bilevel linear programming (English)
0 references
17 June 2024
0 references
bilevel linear programs
0 references
computational complexity
0 references
strong-weak approach
0 references
pessimistic bilevel programs
0 references
0 references
