A numerical study on B&B algorithms for solving sum-of-ratios problem

Authors:
Lianbo Gao;Jianming Shi
Affiliations:
Department of Computer Science and Systems Engineering, Muroran Institute of Technology;Department of Computer Science and Systems Engineering, Muroran Institute of Technology
Venue:
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Year:
2010

Citing 6
Cited 0

Minimization of the sum of three linear fractional functions

Journal of Global Optimization
A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems

Journal of Global Optimization
Solving the Sum-of-Ratios Problem by an Interior-Point Method

Journal of Global Optimization
A branch-and-bound algorithm for maximizing the sum of several linear ratios

Journal of Global Optimization
Using concave envelopes to globally solve the nonlinear sum of ratios problem

Journal of Global Optimization
A Unified Monotonic Approach to Generalized Linear Fractional Programming

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.