Computational aspects of the method of bilateral narrowing of the boundaries of the optimum and the variables in the mixed-integer knapsack problem

In this article experimental research was conducted in order to investigate the quality of the method for the solution of the problem of the mixed-integer programming with one restriction witch suggested by author. In these experiments it has been confirmed once more that the method suggested by author operates more rapidly than the known “branch and bound” method.