Genetic algorithm optimisation toolbox
Show older comments
I have set of 50 equations like z1=a1(x1)+b1(x2)+c1(x3)+d1(x4) to z50=a50(x1)+b50(x2)+c50(x3)+d50(x4) . I need to optimise the weights of variables x1,x2,x3,x4 which should be bound to [1 to 5]. The value z1 to z50 varies between 140 to 180. Coefficient (a1 ,b1 ,c1,d1) to (a50,b50,c50,d50) also varies between 1 to 10. How to get solution using ga in optimisation toolbox or any other methods?
10 Comments
Walter Roberson
on 21 Mar 2019
It is not entirely clear which are the knowns and which are the unknowns ?
Balaji L
on 21 Mar 2019
Walter Roberson
on 21 Mar 2019
What is being optimized? Your z* equations form linear equality constraints, and your [1 to 5] form upper and lower bound constraints, but I see no minimization going on. With the information we have, any set of values that satisfies those constraints would be equally as good.
Balaji L
on 21 Mar 2019
Walter Roberson
on 21 Mar 2019
Given any two sets of x1, x2, x3, x4, x5, where each set satisfies the linear equalities z1 through z50 and the bounds constraints 1 to 5 for the x* values, then how would you decide which of the two sets of x1, x2, x3, x4, x5 is "better" ?
Are you sure you want 50 equality constraints? When you have more equality constraints than variables then unless most of the constraints are redundent, then most of the time there is no solution.
Balaji L
on 21 Mar 2019
Walter Roberson
on 21 Mar 2019
If your correlations were all non-NaN then this would just be the constrained version of
[A B C D E F G]\Correlation
but it is difficult to do much useful when only one of the correlations is non-NaN.
Balaji L
on 21 Mar 2019
Walter Roberson
on 21 Mar 2019
I do not understand what the 0.2419 correlation is measuring or how Y fits into all of this??
Balaji L
on 21 Mar 2019
Accepted Answer
More Answers (0)
Categories
Find more on Genetic Algorithm in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!