Skip to main content
Log in

Algorithms for generalized fractional programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

A generalized fractional programming problem is specified as a nonlinear program where a nonlinear function defined as the maximum over several ratios of functions is to be minimized on a feasible domain of ℝn. The purpose of this paper is to outline basic approaches and basic types of algorithms available to deal with this problem and to review their convergence analysis. The conclusion includes results and comments on the numerical efficiency of these algorithms.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. I. Barrodale, M.J.D. Powell and F.D.K. Roberts, “The differential correction algorithm for rationall∞ approximation,”SIAM Journal Numerical analysis 9 (1972) 493–504.

    Google Scholar 

  2. Y. Benadada, “Approches de résolution du problème de programmation fractionnaire généralisée,” Ph.D. Thesis, Département d'informatique et de recherche opérationnelle, Université de Montréal (Montréal, Canada, 1989).

    Google Scholar 

  3. Y. Benadada and J.A. Ferland, “Partial linearization for generalized fractional programming,”Zeitschrift für Operations Research 32 (1988) 101–106.

    Google Scholar 

  4. J.C. Bernard and J.A. Ferland, “Convergence of interval-type algorithms for generalized fractional programming,”Mathematical Programming 43 (1989) 349–364.

    Google Scholar 

  5. J. Borde and J.P. Crouzeix, “Convergence of a Dinkelbach-type algorithm in generalized fractional programming,”Zeitschrift für Operations Research 31 (1987) A31-A54.

    Google Scholar 

  6. E.W. Cheney and H.L. Loeb, “Two new algorithms for rational approximation,”Numerische Mathematik 3 (1961) 72–75.

    Google Scholar 

  7. J.P. Crouzeix, J.A. Ferland and S. Schaible, “A note on an algorithm for generalized fractional programs,”Journal of Optimization Theory and Applications 50 (1986) 183–187.

    Google Scholar 

  8. J.P. Crouzeix, J.A. Ferland and S. Schaible, “An algorithm for generalized fractional programs,”Journal of Optimization Theory and Applications 47 (1985) 35–49.

    Google Scholar 

  9. J.P. Crouzeix, J.A. Ferland and S. Schaible, “Duality in generalized linear fractional programming,”Mathematical Programming 27 (1983) 342–354.

    Google Scholar 

  10. W. Dinkelbach, “On non-linear fractional programming,”Management Science 13 (1967) 492–498.

    Google Scholar 

  11. J.A. Ferland and J.Y. Potvin, “Generalized fractional programming: algorithms, and numerical experimentation,”European Journal of Operational Research 20 (1985) 92–101.

    Google Scholar 

  12. A.V. Fiacco, “Sensitivity analysis for nonlinear programming using penalty methods,”Mathematical Programming 10 (1976) 287–311.

    Google Scholar 

  13. J. Flachs, “Generalized Cheney—Loeb—Dinkelbach-type algorithms,”Mathematics of Operations Research 10 (1985) 674–687.

    Google Scholar 

  14. T. Ibaraki, “Parametric approaches to fractional programs,”Mathematical Programming 26 (1983) 345–362.

    Google Scholar 

  15. R. Jagannathan, “An algorithm for a class of nonconvex programming problems with nonlinear fractional objectives,”Management Science 31 (1985) 847–851.

    Google Scholar 

  16. R. Jagannathan and S. Schaible, “Duality in generalized fractional programming via Farkas' Lemma,”Journal of Optimization Theory and Applications 41 (1983) 417–424.

    Google Scholar 

  17. S.M. Robinson, “A linearization technique for solving the irreducible Von Neumann economic model,” in: J. Los, ed.,Proceedings of the conference on Von Neumann model (Polish Scientific Publishers (PWN), Warsaw, 1972) pp. 139–150. Also appeared as Technical Summary Report No 1290, Mathematics Research Center, Wisconsin University (Madison, WI, 1972).

    Google Scholar 

  18. S. Schaible, “Multiratio fractional programming — a survey,” in: A. Kurzhanski, K. Neumann and D. Pallaschke, eds.,Optimization, Parallel Processing and Applications, Lecture Notes in Economics and Mathematical Systems No. 304 (Springer, Berlin—Heidelberg, 1988) pp. 57–66.

    Google Scholar 

  19. S. Schaible, “Bibliography in fractional programming,”Zeitschrift für Operations Research 26 (1982) 211–241.

    Google Scholar 

  20. S. Schaible, “A survey of fractional programming,” in: S. Schaible and W.T. Ziemba, eds.,Generalized Concavity in Optimization and Economics (Academic Press, New York, 1981) pp. 417–440.

    Google Scholar 

  21. S. Schaible, “Fractional programming, II: on Dinkelbach's algorithm,”Management Science 22 (1976) 868–873.

    Google Scholar 

  22. M. Sniedovich, “Fractional programming revisited,”European Journal of Operational Research 33 (1988) 334–341.

    Google Scholar 

  23. J. Von Neumann, “A model of general economic equilibrium,”Review of Economic Studies 13 (1945) 1–9.

    Google Scholar 

  24. H. Wolf, “A parametric method for solving the linear fractional programming problem,”Operations Research 33 (1985) 835–841.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crouzeix, JP., Ferland, J.A. Algorithms for generalized fractional programming. Mathematical Programming 52, 191–207 (1991). https://doi.org/10.1007/BF01582887

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582887

Keywords

Navigation