Minimax fractional integral programming i

摘要

This paper deals with the problem of minmax fractional integral type programming by applying the generalized version of univexity considered in Mishra, Shukla and Verma [4], which is equivalent to minimizing a maximum of several time dependent ratios involving integral expressions. We establish optimality conditions based on the generalized invexity, and then we explore the Wolfe type dual model, and Mond-Weir type dual model. Furthermore, a class of weak, strong and strictly converse duality theorems based on the generalized invexity frameworks is established.