After finite iterations, the iteration point always gets into the feasible set.
有限步迭代后，迭代点落入可行域。
After finite iterations, the iteration point gets into the feasible set and the master direction is a feasible direction of descent.
有限次迭代后，迭代点进入可行集且主方向是一可行下降方向。
A rotation transformation method is to be used in changing an ordinary linear programming (LP)problem into an equivalent easily-solved continuous knapsack one after a finite iteration.
本文运用旋转变换法，经有限次变换后，将普通线性规划（LP）问题，化为一个等价的易于求解的连续背包问题。
应用推荐