搜索资源列表
对偶单纯形法
- matlab 关于对偶纯形法的最优化程序的实例编程，求解最小值-Matlab purely on the dual method of optimization procedures programming examples, the minimum solution
单纯形算法程序包
- 线性规划中著名的单纯形法。本程序就是基于单纯形算法写的计算线性规划的小软件。初学乍练，希望对大家有帮助。-linear programming famous simplex method. This procedure is based on the simplex algorithm for the calculation was made of small linear programming software. Beginners Pottinger training, we hope t
单纯形法
- 单纯形算法的c语言源代码-simplex algorithm c language source code
单纯形法2
- 单纯形算法的C++版-simplex algorithm C version
单纯形法代码c
- 单纯形解决线形规划问题的C程序代码（c）
线性规划_单纯形
- 本程序使用VC++编写的,用于实现运筹学中的线性规划的单纯形法,开始数据以在程序开始进行初始化,主要是用来检验算法,具体数值可根据需要进行初始化-procedures for the use of the VC prepared for the realization of operational research, linear programming of the simplex method, the beginning of the data to begin initializatio
非线性规划_单纯形
- 本程序实现运筹学--非线形规划中的单纯形法,求fmin(X)=4*(X1-5)*(X1-5)+(X2-6)(X2-6)的具有最小值时的最优解,如需改变所求函数,在子函数f中修改即可-the program tacticians -- non-linear planning for the simplex method, seeking fmin (X) = 4 * (X1 - 5) * (X1 - 5) (X2-6) (X2-6) with the minimum of the optimal
pid
- 单纯形法整定pid参数,simulink环境,单纯形法很依赖初值的选取,在canshu.m中输入初始值。-Simplex method pid tuning parameters, simulink environment, simplex method is very dependent on the selection of initial value, in canshu.m enter the initial value.
xxgh
- 此程序在matlab环境下运行，适于求解线性规划一类问题。（单纯形法）-This program runs under matlab environment, suitable to solve a class of linear programming problems. (Simplex method)
fenxianxingguihuazhongdancunxingfaqiujizhideCyuyan
- 日常生活生产中有大量求极值的问题，一般计算机实现用穷举法或牛顿迭代法，但其计算量非常大。使用单纯形法可根据单纯形各个顶点的目标函数值，加以比较，丢掉其中最坏的点，代之以新点，。-Daily production of a large number of extremum problems, general computer implemented by the exhaustive method or Newton' s iterative method, but its calculat
linear-program-java
- 线性规划中的单纯形法的java实现，代码有测试类，还有实现类-Linear programming simplex method in java, the code is a test class, as well as the implementation class
[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
danchunxingfa
- 单纯形法，优化方法课程中，实现求解线性规划问题的通用方法(In the course of simplex method and optimization method, a general method for solving linear programming problems is presented)
Simplex method for linear programming
- 线性规划中的单纯形法的c实现，代码有测试类，(Simplex method for linear programming)
SimplexMethod
- 一个单纯形法计算线性规划的GUI，可用于运筹学作业的参考(A simplex method for computing GUI of linear programming)
54895228simplex
- 一种多学科优化算法-单纯形法，提供大家参考.(A multidisciplinary optimization algorithm - simplex method)
单纯形法1
- 用于运筹学中的运输、分配等问题的解决，节省了计算者手动运算的时间，快捷地得出问题结果，作出决策。(The solution of transportation, distribution and other problems in operational research)
dcxf
- 单纯形法（用于注册用但是能运行的），用于单纯形表法解决线性规划(Simplex method (used for registration but can run), for linear programming with simplex table method.)
单纯形法
- 单纯形法的c#代码。这是一个简单的单纯形法的c#代码，仅供参考使用，各位自行筛选获取信息
单纯形法
- 运筹与优化，单纯形法的实现，可用于求最大值，上机作业