Skip to main content

An Interior Multiobjective Linear Programming Algorithm Using Aspirations

  • Conference paper
Multiple Criteria Decision Making

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

  • 1208 Accesses

Abstract

We describe in this paper a new multiple objective linear programming (MOLP) algorithm that is based on the single-objective path-following primal-dual linear programming algorithm, and combines it with aspiration levels and the use of achievement scalarizing functions.

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. Arbel, A., “An Interior Multiobjective Linear Programming Algorithm,” Computers and Operations Research, Vol. 20, No. 7, 1993, pp. 723–735.

    Article  Google Scholar 

  2. Arbel, A., “Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming Problems,” Journal of the Operational Research Society, Vol. 45, No. 1, January 1994, pp. 83–96.

    Google Scholar 

  3. Arbel, A., Exploring Interior Point Linear Programming: Algorithms and Software, MIT Press, Cambridge, MA, 1993.

    Google Scholar 

  4. Arbel, A., and S.S. Oren, “Generating Interior Search Directions for Multiobjective Linear Programming,”, Journal of Multicriteria Decision Analysis, Vol. 2, No. 2, August 1993, pp. 73–86.

    Article  Google Scholar 

  5. Geoffrion, A.M. J.S. Dyer, and A. Feinberg, “An interactive Approach for Multi-Criterion Optimization, with an Application to the Operations of an Academic Department,” Management Science, Vol. 19, No. 4, 1972, pp. 357–368.

    Article  Google Scholar 

  6. Halme, M. and P. Korhonen, “Nondominated Tradeoffs and Termination in Interactive Multiple Objective Linear Programming”, in Lockett, A.G. and Islei, G. (Eds.): Improving Decision Making in Organizations, Springer-Verlag, pp. 410–423, 1989.

    Google Scholar 

  7. Karmarkar, N.K., “A New Polynomial Time Algorithm for Linear Programming,” Combinatorica, Vol. 4, pp. 373–395, 1984.

    Article  Google Scholar 

  8. Kojima, M., Mizuno, S., and Yoshise, A., “A Primal-Dual Interior Point Algorithm for Linear Programming,” Progress in Mathematical Programming, Interior-Point and Related Methods, N. Megiddo (ed.), Springer-Verlag, pp. 29–48, 1989.

    Google Scholar 

  9. Korhonen, P. and Laakso, J., (1986), “A Visual Interactive Method for Solving the Multiple Criteria Problem,”, European Journal of Operational Research, Vol. 24, pp. 277–287.

    Article  Google Scholar 

  10. Korhonen, P. and Wallenius, J., (1988), “A Pareto Race,” Naval Research Logistics, Vol. 35, pp. 615–623.

    Article  Google Scholar 

  11. Korhonen, P. and Wallenius, J., (1990), “A Multiple Objective Linear Programming Decision Support System,” Decision Support Systems, Vol. 6, pp. 243–251.

    Article  Google Scholar 

  12. Kranich, E., 1991, “Interior Point Methods for Mathematical Programming: A Bibliography,” Discussion Paper, No. 171, May 1991, Institute of Economy and Operations Research, FernUniversität Hagen, P.O. Box 940, D-58084, Hagen 1, Germany. To get a copy via E-mail, send a message to: netlib@research.att.com, with the message: send index from bib.

    Google Scholar 

  13. McShane, K.A., Monma, C.L., and Shanno, D.F., “An Implementation of a Primal-Dual Interior Point Method for Linear Programming,” ORSA Journal on Computing, Vol. 1, No. 2, pp. 70–83, 1989.

    Article  Google Scholar 

  14. Megiddo, N., Progress in Mathematical Programming: Interior-Point and Related Methods, Springer-Verlag, Berlin, 1989.

    Google Scholar 

  15. Steuer, R.E., Multiple Criteria Optimization: Theory, Computation, and Application, Wiley, New York, 1986.

    Google Scholar 

  16. Wierzbicki, A., (1980), “The Use of Reference Objectives in Multiobjective Optimization,” in Multiple Criteria Decision Making, Theory and Application, G. Fandel and T. Gal, (Eds.), Springer-Verlag, Berlin, pp. 468–486.

    Chapter  Google Scholar 

  17. Wierzbicki, A., (1986), “On the Completeness and Constructiveness of Parametric Characterizations to Vector Optimization Problems,” OR-Spektrum Vol. 8, pp. 73–87.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arbel, A., Korhonen, P. (1997). An Interior Multiobjective Linear Programming Algorithm Using Aspirations. In: Fandel, G., Gal, T. (eds) Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol 448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59132-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59132-7_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62097-6

  • Online ISBN: 978-3-642-59132-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics