Abstract
AbstractRecently 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.
Publisher
Cambridge University Press (CUP)
Reference13 articles.
1. Invex functions and duality
2. Optimality criteria in nonlinear programming involving nonconvex functions
3. On duality with generalized convexity;Mond;Math. Operationsforsch. Statist. Ser. Optim.,1984
Cited by
435 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献