full
search.png

Search

close.png

Cancel

arrow
Volume 17, Issue 5
Calculation of Penalties in Algorithm of Mixed Integer Programming Solving with Revised Dual Simplex Method for Bounded Variables

Yi-Ming Wei & Qing-Huai Hu

J. Comp. Math., 17 (1999), pp. 545-552.

Published online: 1999-10

Preview Full PDF 2535 25868

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

Penalties, Stronger penalties, The revised dual simplex method for bounded variables.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-17-545, author = {Wei , Yi-Ming and Hu , Qing-Huai}, title = {Calculation of Penalties in Algorithm of Mixed Integer Programming Solving with Revised Dual Simplex Method for Bounded Variables}, journal = {Journal of Computational Mathematics}, year = {1999}, volume = {17}, number = {5}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9124.html} }
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 -

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.

Wei , Yi-Ming and Hu , Qing-Huai. (1999). Calculation of Penalties in Algorithm of Mixed Integer Programming Solving with Revised Dual Simplex Method for Bounded Variables. Journal of Computational Mathematics. 17 (5). 545-552. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard