What is invexity?

Abstract

Abstract Recently it was shown that many results in Mathematical Programming involving convex functions actually hold for a wider class of functions, called invex . Here a simple characterization of invexity is given for both constrained and unconstrained problems. The relationship between invexity and other generalizations of convexity is illustrated. Finally, it is shown that invexity can be substituted for convexity in the saddle point problem and in the Slater constraint qualification.