Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
From MaRDI portal
Publication:6192085
Recommendations
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions
- Robust sufficient optimality conditions and duality in semi-infinite multiobjective programming with data uncertainty
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 778126 (Why is no real title available?)
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- Characterizing robust solution sets of convex programs under data uncertainty
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Convex Analysis
- Minmax robustness for multi-objective optimization problems
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- On nonsmooth optimality theorems for robust optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- On the theory of Lagrangian duality
- Optimality and duality for robust multiobjective optimization problems
- Optimality and duality in vector optimization involving generalized type I functions over cones
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Radius of robust feasibility of system of convex inequalities with uncertain data
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robust convex optimization
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Robust duality for generalized convex programming problems under data uncertainty
- Robust optimization
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Robustness in deterministic multi-objective linear programming with respect to the relative interior and angle deviation
- Robustness in nonsmooth nonlinear multi-objective programming
- Set-valued analysis
- Set-valued optimization. An introduction with applications
- Strong duality in robust convex programming: complete characterizations
Cited in
(1)
This page was built for publication: Robust optimality conditions for multiobjective programming problems under data uncertainty and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192085)