This paper presents an improved (infeasible) simplex method for linear programming, in which some of vertex points, corresponding to the iterative process, can be out of the feasible domain of (LP).
提出了一种求解线性规划(LP)的改进的单纯形法，其迭代过程产生的一部分极点可能出现在可行域外成为不可行极点，因此称之为外点单纯形法。
The method of choosing the thresholds is improved using the iterative optimization method.
采用迭代优化方法改进了阈值选取办法。
Then the moment distribution method is slightly improved by means of the advantage of the iterative method.
然后利用迭代法的优点，对力矩分配法稍做改进。
应用推荐