Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
From MaRDI portal
Abstract: We employ a fuzzy optimality condition for the Frechet subdifferential and some advanced techniques of variational analysis such as formulae for the subdifferentials of an infinite family of nonsmooth functions and the coderivative scalarization to investigate robust optimality condition and robust duality for a nonsmooth/nonconvex multiobjective optimization problem dealing with uncertain constraints in arbitrary Asplund spaces. We establish necessary optimality conditions for weakly and properly robust efficient solutions of the problem in terms of the Mordukhovich subdifferentials of the related functions. Further, sufficient conditions for weakly and properly robust efficient solutions as well as for robust efficient solutions of the problem are provided by presenting new concepts of generalized convexity. Finally we formulate a Mond-Weir-type robust dual problem to the reference problem, and examine weak, strong, and converse duality relations between them under the pseudo convexity assumptions.
Recommendations
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems
Cites work
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- Concepts of robustness for uncertain multi-objective optimization
- Evolutionary Multi-Criterion Optimization
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Minmax robustness for multi-objective optimization problems
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- On highly robust efficient solutions to uncertain multiobjective linear programs
- On nonsmooth optimality theorems for robust optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust multiobjective optimization
- Optimality and duality for robust multiobjective optimization problems
- Optimality and duality in nonsmooth conic vector optimization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust duality for generalized convex programming problems under data uncertainty
- Robust optimization
- Robust optimization-methodology and applications
- Selected topics in robust convex optimization
- Strong duality in robust convex programming: complete characterizations
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- The relationship between multi-objective robustness concepts and set-valued optimization
- Theory and applications of robust optimization
Cited in
(11)- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential
- A fuzzy necessary optimality condition for non-Lipschitz optimization in Asplund spaces
- Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
- On nonsmooth optimality theorems for robust optimization problems
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
This page was built for publication: Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139119)
