运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。
Based on the principle of the dual simplex method about linear programming, the changes of the value of the objective function in iterations have been studied.
与原对偶单纯形法相比，改进算法的存贮量和计算量大大减少。
Compared with the dual simplex method, the amount of the storage and calculations of the improved algorithm is largely reduced.
应用推荐