Hi,
I am trying to solve a quite simple MILP with the following structure:
Once i start adding lower bound to the x_g variables, I get an error saying that the model is infeasible. The IIS shows:
Minimize
Subject To
R257: C14 + C166 <= 47945.20547945205
R277: - C14 <= -25000
R429: - C166 <= -25000
Bounds
C14 free
C166 free
End
C14 and C166 is the same variable for two time steps. They are suppose to have the lower value 25000. The lower bound A matrix is modelled as diagonal -1 matrix, and the corresponding b vector as (LowerValue*-1) in case of negative lower values.
What is the problem?
Thanks!
You received this message because you are subscribed to the Google Groups "Gurobi Optimization" group.
To unsubscribe from this group and stop receiving emails from it, send an email to
.