A primal-dual infeasible-interior-point algorithm for box linear programming is presented.And it is prcved that the iteration complexity is polynomial.

• 对框式线性规划提出了一个原始-对偶不可行内点算法，并证明了该算法的迭代复杂性为多项式时间性.