New answers tagged

3 votes
Accepted

Coding some parameters with index zero in Julia

Just use c[i+1] when indexing c? ...
user avatar
1 vote

How to input this LP model of a buffer allocation problem in Gurobi?

Using a dynamic approach like simulation optimization is still one of the best ways to tackle such a problem instead of applying an LP/MIP. Based on what you mentioned, the problem you have faced ...
user avatar
  • 5,705
4 votes

How to input this LP model of a buffer allocation problem in Gurobi?

You correctly identified that this a linear program. You could either specify this problem in the .lp file format see the Gurobi documenation and consult the syntax rules if you have questions or you ...
user avatar
6 votes

How to put this restriction using Gurobi in python

Firstly, your constraint should rather look this this: $$\sum_{j=0}^{i}X_j \leq H_i \quad \forall i \in I$$ $$\sum_{j=0}^{i}X_j \geq L_i \quad \forall i \in I$$ In your code this should translate to: <...
user avatar
  • 564
10 votes
Accepted

Dealing with Symmetry. Commercial solver defaults vs manual implementations

There might be automatic settings and tunings inside the solver that are not perfect and might choose not to use orbital branching for an instance although it might be beneficial. In that case the ...
user avatar
7 votes

Dealing with Symmetry. Commercial solver defaults vs manual implementations

As far as symmetry breaking constraints v. leaving the solver to deal with the symmetry, I think that is an empirical question, meaning you can try both (with reasonably short time limits) and see ...
user avatar
  • 28.8k
4 votes

It takes a long time to solve excel gurobi-opensolver - is this normal?

This is not a Gurobi issue - the log shows that the instance is solved within a second. I can only assume that the model-building process takes up a lot of time. OpenSolver apparently creates an LP ...
user avatar
  • 1,493
3 votes
Accepted

Solving Graph Partitioning Problems with Gurobi and Pyomo

I would like to ensure that the optimal solutions that are solved within this small amount of times are still solved with optimal solutions while the MIPGap only applies to those slow problems. I ...
user avatar
4 votes
Accepted

I'm trying to solve an OR problem written using pulp framework , with gurobi, in Linux , but I'm not able to solve it

The path in Linux has to point to the gurobi_cl binary, which is located in the bin folder. ...
user avatar
  • 3,034

Top 50 recent answers are included