Journal
OPTIMIZATION
Volume 68, Issue 8, Pages 1471-1489Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/02331934.2019.1581192
Keywords
Bilevel optimization; Karush-Kuhn-Tucker transformation; mathematical program with complementarity constraints
Ask authors/readers for more resources
Using the Karush-Kuhn-Tucker conditions for the convex lower level problem, the bilevel optimization problem is transformed into a single-level optimization problem (a mathematical program with complementarity constraints). A regularization approach for the latter problem is formulated which can be used to solve the bilevel optimization problem. This is verified if global or local optimal solutions of the auxiliary problems are computed. Stationary solutions of the auxiliary problems converge to C-stationary solutions of the mathematical program with complementarity constraints.
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