TY - JOUR
T1 - Calculation of Penalties in Algorithm of Mixed Integer Programming Solving with Revised Dual Simplex Method for Bounded Variables
AU - Wei , Yi-Ming
AU - Hu , Qing-Huai
JO - Journal of Computational Mathematics
VL - 5
SP - 545
EP - 552
PY - 1999
DA - 1999/10
SN - 17
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9124.html
KW - Penalties, Stronger penalties, The revised dual simplex method for
bounded variables.
AB - <p style="text-align: justify;"><span style="text-align: justify;">The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems.&nbsp;</span><span style="text-align: justify;">This paper, based on the general forms of the penalties by Beale and Small and the stronger penalties by Tomlin, describes the modifi</span><span style="text-align: justify;">cations of these penalties used for the method of bounded variables. The same examples from Petersen are taken and the satisfactory results are shown in comparison with those obtained by Tomlin.</span> </p>