How to convert a branch structure to constraints.

[Kaho Suzuki]

Hello, I've encountered a problem. Would you please help me?

Here is a branch structure:

for i=1:24

    a(i)=A1(i)*B1(i)-A2(i)*B2(i);

    if double(a(i))>0

        b(i)=a(i);

        c(i)=0;

    elseif double(a(i))<0

            b(i)=0;

            c(i)=-a(i);

    else 

            b(i)=0;

            c(i)=0;

    end       

end

Where A1,B1,A2 and B2 are all 1*n sdpvars. 

Now I'd like to convert it to constraints. Is there any way to reach it?

[Johan Löfberg]

https://yalmip.github.io/tutorial/logicprogramming/#constraints

https://yalmip.github.io/modellingif

although it looks like you simply have b = max(a,0) and c = min(a,0)

[Johan Löfberg]

should be c = max(-a,0)

[Kaho Suzuki]

Thanks a lot