A New Global Algorithm for Sum of Linear Ratios Problem

This paper presents a new branch and bound algorithm for globally solving general sum of linear ratios problem.First,by using an equivalent transformation technique and a new linear relaxation technique,the equivalent problem can be reduced to a sequence of linear programming problems.The proposed algorithm will convergent to the global optimal solution by means of the subsequent solutions of the series of linear programming problems.Convergence of the algorithm is established and numerical results are given to show the feasibility.