Integer programming as projection
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by London School of Economics and Political Science, LSE Library in its series LSE Research Online Documents on Economics with number 55426.
Length: 23 pages
Date of creation: Jan 2014
Date of revision:
Find related papers by JEL classification:
- R14 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General Regional Economics - - - Land Use Patterns
- J01 - Labor and Demographic Economics - - General - - - Labor Economics: General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2014-03-08 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Lucy Ayre).
If references are entirely missing, you can add them using this form.