Abstract. A combinatorial method for computing the basis of the set of solutions to systems of linear constraints over the set of real numbers and an improved method for computing minimal generating set of solutions over the set of natural numbers are considered. A short review of this method in other discrete domains is presented.

Keywords: linear constraint, linear Diophantine constraint, basis for a solution set.