中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Optimality and duality for a multi-objective programming problem involving generalized d-type-I and related n-set functions

文献类型:期刊论文

作者Mishra, SK; Wang, SY; Lai, KK
刊名EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
出版日期2006-09-01
卷号173期号:2页码:405-418
关键词multi-objective programming n-set functions optimality duality generalized convexity
ISSN号0377-2217
DOI10.1016/j.ejor.2005.02.062
英文摘要In this paper, we introduce several generalized convexity for a real-valued set function and establish optimality and duality results for a multi-objective programming problem involving generalized d-type-I and related n-set functions. (c) 2005 Elsevier B.V. All rights reserved.
WOS研究方向Business & Economics ; Operations Research & Management Science
语种英语
WOS记录号WOS:000238276900004
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/3389]  
专题中国科学院数学与系统科学研究院
通讯作者Lai, KK
作者单位1.City Univ Hong Kong, Dept Management Sci, Kowloon, Hong Kong, Peoples R China
2.Govind Ballabh Pant Univ Agr & Technol, Coll Basic Sci & Humanities, Dept Math Stat & Comp Sci, Pantnagar 263145, Uttar Pradesh, India
3.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
4.Hunan Univ, Coll Business Adm, Changsha, Peoples R China
推荐引用方式
GB/T 7714
Mishra, SK,Wang, SY,Lai, KK. Optimality and duality for a multi-objective programming problem involving generalized d-type-I and related n-set functions[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,2006,173(2):405-418.
APA Mishra, SK,Wang, SY,&Lai, KK.(2006).Optimality and duality for a multi-objective programming problem involving generalized d-type-I and related n-set functions.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,173(2),405-418.
MLA Mishra, SK,et al."Optimality and duality for a multi-objective programming problem involving generalized d-type-I and related n-set functions".EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 173.2(2006):405-418.

入库方式: OAI收割

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

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

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