Duality for minmax B-vex programming involving n-set functions

[摘要] A minmax programming problem involving several B-vex n-set functions is considered. Necessary and sufficient optimality theorems and Wolfe type duality results are established. Duality for the n-set generalized (minmax) fractional programming problem is derived as a special case of the main problem. (C) 1997 Academic Press.

[发布日期] 1997-11-01