On -optimality conditions for convex set-valued optimization problems
From MaRDI portal
Publication:981895
DOI10.11650/TWJM/1500405613zbMATH Open1223.90042OpenAlexW2738786395MaRDI QIDQ981895FDOQ981895
Authors: 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
Recommendations
- Optimality conditions for set-valued optimization in the sense of \(\varepsilon\)-strict efficiency
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative
- Optimality conditions for a nonconvex set-valued optimization problem
- Lagrange optimality conditions for set-valued optimization problems in the sense of \(\varepsilon\)-strongly efficient elements
- Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity
- Optimality conditions of a set valued optimization problem with the help of directional convexificators
- scientific article; zbMATH DE number 7351021
- Optimality conditions for set-valued optimization problems
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
Cited In (13)
- \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions
- Techniques for exploring the suboptimal set
- On set containment characterizations for sets described by set-valued maps with applications
- Existence and duality of generalized \(\epsilon\)-vector equilibrium problems
- \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- \(\varepsilon\)-super subgradient for a set-valued map
- Properties of \(\epsilon\)-super subgradient for a set-valued map and its applications
- 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
- \((C, \varepsilon)\)-super subdifferentials of set-valued maps and optimality conditions for set-valued optimization problems
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Epidifferentiability and hypodifferentiability of pseudoconvex maps in set-optimization problems
This page was built for publication: On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q981895)