单纯形法Matlab程序-2016-11-17

代码说明：

  一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)

文件列表：

Simplex_Method.m, 252 , 2016-11-18
column_generation.m, 509 , 2016-11-03
simplexTab.m, 3320 , 2016-11-18
单纯形Matlab代码（成功版）, 0 , 2017-07-21
单纯形Matlab代码（成功版）\interChange1.m, 232 , 2016-11-19
单纯形Matlab代码（成功版）\multMat.m, 268 , 2016-11-18
单纯形Matlab代码（成功版）\multiFromRowToRow.m, 262 , 2016-11-18
单纯形Matlab代码（成功版）\pivot.m, 404 , 2016-11-18
单纯形Matlab代码（成功版）\simplexTab1.m, 2718 , 2016-11-19
单纯形法.java, 4560 , 2016-11-18