Gateaux可微条件下E-凸规划问题的解集刻画
CHARACTERIZATION OF THE SOLUTION SET OF E-CONVEX PROGRAMMING WITH GATEAUX DIFFERENTIAL

本文研究了E-凸函数在Gateaux可微条件下Gateaux导数与E-次微分之间的关系，获得了E-凸规划问题最优解的必要条件.给出了E-凸规划问题的最优解集刻画.
In this paper, we study the relation between the Gateaux differential of E-convex function and the E-differential, and obtain the necessary condition for the optimal solution of E-convex programming problems. According to these two conclusions, the optimal solution set characterization of E-convex programming problem is shown