On approximate efficiency for nonsmooth robust vector optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7620762
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- scientific article; zbMATH DE number 6541193
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
Cites work
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Characterizations of solution sets of convex vector minimization problems
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Duality theorem and vector saddle point theorem for robust multiobjective optimization problems
- Epsilon approximate solutions for multiobjective programming problems
- Epsilon efficiency
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Minmax robustness for multi-objective optimization problems
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization
- Necessary conditions for ε-optimality
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On -solutions for convex optimization problems with uncertainty data
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On robust multiobjective optimization
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Optimality and duality for robust multiobjective optimization problems
- Recent advances in robust optimization: an overview
- Robust Farkas' lemma for uncertain linear systems with applications
- Robust convex optimization
- Robust counterparts and robust efficient solutions in vector optimization under uncertainty
- Robust duality for generalized convex programming problems under data uncertainty
- Robust linear optimization under general norms.
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust multiobjective optimization with application to Internet routing
- Robust optimization
- Robust optimization-methodology and applications
- Robust solutions of uncertain linear programs
- Robustness analysis in decision aiding, optimization, and analytics
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
- Selected topics in robust convex optimization
- Strong duality in robust convex programming: complete characterizations
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ε-approximate solutions in multiobjective optimization
Cited in
(15)- Second-order strong optimality and duality for nonsmooth multiobjective fractional programming with constraints
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Parametric approach for approximate efficiency of robust multiobjective fractional programming problems
- Robust optimality conditions for semi-infinite equilibrium problems involving data uncertainty
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
- Robustness in nonsmooth nonlinear multi-objective programming
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- On local quasi efficient solutions for nonsmooth vector optimization problems
- Robust optimality and duality relations for multiobjective semi-infinite equilibrium problems having vanishing constraints with uncertain data
- Characterization of norm-based robust solutions in vector optimization
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- Tractable approximation to robust nonlinear production frontier problem
- scientific article; zbMATH DE number 7620762 (Why is no real title available?)
- Approaches for biobjective integer linear robust optimization
This page was built for publication: On approximate efficiency for nonsmooth robust vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2153390)
