首页|Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces
Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces
扫码查看
点击上方二维码区域,可以放大扫码查看
原文链接
NETL
NSTL
万方数据
Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.