| 利用单调函数求线性乘性规划的全局最优解 |
| |
| 引用本文： | 陈永强,程维新.利用单调函数求线性乘性规划的全局最优解[J].河南师范大学学报(自然科学版),2011,39(5):35-37. |
| |
| 作者姓名： | 陈永强 程维新 |
| |
| 作者单位： | 河南师范大学数学与信息科学学院,河南新乡,453007 |
| |
| 基金项目： | 国家自然科学基金(10671057); 河南省高校科技创新人才支持计划项目(2008 HASTIT023) |
| |
| 摘 要： | 对广泛应用于工厂布局设计、超大规模集成电路设计等实际问题中的线性乘性规划问题(LMP)提出了一种单调全局优化算法.并从理论上证明了本算法的收敛性.数值实验表明了提出的方法是可行的和有效的.
|
| 关 键 词： | 全局优化 线性乘性规划 分枝定界 |
Solving Globally the Linear Multiplicative Programming Problem(LMP) via Monotonic Function |
| |
| CHEN Yong-qiang,CHENG Wei-xin.Solving Globally the Linear Multiplicative Programming Problem(LMP) via Monotonic Function[J].Journal of Henan Normal University(Natural Science),2011,39(5):35-37. |
| |
| Authors: | CHEN Yong-qiang CHENG Wei-xin |
| |
| Institution: | CHEN Yong-qiang,CHENG Wei-xin (School of Mathematics and Information Science,Henan Normal University,Xinxiang 453007,China) |
| |
| Abstract: | A global monotonic optimization algorithm is proposed for the linear multiplicative programming(LMP),which can be applied to plant layout design,VLSI chip design and so on pratical problems.Theoretically,the proof which the proposed branch and bound algorithm is convergent to the global minimum is given.And the numerical experiments problem are given to illustrate the feasibility and efficiency of the proposed algorithm. |
| |
| Keywords: | global optimization LMP branch and bound |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
