The bilevel programming problem: reformulations, constraint qualifications and optimality conditions (Q1949263)
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: The bilevel programming problem: reformulations, constraint qualifications and optimality conditions |
scientific article; zbMATH DE number 6160894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bilevel programming problem: reformulations, constraint qualifications and optimality conditions |
scientific article; zbMATH DE number 6160894 |
Statements
The bilevel programming problem: reformulations, constraint qualifications and optimality conditions (English)
0 references
6 May 2013
0 references
The authors study bilevel programming problems in finite-dimensional spaces. They present two reformulations and discuss for them corresponding constraint qualifications (CQ) and optimality conditions. Here, the partial calmness CQ is paid special attention: it is shown that this particular CQ is fulfilled in case the lower level problem is linear. Finally, the particular bilevel demand adjustment problem is discussed in this context.
0 references
bilevel programming
0 references
optimal value function
0 references
constraint qualifications
0 references
optimality conditions
0 references
demand adjustment problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8761321902275085
0 references
0.8761321902275085
0 references
0.8676234483718872
0 references
0.8571274280548096
0 references
0.8534414768218994
0 references
