danchunxingfa
代码说明：
用单纯形法解线性规划 根据单纯形法的原理，在线性规划问题中，决策变量（控制变量）x1，x2，…x n的值称为一个解,满足所有的约束条件的解称为可行解。使目标函数达到最大值（或最小值）的可行解称为最优解。这样，一个最优解能在整个由约束条件所确定的可行区域内使目标函数达到最大值（或最小值）。求解线性规划问题的目的就是要找出最优解。 (According to the principle of the simplex method, in linear programming problem, the decision variables (control variable) x1, x2,... X n value is called a solution, meet all of the constraint conditions of the solution of the called feasible solution. The objective function to achieve maximum (or minimum) feasible solution of the optimal solution is called. So, an optimal solution by constraint conditions throughout the feasible region determined the objective function to achieve maximum or minimum value). To solve the linear programming problem is to find out the purpose of the optimal solution. )
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
