A duality theorem for linear congruences
Williams, H. P.
(1984).
A duality theorem for linear congruences.
Discrete Applied Mathematics,
7(1), 93-103.
https://doi.org/10.1016/0166-218X(84)90116-1
An analogous duality theorem to that for Linear Programming is presented for systems of linear congruences. It is pointed out that such a system of linear congruences is a relaxation of an Integer Programming model (for which the duality theorem does not hold). Algorithms are presented for both the resulting primal and dual problems. These algorithms serve to give a constructive proof of the duality theorem.
| Item Type | Article |
|---|---|
| Copyright holders | © 1984 Elsevier Science B.V. |
| Departments | LSE > Academic Departments > Management |
| DOI | 10.1016/0166-218X(84)90116-1 |
| Date Deposited | 24 Jan 2011 |
| URI | https://researchonline.lse.ac.uk/id/eprint/31659 |
Explore Further
- https://www.scopus.com/pages/publications/0021155556 (Scopus publication)
- http://www.elsevier.com/locate/dam (Official URL)