[Cbc] How to get the lower bound?

[Gabrielle A. Grun]

Hi Thomas,

is this what you are after?
/// Get best objective function value as minimization
inline double getMinimizationObjValue() const
{ return bestObjective_;};
[CbcModel.hpp]

You should be seeing bestObjective_ in any case as John says.

{CBC_END,5,1,"Partial search - best objective %g (best possible %g), took %d 
iterations and %d nodes (%.2f seconds)"},
CbcMessage.cpp]

status_=1;
if (!status_) {
// Set best possible unless stopped on gap
if(secondaryStatus_ != 2)
bestPossibleObjective_=bestObjective_;
handler_->message(CBC_END_GOOD,messages_)
<< bestObjective_ << numberIterations_ << numberNodes_<<getCurrentSeconds()
<< CoinMessageEol ;
} else {
handler_->message(CBC_END,messages_)
<< bestObjective_ <<bestPossibleObjective_
<< numberIterations_ << numberNodes_<<getCurrentSeconds()
<< CoinMessageEol ;
}
CbcModel::branchAndBound---------CbcModel.cpp]

Take care.


Gabrielle
----- Original Message ----- 
From: Thomas Schoenemann
To: cbc at list.coin-or.org
Sent: Sunday, November 07, 2010 7:22 AM
Subject: [Cbc] How to get the lower bound?


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