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
|