couette-matlab

分支界限费用矩阵的说明文档，非常实用,建议下载哦(Branch line cost matrix documentation, very practical, it is recommended to download Oh)

说明：  用于求解耦合速率方程的四阶龙格－库塔数值解法(4th order Runge-kutta methods for solving the coupled rate equations)

各种插值算法，高斯插值算法，线性插值算法，牛顿插值法，哈米特矩阵插值算法(Various interpolation algorithm, the Gaussian interpolation algorithm, linear interpolation algorithm, Newton interpolation, Hammett matrix interpolation algorithm)

基于Laguerre多项式的拟合程序，可以控制多项式的结束，以及变量alpha。(Based on Laguerre polynomial fitting procedure, you can control the end of polynomials, and variable alpha.)

我自己用c语言写的64点基4FFT算法，在visual c++ 6.0环境下编译通过。同matlab结果一致。(My own use C language to write the 64 based 4FFT algorithm, in visual c++ 6 compiler environment through. Results consistent with matlab.)

贝叶斯网络结构学习爬山算法的改进方法，更准确(Improved Bayesian network structure learning climbing algorithm, more accurate)

说明：  相场法材料计算的model C-pure对应的基础相场计算代码，初学者可取(The phase field calculation code corresponding to the model C-pure calculated by the phase field method material is suitable for beginners.)

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)

matlab in ga solving travel saleman problem.

说明：  fortran 学习软件非常有用啊，请管理员加我。