A Numerical Study on B&B Algorithms for Solving Sum-Of-Ratios Problem
The purpose of this paper is threefold; (1) Offer a synopsis of algorithmic review and to make a comparison between two branch-and-bound approaches for solving the sum-of-ratios problem; (2) Modify an promising algorithm for nonlinear sum-of-ratios problem; (3) Study the efficiency of the algorithms via numerical experiments.
KeywordsSum-of-ratios problem fractional programming branch-and-bound approach
Unable to display preview. Download preview PDF.
- [Ma01]Mastumi, T.: NP Hardness of Linear Multiplicative Programming And Related Problems. Journal of Information and Optimization Sciences 9, 113–119 (1996)Google Scholar