Some properties of the bilevel programming problem (Q911488): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimality conditions for the bilevel programming problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The polynomial hierarchy and a simple model for competitive analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Point-to-Set Maps in Mathematical Programming / rank | |||
Normal rank | |||
Revision as of 14:08, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some properties of the bilevel programming problem |
scientific article |
Statements
Some properties of the bilevel programming problem (English)
0 references
1991
0 references
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.
0 references
Stackelberg games
0 references
bilevel programming
0 references
