Commonly in additional to simplexmethod and dualsimplexmethod, another original dual method can solve the liner programming.
解线性规划问题除常见的单纯形法和对偶单纯形法外,还有一种原始对偶法。
2
Compared with the dualsimplexmethod, the amount of the storage and calculations of the improved algorithm is largely reduced.
与原对偶单纯形法相比,改进算法的存贮量和计算量大大减少。
3
Based on the principle of the dualsimplexmethod about linear programming, the changes of the value of the objective function in iterations have been studied.