| 二分单纯形算法中子规划问题的进一步研究 |
| |
| 引用本文： | 严文利.二分单纯形算法中子规划问题的进一步研究[J].运筹与管理,2001,10(4):63-69. |
| |
| 作者姓名： | 严文利 |
| |
| 作者单位： | 淮阴工学院,江苏,淮安,223001 |
| |
| 摘 要： | 本对二分单纯形算法的子规划问题作进一步研究，提出一个新的子规划问题来改善问题的不可行性，并确定了相应的主元旋转规则，并编制了相应于新子规划的新二分算法，并对94个线性规划问题进行了数值实验，实验结果表明，新二分算法是一种改进的二分算法。
|
| 关 键 词： | 二分单纯形算法 子规划问题 主元旋转规则 线性规划 |
| 文章编号： | 1007-3221(2001)04-0063-07 |
| 修稿时间： | 2001年6月15日 |
Further Study on the Sub-Programming of the Simplex-Like Method with Bisection |
| |
| YAN Wen-li.Further Study on the Sub-Programming of the Simplex-Like Method with Bisection[J].Operations Research and Management Science,2001,10(4):63-69. |
| |
| Authors: | YAN Wen-li |
| |
| Abstract: | In this paper, we make further study on the sub-programming of the simplex-like method with bisection, provide a new special linear sub-programming to improve the infeasibility of the problem, determine the corresponding pivoting rule,and set up a new algorithm according to the new sub-programming. We also carry out numerical test in 94 linear programming problems. The result of the test indicates that the new algorithm can be regarded as an improved algorithm of the primal one. |
| |
| Keywords: | simplex method with bisection sub-programming pivoting rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
