解线性规划问题除常见的单纯形法和对偶单纯形法外，还有一种原始对偶法。
Commonly in additional to simplex method and dual simplex method, another original dual method can solve the liner programming.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
应用推荐