Hybrid Integral Type Programming Problems

Abstract

This research deals with a class of problems of minmax fractional integral type programming (or programs) 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 univexity, 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 univexity frameworks is established.