Sufficient Optimality Conditions for a Robust Multiobjective Problem
From MaRDI portal
Recommendations
- Applying convexificators in robust multiobjective optimization
- Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
- Optimality and duality for robust multiobjective optimization problems
- On sequential optimality conditions for robust multiobjective convex optimization problems
- Optimality conditions for a nonsmooth uncertain multiobjective programming problem
Cites work
- A note on the paper ``Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Constraint qualifications and optimality conditions in nonsmooth locally star-shaped optimization using convexificators
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Constraint qualifications for semi-infinite systems of convex inequalities
- Convexifactors, generalized convexity, and optimality conditions
- Duality in robust optimization: Primal worst equals dual best
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Nonsmooth semi-infinite multiobjective optimization problems
- On nonsmooth optimality theorems for robust optimization problems
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Optimization and nonsmooth analysis
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust duality for generalized convex programming problems under data uncertainty
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust optimization
- Strong duality in robust convex programming: complete characterizations
- Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
Cited in
(6)- Dominance for multi-objective robust optimization concepts
- scientific article; zbMATH DE number 5076090 (Why is no real title available?)
- From Optimality Robustness To Sufficiency and Completeness
- scientific article; zbMATH DE number 883239 (Why is no real title available?)
- Applying convexificators in robust multiobjective optimization
- Optimality and duality for robust nonconvex multiobjective optimization problems via bounded upper semi-regular convexificator
This page was built for publication: Sufficient Optimality Conditions for a Robust Multiobjective Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053531)
