Abstract
In this paper, we introduce a new generalized convexity notion for set-valued maps, called ic-cone-convexlikeness, and use it as the main tool to derive an alternative theorem and necessary conditions for efficient, weakly efficient, and Benson properly efficient solutions of the problem of minimizing a set-valued map subject to set-valued constraints. Our results are valid for a class of optimization problems broader than that of the problems considered in Refs. 1--6 and generalize the corresponding results of these references.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Z. F. Li S. Y. Wang (1994) ArticleTitleLagrange Multipliers and Saddle Points in Multiobjective Programming Journal of Optimization Theory and Applications 83 63–81
Z. F. Li (1998) ArticleTitleBenson Proper Efficiency in the Vector Optimization of Set-Valued Maps Journal of Optimization Theory and Applications 98 623–649
G.Y. Chen D.W. Rong (1998) ArticleTitleCharacterization of the Benson Proper Efficiency for Nonconvex Vector Optimization Journal of Optimization Theory and Applications 98 365–384
X. M. Yang X. Q. Yang G. Y. Chen (2000) ArticleTitleTheorems of the Alternative and Optimization with Set-Valued Maps Journal of Optimization Theory and Applications 107 627–640
X. M. Yang D. Li S. Y. Wang (2001) ArticleTitleNear-Subconvexlikeness in Vector Optimization with Set-Valued Functions Journal of Optimization Theory and Applications 110 413–427
Y. W. Huang (2002) ArticleTitleOptimality Conditions for Vector Optimization with Set-Valued Maps Bulletin of the Australian Mathematical Society 66 317–330
K. Fan (1953) ArticleTitleMinimax Theorems Proceedings of the National Academy of Sciences of the USA 39 42–47
V. Jeyakumar (1985) ArticleTitleConvexlike Alternative Theorems and Mathematical Programming Optimization 16 643–652
S. Paeck (1992) ArticleTitleConvexlike and Concavelike Conditions in Alternative, Minimax, and Minimization Theorems Journal of Optimization Theory and Applications 14 317–332
Z. Li (1999) ArticleTitleA Theorem of the Alternative and Its Application to the Optimization of Set-Valued Maps Journal of Optimization Theory and Application 100 365–375
X. M. Yang (1992) ArticleTitleAlternative Theorems and Optimality Conditions with Weakened Convexity Opsearch 29 125–135
P. H. Sach (2003) ArticleTitleNearly Subconvexlike Set-Valued Maps and Vector Optimization Problems Journal of Optimization Theory and Applications 119 335–356
J. P. Dauer O. A. Saleh (1993) ArticleTitleA Characterization of Proper Minimal Points as Solutions of Sublinear Optimization Problems Journal of Mathematical Analysis and Applications 178 227–246
W. Song (1998) ArticleTitleDuality in Set-Valued Optimization Dissertations Mathematicae 375 1–67
W. W. Brecker G. Kassay (1997) ArticleTitleA Systematization of Convexity Concepts for Sets and Functions Journal of Convex Analysis 4 109–127
V. Jeyakumar J. Gwinner (1991) ArticleTitleInequality Systems and Optimization Journal of Mathematical Analysis and Applications 159 51–57
A. Aleman (1985) ArticleTitleOn Some Generalizations of Convex Sets and Convex Functions Mathematica: Revue d’Analyse Numérique et de Théorie de l’Approximation 14 1–6
Author information
Authors and Affiliations
Additional information
Communicated by H. P. Benson
The author thanks the anonymous referees for their remarks.
Rights and permissions
About this article
Cite this article
Sach, P.H. New Generalized Convexity Notion for Set-Valued Maps and Application to Vector Optimization. J Optim Theory Appl 125, 157–179 (2005). https://doi.org/10.1007/s10957-004-1716-4
Issue Date:
DOI: https://doi.org/10.1007/s10957-004-1716-4