Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached.
因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。
The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
应用推荐