An equivalent one level optimization problem to a semivectorial bilevel problem

DOI10.1007/s11117-017-0511-zzbMath1471.90126OpenAlexW2735896332MaRDI QIDQ1746029

M. El Idrissi, Nazih Abderrazzak Gadhi

Publication date: 19 April 2018

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-017-0511-z

zbMATH Keywords

optimality conditionsconvex functionoptimal value functionClarke subdifferentialbilevel optimization

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 (8)

Some new optimality conditions for semivector bilevel optimization program ⋮ Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective ⋮ New optimality conditions and a scalarization approach for a nonconvex semi-vectorial bilevel optimization problem ⋮ Necessary optimality conditions for a semivectorial bilevel optimization problem using the kth-objective weighted-constraint approach ⋮ Estimates for coderivative of solution map in bilevel program ⋮ Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation ⋮ Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Convexity and concavity properties of the optimal value function in parametric nonlinear programming
• Some properties of the bilevel programming problem
• Necessary optimality conditions for bilevel set optimization problems
• Necessary optimality conditions for Stackelberg problems
• New optimality conditions for the semivectorial bilevel optimization problem
• Lipschitz continuity of the optimal value function in parametric optimization
• Necessary optimality conditions for bilevel optimization problems using convexificators
• Optimization and nonsmooth analysis
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• On lagrange-kuhn-tucker multipliers for pareto optimization problems
• 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
• Multicriteria Optimization
• First-order necessary optimality conditions for general bilevel programming problems

This page was built for publication: An equivalent one level optimization problem to a semivectorial bilevel problem