Fabio David

To solve a specific problem, I have created a set of integer decisions variables S[i,k] with lb=0 and ub=640, with a size of approximately 1000 indices, but in some instances it can reach tens of t...

Using grbtune to analyze my problem, it suggested using the option ScaleFlag=1. This significantly reduced the execution time for solving it. Looking at the documentation on Gurobi site, it was not...

Hi,I have a problem that can be modeled as a MCKP (multiple-choice knapsack problem). It is possible to calculate all items i in advance (python script) and classify them in C classes. Each item is...

Hi I'm trying to solve a MILP with multiple objectives. For example, suppose I want to min x then min y and finally min z. I would like to know which is the most efficient way to solve it. Should I...

I need to add a constraint so that my decision var must be in a interval, so I tried to filter somethong like this: m.addConstrs( (O[i] == 1 for i in L if x[i] >= a[i] and x[i] <= a[i]+b), "co" ) U...