Redundant Constraints and Extraneous Variables in Integer Programs
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.
Volume (Year): 18 (1972)
Issue (Month): 7 (March)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:18:y:1972:i:7:p:423-427. See general 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.