Skip to main content
SpringerLink
Log in

Linear multiple objective programs with zero–one variables

  • Published:
Mathematical Programming Submit manuscript

Abstract

Theoretical results are developed for zero–one linear multiple objective programs. Initially a simpler program, having as a feasible set the vertices of the unit hypercube, is studied. For the main problem an algorithm, computational experience, parametric analysis and indifference sets are presented. The mixed integer version of the main problem is briefly 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. D.E. Bell and J.F. Shapiro, “A finitely convergent duality theory for zero–one integer programming”, MIT Operations Research Center Report OR 043-75 (May 1975).

  2. G.R. Bitran, “Admissible points and vector optimization: a unified approach”, unpublished Ph.D. thesis, Operations Research Center, MIT (Cambridge, MA, 1975).

    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. R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).

    Google Scholar 

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

    Google Scholar 

  6. J.S.H. Kornbluth, “Duality, indifference and sensitivity analysis in multiple objective programming”,Operations Research Quarterly 25 (1974) 599–614.

    Google Scholar 

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

    Google Scholar 

  8. 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, to appear.

  9. 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 

Download references

Author information

Authors and Affiliations

  1. University of São Paulo, SP, Brazil

    Gabriel R. Bitran

Authors
  1. Gabriel R. Bitran
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by the “Fundação Carlos Alberto Vanzolini”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bitran, G.R. Linear multiple objective programs with zero–one variables. Mathematical Programming 13, 121–139 (1977). https://doi.org/10.1007/BF01584332

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation