On the Complexity of a Class of Mixed Integer Linear Programs

We consider a class of mixed integer linear programs like with the property that for any
fixed vector the integer program , is polynomially solvable. This means that if the continuous variables are fixed, then the remaining integer program is polynomially solvable. Because of this one could expect that the original problem could be solved in polynomial time with a Benders like approach, however we show that it is NP-hard.

By: Francisco Barahona

Published in: RC22914 in 2003


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .