Re: [Help-glpk] "The conflict graph is either empty or too big"

[spiritfire]

Hi everyone, me again.

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, 
thank you.


spiritfire wrote:
> 
> Hi, 
> 
> 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 :
> http://old.nabble.com/file/p33830878/simul.mod 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 ... ?
> 
> Does anybody know if it is normal ?
> 
> my code is attached.
> 
> Thank you.
> 

-- 
View this message in context: 
http://old.nabble.com/%22The-conflict-graph-is-either-empty-or-too-big%22-tp33830878p33889205.html
Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com.