Skip to main content

Vector-Maximum Gradient Cone Contraction Techniques

  • Conference paper
Multiple Criteria Problem Solving

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

Abstract

One of the keys to the successful application of vector-maximum methods involves reducing the gradient cone using interval criterion weights. In this paper, the gradient cone is defined to be the convex cone generated by the gradients of the different objectives. Methods are given for reducing the gradient cone to subsets of itself under different circumstances. These circumstances include fixed and/ or interval criterion weights and the effect of linear dependence among the original criterion gradients on results. Illustrative examples are provided and computational implications are discussed.

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

Access this chapter

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 shipping 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.

References

  1. Evans, J. P. and R. E. Steuer, “Generating Efficient Extreme Points in Linear Multiple Objective Programming: Two Algorithms and Computing Experience,” in Cochrane, J. L. and M. Zeleny (eds.), Multiple Criteria Decision Making, University of South Carolina Press, (1973), pp. 349–365.

    Google Scholar 

  2. Steuer, R. E., “Interval Criterion Weights Programming: A Portfolio Selection Example, Gradient Cone Modification, and Computational Experience,” Proceedings of Tenth Southeastern TIMS Meeting, (1974), pp. 246–255.

    Google Scholar 

  3. Steuer, R. E., “Multiple Objective Linear Programming with Interval Criterion Weights,” Management Science, Vol. 23, No. 3, (November, 1976), pp. 305–316.

    Article  Google Scholar 

  4. Steuer, R. E., “An Interactive Multiple Objective Linear Programming Procedure,” TIMS Studies in the Management Sciences, Vol. 6, (1977), pp. 225–239.

    Google Scholar 

  5. Steuer, R. E., “Operating Manual for the ADBASE/FILTER Computer Package for Solving Multiple Objective Linear Programming Problems,” (Release: 6/77), College of Business and Economics, University of Kentucky (1977).

    Google Scholar 

  6. Zeleny, M., “Multicriteria Simplex Method: A Fortran Routine,” in Zeleny, M. (ed.), Multiple Criteria Decision Making, Kyoto, 1975, Springer-Verlag: Heidelberg, (1975), pp. 323–345.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Steuer, R.E. (1978). Vector-Maximum Gradient Cone Contraction Techniques. In: Zionts, S. (eds) Multiple Criteria Problem Solving. Lecture Notes in Economics and Mathematical Systems, vol 155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46368-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46368-6_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08661-1

  • Online ISBN: 978-3-642-46368-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics