Tobias Achterberg

You are adding variables with model.addVar() from within your callback? This just cannot work. What you have in your hand as a user is the original user model. But the branch-and-cut is performend ...

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...

The log file looks okay. It seems pretty difficult to find a feasible solution for your model. What you see in the table is the output of the branch-and-bound tree search. The algorithm successivel...

This is actually not a bug. It is due to the large (actually, infinite) domains of your variables and the consequences that this has for the piece-wise linear approximation that we use for the log ...

This looks like a bug. Thanks for reporting! I will investigate and check what is going on. Tobias