Previous Page | Next Page

The Mixed Integer Linear Programming Solver

Functional Summary

Table 11.1 summarizes the options available for the SOLVE WITH MILP statement, classified by function.

Table 11.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 lifted 0-1 cut level

CUTMILIFTED=

Mixed integer rounding (MIR) cut level

CUTMIR=

Row multiplier factor for cuts

CUTSFACTOR=

Zero-half cut level

CUTZEROHALF=

Previous Page | Next Page | Top of Page