The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.

内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。

youdao

Simplex algorithm is an effective method for solving linear programming problem.

单纯形法是求解线性规划问题的有效方法。

youdao

To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.

为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。

youdao

To improve the method of solving linear programming problem by means of simplex method, this paper gives the method of linear programming problem general solution with infinite optimal solutions.

为了进一步完善解线性规划问题的单纯形法，本文给出了表达一类具有无穷多个最优解的线性规划问题通解的方法。

youdao