Skip to main content
Log in

An efficient method for solving linear goal programming problems

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

Abstract

This note proposes a solution algorithm for linear goal programming problems. The proposed method simplifies the traditional solution methods. Also, the proposed method is computationally efficient.

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. Charnes, A., andCooper, W.,Management Models and Industrial Applications of Linear Programming, Vol. 1, Wiley, New York, New York, 1961.

    Google Scholar 

  2. Lee, S.,Goal Programming for Decision Analysis, Auerbach, Philadelphia, Pennsylvania, 1972.

    Google Scholar 

  3. Ignizio, J.,Introduction to Linear Goal Programming, Sage, Beverly Hills, California, 1985.

    Google Scholar 

  4. Romero, C.,Handbook of Critical Issues in Goal Programming, Pergamon, Oxford, England, 1990.

    Google Scholar 

  5. Winston, W.,Operations Research: Applications and Algorithms, PWS-Kent, Boston, Massachusetts, 1987.

    Google Scholar 

  6. Hiller, F., andLieverman, G.,Introduction to Operations Research, McGraw-Hill, New York, New York, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. L. Yu

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, H.L. An efficient method for solving linear goal programming problems. J Optim Theory Appl 90, 465–469 (1996). https://doi.org/10.1007/BF02190009

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02190009

Key Words

Navigation