| DC规划的整体算法 |
| |
| 引用本文： | 蔡剑.DC规划的整体算法[J].北华大学学报(自然科学版),2008,9(1):16-20. |
| |
| 作者姓名： | 蔡剑 |
| |
| 作者单位： | 南京航空航天大学金城学院,江苏,南京,211156 |
| |
| 摘 要： | 通过对DC规划问题目标函数的线性下界估计,建立了DC规划的松弛线性规划,给出了 DC规划问题的一个新的整体优化算法.并通过对松弛线性规划可行域的细分以及一系列松弛线性规划的求解过程证明了算法的可行性,实例显示算法对大规模问题也是有效的.
|
| 关 键 词： | DC规划 线性化方法 全局优化 |
| 文章编号： | 1009-4822（2008）01-0016-05 |
| 收稿时间： | 2007-10-11 |
| 修稿时间： | 2007年10月11 |
Global Algorithm for DC Programming |
| |
| CAI Jian.Global Algorithm for DC Programming[J].Journal of Beihua University(Natural Science),2008,9(1):16-20. |
| |
| Authors: | CAI Jian |
| |
| Abstract: | This paper gives a relaxed linear programming of DC programming problems according to the linear lower bound of DC functions, and provides a new method for fmding the globally optimal solutions of DC programming problems. The proposed method is efficient by solving a sequence of relaxed linear programming problems over partitioned subsets. The examples are tested to demonstrate that the proposed method is efficient for large-scale DC programming problems. |
| |
| Keywords: | DC programming Linearization method Global optimization |
| 本文献已被 维普 万方数据 等数据库收录！ |
