Generalization of semilocally preinvex and sufficiency theorem

الملخص EN

In this paper nonlinear programming involving convex is considered.

Also we show that class of pseudo convex is larger than class of semi locally pseudopreinvex.

Kuhn–Tucker type sufficient optimality conditions are defined for pseudo convex.