Duality for minmax programming involvingV-invex functions
C. R. Bector, S. Chandra, Uma Kumar · Optimization · 1994
Sufficient optimality conditions and duality results for a class of minmax programming problems are obtained under V-invexity type assumptions on objective and constraint functions. Applications of these results to certain fractional and generalized fractional programming problems are also presented