Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
From MaRDI portal
Publication:5221266
DOI10.1080/02331934.2019.1625901zbMath1433.90151OpenAlexW2952112154MaRDI QIDQ5221266
Khadija Hamdaoui, Nazih Abderrazzak Gadhi, M. El Idrissi
Publication date: 25 March 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1625901
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items (8)
On variational inequalities using directional convexificators ⋮ Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective ⋮ A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem ⋮ On multiobjective bilevel optimization using tangential subdifferentials ⋮ Optimality Conditions for a Nonsmooth Semivectorial Bilevel Optimization Problem ⋮ Sufficient Optimality Conditions in Bilevel Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Convexifactors, generalized convexity, and optimality conditions
- Second order optimality conditions for bilevel set optimization problems
- A generalized derivative for calm and stable functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- An equivalent one level optimization problem to a semivectorial bilevel problem
- Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems
- Nonsmooth vector functions and continuous optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- 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
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation
- Convexifactors, generalized convexity and vector optimization
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
This page was built for publication: Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
