Hi Veit!
+3044704: mip = 6.000000000e+00>= 5.644706378e+00 5.9% (39579;
54703)
My interpretation of this output (documentation?) is that glpk found an
integer solution
with objective 6, and found a lower bound of 5.644... My question: why
does it keep
going -- sometimes for a very long time? We know the objective is an
integer and greater
than 5, and a solution with value 6 has already been found -- why
doesn't glpk terminate?
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?
Regards
Oscar
* Which somehow I would like to have a switch for as seeing the
fractional lower bound can sometimes be of interest.
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
