Abstract
In this chapter we address the problem of finding an x ∈ ℜn which is a solution to the system Ax = b or Ax ≥ b with some or all of the x j required to be integer. This problem has a very long history. Integer equalities were studied by the Greek mathematician Diophantos during the third century A.D. In fact, when all the variables are required to be integer the equations in the system Ax = b are called linear Diophantine equations. We use the terms Diophantine and integer interchangeably. The study of linear and nonlinear Diophantine equations is an important part of number theory. Although linear Diophantine equations were studied in the third century A.D. it was not until the 20th century A.D. (1976 to be precise) that a polynomial algorithm was given for finding an integer solution the system Ax = b.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Martin, R.K. (1999). Integer Linear Systems: Projection and Inverse Projection. In: Large Scale Linear and Integer Optimization: A Unified Approach. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4975-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4975-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7258-5
Online ISBN: 978-1-4615-4975-8
eBook Packages: Springer Book Archive