Advertisement

Linear Multiple Objective Programming

  • Roger Hartley
Part of the International Centre for Mechanical Sciences book series (CISM, volume 289)

Abstract

Multiple objective optimisation has undergone considerable development in recent years and several approaches have been investigated. One of the closest to single objective optimisation is vector optimisation, in which efficient (non-dominated, admissible, Pareto optimal) solutions are sought. Since linear programming exhibits a particularly complete body of theory, we might expect the same to be true of vector linear programming and in this lecture we will describe some aspects of this theory.

Keywords

Convex Cone Simplex Method Single Objective Optimisation Efficient Point Single Objective Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hartley, R. On cone-efficiency, cone-convexity, and cone compactness, SIAM,J,App4,Maths. 34 (1978), 211–222Google Scholar
  2. 2.
    Stoer, J. and Witzgall, C. Convexity and Optimisation in Finite Dimensions,Springer, Berlin 1970Google Scholar
  3. 3.
    Hartley, R. Linear and Nonlinear Programming, Ellis Horwood, Chichester, England, to appear (1985)Google Scholar
  4. 4.
    Hogan, W. W. Point-to-set-maps in mathematical programming, SIAM Review, 15 (1973) 591–603.CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Hartley, R. and Riistichini, A. Stability in Multicriteria Linear Programming,Preprint, University of Manchester.Google Scholar
  6. 6.
    Philip, J. Algorithms for the vector maximum problem, Math,Prog,,2 (1979) 207–229Google Scholar
  7. 7.
    Bitran, G. R. and Magnanti, T. L,, Duality based Characterisation of Efficient Facets,MIT Prepring (1979)Google Scholar
  8. 8.
    Ecker, J. E. Hegner, N. S. and Kouada, I.A. Generating all maximal efficient faces for multiple objective linear programs, J, O.T0A., 30 (1980), 353–381Google Scholar
  9. 9.
    Isermann, H. The Enumeration of the set of all efficient solutions for a linear multiple objective program, O.R, Q,, 28 (1977), 711–725.Google Scholar
  10. 10.
    Evans, J. P. and Steuer, R. E. A revised simplex method for linear multiple objective programs, Math, Prog. 5, (1973) 54–72.CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Ecker, J. E. and Kouada, I.A. Finding all efficient extreme points for multiple objective linear programs, Math,Prog,14 (1978) 249–261Google Scholar
  12. 12.
    Yu, P. L. and Zeleny, M. The set of all non-dominated solutions in linear cases and a multi-criteria simplex method, J.Math,And.Appl. 49 (1975), 430–468Google Scholar
  13. 13.
    Ecker, J. E. and Kouada, I.A. Finding efficient points for linear multiple objective programs, Math.Prog. 8, (1975) 375–377.Google Scholar
  14. 14.
    Ecker, J. E. and Jegner, Nancy S., On computing an initial efficient extreme point, J,,O,R, S, 31 (1980), 591–594Google Scholar

Copyright information

© Springer-Verlag Wien 1985

Authors and Affiliations

  • Roger Hartley
    • 1
  1. 1.Department of Decision TheoryUniversity of ManchesterUK

Personalised recommendations