POOLBESTBOUND
|
Description
|
Best bound on the objective value of any MIP solution that can be found in the remainder of the branch-and-bound search. If solution enumeration is enabled, by setting
POOLENUMSTRATEGY
>0, this attribute provides a bound on any undiscovered solution that can be added to the pool.
|
|
Type
|
Double
|
|
Topic area
|
|
|
Notes
|
1. If the cutoff is relaxed to allow for the discovery of worse solutions than the current incumbent, such as when enabling solution enumeration with
POOLENUMSTRATEGY, this attribute can become higher/lower (resp. for minimization/maximization problems) than the optimal objective value.
2. Unlike
BESTBOUND, which is capped at the objective value of the best solution found so far and therefore stops advancing once that solution is proven optimal, this attribute is not capped and keeps tightening towards the worst solution that can still be added to the pool. It can therefore be used to track the remaining progress of a solution enumeration search after
BESTBOUND has stopped advancing.
|
|
Set by routines
|
|
|
See also
|
|
|
Category
|
Attribute
|
© 2001-2026 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.