搜索资源列表
单纯行法
- 单纯行法用于线性规划的计算 求解最优化问题-simple linear programming method for the calculation of solving optimization problems
C++数学计算
- 用于解决目标函数的最优化问题,目标函数自编,在vc++6.0中运行通过 -objective function for the solution of optimization problem, the objective function writing, the vc + +6.0 running through
gradien_searching
- 在最优化问题中,常用需求取代价函数的最小值,该程序实现了最速梯度求最小的功能-in optimization problems, the demand to replace the commonly used function of the minimum price. the program achieved the steepest gradient for the smallest functional
pr_loqo
- loqo用内点法进行解最优化问题。对于训练SVM特别有用。-loqo using interior point method for Solving optimization problems. Training for SVM particularly useful.
tubuchuanyue
- 徒步穿越荒漠数学模型 研究的是徒步穿越荒漠耗资及行程时间安排的最优化问题-across the desert on foot mathematical model study of crossing the desert on foot and the cost of the trip scheduling optimization problems
tianji
- 田忌赛马问题:用动态规划问题,解决最优化问题,不错的算法哦-Tianji race issue : dynamic programming problem solving optimization problems, a good algorithm oh.
Dynamic_Programming
- 多阶段决策过程( multistep decision process )是指 这样一类特殊的活动过程,过程可以按时间顺序分解成若干个相互联系的阶段,在每一个阶段都需要做出决策,全部过程的决策是一个决策序列。 动态规划 ( dynamic programming )算法 是解决 多阶段决策过程最优化问题 的一种常用方法,难度比较大,技巧性也很强。利用动态规划算法,可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是:将待求解的问题分解成若干个相互联系的子问题,先求解
program_of_fabonacci_method_writed_in_matlab
- 我学着用matlab编写的用来解最优化问题的fabonacci程序-I learned to use Matlab prepared by the optimal solution to the problem fabonacci procedures
OptimizeMethod
- 最优化问题的线性规划求解源码(研究生课程:最优化计算方法)-optimization problem solving linear programming source (postgraduate courses : optimization method)
fuhexing
- 说明: 1.本程序为复合形法 !* 2.程序功能是求解约束最优化问题-Note : 1. The procedures for the complex method! * 2. Programming is solving constrained optimization problem
zuiyouhua11
- 最优化问题:变尺度算法求最多元非线性函数的最值问题-optimization problem : Changing the scaling algorithm for the nonlinear function of the value problems
ga0000000000000
- 遗传算法的一个实例。m个工件分配给m架机床的效益最优化问题,使用一种遗传算法解决。-a genetic algorithm examples. M m allocated to the workpiece-machine efficiency optimization, the use of a genetic algorithm.
n1qn3-lib
- 最优化算法,应用有限内存拟牛顿方法(Limited Memory (variable-storage)quasi-Newton method)求解高维最优化问题,使用更多的内存将使算法更有效。-optimization algorithm, Application limited memory quasi-Newton method (Limited Memory (variable-stora ge) quasi--Newton method) for high-dimensional opt
SolverTable
- 这个是斯坦福大学商学院MBA教学用的Excel 集成的Visual Basicl语言编写的Solver软件,可以解决商业路径最优化问题-This is a Stanford University Business School MBA teaching Excel integration of the Visual Basi cl language prepared by the Solver software can solve business problems path optimizat
支撑材料
- 单纯性法的C++程序,或者Java程序,要求能够解任意种最优化问题(C++ language or Java)
无约束一维极值问题
- 求一维无约束问题的最优解。包括很多传统的优化算法如牛顿法等。(Using Newton method to find the optimal solution of one dimensional unconstrained problems.)
约束非线性优化问题求解
- 最优化 ,matlab, 约束非线性优化问题求解,约束非线性优化问题(Constrained nonlinear optimization problem)
最优化实验外惩罚函数法
- 最优化实验外惩罚函数法,我们根据约束的特点,构造某种惩罚函数,然后加到目标函数中去,将约束问题求解转化为一系列的无约束问题。这种“惩罚策略”,对于无约束问题求解过程中的那些企图违反约束条件的目标点给予惩罚。(According to the characteristics of constraints, we construct some penalty function, and then add it to the objective function to transform the co
Newton
- 求解无约束最优化问题,Newton方法包括基本Newton法,拟Newton法等BFGS,DFP方法(Solving unconstrained optimization problems, Newton method)
精通matlab最优化计算光盘(第二版)
- 本书附带光盘中包括了作者全书所有自己编写的算法对应的MATLAB的M文件。所有代码按照章节存放在各个文件夹下,如“第6章 无约束一维极值问题”文件夹下存放了本书第6章所有的算法程序代码。对于算法的程序代码,在光盘中存为同函数名的M文件,例如,minHJ.m表示用黄金分割法求解一维函数的极值的程序,依此类推。(The book contains CD-ROM, including all the M files of the MATLAB written by the author. All th