KALIS_DICHOTOMIC_OBJ_SEARCH
|
Description
|
Uses a dichotomic strategy to find the optimal objective value
|
||
|
Type
|
Boolean, read/write
|
||
|
Values
|
|
||
|
Notes
|
Uses a dichotomic strategy to find the optimal objective value. By default the optimization algorithm imposes an amelioration constraint stating that the objective value of the solution to be found must be better than the objective value of the best solution already found. With a dichotomic optimization strategy, this constraint is replaced by a binary search tree over the objective variable domain.
|
||
|
Affects routines
|
© 2001-2019 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.