Calculation of Penalties in Algorithm of Mixed Integer Programming Solving with Revised Dual Simplex Method for Bounded Variables
Year: 1999
Author: Yi-Ming Wei, Qing-Huai Hu
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 5 : pp. 545–552
Abstract
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. 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 Petersen are taken and the satisfactory results are shown in comparison with those obtained by Tomlin.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1999-JCM-9124
Journal of Computational Mathematics, Vol. 17 (1999), Iss. 5 : pp. 545–552
Published online: 1999-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 8
Keywords: Penalties Stronger penalties The revised dual simplex method for bounded variables.