Michel Soares

It seems to me like there is a small confusion between the modelling (1-indexed) and the code (python is 0-indexed). It might make more sense to use range(0, len(T)-3) in your constraint.  

Hi Jianing Ding, I would recommend you export a LP file in both codes and compare them, it might show you differences in the model (C#, MATLAB). I am not sure by what you mean with "can't be dealt ...

Gurobi uses the standard IEE 754 double-precision format, which should amount to 64bits. See: https://www.gurobi.com/documentation/current/refman/real_numbers_are_not_real.html

A few things that I notice from the logs:1. You arrive at better/best solutions earlier using cutoffs. 2. In tighter cutoff scenarios, the solver takes longer to prove optimality and ends up explor...

I am unaware of a way to do this.Nonetheless, it seems unlikely to me that this would be beneficial in performance. Solving LP relaxations in the the branch and bound nodes are usually quite fast a...

Yes, different solutions come from exploring different branches/nodes of the branch and bound when solving a MIP. The solutions from the pool may also come from MIP heuristics that Gurobi uses.

ComputeIIS can sometimes take a long time. If you are running on the command line, you can pause anytime and write the current IIS, you do not have to wait until it finishes. One strategy with IIS ...

Hi Jordi. Regarding your IIS constraints: LoadAfterVisit_11_22_1: - 1100 C1711 - C3661 + C3727 >= 849 LoadAfterVisit_22_11_1: - 1100 C3235 + C3661 - C3727 >= 904 Let's assume C1711 is zero and C323...

Hi Scott, You may try doing this instead: quicksum(self.b_plus[j, i, t] for j in range(self.noCells) if j!=i) -                     quicksum(self.b_minus[i, j, t] for j in range(self.noCells) if j!=i)

Hello, This is a quote from the Start parameter page: "If the Gurobi MIP solver log indicates that your MIP start didn't produce a new incumbent solution, note that there can be multiple explanatio...