\(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
From MaRDI portal
Publication:1916781
DOI10.1006/jmaa.1996.0080zbMath0848.90107OpenAlexW1967186512MaRDI QIDQ1916781
Publication date: 14 July 1996
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1996.0080
multiobjective programming\(\varepsilon\)-Pareto optimalitynecessary Kuhn-Tucker conditionnondifferentiable, convex, multiobjective minimizationWolf-type duality theorem
Related Items
On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ \(\varepsilon\)-optimality for multiobjective programming on a Banach space ⋮ Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity ⋮ On Minty variational principle for nonsmooth vector optimization problems with approximate convexity ⋮ Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ On approximate efficiency for nonsmooth robust vector optimization problems ⋮ Generating \(\varepsilon\)-efficient solutions in multiobjective programming ⋮ On approximate efficiency in multiobjective programming ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS ⋮ Two Types of Approximate Saddle Points ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ Unnamed Item ⋮ Constrained \(\epsilon\)-vector valued games and generalized multi-valued \(\epsilon\)-minmax, \(\epsilon\)-maxmin programming. ⋮ Approximate saddle points for constrained vector-valued games. ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems ⋮ ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ \(\varepsilon\)-optimality and duality for multiobjective fractional programming ⋮ \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems ⋮ On approximate starshapedness in multiobjective optimization ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity ⋮ Approximate solutions of multiobjective optimization problems ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems
