顶点所对应的可行解称为基本可行解。
Feasible solution corresponding to the vertex is called a basic feasible solution.
因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。
Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached.
针对这一问题，文章提出了求非负变量等式约束基本可行解的一种方法。
In this paper, the authors establish a new method of finding the base feasible solution for linear program subject to non-negative variables and equality constraints.
针对这一问题，文章提出了求非负变量等式约束基本可行解的一种方法。
In this paper, the authors establish a new method of finding the base feasible solution for linear program subject to non-negative variables and equality constraints.
应用推荐