On approximate solutions for nonsmooth robust multiobjective optimization problems
From MaRDI portal
Publication:5239079
robust optimality\(\varepsilon\)-approximate (KKT) condition of degree \(n\varepsilon\)-approximate weak vector saddle-point of degree \(n\)\varepsilon\)-vector duality of degree \(n\)generalized convexity of degree \(n\)robust \(\varepsilon\)-Mond-Weir type duality of degree \(nrobust \(\varepsilon\)-quasi-(weakly) efficient solutions
Recommendations
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- On approximate efficiency for nonsmooth robust vector optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- scientific article; zbMATH DE number 7620762
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
Cites work
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
- Approximate solutions of multiobjective optimization problems
- Concepts of robustness for uncertain multi-objective optimization
- Duality theorem and vector saddle point theorem for robust multiobjective optimization problems
- Evolutionary Multi-Criterion Optimization
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Integration of subdifferentials of lower semicontinuous functions on Banach spaces
- Minmax robustness for multi-objective optimization problems
- Necessary conditions for ε-optimality
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- On -solutions for convex optimization problems with uncertainty data
- On nonsmooth optimality theorems for robust optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- On robust multiobjective optimization
- On the variational principle
- Optimality and duality for robust multiobjective optimization problems
- Robust convex optimization
- Robust duality for generalized convex programming problems under data uncertainty
- Robust multiobjective optimization \& applications in portfolio optimization
- Robust optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Subdifferential determination of essentially directionally smooth functions in Banach space
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The relationship between multi-objective robustness concepts and set-valued optimization
- Two Types of Approximate Saddle Points
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
Cited in
(23)- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- Optimality conditions for generalized convex nonsmooth uncertain multi-objective fractional programming
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- Further results on quasi efficient solutions in multiobjective optimization
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
- Optimality conditions and saddle point theorems of approximate quasi weak efficient solutions for robust multi-objective programming
- Approximate solution in robust multi-objective optimization and its application in portfolio optimization
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- On approximate efficiency for nonsmooth robust vector optimization problems
- Optimality conditions for a nonsmooth uncertain multiobjective programming problem
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- On mathematical programs with equilibrium constraints under data uncertainty
- On approximate optimality conditions for robust multi-objective convex optimization problems
- scientific article; zbMATH DE number 6541193 (Why is no real title available?)
This page was built for publication: On approximate solutions for nonsmooth robust multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239079)
