Here Tins is a decision variable of size=(24,1) in my optimization problem. The value of Tins(min_des) =20 while value of Tins(max_des) = 23.
I have tried using the following constraints for the above equation in MILP problem.
(Tmin – Tins) – M1*(1-BCac) <= 0 where M1 is an upper bound on (Tmin – Tins)
(Tins – Tmax) – M2*BCac <= 0 where M2 is an upper bound on (Tins – Tmax)
But if its supposed that Tins=27
then my first constraint gets satisfied with both BCac=1 and BCac=0
although the second constraint is satisfied at BCac=1 only, which is correct.
But due to the first constraint, my program is getting an infeasible solution.
Any help would be deeply appreciated.
Best Answer