E-凸规划最优性问题研究

The Study of Optimality of E-convex Programming

文章首先给出文献[1]中定理4.1的一个反例,并在对该文献的定理4.2进行修正的基础上给出了E-凸规划问题最优解的刻画;其次,给出一个E-凸规划问题的最优性充分条件;最后,在E-可微情形下得到E-凸规划问题最优解的相关结论.

This paper first presents a counter example of the theorem 4.1 in reference [1] and gives the characterization of the optimal solution of the E-eonvex programming problem by making revision of the theorem 4.2 in reference [1]. Then it gives sufficient conditions of the E-convex programming. Finally, it studies the relevant conclusion of the optimal solution of the E-convex programming for the E-differentiable ease.