Fourier-Motzkin elimination extension to integer programming problems
Williams, H. P.
(1976).
Fourier-Motzkin elimination extension to integer programming problems.
Journal of Combinatorial Theory, Series A,
21(1), 118-123.
https://doi.org/10.1016/0097-3165(76)90055-8
This paper describes how the Fourier-Motzkin Elimination Method, which can be used for solving Linear Programming Problems, can be extended to deal with Integer Programming Problems. The extension derives from a known decision procedure for the formal theory of a fragment of arithmetic which excludes multiplication.
| Item Type | Article |
|---|---|
| Copyright holders | © 1976 Elsevier Inc |
| Departments | LSE > Academic Departments > Management |
| DOI | 10.1016/0097-3165(76)90055-8 |
| Date Deposited | 24 Jan 2011 |
| URI | https://researchonline.lse.ac.uk/id/eprint/31614 |
Explore Further
- https://www.scopus.com/pages/publications/0042576333 (Scopus publication)
- http://www.elsevier.com/locate/jcta (Official URL)