GA optimization inequality constraints

1 次查看(过去 30 天)
Hello community,
I have been trying to solve a optimization problem for which my inequality constrains are as follows:
Say if X is the solution (1*2000 matrix), my constraint is that every next value for the X matrix should be higher than the previous value. Lets say a is value of X at 1st position (X1) and b is the value at second X2. So constraint is b-a >= 0.01; To write it in terms of less than, since ga takes constraints as A.X<=b, we have (a-b <= -0.01).
But when iam trying to build A matrix and B matrix, when i give negative inputs in B matrix i always get the error: Could not find a feasible initial point.
Can someone help me in - how to define this constraint without using a negative constant value? or is there any other way to do the same? I have been struck in this problem for quite sometime. Please give me any siggestions.
Thanks.

采纳的回答

Matt J
Matt J 2019-8-30
编辑:Matt J 2019-8-30
The construction of the A and b matrices should be,
A=-diff(speye(2000));
b=-0.01*ones(2000,1);
If you have done this, then there is nothing incorrect about the way you have built the constraints, assuming X(i+1)-X(i)>=0.01 are indeed the conditions you want. You should investigate whether the problem truly does have a feasible solution under these constraints and whatever other constraints you have imposed.
  6 个评论
Nivedhitha S
Nivedhitha S 2019-9-3
Thanks for noticing that. But when i tried using something like this also, I got the same error. ie., whenever i used a negative value for b matrix i got the error.
b= zeros (2880,1);
for n = 1:4:no_term-4
b (n) = -0.01;
end
for n = 2:4:no_term-4
b (n) = -0.01;
end
for n = 3:4:no_term-4
b (n) = -0.0001;
end
for n = 4:4:no_term-4
b (n) = -0.001;
end
Matt J
Matt J 2019-9-3
编辑:Matt J 2019-9-3
They are still too large to satisfy your bounds.

请先登录,再进行评论。

更多回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Solver Outputs and Iterative Display 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by