MINIMAX PROGRAMMING UNDER GENERALIZED （p, r）-INVEXITY  

作　　者：S. K. MISHRA Shouyang WANG K. K. LAI 

机构地区：[1]Department of Mathematics, Statistics and Computer Science, College of Basic Sciences and Humanities, G. B. Pant University of Agriculture and Technology, Pantnagar-263 145, India [2]Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China [3]Department of Management Sciences, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, China

出　　处：《Journal of Systems Science & Complexity》2007年第4期501-508,共8页系统科学与复杂性学报（英文版）

摘　　要：Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.

关 键 词：DUALITY minimax programming optimality conditions （p r）-invex functions. 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]