登录
首页 » matlab » function-optimization-GA

function-optimization-GA

于 2013-11-20 发布 文件大小:1KB
0 212
下载积分: 1 下载次数: 20

代码说明:

  多元优化 单峰目标函数 多峰目标函数 遗传算法 matlab源码( multivariate optimization, Unimodal objective function, multimodal objective function, genetic algorithm ,matlab source)

文件列表:

Multiple elements optimization matlab GA

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • audiogram
    Hearing test. It using music card to test left and right ear seperately. It contains graphic iterface[*.fig] and m-file. It works fine with 6.5 version of Matlab.
    2009-02-27 03:33:35下载
    积分:1
  • svmc
    classification with svm
    2010-10-23 02:25:54下载
    积分:1
  • MATLAB
    ODE function 求解一阶线性常微分方程(ODE function for solving first-order linear ordinary differential equations)
    2013-12-07 07:07:55下载
    积分:1
  • k_means
    杜达的《模式分类》第二版的配套的Matlab源代码杜达的《模式分类》第二版的配套的Matlab源代码杜达的《模式分类》第二版的配套的Matlab源代码 ( pattern classificationthe second edition of the supporting Matlab source codethe supporting Matlab source code Duda39quot pattern classification,quot the second edition of the supporting Matlab source code)
    2010-05-13 15:41:09下载
    积分:1
  • DCDC
    DC/DC converter的simulink模型(Simulink modell of DC/DC converter)
    2018-01-12 16:37:53下载
    积分:1
  • keystone
    说明:  keystone,距离补偿算法,检测运动目标(keystone,distance compensation algorithm to detect moving targets)
    2021-04-10 20:08:58下载
    积分:1
  • buffer
    File for performance of a buffer
    2012-11-08 04:39:30下载
    积分:1
  • 永磁电机滑模观测器模型位置跟踪
    说明:  一个永磁同步电动机的滑模观测器仿真模型,可以很好的实现位置跟踪与控制。(A simulation model of sliding mode observer for PMSM can realize position tracking and control well.)
    2021-03-17 21:49:21下载
    积分:1
  • hf
    说明:  Hartree fock in quantum
    2010-07-08 14:52:31下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载