Integer programming as projection
We generalise polyhedral projection (Fourier-Motzkin elimination) to integer programming (IP) and derive from this an alternative perspective on IP that parallels the classical theory. We first observe that projection of an IP yields an IP augmented with linear congruence relations and finite-domain variables, which we term a generalised IP. The projection algorithm can be converted to a branch-and-bound algorithm for generalised IP in which the search tree has bounded depth (as opposed to conventional branching, in which there is no bound). It also leads to valid inequalities that are analogous to Chv´atal-Gomory cuts but are derived from congruences rather than rounding, and whose rank is bounded by the number of variables. Finally, projection provides an alternative approach to IP duality. It yields a value function that consists of nested roundings as in the classical case, but in which ordinary rounding is replaced by rounding to the nearest multiple of an appropriate modulus, and the depth of nesting is again bounded by the number of variables.
|Date of creation:||Jan 2014|
|Date of revision:|
|Contact details of provider:|| Postal: LSE Library Portugal Street London, WC2A 2HD, U.K.|
Phone: +44 (020) 7405 7686
Web page: http://www.lse.ac.uk/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ehl:lserod:55426. 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: (LSERO Manager)
If references are entirely missing, you can add them using this form.