Mathematical Programming

, Volume 5, Issue 1, pp 54–72

A revised simplex method for linear multiple objective programs

  • J. P. Evans
  • R. E. Steuer


For linear multiple-objective problems, a necessary and sufficient condition for a point to be efficient is employed in the development of a revised simplex algorithm for the enumeration of the set of efficient extreme points. Five options within this algorithm were tested on a variety of problems. Results of these tests provide indications for effective use of the algorithm.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© The Mathematical Programming Society 1973

Authors and Affiliations

  • J. P. Evans
    • 1
  • R. E. Steuer
    • 2
  1. 1.University of North CarolinaChapel HillUSA
  2. 2.University of KentuckyLexingtonUSA

Personalised recommendations