Advertisement

Journal of Global Optimization

, Volume 1, Issue 2, pp 173–182 | Cite as

Global optimization of fractional programs

  • P. M. Pardalos
  • A. T. Phillips
Article

Abstract

Dinkelbach's global optimization approach for finding the global maximum of the fractional programming problem is discussed. Based on this idea, a modified algorithm is presented which provides both upper and lower bounds at each iteration. The convergence of the lower and upper bounds to the global maximum function value is shown to be superlinear. In addition, the special case of fractional programming when the ratio involves only linear or quadratic terms is considered. In this case, the algorithm is guaranteed to find the global maximum to within any specified tolerance, regardless of the definiteness of the quadratic form.

Key words

Global optimization fractional programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avriel, M., W. E.Diewert, S.Schaible, and I.Zang (1988), Generalized Concavity, New York: Plenum Press.Google Scholar
  2. Dinkelbach, W. (1967), On Nonlinear Fractional Programming, Management Science 13(7): 492–498.Google Scholar
  3. Grunspan, M. (1971), Fractional Programming: A Survey, Technical Report 50, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.Google Scholar
  4. Ibaraki, T. (1983), Parametric Approaches to Fractional Programs, Mathematical Programming 26: 345–362.Google Scholar
  5. Isbell, J. R. and W. H.Marlow (1956), Attrition Games, Naval Research Logistics Quarterly 3: 71–93.Google Scholar
  6. Pardalos, P. M. (1986), An Algorithm for a Class of Nonlinear Fractional Problems Using Ranking of the Vertices, BIT 26: 392–395.Google Scholar
  7. Phillips, A. T. and J. B.Rosen (1990a), Guaranteed ε-Approximate Solution for Indefinite Quadratic Global Minimization, Naval Research Logistics 37: 499–514.Google Scholar
  8. Phillips, A. T. and J. B.Rosen (1990b), A Parallel Algorithm for Partially Separable Non-convex Global Minimization, Annals of Operations Research 25: 101–118.Google Scholar
  9. Schaible, S. (1973), Fractional Programming: Transformations, Duality, and Algorithmic Aspects, Technical Report 73–9, Department of Operations Research, Stanford University, Stanford, CA.Google Scholar
  10. Schaible, S. (1976a), Fractional Programming I, Duality, Management Science 22(8): 858–867.Google Scholar
  11. Schaible, S. (1976b), Fractional Programming II, On Dinkelbach's Algorithm, Management Science 22(8); 868–873.Google Scholar
  12. Schaible, S. (1981), Fractional Programming: Applications and Algorithms, European Journal of Operational Research 7: 111–120.Google Scholar
  13. Schaible, S. and T.Ibaraki (1983), Fractional Programming, European Journal of Operational Research 12: 325–338.Google Scholar

Copyright information

© Kluwer Academic Publishers 1991

Authors and Affiliations

  • P. M. Pardalos
    • 1
  • A. T. Phillips
    • 2
  1. 1.Computer Science DepartmentThe Pennsylvania State UniversityUniversity ParkU.S.A.
  2. 2.Computer Science DepartmentUnited States Naval AcademyAnnapolisU.S.A.

Personalised recommendations