搜索资源列表
d04540227
- delphi编译的运筹学单纯形法 操作方便-delphi compiled tacticians simplex method convenient operation
单纯型法
- 单纯型法，主要用于规划-simplex method, used mainly for planning
dualprog
- 对偶单纯形法求线性规划最优解-dual simplex method for solving linear programming problems.
LINEPROG(12K)
- 线性规划工具箱-performing the standard two phase simplex method on linear programming problems.具体介绍里面有
解线性规划的用乘数的单纯形法
- 解线性规划的用乘数的单纯形法-linear programming solution using the multiplier Simplex Method
线性规划的单纯形法c++
- 用c++实现的线性规划的单纯形法-use linear programming to achieve the Simplex Method
tbb
- 单纯形法c++编程，以解决运筹学中线性规划问题，程序简单明了，对于初学者来说是一个很不错的选择-Simplex Method c programming, operations research to solve linear programming problems, procedures simple and clear, for a newcomer is a very bad choice
tbb2
- 单纯形法c编程，可用于运筹学线性规划问题的解决，优化问题-Simplex Method c programming, operations research can be used for linear programming problem-solving, optimization, etc.
tbb3
- 单纯形法c++编程，可用于线性规划问题的研究解决优化问题-Simplex Method c programming, linear programming can be used to study and solve the problem of optimization problem
优化1
- 这是用单纯形法发来进行函数优化的程序，可以运行成功，需要的就下吧-This is sends in with the simplex method carries on the procedure which the function optimizes, may move successfully, download if you need
单纯行程序—戴卫国
- 这个程序是vc来实现的，他实现了单纯形法的功能。这是军事运筹里常常用到的-vc this procedure is achieved, he achieved the simplex method function. This is a military strategy often used in Lane
最优化作业C++源代码
- 用C++编的一些最优化作业中的程序,有Newton法,DFP法,共轭梯度法,单纯形法,内点法,外点法,内外点法,都能使用,我已经全部调试过了-C compile some of the most optimized operating procedures, Newton, DFP, conjugate gradient method, the simplex method, interior point method, the points outside the law, outside p
线性规划_单纯形
- 本程序使用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
整数规划法
- 本程序是在原来的单纯形法基础上改进的,主要用于分枝界定法求解的整数规划。 修正的地方： １．运用勃兰特原则 ２.人机互动-this procedure is in the original simplex method on the basis of improvement, mainly for Mycobacterium defined method of integer programming. The amendment : 1. Using the principle of
simplex method
- 单纯形法算线性方程
opt
- 实现单纯形法求解最优化问题的步骤，两步法实现，可自由输入参数-Simplex method to achieve optimization step, two-step implementation of free input parameters
yunchouxue.rar
- 运筹学ppt考试复习专用 第一章 线性规划与单纯形法 第二章 线性规划的对偶理论 第三章 整数规划 第四章 目标规划 第五章 运输与指派问题 第六章 网络模型,Operational research ppt exam review chapter dedicated linear programming and simplex method chapter on linear programming duality theory of integer programmi
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.
dancunxing
- 最优化理论与方法，一维搜索法，一条完整的单纯形法程序，用C语言编的-Optimization theory and methods, one-dimensional search, a complete program of the simplex method, using the C language. . .