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.

• 저널Management Science · 18(7) · 423–427
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.18.7.423
• 저자David S. Rubin