Duality in nondifferentiable minimax fractional programming with generalized convexity (Q2495986)

The authors study nondifferentiable minimax fractional programming problem in which the supremum of ratio of functions involving square roots is to be minimized. They present Mond-Weir type dual formulation for the problem ad establish weak, strong and strict converse duality theorems with \((F,\alpha,\rho,d)\)-pseudoconvexity. Among results in this direction the reader's attention is invited to the recent article by \textit{H. C. Lai} and \textit{J. C. Lee} [J. Comput. Appl. Math. 146, 115--126 (2002; Zbl 1010.90080)].