Skip to main content
SpringerLink
Log in

An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This paper is concerned with a problem of maximizing the sum of several ratios of functions. We extend an algorithm, which has been designed to solve the sum-of-linear-ratios problem, for solving the sum-of-nonlinear-ratios problem. We also discuss the complexity of the problem and report the results of numerical experiments on the extended algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Benson H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Glob. Optim. 22, 343–364 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dai Y., Shi J., Wang S.Y.: Conical partition algorithm for maximizing the sum of dc ratios. J. Glob. Optim. 31, 253–270 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dur M., Horst R., Thoai N.V.: Solving sum-of-ratios fractional programs using efficient points. Optimization 49, 447–466 (2001)

    Article  MathSciNet  Google Scholar 

  4. Freund R.W., Jarre F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19, 83–102 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Horst R., Tuy H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)

    MATH  Google Scholar 

  6. Karpenko O., Shi J., Dai Y.: Prediction of MHC class II binders using the ant colony search strategy. Artif. Intell. Med. 35, 147–156 (2005)

    Article  Google Scholar 

  7. Konno H., Abe N.: Minimization of the sum of three linear fractional functions. J. Glob. Optim. 15, 419–432 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Konno H., Fukaishi K.: A branch-and-bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Glob. Optim. 18, 283–299 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Konno H., Yajima Y., Matsui T.: Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Glob. Optim. 1, 65–81 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Konno H., Yamashita H.: Minimization of the sum and the product of several linear fractional functions. Nav. Res. Logist. 46, 583–596 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kuno T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22, 155–174 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Matsui T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9, 113–119 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  13. Muu L.D., Tam B.T., Schaible S.: Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions. J. Glob. Optim. 6, 179–191 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pardalos P.M., Phillips A.: Global optimization of fractional programs. J. Glob. Optim. 1, 173–182 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  15. Phuong N.T.H., Tuy H.: A unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26, 229–259 (2003)

    Article  MATH  Google Scholar 

  16. Prokopyev O.A., Huang H.-X., Pardalos P.M.: On complexity of unconstrained hyperbolic 0–1 programming problems. Oper. Res. Lett. 33, 312–318 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Schaible S.: A note on the sum of a linear and linear-fractional function. Nav. Res. Logist. Q. 24, 691–693 (1977)

    Article  MATH  Google Scholar 

  18. Schaible S., Shi J.: Fractional programming: the sum-of-ratios case. Optim. Methods Softw. 18, 219–229 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Schaible, S., Shi, J.: Recent developments in fractional programming: single-ratio and max- min case. In: Nonlinear Analysis and Convex Analysis, pp. 493–506. Yokohama Publishers, Yokohama (2004)

  20. Shi J.: A combined algorithm for fractional programming. Ann. Oper. Res. 103, 135–147 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  21. Stancu-Minasian I.M.: Fractional Programming. Kluwer Academic Publishers, Dordrecht (1997)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information and Electronic Engineering, Muroran Institute of Technology, Muroran, Japan

    Lianbo Gao & Jianming Shi

  2. Department of Mathematics, Banaras Hindu University, Varanasi, India

    Shashi K. Mishra

Authors
  1. Lianbo Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shashi K. Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianming Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianming Shi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, L., Mishra, S.K. & Shi, J. An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem. Optim Lett 6, 221–230 (2012). https://doi.org/10.1007/s11590-010-0232-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0232-8

Keywords

Search

Navigation