Redundant Constraints and Extraneous Variables in Integer Programs

David S. Rubin
Additional contact information
David S. Rubin: Bell Telephone Laboratories, Inc., Holmdel, New Jersey

Management Science, 1972, vol. 18, issue 7, 423-427

Abstract: Integer 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.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.7.423 (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:inm:ormnsc:v:18:y:1972:i:7:p:423-427

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().