Skip to main content
SpringerLink
Log in

New criteria for the simplex algorithm

  • Published:
Mathematical Programming Submit manuscript

Abstract

The standard linear programming problem with a finite optimum value is considered. We derive new criteria which guarantee that

(i) a non-basic variable of a basic feasible solution will remain a non-basic variable of an optimal basic solution; (ii) a basic variable of a basic feasible solution will remain a basic variable of an optimal basic solution.

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. Hadley,Linear programming (Addison-Wesley Publishing Co., Reading, MA, 6th edn., 1972).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Malaya, Kuala Lumpur, Malaysia

    M. C. Cheng

Authors
  1. M. C. Cheng
    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

Cheng, M.C. New criteria for the simplex algorithm. Mathematical Programming 19, 230–236 (1980). https://doi.org/10.1007/BF01581644

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation