On approximate solutions for nonsmooth robust multiobjective optimization problems

DOI10.1080/02331934.2019.1579212zbMath1434.90177OpenAlexW2916289928WikidataQ128354231 ScholiaQ128354231MaRDI QIDQ5239079

Mohammad Reza Mahyarinia, Majid Fakhar, 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

zbMATH Keywords

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

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Robustness in mathematical programming (90C17)

Related Items (16)

Some characterizations of approximate solutions for robust semi-infinite optimization problems ⋮ Further results on quasi efficient solutions in multiobjective optimization ⋮ On mathematical programs with equilibrium constraints under data uncertainty ⋮ On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data ⋮ 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 ⋮ On approximate optimality conditions for robust multi-objective convex optimization problems ⋮ On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems ⋮ 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 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 ⋮ Optimality conditions for a nonsmooth uncertain multiobjective programming problem ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solutions of multiobjective optimization problems
• On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
• Minmax robustness for multi-objective optimization problems
• Robust duality for generalized convex programming problems under data uncertainty
• Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
• Robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
• Integration of subdifferentials of lower semicontinuous functions on Banach spaces
• On the variational principle
• \(\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
• On robust multiobjective optimization
• Robust multiobjective optimization \& applications in portfolio optimization
• Necessary optimality conditions and saddle points for approximate optimization in Banach space
• Robust Convex Optimization
• DUALITY THEOREM AND VECTOR SADDLE POINT THEOREM FOR ROBUST MULTIOBJECTIVE OPTIMIZATION PROBLEMS
• Subdifferential Determination of Essentially Directionally Smooth Functions in Banach Space
• Two Types of Approximate Saddle Points
• Necessary conditions for ε-optimality
• ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
• ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Evolutionary Multi-Criterion Optimization
• Optimality and duality for robust multiobjective optimization problems

This page was built for publication: On approximate solutions for nonsmooth robust multiobjective optimization problems