In contrast to the numerous known statements of sharpening cuts stronger in modified Gomory this paper will inform about a possibility to make cuts stronger in modified Gomory-algorithms. These modified Gomory-algorithms are characterized in generating cuts using nonfeasible basic solutions too. It is shown that the relation between cuts defined in this note represents an enlargement of the relation of dominance by Piehler.