Tobias Achterberg

This should get fixed with our new Gurobi 10.0 release, which is scheduled for first half of November 2022.

This is a delicate issue. We only promise that we will be able to detect the following two cases as convex: 1. x^T Q x <= d with PSD matrix Q2. sum xj² - y² <= 0 with y >= 0 But Gurobi will also be...

You need to add each of your constraints with m.addConstr().

In your formulation, I think that you always need to use (1 - bi) for all the big-M constraints as you have formulated them.

I think that your big-M constraints are wrong. For example, b1=0 will force I[v][i] <= 120*SOC_avg[v][i] due to the first big-M constraint. This is not what you want. You only want to force constra...

For example, say you have four different regions based on the relationship of x and y in which you have different objective functions. Then you need four binary variables to indicate in which regio...

Yes, you can do this manually. But you can also just use the "and" general constraint: addConstr(z == and_(x,y)). Moreover, you can just stick with your quadratic objective function as indicated in...

Hi Austin, yes, your observation is correct. The fix in Gurobi 9.5 just means that those solutions are discarded from the solution pool. It does not mean that they are already pruned in the search ...

Thanks. I found the issue. Even if you disable cuts, we are allowing cuts to be generated in a cut loop that runs in parallel to the root node solve. As a workaround, you could instead set the CutP...

Hi Ellen, this is strange. I would like to investigate. Do you have an mps file with which you can reproduce the issue using the Gurobi command line tool? On Linux, you would call gurobi_cl Cuts=0 ...