In this paper a global optimization algorithm is proposed for locating global minimum of sum of linear ratios problem (P) with coefficients.By utilizing equivalent problem and linearization technique,the relaxation linear programming (RLP) about the (P) is established,thus the initial non-convex problem (P) is reducedto a series of linear programming (RLP).The proposed branch and bound algorithm is convergent to the global minimum of (P) through the successive refinement of the feasible region and solutions of a series of RLP.And finally the numerical experiment is given to illustrate the feasibility of the presented algorithm.%对带系数的线性比式和问题(P)提出一确定性全局优化算法.利用等价问题和线性化技术给出了问题(P)的松弛线性规划(RLP),通过对(RLP)可行域的细分以及一系列(RLP)的求解过程,提出的分枝定界算法收敛问题(P)全局最优解.最终数值实验表明了提出方法的可行性.
展开▼
