| 王世磊.E-凸规划最优性问题研究[J].海南师范大学学报自科版,2017,30(1):1-6 |
| E-凸规划最优性问题研究 |
| The Study of Optimality of E-convex Programming |
| 投稿时间：2016-10-17 |
| DOI：10.12051/j.issn.1674-4942.2017.01.001 |
| 中文关键词: E-凸函数 E-凸规划 E-可微 最优解 最优性条件 |
| 英文关键词: E-convex function E-convex programming E-differentiable optimal solution optimal condition |
| 基金项目: |
|
| 摘要点击次数: 755 |
| 全文下载次数: 432 |
| 中文摘要: |
| 文章首先给出文献[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-convex 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 case. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |
