Journal
MATHEMATICAL PROGRAMMING
Volume 138, Issue 1-2, Pages 309-332Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-012-0535-x
Keywords
Bilevel problems; KKT-condition; FJ-condition; Mathematical programs with complementarity constraints; Genericity; Critical points
Ask authors/readers for more resources
Bilevel programs (BL) form a special class of optimization problems. They appear in many models in economics, game theory and mathematical physics. BL programs show a more complicated structure than standard finite problems. We study the so-called KKT-approach for solving bilevel problems, where the lower level minimality condition is replaced by the KKT- or the FJ-condition. This leads to a special structured mathematical program with complementarity constraints. We analyze the KKT-approach from a generic viewpoint and reveal the advantages and possible drawbacks of this approach for solving BL problems numerically.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available