搜索资源列表
Matlab求解线性规划
- 此程序在matlab环境下运行，适于求解线性规划一类问题。（单纯形法）-this procedure in running Matlab environment suitable for solving a class of linear programming problems. (Simplex)
单纯形法
- Matlab下的，很不错哦
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
simplex_algorithm
- 单纯形算法源程序，具有选择是求解目标值的最大还是最小问题，同时也具有可行性变量约束限制-Simplex algorithm source with the target choice is to solve the biggest problem is still the smallest, but also with the feasibility of variable binding constraints
Revisedsimplexmathod
- 此算法为改进的单纯形算法，也是运筹学中要用到的方法，可以运行的-revised simplex method
cPP-matlab
- 应用于电力系统最优运行。 是C++与matlab相结合的源码程序，充分利用了matlab长于矩阵处理的优势。 程序实现了运筹学中的单纯形算法。-This procedure can be used for the optimal operation of the power system which combines C++ and matlab, and makes the most of matlab for matrix operations. The source code
Linear-programming
- 线性规划matlab算法，包括单纯形法，修正单纯形法，大M法，变量有界单纯形法。-Matlab algorithm of linear programming, including the simplex method, revised simplex method, big-M method, the variable bounded simplex method.
matlab-code
- 几个多目标求极值的Matlab算法，包括模式搜索法、Rosenbrock法、单纯形法、Powell法、最速下降法、共轭梯度法、牛顿法、信赖域法-Matlab algorithm, several multi-objective extremum including pattern search method, Rosenbrock method, simplex method, Powell method, the steepest descent method, conjugate gradi
simplex-method
- matlab程序下的单纯形法，其中有二阶段法，大M法，灵敏度分析-simplex method with matlab,including two stage method,big M method and sensitivity analysis
Simplex2phase
- matlab两阶段单纯形法解线性规划问题的函数，有详细的注释和说明，还有一个word文档是用该程序解决实际问题的一个例子。-Matlab codes for simplex 2 phase algorithm, detailed comments and instructions, and a example using this code to solve a real problem.
matlabNLP
- matlab 编写的非线性优化算法源码，注意，不是应用，而是把函数的源码。包括单纯形，牛顿法等基本源码-matlab nonlinear optimization code, is the resource of function, including simplex,Newton ...
单纯形法Matlab程序-2016-11-17
- 一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is