In case of problems with thousands of variables, the primal-dualalgorithm will be far more efficient.
对于有大量变量的问题，原始对偶算法将更为有效。
2
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
3
It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.