Skip to main content
Springer Nature Link
Log in

A note on bicriterion programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

This note examines the complexity of solving the bicriterion vector maximum problem and the associated linear-weighted criterion problem over a finite set of alternatives. It presents an algorithm for linear-weighted problems with separable objectives that is considerably more efficient than complete enumeration of all alternatives and shows that the algorithm is essentially optimal for this problem.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. A.V. Aho, J.E. Hopcroft and J.D. Ullman,The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).

    MATH  Google Scholar 

  2. H.P. Benson, “Vector maximization with two objective functions”,Journal of Optimization Theory and Applications 28 (1979) 253–257.

    Article  MATH  MathSciNet  Google Scholar 

  3. M.E. Dyer, “Vertex enumeration in mathematical programming”, PhD Thesis, University of Leeds (Leeds, England, 1979).

    Google Scholar 

  4. M.E. Dyer, “An O(n) algorithm for the multiple-choice knapsack linear program”, to appear inMathematical Programming (1982).)

  5. A.M. Geoffrion, “Solving bicriterion mathematical programs”,Operations Research 15 (1967) 39–54.

    MATH  MathSciNet  Google Scholar 

  6. R.R. Hocking and R.L. Shepard, “Parametric solution of a class of nonconvex programs”,Operations Research 19 (1971) 1742–1747.

    Article  MATH  MathSciNet  Google Scholar 

  7. D.E. Knuth, “Big Omicron and Big Omega and Big Theta”,SIGACT News April-June Issue (1976) 18–24.

    Article  Google Scholar 

  8. H.T. Kung, F. Luccio and F.P. Preparata, “On finding the maxima of a set of vectors”,Journal of the Association for Computing Machinery 22 (1975) 469–476.

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. J. Walker, “An interactive method as an aid in solving bicriterion mathematical programming problems”,Journal of the Operational Research Society 29 (1978) 915–922.

    Article  MATH  Google Scholar 

  11. J. Walker, “Optimal redundancy in serial-stage systems—a computer avoidance approach”, in:Proceedings of the 2nd national reliability conference (Birmingham, England, 1979), 3C/2, 1–11.

  12. J. Walker, “Multi-criteria programming with applications to the redundancy allocation problem”, PhD Thesis, CNAA, Teesside Polytechnic (Middlesbrough, England, 1980).

    Google Scholar 

  13. A.C-C Yao, “A lower bound to finding convex hulls”,Journal of the Association for Computing Machinery 28 (1981) 780–787.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Teesside Polytechnic, Middlesbrough, TS1 3BA, Cleveland, England

    M. E. Dyer & J. Walker

Authors
  1. M. E. Dyer
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. J. Walker
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dyer, M.E., Walker, J. A note on bicriterion programming. Mathematical Programming 27, 355–361 (1983). https://doi.org/10.1007/BF02591909

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words