MIPCONCURRENTSOLVES
|
Description
|
Selects the number of concurrent solves to start for a MIP. Each solve will use a unique random seed for its random number generator, but will otherwise apply the same user controls. The first concurrent solve to complete will have solved the MIP and all the concurrent solves will be terminated at this point. Using concurrent solves can be advantageous when a MIP displays a high level of
performance variability.
|
||||||
|
Type
|
Integer
|
||||||
|
Values
|
|
||||||
|
Default value
|
0
|
||||||
|
Note
|
A node limit is imposed on each concurrent solve, through
MIPCONCURRENTNODES. When a concurrent solve reaches this node limit, it will be suspended until all concurrent solves have reached the limit. At this point a winner will be declared, based on which solve made the most progress towards optimality and only the winning solve will continue, using all threading resources. If a concurrent solve completes its MIP search before reaching the node limit, all solves will be stopped.
|
||||||
|
Note
|
Concurrent solves are not compatible with many callbacks that can be used for modifying the branch-and-bound search. Setting any of the following callbacks will automatically disable concurrent solves:
XPRSaddcboptnode,
XPRSaddcbprenode,
XPRSaddcbcutmgr,
XPRSaddcbestimate,
XPRSaddcbsepnode,
XPRSaddcbchgbranch,
XPRSaddcbchgbranchobject
|
||||||
|
Affects routines
|
|||||||
|
See also
|