Chubanov's basic procedure consists of solving that reformulation with a Perceptron method. The other trick that Chubanov (as well as Peña and Soheili, in their deterministic rescaled Perceptron \cite{algorithm}) is that any feasible dual vector induces valid inequalities, and that the quality (tightness) of the inequalities is proportional to that of the dual solution's upper bound value.