二分单纯形算法中子规划问题的进一步研究

Further Study on the Sub-Programming of the Simplex-Like Method with Bisection

本文对二分单纯形算法中的子规划问题作进一步研究 ,提出一个新的子规划问题来改善问题的不可行性 ,并确定出了相应的主元旋转规则 ,并编制了相应于新子规划的新二分算法。并对94个线性规划问题进行了数值实验。实验结果表明 。

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.