A study on the duality of e-convex non-linear programming problem

In this work, we will study a class of the duality problem of E-convexprogramming. The weak and strong theorems for the duality problem of E-convexprogramming are given to show the relation between the solutions of the dual andprimal problems, and also we will prove some properties of the duality problem ofE-convex programming.