On approximate efficiency for nonsmooth robust vector optimization problems
DOI10.1007/s10473-020-0320-5zbMath1499.90190OpenAlexW3028487898MaRDI QIDQ2153390
Publication date: 4 July 2022
Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10473-020-0320-5
scalarizationrobust multiobjective optimizationrobust optimization approach\(\epsilon\)-efficient solution\(\epsilon\)-optimality conditions
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)
Related Items (2)
Cites Work
- Unnamed Item
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Minmax robustness for multi-objective optimization problems
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust duality for generalized convex programming problems under data uncertainty
- Robust linear optimization under general norms.
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Selected topics in robust convex optimization
- Epsilon efficiency
- Robust solutions of uncertain linear programs
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Robust multiobjective optimization with application to Internet routing
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Epsilon approximate solutions for multiobjective programming problems
- Robust optimization-methodology and applications
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- Recent advances in robust optimization: an overview
- Robustness analysis in decision aiding, optimization, and analytics
- On robust multiobjective optimization
- Characterizations of solution sets of convex vector minimization problems
- Robust multiobjective optimization \& applications in portfolio optimization
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Robust Convex Optimization
- DUALITY THEOREM AND VECTOR SADDLE POINT THEOREM FOR ROBUST MULTIOBJECTIVE OPTIMIZATION PROBLEMS
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Necessary conditions for ε-optimality
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ε-approximate solutions in multiobjective optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Optimality and duality for robust multiobjective optimization problems
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
This page was built for publication: On approximate efficiency for nonsmooth robust vector optimization problems
