| The Mixed Integer Linear Programming Solver |
Functional Summary
Table 9.1 summarizes the options available for the SOLVE WITH MILP statement, classified by function.
Table 9.1: Options for the MILP Solver| Description | Option |
| Presolve Option | |
| type of presolve | PRESOLVER= |
| Warm Start Option | |
| primal solution input data set (warm start) | PRIMALIN |
| Control Options | |
| stopping criterion based on absolute objective gap | ABSOBJGAP= |
| cutoff value for node removal | CUTOFF= |
| emphasize feasibility or optimality | EMPHASIS= |
| maximum allowed difference between an integer variable's value and an integer | INTTOL= |
| maximum number of nodes to be processed | MAXNODES= |
| maximum number of solutions to be found | MAXSOLS= |
| maximum solution time | MAXTIME= |
| frequency of printing node log | PRINTFREQ= |
| detail of solution progress printed in log | PRINTLEVEL2= |
| probing level | PROBE= |
| stopping criterion based on relative objective gap | RELOBJGAP= |
| scale the problem matrix | SCALE= |
| stopping criterion based on target objective value | TARGET= |
| use CPU/real time | TIMETYPE= |
| Heuristics Option | |
| primal heuristics level | HEURISTICS= |
| Search Options | |
| node selection strategy | NODESEL= |
| use of variable priorities | PRIORITY= |
| number of simplex iterations performed on each variable in strong branching strategy | STRONGITER= |
| number of candidates for strong branching | STRONGLEN= |
| rule for selecting branching variable | VARSEL= |
| Cut Options | |
| overall cut level | ALLCUTS= |
| clique cut level | CUTCLIQUE= |
| flow cover cut level | CUTFLOWCOVER= |
| flow path cut level | CUTFLOWPATH= |
| Gomory cut level | CUTGOMORY= |
| generalized upper bound (GUB) cover cut level | CUTGUB= |
| implied bounds cut level | CUTIMPLIED= |
| knapsack cover cut level | CUTKNAPSACK= |
| lift-and-project cut level | CUTLAP= |
| mixed integer rounding (MIR) cut level | CUTMIR= |
| row multiplier factor for cuts | CUTSFACTOR= |
Copyright © 2008 by SAS Institute Inc., Cary, NC, USA. All rights reserved.