Description Branch and Bound: Specifies how often the optimizer should run a heuristic to reduce the number of fractional integer variables in the node LP solutions. Type Integer Values
-1 Automatic. 0 Disabled. 1 Run before and after cutting on the root node. 2 Run also during root cutting. 3 Run also during the tree search. Default value -1 Note This heuristic is only applicable to problems that are dual degenerate. These are problems that contain multiple solutions with identical objective function value. The more dual degenerate a problem is, the more likely it will be for this heuristic to have an improving effect. Affects routines
If you have any comments or suggestions about these pages, please send mail to email@example.com.
© Copyright 1983-2013 Fair Isaac Corporation. All rights reserved.