Skip to main content
SpringerLink
Log in

A revised simplex method for linear multiple objective programs

  • Published:
Mathematical Programming Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.J. Arrow, E.W. Barankin and D. Blackwell, “Admissible points of convex sets”, in:Contributions to the theory of games, Eds. H.W. Kuhn and A.W. Tucker (Princeton Univ. Press, Princeton, N.J., 1953) 87–91.

    Google Scholar 

  2. A. Charnes and W.W. Cooper,Management models and industrial applications of linear programming, Vol. 1 (Wiley, New York, 1961) 299–310.

    Google Scholar 

  3. A.M. Geoffrion, “Strictly concave parametric programming, Part I”,Management Science 13 (3) (1966) 244–253.

    Google Scholar 

  4. A.M. Geoffrion, “Proper efficiency and the theory of vector maximization”,Journal of Mathematical Analysis and Applications 22 (1968) 618–630.

    Google Scholar 

  5. S. Karlin,Mathematical methods and theory in games, programming and economics, Vol. I (Addison-Wesley, Reading, Mass., 1959) 216–218.

    Google Scholar 

  6. T. Koopmans, “Analysis of production as an efficient combination of activities”, in:Activity analysis of production and allocation, Cowles Commission Monograph Vol. 13, (Wiley, New York, 1951) 33–97.

    Google Scholar 

  7. H.W. Kuhn and A.W. Tucker, “Nonlinear programming”, in:Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability (University of California Press, Berkeley, Calif., 1950) 481–492.

    Google Scholar 

  8. O. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969) 27–35.

    Google Scholar 

  9. M. Markowitz, “The optimization of a quadratic function subject to linear constraints”,Naval Research Logistics Quarterly 3 (1, 2) (1956) 111–133.

    Google Scholar 

  10. J. Philip, “Algorithms for the vector maximization problem”,Mathematical Programming 2 (1972) 207–229.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of North Carolina, Chapel Hill, North Carolina, USA

    J. P. Evans

  2. University of Kentucky, Lexington, Kentucky, USA

    R. E. Steuer

Authors
  1. J. P. Evans
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. E. Steuer
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by the Office of Naval Research, Contract No. N00014-67-A-0321-0003 (NR047-095).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evans, J.P., Steuer, R.E. A revised simplex method for linear multiple objective programs. Mathematical Programming 5, 54–72 (1973). https://doi.org/10.1007/BF01580111

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580111

Keywords

Search

Navigation