ON REDUNDANCY IN SYSTEMS OF LINEAR INEQUALITIES

Jan Telgen

No 272154, Econometric Institute Archives from Erasmus University Rotterdam

Abstract: In this paper the concept of redundancy in systems of linear inequalities is established from the existence of the minimal inequality representation of a system of linear constraints. It is shown that absence of redundancy is a necessary and sufficient condition for having a minimal inequality representation of the system; then a minimal inequality representation can be obtained by deleting redundant constraints. Furthermore a general method to determine redundancy is developed; this method is based on the simplex method and is greatly inspired by Gal [2]. A number of known methods can be shown to be simplified variants of this method. Finally the equivalence, in terms of complexity theory, of the problem of determining redundancy and the general linear programming problem, is proved. From this a class of problems is indicated, for which it may be fruitful to determine redundancy.

Keywords: Agricultural and Food Policy; Research Methods/Statistical Methods (search for similar items in EconPapers)
Pages: 16
Date: 1977-09
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/272154/files/erasmus091.pdf (application/pdf)
https://ageconsearch.umn.edu/record/272154/files/erasmus091.pdf?subformat=pdfa (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ags:eureia:272154

DOI: 10.22004/ag.econ.272154

Access Statistics for this paper

More papers in Econometric Institute Archives from Erasmus University Rotterdam Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().