Compared with the dual simplex method, the amount of the storage and calculations of the improved algorithm is largely reduced.
与原对偶单纯形法相比，改进算法的存贮量和计算量大大减少。
On the basis of simplex method for dual, a fast decreasing algorithm of objective function is proposed.
在对偶单纯形方法的基础上，提出了线性规划的目标函数最速递减算法。
On the basis of simplex method for dual, a fast decreasing algorithm of objective function is proposed.
在对偶单纯形方法的基础上，提出了线性规划的目标函数最速递减算法。
应用推荐