On multiobjective bilevel optimization using tangential subdifferentials
From MaRDI portal
Publication:2691426
DOI10.3934/jimo.2022156OpenAlexW4293104463MaRDI QIDQ2691426
Mohamed Ohda, Nazih Abderrazzak Gadhi
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022156
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Cites Work
- Unnamed Item
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
- Robustness in nonsmooth nonconvex optimization problems
- Subgradients of marginal functions in parametric mathematical programming
- Variational methods in partially ordered spaces
- Foundations of bilevel programming
- New optimality conditions for the semivectorial bilevel optimization problem
- Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
- Optimization and nonsmooth analysis
- Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- An introduction to the theory of nonsmooth optimization
- Optimality conditions for bilevel programming problems
- Necessary optimality conditions for a semivectorial bilevel problem under a partial calmness condition
- Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints
- Semivectorial bilevel programming versus scalar bilevel programming
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation
- Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
- New necessary optimality conditions in optimistic bilevel programming
- Foundations of Optimization
- Convex Analysis
- First-order necessary optimality conditions for general bilevel programming problems
This page was built for publication: On multiobjective bilevel optimization using tangential subdifferentials
