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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. Journal of Global Optimization 22, 343–364 (2002)
Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. Journal of Global Optimization 22, 155–174 (2002)
Craven, B.D.: Fractional Programming. Sigma Series in Applied Mathematics, vol. 4. Heldermann verlag, Berlin (1988)
Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. Journal of Global Optimization 19, 83–102 (2001)
Hoai Phuong, N.T., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. Journal of Global Optimization 26, 229–259 (2003)
Konno, H., Abe, N.: Minimization of the sum of three linear fractional functions. Journal of Global Optimization 15, 419–432 (1999)
Konno, H., Fukaishi, K.: A branch-and-bound algorithm for solving low rank linear multiplicative and fractional programming problems. Journal of Global Optimization 18, 283–299 (2000)
Konno, H., Yajima, Y., Matsui, T.: Parametric simplex algorithms for solving a special class of nonconvex minimization problems. Journal of Global Optimization 1, 65–81 (1991)
Konno, H., Yamashita, H.: Minimization of the sum and the product of several linear fractional functions. Naval Research Logistics 46, 583–596 (1999)
Muu, L.D., Tam, B.T., Schaible, S.: Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions. Journal of Global Optimization 6, 179–191 (1995)
Mastumi, T.: NP Hardness of Linear Multiplicative Programming And Related Problems. Journal of Information and Optimization Sciences 9, 113–119 (1996)
Schaible, S.: A note on the sum of a linear and linear-fractional function. Naval Research Logistics Quarterly 24, 691–693 (1977)
Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optimization Methods and Software 18, 219–229 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, L., Shi, J. (2010). A Numerical Study on B&B Algorithms for Solving Sum-Of-Ratios Problem. In: Kim, Th., Adeli, H. (eds) Advances in Computer Science and Information Technology. AST ACN 2010 2010. Lecture Notes in Computer Science, vol 6059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13577-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-13577-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13576-7
Online ISBN: 978-3-642-13577-4
eBook Packages: Computer ScienceComputer Science (R0)