Initializing help system before first use

MIPPRESOLVE

Description
Branch and Bound: Type of integer processing to be performed. If set to 0, no processing will be performed.
Type
Integer
Values
Bit
Meaning
0 
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.
1 
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.
2 
[Unused] This bit is no longer used to control probing. Refer to the integer control PREPROBING for setting probing level during presolve.
3 
If node preprocessing is allowed to change bounds on continuous columns.
4 
Dual reductions will be performed at each node.
5 
Allow global (non-bound) tightening of the problem during the tree search.
6 
The objective function will be used to find reductions at each node.
7 
Allow the branch-and-bound tree search to be restarted if it appears to be advantageous.
8 
Allow that symmetry is used to presolve the node problem.
Default value
-257
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.