A new equivalent single-level problem for bilevel problems

S. Dempe Department of Mathematics and Computers Sciences, Technical University Bergakademie Freiberg, Freiberg, 09596, Germany

N. Gadhi Department of Mathematics, Dhar El Mehrez, Sidi Mohamed Ben Abdellah University, Fes, MoroccoCorrespondence[email protected]

Pages 789-798 | Received 20 Sep 2011, Accepted 30 Jul 2012, Published online: 03 Dec 2012

Cite this article
https://doi.org/10.1080/02331934.2012.718346
CrossMark

Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

Full Article
Figures & data
References
Citations
Metrics
Reprints & Permissions
Read this article /doi/full/10.1080/02331934.2012.718346?needAccess=true

Abstract

In this article, we give necessary optimality conditions for a bilevel optimization problem (P). An intermediate single-level problem (Q), which is equivalent to the bilevel optimization problem (P), has been introduced.

Keywords:

bilevel optimization
convex functions
Clarke subdifferential
optimal value function
optimality conditions

AMS Subject Classifications::

Primary: 90C29
90C26
90C70
Secondary: 49K99

Acknowledgements

This work is supported by the Alexander-von-Humboldt foundation.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.