Ronald van der Velden

Hi, You could use the ResultFile parameter to specify where Gurobi should store a logfile while solving your model. It would also contain information about the method used to solve your model (e.g....

Ah, the fact that there's a variable on the left side does not allow a quick fix. Still, you could try multiplying both sides by \[max_{j,l,k}^{box}\] to see if this improves performance. I'm assum...

Hi Eugene, You could do something like this: import gurobipy as gpfrom gurobipy import GRBH = range(3)K = [7, 13, 16]with gp.Env() as env, gp.Model(env=env) as model:    V = model.addVars(H, name='...

Hi Jaime, Instead of using Pool.map, you could look at a slightly lower-level approach where you start N processes and keep them running continuously (maintaining their own Gurobi environment objec...

Hi Lennard, My first reaction would be that you could separate (x * l)/y from y/y=1. Then the question is where this expression would be used - in a constraint or the objective function? For a cons...

Hi Jiakang, There are several options for this. You could use the model.copy() function. This gives you a complete, independent copy of the model. It also means any references to variables/constra...

The full puzzle is still not entirely clear now. Is the challenge now to partition the rows into four groups, where each row gets a +/- sign, and the product/sum within each group must match a cert...

The approach is roughly what I had in mind. The best way to verify if it's 100% correct, would be by testing it on several datasets. Kind regards,Ronald

Hi, If I understand the puzzle correctly: You need to choose a value -1 or +1 for each row Then you need to select a subset of rows For those rows, the sum of each -1/+1 multiplied by a given cons...

Hi Mohammad, One cause might be that you look at the X attribute instead of the Xn attribute for retrieving the solutions. X will always contain the best solution irrespective of what you do with S...