Here is the problem.
Equation 2 and 8 contains constant values and as far as I know solver checks for infeasibility by setting all variables to 0, so final equation looks like 0=e=70,50,etc.
Eq2(i,n)…
S(i,n)-B(i,n) =e=(s0(i)-b0(i))(ORD(n)=1) + (S(i,n-1)-B(i,n-1))(ORD(n)>1)+P(i,n)-zeta(i,n) ;
Eq8(j,n)(not mn(j,n))..
sum(f Fj(f, j),
sum(ff $(Fj(ff,j) and (ord(ff) ne ord(f))),
X(f,ff,j,n))) + 1 =e= sum(f$Fj(f,j),Y_f(f,j,n));
where X,Y_f,S,B are variables and s0,b0, zeta are parameters with values of 0,0,not 0.
Basically, it looks like that VAR1+VAR2+PARAMETER=e=VARIABLE
I just can’t come up with the way how I should put conditions for infeasibility to disappear or reformulate it so the problem would remain MIP.
–
To unsubscribe from this group and stop receiving emails from it, send an email to gamsworld+unsubscribe@googlegroups.com.
To post to this group, send email to gamsworld@googlegroups.com.
Visit this group at http://groups.google.com/group/gamsworld.
For more options, visit https://groups.google.com/d/optout.