You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In some cases in the last nodes, we can have a lower bound that is greater than the incumbent (if all incoming nodes are about to be pruned because infeasible or greater than the incumbent). The tree lower bound should always remain below, if we are about to update it to a value greater than the incumbent, clip to the incumbent instead for printing purposes
The text was updated successfully, but these errors were encountered:
In some cases in the last nodes, we can have a lower bound that is greater than the incumbent (if all incoming nodes are about to be pruned because infeasible or greater than the incumbent). The tree lower bound should always remain below, if we are about to update it to a value greater than the incumbent, clip to the incumbent instead for printing purposes
The text was updated successfully, but these errors were encountered: