科研之友
微信
新浪微博
Facebook
分享链接
摘要
A new linearizing method is presented for globally solving sum of linear ratios problem with coefficients. By using the linearizing method, linear relaxation programming (LRP) of the sum of linear ratios problem with coefficients is established, which can provide the reliable lower bound of the optimal value of the initial problem. Thus, a branch and bound algorithm for solving the sum of linear ratios problem with coefficients is put forward. By successively partitioning the linear relaxation of the feasible region and solving a series of the LRP, the proposed algorithm is convergent to the global optimal solution of the initial problem. Compared with the known methods, numerical experimental results show that the proposed method has the higher computational efficiency in finding the global optimum of the sum of linear ratios problem with coefficients.
