Skip to main content
SpringerLink
Log in

Theory and algorithms for linear multiple objective programs with zero–one variables

  • Published:
Mathematical Programming Submit manuscript

Abstract

A new algorithm and theoretical results are presented for linear multiple objective programs with zero–one variables. A procedure to identify strong and weak efficient points as well as an extension of the main problem are analyzed. Extensive computational results are given and several topics for further research are discussed.

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. G.R. Bitran, “Linear multiple objective programs with zero–one variables”,Mathematical Programming 13 (1977) 121–139.

    Google Scholar 

  2. J.G. Ecker and I.A. Kouada, “Finding All Efficient Extreme Points for Multiple Objective Linear Programs”,Mathematical Programming 14 (1978) 249–261.

    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. O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).

    Google Scholar 

  5. H. Pasternak and U. Passy, “Bicriterion mathematical programs with boolean variables”, in: J.L. Cochrane and M. Zeleny, eds., Multiple criteria decision making (University of South Carolina Press, 1973) pp. 327–348.

  6. H. Pasternak and U. Passy, “Bicriterion functions in annual activity planning”, Sixth international conference on operations research, Dublin, 1972.

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

    Google Scholar 

  8. R.T. Rockafellar,Convex analysis (Princeton University Press, 1970).

  9. J.F. Shapiro, “Multiple criteria public investment decision making by mixed integer programming”, in: Proceedings of the conference on multicriterion decision making, Jouy En Josas, May 1975.

  10. P.L. Yu and M. Zeleny, “The set of all nondominated solutions in linear cases and a multicriteria simplex method”,Journal of Mathematical Analysis and Applications 49 (1975) 430–468.

    Google Scholar 

  11. S. Zionts and J. Wallenius, “Identifying efficient vectors: some theory and computational results”, Working Paper No. 257, State University of New York at Buffalo (1976) (to appear in Operations Research).

  12. S. Zionts, “An interactive method for evaluating discrete alternatives involving multiple criteria”, Working Paper No. 271, State University of New York at Buffalo. [Presented at the Ninth International Symposium on Mathematical Programming, Budapest, Hungary, August 1976].

  13. S. Zionts, “Integer linear programming with multiple objectives”,Annals of Discrete Mathematics 1 (1977) 551–562.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Massachusetts Institute of Technology, Cambridge, MA, USA

    Gabriel R. Bitran

Authors
  1. Gabriel R. Bitran
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bitran, G.R. Theory and algorithms for linear multiple objective programs with zero–one variables. Mathematical Programming 17, 362–390 (1979). https://doi.org/10.1007/BF01588256

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation