In 1947, George Dantzig developed an efficient method, the simplex algorithm, for solving linear programming problems.
在1947年,George Dantzig开发了一种效率方法——simplex算法——来解决线性编程的问题。
The answer is in the algebra behind the simplex algorithm, but explaining how it works is beyond the scope of this article.
答案要看 simplex 算法背后采用的代数关系,但是有关它是如何工作的解释已经超出了本文的范围。
The paper presents a new algorithm which is named Generalized Simplex Algorithm. It is an extended algorithm of the Simplex Algorithm.
提出了一个新算法,取名为广义单纯形算法,它可被看作是单纯形法的扩展算法。
应用推荐