[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] presolving
From: |
glpk xypron |
Subject: |
Re: [Help-glpk] presolving |
Date: |
Tue, 24 Jul 2012 14:12:29 +0200 |
Hello Daniele,
http://en.wikibooks.org/wiki/GLPK/Terminal_output#MIP_branch-and-cut_output
describes how to read the output to find out, when the first integer solution
was found and which value it had.
If you have no need to prove optimality, you can use the following parameters
for glpsol:
--tmlim nnn limit solution time to nnn seconds
--mipgap tol set relative mip gap tolerance to tol
Best regards
Xypron
-------- Original-Nachricht --------
> Datum: Tue, 24 Jul 2012 11:08:23 +0200
> Betreff: Re: [Help-glpk] presolving
> the problem has no solution because of the constraints:
> *VincStraordinari1*and
> *VincStraordinari2*
> If i don't consider them, the problem has solution but takes days to find
> the
> solution.
> There is a procedure to shorten the search? Because I think that
> GLPSOLalmost immediately
> finds the solution but all this takes time to verify the optimality of
> this
>
> (p.s. I use the command CUTS for resolve the problem)
>
> Thanks
>
> 2012/7/21 Daniele Micarelli <address@hidden>
>
> > Hello
> > I have these two files that i attached
> >
> > because when i fix these two files with GLPSOL, it used too long (even
> > days) using the commands - math - cuts, and I wanted to know if there
> are
> > ways of presolving to speed the resolution
> >
> > thank you very mutch
> >
> > Best
> >
> > Daniele
> >