Originally posted by: T_O
The documentation says: "Accesses the currently best known bound of all the remaining open nodes in a branch-and-cut tree."
I don't know why there should be open remaining nodes nodes in an infeasible model, but I have got two ideas:
a) This might be due to backtracking or dynamic search. It might be that there remain some nodes that need not be traversed.
b) The behaviour is undefined for infeasible models.
Anyway, I would not rely on this value in an infeasible case as you know that the best known objective for an infeasible maximization problem is -inf (i.e. -1e+75).
Best regards,
Thomas
#CPLEXOptimizers#DecisionOptimization