Searched refs:bestObj_ (Results 1 – 6 of 6) sorted by relevance
549 bestObj_ = model_.getObjValue(); in branchAndBound()602 bestObj_ = bestBound_ = solver->getObjValue(); in branchAndBound()612 bestObj_ = (bonBabInfoPtr->bestObj2()); in branchAndBound()614 <<bestObj_<<CoinMessageEol; in branchAndBound()668 (((fabs (bestObj_) < COUENNE_INFINITY / 1e4) && in branchAndBound()669 (problem_ -> getRecordBestSol () -> getVal () > bestObj_))); in branchAndBound()685 (((fabs (bestObj_) < COUENNE_INFINITY / 1e4) && in bestSolution()686 (problem_ -> getRecordBestSol () -> getVal () > bestObj_)))) in bestSolution()695 (((fabs (bestObj_) < COUENNE_INFINITY / 1e4) && in bestObj()696 (problem_ -> getRecordBestSol () -> getVal () > bestObj_)))) in bestObj()[all …]
54 return bestObj_; in bestObj()106 double bestObj_; member in Bonmin::Bab
73 bestObj_(1e200), in Bab()537 bestObj_ = model_.getObjValue(); in branchAndBound()607 bestObj_ = DBL_MAX; in branchAndBound()613 bestObj_ = - DBL_MAX; in branchAndBound()618 bestObj_ = DBL_MAX; in branchAndBound()626 bestObj_ = bestBound_ = solver->getObjValue(); in branchAndBound()639 bestObj_ = (bonBabInfoPtr->bestObj2()); in branchAndBound()641 <<bestObj_<<CoinMessageEol; in branchAndBound()689 bestObj_); in branchAndBound()
99 if (fabs (bestObj_) < COUENNE_INFINITY) in print()100 out << "best known objective: " << bestObj_ << std::endl; in print()135 if (fscanf (f, "%lf", &bestObj_) < 1) { in readOptimum()
57 bestObj_ (COIN_DBL_MAX), in CouenneProblem()133 bestObj_ (p.bestObj_), in CouenneProblem()
218 CouNumber bestObj_; member in Couenne::CouenneProblem452 CouNumber bestObj () const {return bestObj_;} ///< Objective of best known solution in bestObj()