Multiple Objective Linear Programming and the Tradeoff — Compromise Set

  • Conference paper
Multiple Criteria Decision Making Theory and Application

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 177))

Abstract

In this paper, we develop a method for finding all nondominated compromise solutions to a multiple objective linear program. We also develop an iterative technique that yields an interesting subset of the nondominated set termed the tradeoff — compromise set. This subset depends on the ideal vector and gives insight into what tradeoffs are possible amongst the objectives.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dinkelbach, W., “Uber einen Losungsatz zum Vektormaximumproblem,” Unternehmensforschung-Heute, Edited by M. Beckmann and H. P. Kunzi, Springer-Verlag, Berlin, Germany, pp. 1–13, 1971.

    Google Scholar 

  2. Dinkelbach, W., and Durr, W., “Effizienzaussagen bei Ersatzprogrammen zum Vektormaximumproblem,” Operations Research Verfabren, Edited by H. P. Kunzi and H. Shubert, Verlag Anton Hain, Meisenheim, Germany, pp. 117–123, 1972.

    Google Scholar 

  3. Dinkelbach, W., and Isermann, H., “On Decision Making under Multiple Criteria Decision Making, Edited by J. L. Cochrane and M. Zeleny, University of South Carolina Press, Columbia, South Carolina, pp. 302–312, 1973.

    Google Scholar 

  4. Freimer, M., and Yu, P. L., “Some New Results on Compromise Solutions for Group Decision Problems”, Management Science, Vol. 22, pp. 688–693, 1976.

    Article  Google Scholar 

  5. Gearhart, W. B., “Compromise Solutions and Estimation of the Noninferior Set”, Journal of Optimization Theory and Applications, Vol. 28, pp. 29–47, 1979.

    Article  Google Scholar 

  6. Yu, P. L., and Leitmann, G., “Compromise Solutions, Domination Structures, and Salukvadze’s Solution”, Journal of Optimization Theory and Applications, Vol. 13, pp. 362–378, 1974.

    Article  Google Scholar 

  7. Yu, P. L., “A Class of Solutions for Group Decision Problems”, Management Sciences, Vol. 19, pp. 936–946, 1973.

    Article  Google Scholar 

  8. Zeleny, M., “Compromise Programing”, Multiple Criteria Decision Making, Edited by J. L. Cochrane and M. Zeleny, University of South Carolina Press, Columbia, South Carolina, pp. 262–301, 1973.

    Google Scholar 

  9. Zeleny, M., “A Concept of Compromise Solutions and the Method of the Displaced Ideal”, Computers and Operations Research, Vol. 1, pp. 479–496, 1974.

    Article  Google Scholar 

  10. Zeleny, M., “The Theory of the Displaced Ideal,” Multiple Criteria Decision Making, Kyoto, 1975, Edited by M. Zeleny, Springer Verlag, New York, pp. 151–205, 1975.

    Google Scholar 

  11. Wagner, H. M., “Linear Programming Techniques for regression analysis”, J. Amer. Stat. Assoc, Vol. 54, pp. 206–212, 1959.

    Google Scholar 

  12. Hegner, Nancy Shoemaker, “Multiple Objective Linear Programming”, Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, NY, 1977.

    Google Scholar 

  13. Ecker, J. G., and Shoemaker, Nancy E., “Selecting Subsets from the Set of Efficient Vectors”, SIAM Journal of Control and Optimization, in preparation.

    Google Scholar 

  14. Gal, T., “A General Method for Determing the Set of all Efficient Solutions to a Linear Vectormaximum Problem”, European Journal of Operations Research, to appear.

    Google Scholar 

  15. Isermann, H., “The Enumeration of the Set of all Efficient Solution for a Linear Multiple Objective Program”, Operations Research Quarterly, Vol. 28, pp. 711–725, 1977.

    Article  Google Scholar 

  16. Ecker, J. G., Hegner, Nancy Shoemaker, and Kouada, I. A., “Generating All Maximal Efficient Faces for Multiple Objective Linear Programs”, JOTA, Vol. 30, No. 3, 1980.

    Google Scholar 

  17. Yu, P. L., and Zeleny, M., “The Set of all Nondominated Solutions in Linear Cases and a multicriteria simplex method”, J. Math. Analysis and Applications, Vol. 49, pp. 430–468, 1975.

    Article  Google Scholar 

  18. Isermann, H., “The Enumeration of the Set of all Efficient Solutions for a Linear Multiple Objective Program”, Report B7601, University of Saarland, D6600 Saarbrucker, March 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ecker, J.G., Shoemaker, N.E. (1980). Multiple Objective Linear Programming and the Tradeoff — Compromise Set. In: Fandel, G., Gal, T. (eds) Multiple Criteria Decision Making Theory and Application. Lecture Notes in Economics and Mathematical Systems, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48782-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48782-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09963-5

  • Online ISBN: 978-3-642-48782-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation