用单纯形法求解线性规划问题的多最优解，对一类特殊的可行域，有时会导致失效。
Multiple optimal solutions to the linear programming problem by the simplex method for specific feasible regions sometimes might lead to a loss of efficiency.
单纯形法是求解线性规划问题的有效方法。
Simplex algorithm is an effective method for solving linear programming problem.
二分单纯形算法中，线性规划问题的最优解是通过求解一系列子问题来实现的。
In order to solve linear programming problems, simplex method with bisection carries out pivoting operation on a series of sub-program.
应用推荐