Skip to main content
SpringerLink
Log in

Finding efficient points for linear multiple objective programs

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

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

References

  1. K.J. Arrow, E.W. Barankin and D. Blackwell, “Admissible points of convex sets”, in: H.W. Kuhn and A.W. Tucker, eds.,Contributions to the theory of games (Princeton University Press, Princeton, N.J., 1953) pp. 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. J.P. Evans and R.E. Steuer, “A revised simplex method for linear multiple objective programs”,Mathematical Programming 5 (1973) 54–72.

    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. H. Isermann, “Proper efficiency and the linear vector maximization problem”,Operations Research 22 (1974) 189–191.

    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) pp. 33–97.

    Google Scholar 

  7. H.W. Kuhn and A.W. Tucker, “Nonlinear programming”, in: J. Neyman, ed.,Proceedings of the second Berkeley symposium on mathematical statistics and probability (University of California Press, Berkeley, Calif., 1951) pp. 481–492.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rensselaer Polytechnic Institute, Troy, New York, USA

    J. G. Ecker & I. A. Kouada

Authors
  1. J. G. Ecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. A. Kouada
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by National Science Foundation, Grant No. GP-32844x.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ecker, J.G., Kouada, I.A. Finding efficient points for linear multiple objective programs. Mathematical Programming 8, 375–377 (1975). https://doi.org/10.1007/BF01580453

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation