Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
From MaRDI portal
Publication:4646549
DOI10.1080/02331934.2018.1523402zbMath1427.90251OpenAlexW2892002134MaRDI QIDQ4646549
Khadija Hamdaoui, Fatima Zahra Rahou, Nazih Abderrazzak Gadhi, Lahoussine Lafhim
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1523402
Related Items (7)
On variational inequalities using directional convexificators ⋮ Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints ⋮ Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation ⋮ Optimality conditions of a set valued optimization problem with the help of directional convexificators ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- On the solution of convex bilevel optimization problems
- A multi-objective bi-level location planning problem for stone industrial parks
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality and duality results for bilevel programming problem using convexifactors
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Convexifactors, generalized convexity, and optimality conditions
- Necessary optimality conditions for bilevel set optimization problems
- Multiobjective bilevel optimization
- Second order optimality conditions for bilevel set optimization problems
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Practical bilevel optimization. Algorithms and applications
- Necessary optimality conditions for Stackelberg problems
- Hunting for a smaller convex subdifferential
- Foundations of bilevel programming
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Necessary and sufficient optimality conditions for set-valued optimization problems
- Optimality conditions for the bilevel programming problem
- Optimization and nonsmooth analysis
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
This page was built for publication: Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
