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...
详细信息
ISBN:
(纸本)9781467345026;9781467345002
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.
A mixed-integer knapsack problem solving method is suggested. With this purpose, first, the number of integer-valued variables and the domain of feasible solutions (containing the optimal solution) are decreased. Furt...
详细信息
A mixed-integer knapsack problem solving method is suggested. With this purpose, first, the number of integer-valued variables and the domain of feasible solutions (containing the optimal solution) are decreased. Further, the received problem is solved using the "branch and bound" type method, where the narrow intervals for the functional and variables are used while each is branching. The numerous computing experiments fulfilled have shown that the suggested method operates more rapidly than the known "branch and bound" method.
暂无评论