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