The bilevel programming problem: reformulations, constraint qualifications and optimality conditions (Q1949263): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-011-0508-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2102686659 / rank | |||
Normal rank | |||
Revision as of 01:39, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bilevel programming problem: reformulations, constraint qualifications and optimality conditions |
scientific article |
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
