To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.

在用对偶单纯形法解线性规划问题时，必须找到初始正则解。

youdao

To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.

在用对偶单纯形法解线性规划问题时，必须找到初始正则解。

youdao