Hello everyone,
Is it true that the _expression_ of the logical constraint (a and b) with the following constraints { x <=a ; x <= b ; a+b <= x+1} is less time consuming then its _expression_ with the only constraint 0 <= a + b – 2x <= 1 ?
Another question, in my program i have a constraint that computes the value of the variable V as the sum of variables V1, V2 and V3 (V=V1+V2+V3 ). My problem is that the value of V is integer and it sould be real. For instance, V= 23 rather than 23.3. Do you have any suggestion for the origin of the problem ?
Best regards
Esma