By doing some researches I found out that my code is doing fine but the problem is hard to solve.
I would like to fasten the solver by reducing the precision from 9 to 7 digits. Is it possible ? Or by reducing the number of iterations but I do not know how to do either one of these.
I'm using Gusek.
Any help is welcome,
I'm running a simulation and it's taking quite a while...
I'm running on Gusek, which is the only way I found to use GLPK (couldn't figure out how to install on win)
The program seems to found a solution :
OPTIMAL SOLUTION FOUND
Integer optimization begins...
Gomory's cuts enabled
MIR cuts enabled
Cover cuts enabled
Clique cuts enabled
Creating the conflict graph...
The conflict graph is either empty or too big
But then it goes on searching for quite a while :simul.mod
Time used: 1294.0 secs. Memory used: 55.1 Mb.
+176120: mip = not found yet >= 5.813433080e+004 (195; 6)
+176321: mip = not found yet >= 5.813433080e+004 (196; 6)
I have no clue if it's close to the solution, if it's taking too long or if I should wait or ... ?