Redundant Constraints and Extraneous Variables in Integer Programs
AbstractInteger programs may have constraints which are redundant or else nonbinding. They may also have variables which are extraneous in the sense that there is some optimal program in which they are nonpositive. Thompson, Tonge and Zionts [Thompson, G. L., F. M. Tonge, S. Zionts. 1966. Techniques for removing nonbinding constraints and extraneous variables from linear programming problems. Management Sci. 12(7, March) 588-608.] have discussed the topics of redundant constraints and extraneous variables in linear programs. This paper extends their results to integer programs, and provides new proofs of the original results.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 18 (1972)
Issue (Month): 7 (March)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.