Calculation of penalties in algorithm of mixed integer programming solving with revised dual simplex method for bounded variables

摘要

The branch-and-bound method with the revised dual simplex for bounded vari- ables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general forms of the penalties by Beale and Small and the stronger penalties by Tomlin, describes the modifications of these Penalties used for the method of bounded variables. The same examples from Pe- Tersen are taken and the satisfactory results are shown in comparison with those Obtained by Tomlin.