This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linearprogramming. it is shown that the method is polynomial-time algorithm.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
2
To solve a linearprogramming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
3
First, the main procedures and the distinctive features of the most-obtuse-angle (MOA) row or column pivot rules are introduced for achieving primal or dual feasibility in linearprogramming.