摘要
从DC规划的特点出发,提出了一种线性化方法和分支算法来求全局最优解,实验表明,该方法比传统的DCA算法更简单、方便,而且DCA算法得到的仅仅是局部最优解。
From the characteristics of DC programming, a method of linear and branched aogorithm for global optimal solution is proposed. Experiments show that the method than the traditional DCA algorithm is more simple and convenient. DCA algorithm to be the optimal solution is only partial.
出处
《科学技术与工程》
2009年第9期2281-2284,共4页
Science Technology and Engineering
关键词
DC规划
线性化方法
全局优化
DC programming linear method global optimization
