Abstract
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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have