The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.

• 内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。