Efficiency conditions for multiobjective bilevel programming problems via convexificators
From MaRDI portal
Publication:5152038
DOI10.23952/jnva.4.2020.3.05zbMath1470.49030OpenAlexW4234891635MaRDI QIDQ5152038
Publication date: 18 February 2021
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.4.2020.3.05
efficiency conditionsconstraint qualificationsconvexificatorsmultiobjective bilevel programming problem
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items
Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem, Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications
- Optimality conditions for optimistic bilevel programming problem using convexifactors
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Optimality and duality results for bilevel programming problem using convexifactors
- Scalarization and optimality conditions for vector equilibrium problems
- Nonsmooth analysis
- Some properties of the bilevel programming problem
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Necessary optimality conditions for Stackelberg problems
- Necessary and sufficient conditions for efficiency via convexificators
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Necessary optimality conditions for bilevel optimization problems using convexificators
- Optimality conditions for the bilevel programming problem
- Optimization and nonsmooth analysis
- A necessary and a sufficient optimality condition for bilevel programming problems
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Optimality conditions for bilevel programming problems
- Convexificators and necessary conditions for efficiency
- New necessary optimality conditions in optimistic bilevel programming
- First-order necessary optimality conditions for general bilevel programming problems
