中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Complex minimax programming under generalized convexity

文献类型:期刊论文

作者Mishra, SK; Wang, SY; Lai, KK
刊名JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
出版日期2004-05-01
卷号167期号:1页码:59-71
关键词minimax programming generalized invex function duality theorem
ISSN号0377-0427
DOI10.1016/j.cam.2003.09.045
英文摘要We establish the Kuhn-Tucker-type sufficient optimality conditions for complex minimax programming under generalized invex functions. Subsequently, we apply these optimality criteria to formulate two dual models. We also establish weak, strong and strict converse duality theorems. (C) 2003 Elsevier B.V. All rights reserved.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000221765700004
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/911]  
专题中国科学院数学与系统科学研究院
通讯作者Lai, KK
作者单位1.City Univ Hong Kong, Dept Management Sci, Hong Kong, Hong Kong, Peoples R China
2.GB Pant Univ Agr & Technol, Dept Math Stat & Comp Sci, Pantnagar 263145, Uttar Pradesh, India
3.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Mishra, SK,Wang, SY,Lai, KK. Complex minimax programming under generalized convexity[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS,2004,167(1):59-71.
APA Mishra, SK,Wang, SY,&Lai, KK.(2004).Complex minimax programming under generalized convexity.JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS,167(1),59-71.
MLA Mishra, SK,et al."Complex minimax programming under generalized convexity".JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 167.1(2004):59-71.

入库方式: OAI收割

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

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

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