Skip to main content
Log in

An Exact Method for Fractional Goal Programming

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

Abstract

Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus optimal solutions can be obtained by using existing Global Optimization techniques. However, only heuristic procedures are suggested in the literature on the field. In this note we explore the practical applicability of a recent algorithm for nonconvex quadratic programming with quadratic constraints for this problem. Encouraging computational experiences for randomly generated instances with up to 14 fractional objectives are presented.

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. Audet, C., Hansen, P., Jaumard, B. and Savard, G. (2000), A branch and cut algorithm for nonconvex quadratically constrained quadratic programming, Mathematical Programming, A87, 131–152.

    Google Scholar 

  2. Carrizosa, E. and Plastria, F. (2000), Dominators for multiple-objective quasiconvex maximization problems, Journals of Global Optimization, 18, 35–58.

    Article  Google Scholar 

  3. Charnes, A. and Cooper, W.W. (1962), Programming with linear fractional functionals, Naval Research Logistics Quarterly, 9, 181–186.

    Google Scholar 

  4. Duffin, R.J., Peterson, E.L. and Zener, C. (1967), Geometric Programming, Wiley, New-York.

    Google Scholar 

  5. Hansen, P. and Jaumard, B. (1992), Reduction of indefinite quadratic programs to bilinear programs, Journal of Global Optimization, 2(1), 41–60.

    Article  Google Scholar 

  6. Kornbluth, J.S.H. (1973), A survey of goal programming, Omega, 1, 193–205.

    Article  Google Scholar 

  7. Kornbluth, J.S.H. (1986), On the use of multiple objective linear programming algorithms to solve problems with fractional objectives, European Journal of Operational Research, 23, 78–81.

    Article  Google Scholar 

  8. Kornbluth, J.S.H. and Steuer, E.R. (1981), Goal programming with linear fractional criteria, European Journal of Operational Research, 8, 58–65.

    Article  Google Scholar 

  9. Lee, S.M. and Olson, D.L. (1985), A gradient algorithm for chance constrained non-linear goal programming, European Journal of Operational Research, 22, 359–369.

    Article  Google Scholar 

  10. Plastria, F. and Carrizosa, E. (2001), Gauge distances and median hyperplanes, Journal of Optimization Theory and Applications, 110, 173–182.

    Article  Google Scholar 

  11. Romero, C. (1991), Hidden nonlinearities in linear goal programming models, Handbook of Critical Issues of Goal Programming, Pergamon, Oxford.

    Google Scholar 

  12. Tamiz, M., Jones, D.J. and Romero, C. (1998), Goal programming for decision making: An overview of the current state-of-the-art, European Journal of Operational Research, 111, 569–581.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Audet, C., Carrizosa, E. & Hansen, P. An Exact Method for Fractional Goal Programming. Journal of Global Optimization 29, 113–120 (2004). https://doi.org/10.1023/B:JOGO.0000035028.40292.36

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOGO.0000035028.40292.36

Navigation