Minmax programming problems with (p, r) - ρ - (η, θ)-invexity

Abstract

In this paper, we establish the sufficient optimality conditions for minmax programming and generalized fractional minmax programming problems. Based on the sufficient conditions, a duality model is constructed and duality results are derived under a new type of generalised invexity assumption, called (p, r) − ρ − (η, θ)-invexity. Our study extends some of the previously known results in the framework of generalised invexity and duality models.Wealso provide some examples to illustrate our work.