Skip to main content
SpringerLink
Log in

General criteria for redundant and nonredundant linear inequalities

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A system of linear inequalities subject to nonnegativity restrictions is considered. General criteria which are necessary and sufficient for a linear inequality to be redundant are derived. This general characterization provides a basis for unifying some of the existing techniques. After taking into consideration the existence of redundant linear inequalities, general necessary and sufficient criteria for a linear inequality to be nonredundant are also obtained. An example is given to illustrate the application of these new criteria.

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. Telgen, J.,Minimal Representation of Convex Polyhedral Sets, Journal of Optimization Theory and Applications, Vol. 38, pp. 1–24, 1982.

    Google Scholar 

  2. Boot, J. C. G.,On Trivial and Binding Constraints in Programming Problems, Management Science, Vol. 8, pp. 419–441, 1962.

    Google Scholar 

  3. Karwan, M. H., Lofti, V., Telgen, J., andZionts, S.,Redundancy in Mathematical Programming, Springer-Verlag, Berlin, Germany, 1983.

    Google Scholar 

  4. Thompson, G. L., Tonge, F. M., andZionts, S.,Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems, Management Science, Vol. 12, pp. 588–608, 1966.

    Google Scholar 

  5. Gal, T.,Redundancy in Systems of Linear Inequalities Revisited, Fernuniversität Hagen, Working Paper No. 19, 1978.

  6. Eckhardt, U.,Redundante Ungleichungen bei Linearen Ungleichungs-Systemen, Unternehmensforschung, Vol. 12, pp. 279–286, 1971.

    Google Scholar 

  7. Telgen, J.,On R. W. Llewellyn's Rules to Identify Redundant Constraints: A Detailed Critique and Some Generalizations, Zeitschrift für Operations Research, Vol. 23, pp. 197–206, 1979.

    Google Scholar 

  8. Telgen, J.,Redundancy and Linear Programs, Mathematical Center, Amsterdam, Holland, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Malaya, Kuala Lumpur, Malaysia

    M. C. Cheng (Professor of Applied Mathematics)

Authors
  1. M. C. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by R. A. Tapia

The author wishes to thank the referee for his comments.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, M.C. General criteria for redundant and nonredundant linear inequalities. J Optim Theory Appl 53, 37–42 (1987). https://doi.org/10.1007/BF00938815

Download citation

  • Issue Date:

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

Key Words

Search

Navigation