Solving bilevel programs with the KKT-approach (Q1949259)
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 6160890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving bilevel programs with the KKT-approach |
scientific article; zbMATH DE number 6160890 |
Statements
Solving bilevel programs with the KKT-approach (English)
0 references
6 May 2013
0 references
Bilevel problems (BL) are a class of mathematical programs. The authors analyze the so-called Karush-Kuhn-Tucker (KKT)-approach for solving BL, where the lower level minimality condition is replaced by the KKT- or the Fritz-John-condition. For that purpose, the generic structure of the mathematical programs with complementarity constraints (MPCC) is studied. A main result of the paper is that at a local solution of BL, where the KKT approach leads to a singular system, generically, the minimizer can be computed by a (non-singular) reduced system. A numerical approach for solving BL is given, too.
0 references
bilevel problems
0 references
KKT-condition
0 references
FJ-condition
0 references
mathematical programs with complementarity constraints
0 references
genericity
0 references
critical points
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8511083722114563
0 references
0.8160163760185242
0 references
0.813886284828186
0 references
0.8094913959503174
0 references
0.8090300559997559
0 references
