On approximate solutions for nonsmooth robust multiobjective optimization problems
DOI10.1080/02331934.2019.1579212zbMATH Open1434.90177OpenAlexW2916289928WikidataQ128354231 ScholiaQ128354231MaRDI QIDQ5239079FDOQ5239079
M. Fakhar, M. R. Mahyarinia, Jafar Zafarani
Publication date: 21 October 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1579212
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
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
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Robustness in mathematical programming (90C17)
Cites Work
- Integration of subdifferentials of lower semicontinuous functions on Banach spaces
- On the variational principle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- The relationship between multi-objective robustness concepts and set-valued optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Approximate solutions of multiobjective optimization problems
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- Two Types of Approximate Saddle Points
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Robust convex optimization
- On robust multiobjective optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Concepts of robustness for uncertain multi-objective optimization
- Minmax robustness for multi-objective optimization problems
- Evolutionary Multi-Criterion Optimization
- Duality theorem and vector saddle point theorem for robust multiobjective optimization problems
- Robust duality for generalized convex programming problems under data uncertainty
- Necessary conditions for ε-optimality
- ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Optimality and duality for robust multiobjective optimization problems
- On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
- Title not available (Why is that?)
- Subdifferential Determination of Essentially Directionally Smooth Functions in Banach Space
Cited In (18)
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- 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
- Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- 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
- Optimality conditions for a nonsmooth uncertain multiobjective programming problem
- 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
- Title not available (Why is that?)
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
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)
