On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems

DOI10.11650/twjm/1500405613zbMath1223.90042OpenAlexW2738786395MaRDI QIDQ981895

Gue Myung Lee, Le Anh Tuan

Publication date: 9 July 2010

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500405613

zbMATH Keywords

\(\varepsilon\)-solution\(\varepsilon\)-subgradientconvex set-valued map

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (4)

Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Existence and duality of generalized \(\epsilon\)-vector equilibrium problems ⋮ On set containment characterizations for sets described by set-valued maps with applications

This page was built for publication: On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems