[Cbc] How to get the lower bound?

[Thomas Schoenemann]

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