Abstract
We study different extended formulations for the set X = {x E Zn | Ax = Ax0} in order to tackle the feasibility problem for the set X+ = X N Zn+. Here the goal is not to find an improved polyhedral relaxation of conv(X+), but rather to reformulate in such a way that the new variables introduced provide good branching directions, and in certain circumstances permit one to deduce rapidly that the instance is infeasible. For the case that A has one row a we analyze the reformulations in more detail. In particular, we determine the integer width of the extended formulations in the direction of the last coordinate, and derive a lower bound on the Frobenius number of a. We also suggest how a decomposition of the vector a can be obtained that will provide a useful extended formulation. Our theoretical results are accompanied by a small computational study.
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.
