Library Header Image
LSE Research Online LSE Library Services

A duality theorem for linear congruences

Williams, H. Paul (1984) A duality theorem for linear congruences. Discrete Applied Mathematics, 7 (1). pp. 93-103. ISSN 0166-218X

Full text not available from this repository.
Identification Number: 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
Official URL:
Additional Information: © 1984 Elsevier Science B.V.
Divisions: Management
Subjects: Q Science > QA Mathematics
Date Deposited: 24 Jan 2011 16:23
Last Modified: 15 May 2024 23:27

Actions (login required)

View Item View Item