Originally posted by: sandeepsinghchauhan

How can I write the following constraint wihout using minl?

forall(R in Roots){
  N[R] == minl(1,M[R]);
}

where N is binary decision variable and M is continuous decision variable

Hi,

why don't you want to use minl ?

Instead of minl you could use piecewise of course:

Instead of

N == minl(1,M);

you would then write

N == piecewise{1->1;0}(0,0)M;

regards

Originally posted by: sandeepsinghchauhan

could you please help me to write it in <= or >= form?

Hi,

instead of minl and piecewise you could use logical constraints too.

you could write

(M>=1) => (N==1);
(M<=1) => (N==M);

I would use minl.

Why not use minl ?

regards