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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.
首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。
Finally, according to the bottleneck of Primal-Dual Interior-Point Algorithm, corresponding solution is given. And the application of this algorithm in the future is prospected.
最后还对原-对偶内点算法中的计算瓶颈做出了分析，给出了相应的优化解决方案，并展望了该算法的应用前景。
应用推荐