Skip to main content
SpringerLink
Log in

Vector maximization at a degenerate vertex

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

Method II.2 of our paper [2] on vector maximization published earlier in this journal may fail at a degenerate vertex. The modification of the method needed to overcome this defect is described.

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.

References

  1. J.P. Evans, R.E. Steur, “A revised simplex method for linear multiple objective programs”,Mathematical Programming 5 (1) (1973) 54–72.

    Google Scholar 

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

    Google Scholar 

  3. J. Philip, “An algorithm for combined quadratic and multiobjective programming”, TRITA-MAT-1973-5, Tech. Rept., Dept. Mathematics, Royal Institute of Technology, Stockholm 70, Sweden.

Download references

Author information

Authors and Affiliations

  1. Royal Institute of Technology, Stockholm, Sweden

    Johan Philip

Authors
  1. Johan Philip
    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

Philip, J. Vector maximization at a degenerate vertex. Mathematical Programming 13, 357–359 (1977). https://doi.org/10.1007/BF01584348

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation