| 求解一般D.C.规划的全局最优解 |
| |
| 引用本文： | 徐俊彦,苗壮,刘庆怀. 求解一般D.C.规划的全局最优解[J]. 吉林大学学报(理学版), 2013, 51(6): 1058-1062 |
| |
| 作者姓名： | 徐俊彦 苗壮 刘庆怀 |
| |
| 作者单位： | 长春工业大学 基础科学学院, 长春 130012 |
| |
| 摘 要： | 给出一种求解一般D.C.规划非孤立全局最优解的算法. 该算法克服了目前一些逼近算法在计算过程中有时得到的解为不可行解、 甚至远离真正全局最优解的问题. 数值结果表明了算法的有效性.
|
| 关 键 词： | 全局优化 一般D.C.规划 非孤立最优解 |
| 收稿时间： | 2012-12-28 |
Global Optimization for Generalized D.C.Programming Problem |
| |
| XU Jun yan,MIAO Zhuang,LIU Qing huai. Global Optimization for Generalized D.C.Programming Problem[J]. Journal of Jilin University: Sci Ed, 2013, 51(6): 1058-1062 |
| |
| Authors: | XU Jun yan MIAO Zhuang LIU Qing huai |
| |
| Affiliation: | School of Basic Science, Changchun University of Technology, Changchun 130012, China |
| |
| Abstract: | Most existing approximate methods for solving generalized D.C.programming problems may sometimes provide an infeasible solution, or a solution far from the true optimum. To overcome these limitations, a nonisolatedglobal optimal solution algorithm was proposed for solving generalized D.C.programming problem. Numerical results show the effectiveness of this method. |
| |
| Keywords: | global optimization generalized D.C.programming nonisolated optimal solution |
|
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《吉林大学学报(理学版)》下载全文 |
