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.

• 摘要本文对线性规划提出了一个不可行内点原始－对偶仿射尺度算法，并证明了算法是一个多项式时间算法。