[Cbc] How to get the lower bound?

[John Forrest]

Thomas,

Not sure what you mean.  Doesn't Cbc0005 give you what you want?

Cbc0003I Exiting on maximum nodes
Cbc0005I Partial search - best objective 26499 (best possible 25947.6),
took 5248 iterations and 16 nodes (14.95 seconds)

You can get that from a message handler.

John
On Sun, 2010-11-07 at 16:22 +0100, Thomas Schoenemann wrote:
> Dear all,
> 
> several of my problems cannot be solved exactly by Cbc (or any other solver), 
> so I set a limit on the number of nodes. In this case, most commercial 
> products provide the tightest lowest bound from the part of the branch-and-
> bound that was actually executed. Is there a way to get this information in 
> Cbc? So far I only found the value of the root-relaxation and the value of the
> last round of cuts at the root node, but the latter only by reading it off 
> from the output on the screen.
> 
> Best regards,
>   Thomas
> 
> _______________________________________________
> Cbc mailing list
> Cbc at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/cbc
>