Skip to main content
Article thumbnail
Location of Repository

A duality theorem for linear congruences

By H. Paul Williams

Abstract

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

Topics: QA Mathematics
Publisher: Elsevier
Year: 1984
DOI identifier: 10.1016/0166-218X(84)90116-1
OAI identifier: oai:eprints.lse.ac.uk:31659
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.elsevier.com/locate... (external link)
  • http://eprints.lse.ac.uk/31659... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.