Mond-Weir type duality involving (B, eta)-invex functions for a minmax programming problem

Several Mond-Weir type duals are proposed for a certain minmax programming problem and the notion of proper (b, eta)-invexity is used to establish duality theorems relating the primal and the duals. The duals for a minmax (generalized) fractional programming problem are presented as special cases of the main problem considered in the paper