利用单调函数求线性乘性规划的全局最优解

Solving Globally the Linear Multiplicative Programming Problem(LMP) via Monotonic Function

对广泛应用于工厂布局设计、超大规模集成电路设计等实际问题中的线性乘性规划问题(LMP)提出了一种单调全局优化算法.并从理论上证明了本算法的收敛性.数值实验表明了提出的方法是可行的和有效的.

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.