Type of integer processing to be performed.
[Flags] public enum MipPresolves
Enable all options.
If node preprocessing is allowed to change bounds on continuous columns.
Dual reductions will be performed at each node.
No preprocessing during Branch & Bound.
Primal reductions will be performed at each node. Uses constraints of the node to tighten the range of variables, often resulting in fixing their values. This greatly simplifies the problem and may even determine optimality or infeasibility of the node before the simplex method commences.
Reduced cost fixing will be performed at each node. This can simplify the node before it is solved, by deducing that certain variables' values can be fixed based on additional bounds imposed on other variables at this node.