CALCULATION OF PENALTIES IN ALGORITHM OF MIXEDINTEGER PROGRAMMING SOLVING WITH REVISED DUALSIMPLEX METHOD FOR BOUNDED VARIABLES

作     者：Wei, YM Hu, QH 

作者机构：Chinese Acad Sci Inst Policy & Management Beijing 100080 Peoples R China Wuhan Inst Chem Technol Wuhan 430073 Peoples R China 

出 版 物：《Journal of Computational Mathematics》 (计算数学（英文）)

年 卷 期：1999年第17卷第5期

页      面：545-552页

核心收录：

学科分类：07[理学] 0714[理学-统计学（可授理学、经济学学位）] 070102[理学-计算数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：中国博士后科学基金 

主　　题：penalties stronger penalties the revised dual simplex method for bounded variables 

摘      要：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.