Skip to main content
Log in

Duality of a Nonconvex Sum of Ratios

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

Abstract

For mathematical programs with objective involving a sum of ratios of affine functions, there are few theoretical results due to the nonconvex nature of the program. In this paper, we derive a duality theory for these programs by establishing their connection with geometric programming. This connection allows one to bring to bear the powerful theory and computational algorithms associated with geometric programming.

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. Schaible, S., A Note on the Sum of a Linear and Linear-Fractional Function, Naval Research Logistics Quarterly, Vol. 24, pp. 691–693, 1977.

    Google Scholar 

  2. Craven, B. D., Fractional Programming, Sigma Series in Applied Mathematics, Heldermann Verlag, Berlin, Germany, Vol. 4, 1988.

    Google Scholar 

  3. Martein, L., Maximum of the Sum of a Linear Function and a Linear-Fractional Function, Rivista di Matematica per le Scienze Economiche e Sociali, Vol. 8, pp. 13–20, 1985 (in Italian).

    Google Scholar 

  4. Cambini, A., Martein, L., and Schaible, S., On Maximizing a Sum of Ratios, Journal of Information and Optimization Sciences, Vol. 10, pp. 65–79, 1989.

    Google Scholar 

  5. Schaible, S., Fractional Programming, Handbook of Global Optimization, Edited by R. Horst and P. M. Pardalos, Kluwer Academic Publishers, Dordrecht, Netherlands, pp. 495–608, 1995.

    Google Scholar 

  6. Schaible, S., Fractional Programming with Sums of Ratios, Proceedings of the Italian Workshop on Generalized Convexity, Edited by E. Castagnoli and G. Georgi, Milan, Italy, pp. 163–175, 1995.

  7. Duffin, R. J., Peterson, E. L., and Zener, C., Geometric Programming, Wiley, New York, New York, 1967.

    Google Scholar 

  8. Passy, U., and Wilde, D. J., Generalized Polynomial Optimization, SIAM Journal on Applied Mathematics, Vol. 15, pp. 1344–1356, 1967.

    Google Scholar 

  9. Duffin, R. J., and Peterson, E. L., Reversed Geometric Programs Treated by Harmonic Means, Indiana University Mathematics Journal, Vol. 22, pp. 531–550, 1972.

    Google Scholar 

  10. Duffin, R. J., and Peterson, E. L., Geometric Programming with Signomials, Journal of Optimization Theory and Applications, Vol. 11, pp. 3–35, 1973.

    Google Scholar 

  11. Avriel, M., Dembo, R., and Passy, U., Solution of Generalized Geometric Programs, International Journal of Numerical Methods in Engineering, Vol. 9, pp. 149–168, 1975.

    Google Scholar 

  12. Cole, F., Bochet, W., Van Assche, F., Ecker, J., and Smeers, Y., Reversed Geometric Programming: A Branch-and-Bound Method Involving Linear Subproblems, European Journal of Operations Research, Vol. 5, pp. 26–35, 1980.

    Google Scholar 

  13. Allueva, A., A New Algorithm in Signomial Programming, Trabajos de Investigación Operacional, Vol. 7, pp. 135–156, 1992.

    Google Scholar 

  14. Wilde, D. J., and Beightler, C. S., Foundations of Optimization, Prentice Hall, Englewood Cliffs, New Jersey, 1967.

    Google Scholar 

  15. Craven, B. D., Lagrangian Conditions and Quasiduality, Bulletin of the Australian Mathematical Society, Vol. 16, pp. 325–339, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scott, C.H., Jefferson, T.R. Duality of a Nonconvex Sum of Ratios. Journal of Optimization Theory and Applications 98, 151–159 (1998). https://doi.org/10.1023/A:1022693032053

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022693032053

Navigation