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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
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.
而原始-对偶内点法完全可以很好地解决由于发电机转子运动方程的引入带来的大量约束问题，具有极好的收敛特性。
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.
而原始-对偶内点法完全可以很好地解决由于发电机转子运动方程的引入带来的大量约束问题，具有极好的收敛特性。
应用推荐