Skip to main content
SpringerLink
Log in

On degeneracy in enumeration

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In the case of degeneracy in an LP-formulation, there is not a one-to-one correspondence between extreme points and feasible bases. If the task is to find thek best extreme points in the set of feasible solutions to an LP, this lack of correspondence has a certain importance, since methods based on the Simplex Algorithm are oriented towards feasible bases instead of the relevant extreme points. We therefore present an easily implementable method to avoid 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

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. M. E. Dyer and L. G. Proll:An algorithm for determining all extreme points of a convex polytope, Math. Programming XII, (1977), 81–96.

    Google Scholar 

  2. S. I. Gass:Linear Programming, fourth edition, McGraw-Hill Book Company, New York, (1975) p. 142.

    Google Scholar 

  3. S. I. Gass:Comments on the possibility of cycling with the simplex method, Oper. Res. XXVII, (1978), 848–852.

    Google Scholar 

  4. S. W. Wallace:Enumeration algorithm in linear programming, Report in informatics no. 3, Department of Mathematics, University of Bergen, (1982).

Download references

Author information

Authors and Affiliations

  1. Dept. of Science and Technology, The Chr. Michelson Inst., Fantoftvegen 38, N-5036, Fantoft, Norway

    Stein W. Wallace

Authors
  1. Stein W. Wallace
    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

Wallace, S.W. On degeneracy in enumeration. BIT 23, 267–270 (1983). https://doi.org/10.1007/BF02218448

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation