ON EXTENSION OF THE DOMAIN OF APPLICABILITY OF THE DOMINANCE PRINCIPLE

The possibility of extending the class of problems of discrete optimization, admitting the application of the dominance principle for their solution, is illustrated by an example of the additional cut-off rule of nonpromising sets of solutions for the branch-and-bound method. The extension is achieved by introducing an additional condition of the comparability of the vertices of the tree of solutions.