Tobias Achterberg

No, you need to use PoolSearchMode=2 to really find all feasible solutions. With PoolSearchMode=1 there is no guarantee of exhaustiveness. For example, PoolSearchMode=1 would not disable dual preso...

Hi Martin! You can obtain the desired behavior directly through a combination of parameter and attribute settings. What you would do is to do the first optimization with Crossover=0 as usual. Then,...

The reason is parallel execution. It could be that two parallel threads find solutions at the same time. At the synchronization point, we collect these solutions and present them one by one to the ...

From your description, this really sounds like a network flow model. What you would do is to model this as a digraph, i.e., with directed arcs. So, if you have an edge e=(i,j) you would introduce t...

This issue arises very frequently in column generation approaches, and then people are surprised why their pricing algorithm seems to be wrong (because the pricing algorithm often assumes standard ...

The y variables have a finite upper bound, in this case an upper bound of 1. For this reason, the reduced costs can be negative. This means that such a variable is non-basic at its upper bound. For...

It looks like you just have a pretty tough MIP to solve. The differences on Windows and Mac most likely come from a phenomenon that is called "performance variability". There are a number of posts ...

Wow, okay, this makes sense. Check the size of the model! With 5 hours, you already have 647 million non-zero coefficients in your model. Every non-zero consumes already 12 bytes, and this is only ...

Moreover, I would try what happens if you don't do this for a whole day, but only for, say, 6 hours or so.

I did not look too closely at your model, but my assumption is that the battery constraints are linking the time steps with each other. May it be that without those constraints you pretty much get ...