Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

So, I posted on stack overflow looking for a reasonably fast algorithm to solve systems of linear Diophantine inequalities and was pointed to this article by Cheng-Zhi Gao and Yu-Lin Dong. The problem is, they give the algorithm on pages 350-351, but part of step (3) appears to be missing.

My question for math overflow is, therefore, whether anyone knows either of another such algorithm or has an idea as to what the missing part of Gao and Dong's algorithm is.

share|improve this question
@Joseph O'Rourke: The question you linked to is on systems of linear + quadratic Diophantine equations, whereas this one restricts to linear Diophantine equations. –  j.c. Jul 11 '11 at 1:56
Please review: "Algorithms for solving systems of linear Diophantine inequalities," a previous MO question: mathoverflow.net/questions/37637… , whose title differs by just one character (pluralizing 'Algorithm'). –  Joseph O'Rourke Jul 11 '11 at 1:58
@jc: Point taken! –  Joseph O'Rourke Jul 11 '11 at 1:59
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.