中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Near-subconvexlikeness in vector optimization with set-valued functions

文献类型:期刊论文

作者Yang, XM; Li, D; Wang, SY
刊名JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
出版日期2001-08-01
卷号110期号:2页码:413-427
关键词set-valued functions vector optimization nearly-subconvexlike functions theorems of the alternative scalarization Lagrangian multiplier theorem
ISSN号0022-3239
英文摘要A new class of generalized convex set-valued functions, termed nearly-subconvexlike functions, is introduced. This class is a generalization of cone-subconvexlike maps, nearly-convexlike set-valued functions, and preinvex set-valued functions. Properties for the nearly-subconvexlike functions are derived and a theorem of the alternative is proved. A Lagrangian multiplier theorem is established and two scalarization theorems are obtained for vector optimization.
WOS研究方向Operations Research & Management Science ; Mathematics
语种英语
WOS记录号WOS:000170581700009
出版者KLUWER ACADEMIC/PLENUM PUBL
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/16069]  
专题中国科学院数学与系统科学研究院
通讯作者Yang, XM
作者单位1.Chongqing Normal Univ, Dept Math, Chongqing, Peoples R China
2.Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China
3.Chinese Acad Sci, Inst Syst Sci, Beijing, Peoples R China
推荐引用方式
GB/T 7714
Yang, XM,Li, D,Wang, SY. Near-subconvexlikeness in vector optimization with set-valued functions[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS,2001,110(2):413-427.
APA Yang, XM,Li, D,&Wang, SY.(2001).Near-subconvexlikeness in vector optimization with set-valued functions.JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS,110(2),413-427.
MLA Yang, XM,et al."Near-subconvexlikeness in vector optimization with set-valued functions".JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 110.2(2001):413-427.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。