Williams, H. Paul (1983) A characterisation of all feasible solutions to an integer program. Discrete Applied Mathematics, 5 (1). pp. 147-155. ISSN 0166-218X
Full text not available from this repository.
Identification Number: 10.1016/0166-218X(83)90024-0
Abstract
It is shown how the dual of Fourier–Motzkin elimination can be applied to eliminating the constraints of an Integer Linear Program. The result will, in general, be to reduce the Integer Program to a single Diophantine equation together with a series of Linear homogeneous congruences. Extreme continuous solutions to the Diophantine equation give extreme solutions to the Linear Programming relaxation. Integral solutions to the Diophantine equation which also satisfy the congruences give all the solutions to the Integer Program.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.elsevier.com/locate/dam |
| Additional Information: | © 1983 Elsevier |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 24 Jan 2011 12:48 |
| Last Modified: | 30 Mar 2024 18:09 |
| URI: | http://eprints.lse.ac.uk/id/eprint/31609 |
Actions (login required)
 |
View Item |
