Jonasz Staszek

Dear Nicolas, I believe this discussion will shed some light. Best regardsJonasz

Dear James, could you please post a minimal, reproducible example of the code which throws this error? For a general discussion about this error, have a look here. Best regardsJonasz

Dear Ankit, solving MIPs can indeed be done exactly (finding optimal, or the best solution - using a solver like Gurobi) or heuristically (without being sure that the solution is optimal - here you...

Thanks for these clarifications. In the future please paste the code rather than the screenshot - you can't really copy anything out from a picture... My understanding is that you would be interest...

Dear Tangzhe, based on the description you provided it is difficult to give specific advice. Could you please share a minimal reproducible example of your problem? Best regardsJonasz

Dear Maximilian Your script is really complex and I am afraid I cannot help you further without a (really) deep dive. If you could come up with a minimal reproducible example, we could try to help ...

Dear Eduardo, there is something wrong with your objective function. I intuitively tried to correct its implementation to: objetivo = quicksum(quicksum(u[p, t] for p in P) + quicksum(h[i, t] for i ...

Hi Saurav, Piecewise Linearization might be able to help you. These articles (here and here) should be of interest. Best regardsJonasz

Hi Margi, it is possible to model conditional statements. For more information, have a look at Jaromił's entry in knowledge base. Best regardsJonasz

Hi Anh, generally you should be able to achieve your objective by setting the SolutionLimit parameter to 1 - Gurobi will then terminate after finding the first integer-feasible solution. I can't pr...