Skip to main content
SpringerLink
Log in

Generic Algorithm for Generalized Fractional Programming

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We propose a unified framework to study various versions of Dinkelbach-type algorithms for solving the generalized fractional programming problem. Classical algorithms used carefully selected iterate points and incorporated subtle convergence proofs. Our generic algorithm, however, is natural and simple. Moreover, the convergence analysis can be carried out through geometric observations and fundamental properties of convex functions. Consequently, the classical results are either refined or strengthened with new insights.

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. von Neumann, J.: A model of general economic equilibrium. Rev. Econ. Stud. 13, 1–9 (1945)

    Article  Google Scholar 

  2. Almogy, Y., Levin, O.: A class of fractional programming problems. Oper. Res. 19, 57–67 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  3. Colantoni, C.S., Manes, R.P., Whinston, A.: Programming, profit rates, and pricing decisions. Account. Rev. 44, 467–481 (1969)

    Google Scholar 

  4. Floudas, C.A., Pardalos, P.M.: Recent Advances in Global Optimization. Princeton University Press, Princeton (1992)

    Google Scholar 

  5. Kanchan, P.K., Holland, A.S.B., Sahney, B.N.: Transportation techniques in linear-plus-fractional programming. Cah. Cent. Étud. Rech. Opér. 23(2), 153–157 (1981)

    MATH  MathSciNet  Google Scholar 

  6. Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143–158 (1989)

    MATH  MathSciNet  Google Scholar 

  7. Konno, H., Watanabe, H.: Bond portfolio optimization problems and their application to index tracking: a partial optimization approach. J. Oper. Res. Soc. Jpn. 39, 295–306 (1996)

    MATH  MathSciNet  Google Scholar 

  8. Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 495–608. Kluwer Academic, Dordrecht (1995)

    Google Scholar 

  9. Stancu-Minasian, I.M.: Applications of the fractional programming. Econ. Comput. Econ. Cybern. Stud. Res. 1, 69–86 (1980)

    MathSciNet  Google Scholar 

  10. Crouzeix, J.P., Ferland, J.A., Schaible, S.: An algorithm for generalized fractional programs. J. Optim. Theory Appl. 47(1), 35–49 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bernard, J.C., Ferland, J.A.: Convergence of interval-type algorithms for generalized fractional programming. Math. Program. A 43(3), 349–363 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Barros, A.I., Frenk, J.B.G., Schaible, S., Zhang, S.: A new algorithm for generalized fractional programs. Math. Program. A 72(2), 147–175 (1996)

    Article  MathSciNet  Google Scholar 

  13. Crouzeix, J.P., Ferland, J.A.: Algorithms for generalized fractional programming. Math. Program. 52B(2), 191–207 (1991)

    Article  MathSciNet  Google Scholar 

  14. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  15. Ferland, J.A., Potvin, J.Y.: Generalized fractional programming: algorithms and numerical experimentation. Eur. J. Oper. Res. 20(1), 92–101 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  16. Sion, M.: On general minimax theorems. Pac. J. Math. 8, 171–176 (1958)

    MATH  MathSciNet  Google Scholar 

  17. Dem’yanov, V.F., Malozemov, V.N.: Introduction to Minimax. Wiley, New York (1974)

    Google Scholar 

  18. Ben-Tal, A., Teboulle, M.: A smoothing technique for nondifferentiable optimization problems. In: Morel, J.M., Takens, F., Teissier, B. (eds.) Optimization, Varetz, 1988. Lecture Notes in Mathematics, vol. 1405, pp. 1–11. Springer, Berlin (1989)

    Chapter  Google Scholar 

  19. Bertsekas, D.P.: Approximation procedures based on the method of multipliers. J. Optim. Theory Appl. 23, 487–510 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sheu, R.L., Lin, J.Y.: Solving continuous min-max problems by an iterative entropic regularization method. J. Optim. Theory Appl. 121(3), 597–612 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Lin, J.Y., Sheu, R.L.: Modified Dinkelbach-type algorithm for generalized fractional programs with infinitely many ratios. J. Optim. Theory Appl. 126(2), 323–343 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National Cheng Kung University, Tainan, Taiwan

    H. J. Chen & R. L. Sheu

  2. A.G. Anderson Graduate School of Management, University of California, Riverside, CA, USA

    S. Schaible

  3. Department of Applied Mathematics, Chung Yuan Christian University, Chung-Li, 32023, Taiwan

    S. Schaible

Authors
  1. H. J. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Schaible
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. L. Sheu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Schaible.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H.J., Schaible, S. & Sheu, R.L. Generic Algorithm for Generalized Fractional Programming. J Optim Theory Appl 141, 93–105 (2009). https://doi.org/10.1007/s10957-008-9499-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-008-9499-7

Keywords

Search

Navigation