From: jamuna kamaraj on
hai
i have one doubt in GA optimization.
My problem is : min(f)=x1+x2+x3+x4
s.t [A][x1 x2 x3 x4]<= [b]
x(i)={0,1} i=1to 4
when i have to solve by GA, x is calculated as fractional value. But my x is binary number. How do i use GA for this problem. I expect your valuable comments or codes...
From: Torsten Hennig on
> hai
> i have one doubt in GA optimization.
> My problem is : min(f)=x1+x2+x3+x4
> s.t [A][x1 x2 x3 x4]<= [b]
> x(i)={0,1}
> x(i)={0,1} i=1to 4
> when i have to solve by GA, x is calculated as
> fractional value. But my x is binary number. How do i
> use GA for this problem. I expect your valuable
> comments or codes...

There are only 2^4 = 16 possibilities for the vector
[x1 x2 x3 x4] ; just check which combination yields
the minimum for the objective function.

Best wishes
Torsten.
From: Bruno Luong on
"jamuna kamaraj" <jamunakamaraj(a)gmail.com> wrote in message <hpub15$6a6$1(a)fred.mathworks.com>...
> hai
> i have one doubt in GA optimization.
> My problem is : min(f)=x1+x2+x3+x4
> s.t [A][x1 x2 x3 x4]<= [b]
> x(i)={0,1} i=1to 4
> when i have to solve by GA, x is calculated as fractional value. But my x is binary number. How do i use GA for this problem. I expect your valuable comments or codes...

help BINTPROG

Bruno