This paper will inform about a possibility, to make cuts stronger in the GONORY all-integer algorithm. To this end we define a relation of dominance between cuts; by means of this relation we then decide whether a stronger cut can be obtained by changing the constant term. Furthermore, two simple sufficient conditions are given for the existence and non-existence, respectively, of a dominating cut. Finally, some unsolved problems are mentioned and remarks about further studies are given.