We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A New Branch and Bound Method for Solving Sum of Linear Ratios Problem.
- Authors
Chun-Feng Wang; Xin-Yue Chu
- Abstract
For globally solving sum of linear ratios problem (SLRP), this paper presents a new branch-and-bound method. In this method, a new linear relaxation technique is proposed firstly; then, the initial problem SLRP is solved by a sequence of linear programming problems. Meanwhile, to improve the convergence speed of our algorithm, two accelerating techniques are presented. The proposed algorithm is proved to be convergent, and some experiments are provided to show its feasibility and efficiency.
- Subjects
MATHEMATICAL bounds; ALGORITHMS; STOCHASTIC convergence; LINEAR programming; PROBLEM solving
- Publication
IAENG International Journal of Applied Mathematics, 2017, Vol 47, Issue 3, p276
- ISSN
1992-9978
- Publication type
Article