科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we propose a new kind of S-super efficiency of vector optimization problems with set-valued maps via Assumption (A), which unifies exact and approximate super efficiency well known in the literature. Furthermore, we also introduce the concept of nearly S-subconvexlikeness via Assumption (A) and discuss some relations with other types of generalized convexity. Moreover, we establish some scalarization theorems and Lagrange multiplier theorems of S-super efficiency under the nearly S-subconvexlikeness.
