I am trying my hands on examples on genetic algorithms in MATHWORK CENTRAL. I would like someone to explain to me what the empty matix means .I saw it was defined for for equality contraints. But why are there four
1 vue (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Honey Adams
le 28 Juin 2018
Réponse apportée : Walter Roberson
le 28 Juin 2018
function [c, ceq] = simple_constraint(x)
c = [1.5 + x(1)*x(2) + x(1) - x(2);...
-x(1)*x(2) + 10];
ceq = []; by
ObjectiveFunction = @simple_fitness;
nvars = 2; % Number of variables
LB = [0 0]; % Lower bound
UB = [1 13]; % Upper bound
ConstraintFunction = @simple_constraint;
rng(1,'twister') % for reproducibility
[x,fval] = ga(ObjectiveFunction,nvars,...
[],[],[],[],LB,UB,ConstraintFunction)
0 commentaires
Réponse acceptée
Walter Roberson
le 28 Juin 2018
[x,fval] = ga(ObjectiveFunction,nvars,...
[],[],[],[],LB,UB,ConstraintFunction)
can be rewritten as
A = []; b = [];
Aeq = []; beq = [];
[x,fval] = ga(ObjectiveFunction, nvars, ...
A, b, Aeq, beq, LB, UB, ConstraintFunction)
That is, there are no linear inequality constraints (A and b) and no linear equality constraints (Aeq and beq)
0 commentaires
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Genetic Algorithm dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!