Ronald van der Velden

In terms of performance, I'm a bit concerned the constraints linking variables y and w/e could have a bad impact, especially when the number of weeks grows. Fortunately you might get away with a pu...

Just to be sure - I think the current issue is that you solve the relaxed model, but then request "Pi" for the original model (which has not been solved, hence Pi is not available there). Are you o...

in c there are 225*3038 elements and only 3038 of them have values I guess for every i there is exactly one l with a non-zero value? In that case: You don't need the inner-most loop iterating over...

Hi Carl, Please give it a try yourself and feel free to ask a more specific question once you need help with a particular step. Kind regards,Ronald

Interesting! Matrix multiplication in GAMS might be more efficient than "raw" C# - indeed this has nothing to do with the solver being used, whether that's Gurobi or CPLEX. But I'm still curious to...

Exactly, without "real" rosters produced by a subproblem. I believe since you have slack variables, there is always a solution to the master problem right? So you could generate the obvious empty r...

Hi Carl, My suggestion would be to try and implement this step-by-step. Looking at your code, I get the impression some parts are not yet valid Python (some syntax errors, and variables referenced ...

Hi Betül, Thanks for posting on the forum! This seems to be a general performance issue unrelated to Gurobi, unless I'm missing something? Nevertheless I'm curious what the magnitude of J and L is ...

As you can see in the article, the problem with your constraint is that it's not properly defined when something is "close enough to zero". If 0.0 is not allowed, would 0.001 be allowed, or 0.0001 ...

Hi, When you call m.getVarByName(), the result is a Gurobi variable. You can then either get the optimal solution value using var.X or the value of any other solution in the pool using var.Xn (afte...