Optimality conditions for robust weakly efficient solutions in uncertain optimization
From MaRDI portal
Cites work
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals
- A unified approach through image space analysis to robustness in uncertain optimization problems
- A unified approach to uncertain optimization
- A unified characterization of multiobjective robustness via separation
- Characterizations of set relations with respect to variable domination structures via oriented distance function
- Higher-order generalized Studniarski epiderivative and its applications in set-valued optimization
- Higher-order optimality conditions for strict and weak efficient solutions in set-valued optimization
- Higher-order optimality conditions for strict minimality in set-valued otimization
- Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Minmax robustness for multi-objective optimization problems
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- New higher-order weak lower inner epiderivatives and application to Karush-Kuhn-Tucker necessary optimality conditions in set-valued optimization
- New second-order radial epiderivatives and applications to optimality conditions
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust multiobjective optimization
- On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions in terms of contingent epiderivatives for strict local Pareto minima in vector optimization problems with constraints
- Robust convex optimization
- Robust duality for generalized convex programming problems under data uncertainty
- Robust optimization
- Robust optimization model for uncertain multiobjective linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Robust solutions to multi-objective linear programs with uncertain data
- Scalarization of multiobjective robust optimization problems
- Strong duality in robust convex programming: complete characterizations
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Theory and applications of robust optimization
This page was built for publication: Optimality conditions for robust weakly efficient solutions in uncertain optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968890)