搜索资源列表
最优化作业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. . .
danchunxingfa
- 运筹学基本的单纯形法C语言程序能运行！本人以试！-Basic operations research simplex method C language program to run! I have to try!
NLP
- matlab最优化程序包括 无约束一维极值问题 进退法 黄金分割法 斐波那契法 牛顿法基本牛顿法 全局牛顿法 割线法 抛物线法 三次插值法 可接受搜索法 Goidstein法 Wolfe.Powell法 单纯形搜索法 Powell法 最速下降法 共轭梯度法 牛顿法 修正牛顿法 拟牛顿法 信赖域法 显式最速下降法-matlab optimization program includes one-dimensional extremum problem without constraint adva
Code_MATLAB_Optimization
- 这是龚纯《精通MATLAB最优化计算》随书源码(M文件)。基于MATLAB优化工具箱，代码包含的内容有：牛顿法等无约束一维极值问题、单纯形搜索法等无约束多维极值问题、Rosen梯度投影法等约束优化问题、L-M法等非线性最小二乘优化问题、线性规划、整数规划、二次规划、粒子群优化、遗传算法。-This is pure Gong " Mastering MATLAB optimization calculations," with the book source (M file)
Iter
- 整数规划程序，好不容易找到哦，很不错，对编写单纯形法和整数规划都有参考价值-Integer planning process, hard to find Oh, very good, the preparation of the simplex method and integer programming have a reference value to
PID-optimization
- 基于Matlab的PID参数最优化设计(fminsearch单纯形法)-Matlab-based design of PID parameter optimization (fminsearch simplex method)
unconstrained_optimization
- VC实现的，多维函数搜索，无约束优化方法， (1)最速下降法 (2)阻尼牛顿法(3)共轭梯度法 (4)鲍维尔法(5)变尺度法(6)单纯形法 -VC implementation, multi-dimensional function of search, unconstrained optimization methods, (1), steepest descent method (2) damped Newton' s method (3) conjugate gradient
vc
- vc编的线性规划源码,单纯形方法求解线性规划问题-vc-compile-source linear programming, simplex method for solving linear programming problems
Text1
- 单纯形法的村c++程序，直接运行就可以使用-Simplex method of the village c++ Procedures can be used directly to run on
mySimplex
- 单纯形法：为求解线性规划问题的通用方法。一般在数学建模课上老师要求实现，这是为自己做的一个，希望各位上课时方便交作业。-Simplex Method: Solving linear programming problem for the general method. General in the mathematical modeling class the teacher asked the realization that this is done for their own one, I
PID_danchunxin
- 基于单纯形无约束方法的PID参数整定。在myfun.m中输入目标函数和控制对象的传递函数，运行主函数即可得到阶跃响应曲线-Based on unconstrained simplex method of PID parameter tuning. Myfun.m enter in the objective function and control the transfer function of the object, run the main function can be obtained
Optimization_procedures
- 本程序是单纯形法，参考书目:河海大学<吴凤平>运筹学方法与应用-This procedure is a simplex method, bibliography: Hohai University < WU Feng-ping> Operations Research Methods and Applications