在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
本文还给出了第一个正则解的一个求法，并讨论了退化情况。
Moreover, a method to find out the first regular solution has been given and the generating situation has been discussed in this paper.
通过适当选取正则参数，证明了正则解具有最优的渐近收敛阶。
By apriori choosing regularization parameter, optimal convergence order of the regularized solution is obtained.
应用推荐