NodeMethod
Method used to solve MIP node relaxations
| Type: | int |
|---|---|
| Default value: | 1 |
| Minimum value: | 0 |
| Maximum value: | 2 |
Algorithm used for MIP node relaxations (0=primal simplex, 1=dual simplex, 2=barrier). Note that barrier is not an option for MIQP node relaxations.
Note: Only affects mixed integer programming (MIP) models
For examples of how to query or modify parameter values from our different APIs, refer to our Parameter Examples.
