搜索资源列表
danchun
- 用单纯形法求解线性规划最优解，能输出求解过程中产生的单纯形表，并输出最优解-Simplex method for solving linear programming optimal solution, can solve the output generated in the process of simplex tableau, and output the optimal solution
originalsimpleM111.m
- 原始单纯形法（大M法，无需给出初始基变量）。输入：C是n维行向量，A是m*n的系数矩阵，b是m维列向量 输出：x最优解（如果有的话），fval最优值，flag解的状态说明，interation求解时的循环次数-The original simplex method (big M method, without giving the initial basic variable). Input: C is the n-dimensional row vector, A is the coef
[M]
- 原始单纯形法（大M法，无需给出初始基变量） Programmed by Liyang(faruto s Studio~!) BNU MATH Email:liyangbnu@mail.bnu.edu.cn QQ:516667408 last modified 2008.4.27 求解标准型线性规划:max C*X s.t. A*X=b (b>=0) X>=0 输入：C是n维行向量，A是m*n的系数矩阵，b是m维列向量- Of the origina
Simplex-method
- Simplex-method on C++
GUI-based-on-Matlab
- 遗传算法改进的模糊C-均值聚类MATLAB源码。用单纯形法来做的-Improved genetic algorithm fuzzy C- means clustering MATLAB source. To do with the simplex method
单纯形
- 单纯形法matlab程序，输入A,b,c，得到整个过程的单纯形表与最优解，最优值，每一步变换的单纯形表都有给出，完全没有错，很详细，有运行结果说明。(The simplex method matlab program, input A, B, C, get the simplex table and the optimal solution of the whole process, the optimal value, the simplex table of each step transf