|Subject:||Re: [Help-glpk] [Fwd: mip behavior]|
|Date:||Fri, 15 Apr 2011 09:59:42 +0200|
|User-agent:||Mozilla/5.0 (X11; U; Linux i686 (x86_64); en-US; rv:188.8.131.52) Gecko/20110303 Lightning/1.0b2 Thunderbird/3.1.9|
It seems like GLPK has not realized that you objective function is integer as it normally outputs the rounded lower bound as the right hand column*. Have your really declared all your variables as integers?+3044704: mip = 6.000000000e+00>= 5.644706378e+00 5.9% (39579;54703)My interpretation of this output (documentation?) is that glpk found aninteger solutionwith objective 6, and found a lower bound of 5.644... My question: whydoes it keepgoing -- sometimes for a very long time? We know the objective is aninteger and greaterthan 5, and a solution with value 6 has already been found -- whydoesn't glpk terminate?
Regards Oscar* Which somehow I would like to have a switch for as seeing the fractional lower bound can sometimes be of interest.
|[Prev in Thread]||Current Thread||[Next in Thread]|