Skip to main content
SpringerLink
Log in

Generalized theorems for permanent basic and nonbasic variables

  • Published:
Mathematical Programming Submit manuscript

Abstract

The standard linear program with known finite optimum value is considered. New theorems for identifying permanent basic and non-basic variables are derived which generalize and unify many existing approaches. These theorems also provide a powerful theoretical basis for identifying many more permanent basic and nonbasic variables which are otherwise not identifiable under existing approaches.

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. L. Brosius, “Comment on a paper by M.C. Cheng”,Mathematical Programming 21(1981) 229–232.

    Article  MATH  MathSciNet  Google Scholar 

  2. M.C. Cheng, “New criteria for the simplex algorithm”,Mathematical Programming 19(1980) 230–236.

    Article  MATH  MathSciNet  Google Scholar 

  3. M.C. Cheng, “Recent development in the simplex algorithm”, in: K.N. Cheng and C.T. Chong, eds.,Proceeding of the Mathematical Seminar: Singapore 1980 (Singapore Mathematical Society and Mathematics Department, N.U.S., Singapore, 1981) pp. 6–19.

    Google Scholar 

  4. U. Eckhardt, “Redundante Ungleichungen bei linearen Ungleichungssystemen”,Unternehmensforschung 12(1971) 279–286.

    Article  MathSciNet  Google Scholar 

  5. T. Gal, “Redundancy in systems of linear inequalities revisited”, Discussion Paper no. 19, Fern-Universität (Hagen, 1978).

    Google Scholar 

  6. M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts, Redundancy in mathematical programming: A state-of-the-art survey, Lecture Notes in Economics and Mathematical Systems, Vol. 206 (Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983).

    MATH  Google Scholar 

  7. R.W. Llewellyn, Linear programming (Holt, Rinehart & Whinston, New York, 1964) pp. 132–138.

    Google Scholar 

  8. J. Telgen, “On R.W. Llewellyn’s rules to identify redundant constraints: A detailed critique and some generalizations”,Zeitschrift für Operations Research 23(1979) 197–206.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Telgen, Redundancy and linear programs, Mathematical Centre Tracts 137 (Mathematisch Centrum, Amsterdam, 1981).

    MATH  Google Scholar 

  10. G.L. Thompson, F.M. Tonge and S. Zionts, “Techniques for removing non-binding constraints and extraneous variables from linear programming”,Management Science 12(1966) 588–608.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, 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. Generalized theorems for permanent basic and nonbasic variables. Mathematical Programming 31, 229–234 (1985). https://doi.org/10.1007/BF02591751

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation