It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
Compared with the dual simplex method, the amount of the storage and calculations of the improved algorithm is largely reduced.
与原对偶单纯形法相比，改进算法的存贮量和计算量大大减少。
应用推荐