Williams, H. Paul (1976) Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory, Series A, 21 (1). pp. 118-123. ISSN 0097-3165
Abstract
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 |
|---|---|
| Official URL: | http://www.elsevier.com/locate/jcta |
| Additional Information: | © 1976 Elsevier Inc |
| Library of Congress subject classification: | Q Science > QA Mathematics |
| Sets: | Research centres and groups > Management Science Group Departments > Management |
| Date Deposited: | 24 Jan 2011 13:25 |
| URL: | http://eprints.lse.ac.uk/31614/ |
Actions (login required)
 |
Record administration - authorised staff only |
