Optimality criteria in E-convex programming

Necessary and sufficient optimality criteria in nonlinear programming are discussed for a class of E-convex programming problems which is considered more general than a class of convex programming problems. We also modify the Fritz John and the Kuhn–Tucker problems to E-Fritz John and E-Kuhn–Tucker problems.