Branch and Bound method for binary problems with the procedure that reduces dimension of problems

The relationships between elements aij of coefficient matrix, elements di of vector d and elements cj of vector c in general binary problem are considered. Some of them allow us to establish the values of selected elements of feasible or optimal vector x. This procedure reduces the dimension of basic problem and can be install in branch and bound method. It gives positive effects.