Theory of linear and integer programming
Theory of linear and integer programming
On Counting Integral Points in a Convex Rational Polytope
Mathematics of Operations Research
Hi-index | 0.00 |
Given A ∈ Zm×n and b ∈ Zm, we consider the issue of existence of a nonnegative integral solution x ∈ Nn to the system of linear equations Ax = b. We provide a discrete and explicit analogue of the celebrated Farkas lemma for linear systems in Rn and prove that checking existence of integral solutions reduces to solving an explicit linear programming problem of fixed dimension, known in advance.