在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
解线性规划问题除常见的单纯形法和对偶单纯形法外，还有一种原始对偶法。
Commonly in additional to simplex method and dual simplex method, another original dual method can solve the liner programming.
用稀疏对偶单纯形法求解每时段的经济功率分配，所用内存少，计算时间短。
Small memory capacity and short CPU time are repuired by the algorithm for the solution of the economic dispatch every interval with simple form of sparse dual method.
利用对偶规划求解一个单纯形法循环的例子，由此减少了单纯形法迭代次数，达到简化计算、加快计算速度、节省存储空间的效果。
This paper tries to find the solution of a simplex-method recurrence by means of dual program, which can reduce the repetitions of simplex-method and simplify the calculations as well.
本文主要讨论了生产网络流的最小费用问题，在研究该问题的基本结构及其对偶性质的基础上给出了该问题的网络单纯形法。
The infrastructure and dual properties of the so-called minimum cost problem are specifically studied to outline a network simplex method for solving this problem.
本文主要讨论了生产网络流的最小费用问题，在研究该问题的基本结构及其对偶性质的基础上给出了该问题的网络单纯形法。
The infrastructure and dual properties of the so-called minimum cost problem are specifically studied to outline a network simplex method for solving this problem.
应用推荐