The Mixed Integer Linear Programming Solver
Functional Summary
Table 7.1 summarizes the options available for the SOLVE WITH MILP statement, classified by function.
Table 7.1: Options for the MILP Solver
|
Description |
Option |
|---|---|
|
Presolve Option |
|
|
Specifies the type of presolve |
|
|
Warm Start Option |
|
|
Specifies the input primal solution (warm start) |
|
|
Control Options |
|
|
Specifies the stopping criterion based on absolute objective gap |
|
|
Specifies the cutoff value for node removal |
|
|
Emphasizes feasibility or optimality |
|
|
Specifies the maximum violation on variables and constraints |
|
|
Specifies the maximum allowed difference between an integer variable’s value and an integer |
|
|
Specifies the frequency of printing the node log |
|
|
Specifies the detail of solution progress printed in log |
|
|
Specifies the maximum number of nodes to be processed |
|
|
Specifies the maximum number of solutions to be found |
|
|
Specifies the time limit for the optimization process |
|
|
Specifies the tolerance used in determining the optimality of nodes in the branch-and-bound tree |
|
|
Specifies the probing level |
|
|
Specifies the stopping criterion based on relative objective gap |
|
|
Specifies the scale of the problem matrix |
|
|
Specifies the stopping criterion based on target objective value |
|
|
Specifies whether time units are CPU time or real time |
|
|
Heuristics Option |
|
|
Specifies the primal heuristics level |
|
|
Search Options |
|
|
Specifies the level of conflict search |
|
|
Specifies the node selection strategy |
|
|
Enables use of variable priorities |
|
|
Specifies the number of simplex iterations performed on each variable in strong branching strategy |
|
|
Specifies the number of candidates for strong branching |
|
|
Specifies the rule for selecting branching variable |
|
|
Cut Options |
|
|
Specifies the cut level for all cuts |
|
|
Specifies the clique cut level |
|
|
Specifies the flow cover cut level |
|
|
Specifies the flow path cut level |
|
|
Specifies the Gomory cut level |
|
|
Specifies the generalized upper bound (GUB) cover cut level |
|
|
Specifies the implied bounds cut level |
|
|
Specifies the knapsack cover cut level |
|
|
Specifies the lift-and-project cut level |
|
|
Specifies the mixed lifted 0-1 cut level |
|
|
Specifies the mixed integer rounding (MIR) cut level |
|
|
Specifies the row multiplier factor for cuts |
|
|
Specifies the overall cut aggressiveness |
|
|
Specifies the zero-half cut level |
|
|
Decomposition Algorithm Options |
|
|
Enables decomposition algorithm and specifies general control options |
DECOMP=() |
|
Specifies options for the master problem |
|
|
Specifies options for the master problem solved as a MILP |
|
|
Specifies options for the subproblem |