Journal of Global Optimization

, Volume 50, Issue 3, pp 439–455 | Cite as

Global optimization for the generalized polynomial sum of ratios problem



In this paper, a new deterministic global optimization algorithm is proposed for solving a fractional programming problem whose objective and constraint functions are all defined as the sum of generalized polynomial ratios, which arises in various practical problems. Due to its intrinsic difficulty, less work has been devoted to globally solving this problem. The proposed algorithm is based on reformulating the problem as a monotonic optimization problem, and it turns out that the optimal solution which is provided by the algorithm is adequately guaranteed to be feasible and to be close to the actual optimal solution. Convergence of the algorithm is shown and numerical examples are given to illustrate the feasibility and efficiency of the present algorithm.


Global optimization Generalized polynomial Fractional programming Sum of ratios Nonisolated optimal solution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Charnes A., Cooper W.W.: Programming with linear fractional functionals. Nav. Res. Logist. Q. 9, 181–186 (1962)CrossRefGoogle Scholar
  2. 2.
    Schaible S.: Fractional programming II, on Dinkelbach’s algorithm. Manag. Sci. 22, 868–873 (1976)CrossRefGoogle Scholar
  3. 3.
    Qu S., Zhang K., Wang F.: A global optimization using linear relaxation for generalized geometric programming. Eur. J. Oper. Res. 190, 345–356 (2008)CrossRefGoogle Scholar
  4. 4.
    Shen P., Wang C.: Global optimization for sum of linear ratios problem with coefficients. Appl. Math. Comput. 176, 219–229 (2006)CrossRefGoogle Scholar
  5. 5.
    Shen P., Ma Y., Chen Y.: A robust algorithm for generalized geometric programming. J. Glob. Optim. 41, 593–612 (2008)CrossRefGoogle Scholar
  6. 6.
    Shen P., Chen Y., Ma Y.: Solving sum of quadratic ratios fractional programming via monotonic function. Appl. Math. Comput. 103, 234–244 (2009)CrossRefGoogle Scholar
  7. 7.
    Jefferson T.R., Scott C.H.: Generalized geometric programming applied to problems of optimal control: I. theory. J. Optim. Theory Appl. 26, 117–129 (1978)CrossRefGoogle Scholar
  8. 8.
    Das K., Roy T.K., Maiti M.: Multi-item inventory model with under imprecise objective and restrictions: a geometric programming approach. Prod. Plan. Control 11(8), 781–788 (2000)CrossRefGoogle Scholar
  9. 9.
    Jae Chul C., Bricker L.D.: Effectiveness of a geometric programming algorithm for optimization of machining economics models. Comput. Oper. Res. 23(10), 957–961 (1996)CrossRefGoogle Scholar
  10. 10.
    Jagannathan R.: A stochastic geometric programming problem with multiplicative recourse. Oper. Res. Lett. 9, 99–104 (1990)CrossRefGoogle Scholar
  11. 11.
    Sönmez A.I., Baykasoglu A., Dereli T., Filiz I.H.: Dynamic optimization of multipass milling operations via geometric programming. Int. J. Mach. Tools Manuf. 39, 297–320 (1999)CrossRefGoogle Scholar
  12. 12.
    Scott C.H., Jefferson T.R.: Allocation of resources in project management. Int. J. Syst. Sci. 26, 413–420 (1995)CrossRefGoogle Scholar
  13. 13.
    Maranas C.D., Floudas C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351–369 (1997)CrossRefGoogle Scholar
  14. 14.
    Freund R.W., Jarre F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19, 83–102 (2001)CrossRefGoogle Scholar
  15. 15.
    Benson H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Glob. Optim. 22, 343–364 (2002)CrossRefGoogle Scholar
  16. 16.
    Chang C.-T.: On the polynomial fractional programming problem. Eur. J. Oper. Res. 143, 42–52 (2002)CrossRefGoogle Scholar
  17. 17.
    Benson H.P.: Global optimization algorithm for the nonlinear sum of ratios problem. J. Optim. Theory Appl. 112(1), 1–29 (2002)CrossRefGoogle Scholar
  18. 18.
    Wang Y., Zhang K.: Global optimization of nonlinear sum of ratios problem. Appl. Math. Comput. 158, 319–330 (2004)CrossRefGoogle Scholar
  19. 19.
    Shen P., Yuan G.: Global optimization for the sum of generalized polynomial fractional functions. Math. Methods Oper. Res. 65, 445–459 (2007)CrossRefGoogle Scholar
  20. 20.
    Pardalos P.M., Philips A.T.: Global optimization of fractional programming. J. Glob. Optim. 1, 173–182 (1991)CrossRefGoogle Scholar
  21. 21.
    Pardalos P.M., Romeijn E., Tuy H.: Recent developments and trends in global optimization. J. Comput. Appl. Math. 124(1–2), 209–228 (2000)CrossRefGoogle Scholar
  22. 22.
    Stancu-Minasian I.M.: Fractional Programming: Theory, Methods and Applications. Kluwer, Dordrecht (1997)Google Scholar
  23. 23.
    Schaible S., Shi J.: Fractional programming: the sum-of-ratios case. Optim. Methods Softw. 18, 219–229 (2003)CrossRefGoogle Scholar
  24. 24.
    Tuy H.: Robust solution of nonconvex global optimization problem. J. Glob. Optim. 32, 307–323 (2005)CrossRefGoogle Scholar
  25. 25.
    Tuy H.: Monotonic optimization: problems and solution approaches. SIAM J. Optim. 11(2), 464–494 (2000)CrossRefGoogle Scholar
  26. 26.
    Tuy H., Thach P.T., Konno H.: Optimization of polynomial fractional functions. J. Glob. Optim. 29, 19–44 (2004)CrossRefGoogle Scholar
  27. 27.
    Tuy H.: Polynomial optimization: a robust approach. Pac. J. Optim. 1, 357–374 (2005)Google Scholar
  28. 28.
    Tuy H., Hoai-Phuong N.T.: A robust algorithm for quadratic optimization under quadratic constraints. J. Glob. Optim. 37(4), 557–569 (2007)CrossRefGoogle Scholar
  29. 29.
    Nataray P.S.V., Kotecha K.: Global optimization with higher order inclusion function forms, part 1: a combined Taylor-Bernstein form. Reliab. Comput. 1, 27–44 (2004)CrossRefGoogle Scholar
  30. 30.
    Berz M., Hoffstatter G.: Computation and application of Taylor polynomials with interval remainder bounds. Reliab. Comput. 4, 83–97 (1998)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC. 2010

Authors and Affiliations

  1. 1.College of Mathematics and Information ScienceHenan Normal UniversityXinxiangPeople’s Republic of China

Personalised recommendations