Optimality Conditions for Set-Valued Optimization Problems
In this paper, we first prove that the generalized subconvexlikeness introduced by Yang, Yang and Chen [1] and the presubconvelikeness introduced by Zeng [2] are equivalent. We discuss set-valued nonconvex optimization problems and obtain some optimality conditions.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Etamaths Publishing
2023-07-01
|
| Series: | International Journal of Analysis and Applications |
| Online Access: | http://etamaths.com/index.php/ijaa/article/view/2277 |