A note on fractional minmax programs containing n-set functions

被引:4
|
作者
Bhatia, D [1 ]
Kumar, P [1 ]
机构
[1] UNIV DELHI,GARGI COLL,DEPT MATH,NEW DELHI 110049,INDIA
关键词
D O I
10.1006/jmaa.1997.5593
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Generalized rho-convexity assumptions are imposed on a few of the functions involved in the objective and the constraints to obtain sufficient optimality conditions and duality results for a generalized minmax fractional programming problem with n-set functions. (C) 1997 Academic Press.
引用
收藏
页码:283 / 292
页数:10
相关论文
共 50 条