A modification of the GOMORY-method for solving mixed-integer optimization problems is formulated. The revised simplex mothod is used instead of the usually applieddual simplex method. Then, the GOMORY-method is imbedded into a branch-and-bound-algorithm, giving a well-conditionedg numerical method for solving mixed-integer optimization probiems without some disadvantages of well-known alogrithms.