Abstract
A necessary and sufficient condition for identification of dominated columns, which correspond to one type of redundant integer variables, in the matrix of a general Integer Programming problem, is derived. The given condition extends our recent work on eliminating dominated integer variables in Knapsack problems, and revises a recently published procedure for reducing the number of variables in general Integer Programming problems given in the literature. A report on computational experiments for one class of large scale Knapsack problems, illustrating the function of this approach, is included.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
