\(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization

DOI10.1007/S00186-005-0007-7zbMath1109.49021OpenAlexW2001440195MaRDI QIDQ2433240

Ahmed Taa

Publication date: 27 October 2006

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-005-0007-7

zbMATH Keywords

optimality conditionsmultiobjective optimizationscalarizationconvex\(\varepsilon\)-subdifferentials of set-valued maps\(\varepsilon\)-weak ParetoLagrange-multipliersnearly subconvexlikesubconvexlike

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items (22)

Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ On the optimality conditions for D.C. vector optimization problems ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Pareto epsilon-subdifferential sum rule for set-valued mappings and applications to set optimization ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions ⋮ Differential stability in a multi-objective optimal control problems with a possibly empty solution set ⋮ Unnamed Item ⋮ Optimality conditions for vector optimization problems with difference of convex maps ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems ⋮ Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency ⋮ Approximate solutions of vector optimization problems via improvement sets in real linear spaces ⋮ Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ Approximate duality for vector quasi-equilibrium problems and applications ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces ⋮ Sensitivity analysis in parametric convex vector optimization ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Differential stability properties in convex scalar and vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of multiobjective optimization
• Epsilon efficiency
• Pshenichnyi's theorem for vector minimization
• Existence and Lagrangian duality for maximization of set-valued functions
• Sensitivity analysis in multiobjective optimization
• Conjugate maps and duality in multiobjective optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• Optimization of set-valued functions
• Connectedness of efficient solution sets for set-valued maps in normed spaces
• Contingent epiderivatives and set-valued optimization
• Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
• Approximate saddle-point theorems in vector optimization
• On the variational principle
• Contingent derivatives of set-valued maps and applications to vector optimization
• Optimization and nonsmooth analysis
• Stability and Sensitivity Analysis in Convex Vector Optimization
• Necessary conditions for ε-optimality
• Invex optimisation problems
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Connectivity of efficient solution sets in vector optimization of set-valued mappings
• On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
• Sufficient conditions of optimality for multiobjective optimization problems with γ-paraconvex data
• On Approximate Solutions in Convex Vector Optimization
• Set-valued derivatives of multifunctions and optimality conditions
• GENERALIZED CONTINGENT EPIDERIVATIVES IN SET-VALUED OPTIMIZATION: OPTIMALITY CONDITIONS
• Necessary and sufficient condiitions for multiobjective optimization problems
• Convex Analysis
• Optimality conditions for maximizations of set-valued functions
• e-weak minimal solutions of vector optimization problems with set-valued maps

This page was built for publication: \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization