线性规划的双进基迭代法

Iterative method of two enter basis in linear programming

研究讨论了线性规划的“双进基迭代”方法, 说明了此方法不会出现循环的情况. 对于有些线性规划问题的计算比单纯形方法要快捷一些.

In this paper we descride a method to solve the linear programming problem that each time we chose two nonbasic variable to enters the basis and at the same time we induce two basic variable leave the basis by the suitable select this method can prevent the cyclicard may be faster.