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.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming;
给出了二次锥规划的一种非精确不可行内点算法。
On the Research of Primal-dual Infeasible Interior Point Algorithm for Box Linear Programming;
给出了二次锥规划的一种非精确不可行内点算法。
应用推荐