This paper tries to find the solution of a simplex-method recurrence by means of dual program, which can reduce the repetitions of simplex-method and simplify the calculations as well.
利用对偶规划求解一个单纯形法循环的例子,由此减少了单纯形法迭代次数,达到简化计算、加快计算速度、节省存储空间的效果。
This paper tries to find the solution of a simplex-method recurrence by means of dual program, which can reduce the repetitions of simplex-method and simplify the calculations as well.
利用对偶规划求解一个单纯形法循环的例子,由此减少了单纯形法迭代次数,达到简化计算、加快计算速度、节省存储空间的效果。
应用推荐