Tobias Achterberg

As far as I can see, you are minimizing your objective function. Hence, the primal (incumbent) bound is an upper bound, while the dual bound is a lower bound. You can provide a "MIP start" solution...

So, what happens with different seeds? Do you see that independent on the seed, Windows is slower than Mac? When you look at the Windows Task Manager and observe that only 20% of the CPU is used, i...

Hi Henrique, you could install a callback function that queries the MIP_NODLFT data. The first time this becomes non-zero, you are at the end of the root node. Alternatively, you could launch your ...

As I said, this could just be due to performance variability (i.e., good or bad luck with the heuristic decisions that the solver takes). For example, it might be that on Mac Gurobi decides more qu...

This is really strange. Your models are not that large that they would lead to 300 seconds just for solving an equation system. Yes, could you please send your data to achterberg (at) gurobi (dot) ...

I can see that between 1200 and 2500 seconds, the node throughput is pretty low. This can happen, because at some points during the search we occasionally apply very heavy algorithms with cutting p...

No, there are no parameter settings that will *certainly* make the process faster. It is always a matter of trying. And if you want to systematically try parameter combinations you should take a lo...

I suspect that this is a numerical issue. When you fix the bounds of the variables to your solution values, what does Gurobi say at the end about the violations of the solution? Does it report viol...

So, you are interested in why some variables appear with an objective coefficient of 0 in the LP file? The reason is one particular aspect of the LP file format. Namely, if you have variables that ...

This is really strange and seems to point to a bug, either in your code or in ours. Would it be possible to send me the Python code that produces this issue? Ideally, you would first simplify and r...