Solution of One Problem of Choice of Products by Means of Branch and Bound Method

In article the mixed-integer linear programming problem (with binary variables) is considered. This problem is NP-complete as generalizes knapsack problem. The new way of calculation of bounds in branch and bound method is offered. The way is based on transition to a dual problem in continuous variables and on known minimax theorems. The numerical example illustrates features of such approach.