BRANCHDISJ
Description
|
Branch and Bound: Determines whether the optimizer should attempt to branch on general split disjunctions during the branch and bound search.
|
||||||||||
Type
|
Integer
|
||||||||||
Topic area
|
|||||||||||
Values
|
|
||||||||||
Default value
|
-1
|
||||||||||
Notes
|
Note Split disjunctions are a special form of disjunctions that can be written as
∑j mj xj ≤ m0 ∨ ∑j mj xj ≥ m0+1
The split disjunctions created by the optimizer will use a combination of binary or integer variables
xj, with integer coefficients
mj.
Split disjunctions for branching will always be created with a default priority value of 400 instead of the default value of 500 for regular entity branches.
|
||||||||||
Affects routines
|
|||||||||||
Category
|
Control
|
© 2001-2025 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.