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 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.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
Trust region interior point method can settle the problem of adjusting step sizes on successive linear programming well.
信赖域内点法可以很好地解决逐线性规划方法中的步长调整问题。
Trust region interior point method can settle the problem of adjusting step sizes on successive linear programming well.
信赖域内点法可以很好地解决逐线性规划方法中的步长调整问题。
应用推荐