MAXMIPTASKS
|
Description
|
Branch-and-Bound: The maximum number of tasks to run in parallel during a MIP solve.
|
||||
|
Type
|
Integer
|
||||
|
Values
|
|
||||
|
Default value
|
-1
|
||||
|
Note
|
The MIP solver will create smaller tasks from individual active nodes or based on local search heuristics. These are tasks that will be executed in parallel by the number of threads set by
MIPTHREADS.
|
||||
|
Note
|
If
MAXMIPTASKS is set to a fixed, positive value, the branch-and-bound tree nodes will always be solved in the same deterministic way, independent of the actual number of executing threads implied by
MIPTHREADS. How a MIP is solved will still depend on the number of threads used for solving the continuous relaxation and therefore on the settings for the controls
BARTHREADS,
DUALTHREADS and
CONCURRENTTHREADS). To obtain a MIP solve that is completely independent of the number of threads, it is sufficient to set
MAXMIPTASKS,
FORCEPARALLELDUAL and
BARTHREADS. The concurrent LP solver should be avoided in this case.
|
||||
|
Note
|
The number of MIP tasks that can be defined for a 32-bit system is limited to 32 for performance reasons.
|
||||
|
Affects routines
|
|||||
|
See also
|
© 2001-2020 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.