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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
2
The primal-dual interior point method can solve effectively the problem with a lot of constraints resulting from the motion equations of the generator rotors with the result of perfect convergence.