单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解，再鉴别；若仍不是，则再转换，按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。-Simplex method, the general method for the linear programming problem. Simplex is American mathematician G.B. Dan cheek first proposed in 1947. According to its theory is: linear programming problem in the feasible region is a n d vector space Rn polyhedral convex set, the optimal value if there will be some vertices in the convex set. The vertices of the feasible solution is called the basic feasible solution. Simplex method the basic idea is: to find out a basic feasible solution, to identify it, to see whether the optimal solution　If not, then according to certain rules to another to improve the basic feasible solution, then identify　If still not, transform again, click here to repeat. Because the number of basic feasible solution co., LTD., the limited time converting will can get the optimal solution of problem. If the problem no optimal solutions also can use this method.