A new equivalent single-level problem for bilevel problems

DOI10.1080/02331934.2012.718346zbMath1291.90216OpenAlexW2012267561MaRDI QIDQ5169457

Stephan Dempe, Nazih Abderrazzak Gadhi

Publication date: 10 July 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.718346

zbMATH Keywords

optimality conditionsconvex functionsoptimal value functionbilevel optimizationclarke subdifferential

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Optimality conditions (49K99)

Related Items (4)

New optimality conditions for bilevel programs by using an exact separation principle ⋮ Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach ⋮ Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Some properties of the bilevel programming problem
• Necessary optimality conditions for bilevel set optimization problems
• Necessary optimality conditions for Stackelberg problems
• Necessary optimality conditions for bilevel optimization problems using convexificators
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• Problems of Hierarchical Optimization in Finite Dimensions
• A necessary and a sufficient optimality condition for bilevel programming problems
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• Optimality conditions for bilevel programming problems
• First-order necessary optimality conditions for general bilevel programming problems

This page was built for publication: A new equivalent single-level problem for bilevel problems