E-凸规划最优性问题研究 |
| |
引用本文: | 王世磊. E-凸规划最优性问题研究[J]. 海南师范大学学报(自然科学版), 2017, 30(1): 1-6 |
| |
作者姓名: | 王世磊 |
| |
作者单位: | 信阳学院 数学与信息学院,河南 信阳 464000 |
| |
摘 要: | 文章首先给出文献[1]中定理4.1的一个反例,并在对该文献的定理4.2进行修正的基础上给出了E-凸规划问题最优解的刻画;其次,给出一个E-凸规划问题的最优性充分条件;最后,在E-可微情形下得到E-凸规划问题最优解的相关结论.
|
关 键 词: | E-凸函数 E-凸规划 E-可微 最优解 最优性条件 |
收稿时间: | 2016-10-17 |
The Study of Optimality of E-convex Programming |
| |
Abstract: | This paper first presents a counter example of the theorem 4.1 in reference [1] and gives the characterization ofthe optimal solution of the E-convex programming problem by making revision of the theorem 4.2 in reference [1]. Then itgives sufficient conditions of the E-convex programming. Finally, it studies the relevant conclusion of the optimal solution ofthe E-convex programming for the E-differentiable case. |
| |
Keywords: | E-convex function E-convex programming E-differentiable optimal solution optimal condition |
本文献已被 CNKI 等数据库收录! |
| 点击此处可从《海南师范大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《海南师范大学学报(自然科学版)》下载全文 |