Abstract
In this paper, we give a comparison among some notions of weak sharp minima introduced in Amahroq et al. [Le matematiche J. 73 (2018) 99–114], Durea and Strugariu [Nonlinear Anal. 73 (2010) 2148–2157] and Zhu et al. [Set-Valued Var. Anal. 20 (2012) 637–666] for set-valued optimization problems. Besides, we establish sharp Lagrange multiplier rules for general constrained set-valued optimization problems involving new scalarization functionals based on the oriented distance function. Moreover, we provide sufficient optimality conditions for the considered problems without any convexity assumptions.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献