搜索资源列表
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
xxgh_M
- 与上次上传的原始单纯形算法属于系列问题，本例用大M法求解线性规划问题-From the last of the original simplex algorithm belonging to family issues, in this case M method to solve large linear programming problem
1
- 这个系统基于单纯形法的基本思想概念，通过大M这一思想，派生出对偶单纯形法这个工具，希望这个程序能给大家带来实在的用途。-This system is based on the simplex method the basic idea of the concept of a large M this idea, derived from a large M simplex method this tool, I hope we can bring this process is used.
Linear-programming
- 线性规划matlab算法，包括单纯形法，修正单纯形法，大M法，变量有界单纯形法。-Matlab algorithm of linear programming, including the simplex method, revised simplex method, big-M method, the variable bounded simplex method.
simplex-master
- simplex算法，是优化算法中的典型算法，本例方便需要调用该算法的学习者初步了解该算法的运用-A simple scr ipt to optimize a linear program using the SIMPLEX algorithm. The function "simplex" in simplex.m is the entry point for running an optimization.
simplex-method
- matlab程序下的单纯形法，其中有二阶段法，大M法，灵敏度分析-simplex method with matlab,including two stage method,big M method and sensitivity analysis
LP
- 此程序是用大M值单纯形法来求解线性规划,输入格式按标准型来输入，输入时有提示-This program is a large value of M simplex method for solving linear programming
simplex
- 单纯性法大M法和多阶段法的源程序，单纯性法大M法和多阶段法的源程序-Simple method big M method and multi-stage method of source, simple method big M method and multi-stage method of source
1
- 用单纯形法实现对线性规划中目标函数的求解，具体方法：大M法。-In the simplex method is used to implement the linear programming solution of the objective function, specific method: big M method.
min
- 无约束多维问题的m文件程序，包括鲍威尔法，单纯性法，最速下降法，BFGS方法等-Unconstrained multidimensional problem of m document procedures, including Powell method, simplex method, steepest descent method, BFGS method
单纯形法Matlab程序-2016-11-17
- 一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is