Skip to main content
Log in

Optimization of Polynomial Fractional Functions

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A new approach is proposed for optimizing a polynomial fractional function under polynomial constraints, or more generally, a synomial fractional function under synomial constraints. The approach is based on reformulating the problem as the optimization of an increasing function under monotonic constraints.

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. Dinkelbach, W. (1967), On nonlinear fractional programming, Management Science, 9, 16–24.

    Google Scholar 

  2. Duong, P.C. (1987), Finding the global extremum of a polynomial function. In: Essays on Nonlinear Analysis and Optimization Problems, Institute of Mathematics, Hanoi, pp. 111–120.

    Google Scholar 

  3. Floudas, C.A. et al. (1999), Handbook of Test Problems in Local and Global Optimization, Kluwer.

  4. Ibaraki, T. (1981), Solving mathematical programming problems with fractional objective functions, In: Schaible, S. and Ziemba, W.T. (eds.), Generalized Concavity in Optimization and Economics, Academic Press, pp. 441–472.

  5. Konno, H. and Fukaisi, K. (2000), A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems, Journal of Global Optimization, 18, 283–299.

    Article  Google Scholar 

  6. Konno, H., Thach, P.T. and Tuy, H. (1997), Optimization on Low Rank Nonconvex Structures, Kluwer.

  7. Gotoh, J.Y. and Konno, H. (1999), Maximization of the ratio of two convex quadratic functions over a polytope, Preprint, Dept of Industrial Engineering and Management, Tokyo Institute of Technology, Tokyo.

    Google Scholar 

  8. Hoai-Phuong, Ng.T. and Tuy, H. (2000), A unified monotonic approach to generalized linear fractional programming, Preprint, Hanoi Institute of Mathematics, Hanoi.

    Google Scholar 

  9. Horst, R. and Tuy, H. (1996), Global Optimization, Deterministic Approaches, third edition, Springer.

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

    Google Scholar 

  11. Konno, H., Thach, P.T. and Tuy, H. (1997), Optimization on Low Rank Nonconvex Structures, Kluwer.

  12. Kuno, T. (1997), A variant of the outer approximation method for globally minimizing a class of composite functions, Journal of the Operations Research Society of Japan, 40, 245–260.

    Google Scholar 

  13. Lasserre, J. (2001), Global optimization with polynomials and the problem of moments, SIAM J. on Optimization, 11, 796–817.

    Article  Google Scholar 

  14. Lasserre, J. (2002), Semidefinite programming vs. LP relaxations for polynomial programming, Mathematics of Operations Research, 27, 347–360.

    Article  Google Scholar 

  15. Rubinov, A., Tuy, H. and Mays, H. (2001), An algorithm for monotonic global optimization problems, Optimization, 49, 205–222.

    Google Scholar 

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

  17. Sherali, H. and Tuncbilek, C.H. (1992), A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, Journal of Global Optimization, 2, 101–112.

    Article  Google Scholar 

  18. Sherali, H. and Tuncbilek, C.H. (1997), New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Operations Research Letters, 21, 1–9.

    Article  Google Scholar 

  19. Sherali, H. (1998), Global optimization of nonconvex polynomial programming problems having rational exponents, Journal of Global Optim.

  20. Shi, J. (1999), Global Optimization for Fractional Programming, Preprint, School of Management, Science University of Tokyo.

  21. Shor, N.Z. (1998), Nondifferentiable Optimization and Polynomial Problems, Kluwer.

  22. Stancu-Minasian, I.M. (1997), Fractional Programming: Theory, Methods and Applications (Mathematics and Its Applications), Kluwer.

  23. Tuy, H. (1998), Convex Analysis and Global Optimization, Kluwer.

  24. Tuy, H. (1997), Normal sets, polyblocks and monotonic optimization, Vietnam Journal of Mathematics, Springer Verlag, 27(4), 277–300.

    Google Scholar 

  25. Tuy, H. (2000), Monotonic Optimization: Problems and Solution Approaches, SIAM Journal on Optimization, 11(2), 464–494.

    Article  Google Scholar 

  26. Tuy, H. (2001), Polyblock Algorithms Revisited, preprint 2001/40, Institute of Mathematics, Hanoi.

    Google Scholar 

  27. Tuy, H. and Luc, L.T. (2000), A new approach to optimization under monotonic constraint, Journal of Global Optimization, in press.

  28. Wingo, D.R. (1985), Globally minimizing polynomials without evaluating derivatives, Intl J. Comput. Math., 17(287).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tuy, H., Thach, P.T. & Konno, H. Optimization of Polynomial Fractional Functions. Journal of Global Optimization 29, 19–44 (2004). https://doi.org/10.1023/B:JOGO.0000035016.74398.e6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOGO.0000035016.74398.e6

Navigation