Generalization of Semilocally Preinvexand Sufficiency Theorem

Abstract

In this paper nonlinear programming involving convex is considered. Also we show that class of pseudoconvex is larger than calss of semilocally pseudopreinvex. Kuhn –Tucker type sufficient optimality conditions is defined for pseudoconvex.