The DECOMP_MASTER statement controls the master problem.
Table 15.12 summarizes the options available in the DECOMP_MASTER statement. These options control the master LP solver in the decomposition algorithm during the solution of an LP or a MILP. (As indicated, you can specify the PRINTLEVEL= option only in the OPTLP procedure.) For descriptions of these options, see the section LP Solver Options in Chapter 7: The Linear Programming Solver and the section PROC OPTLP Statement in Chapter 12: The OPTLP Procedure. Some options have different defaults when you use the decomposition algorithm, as indicated in Table 15.12.
Table 15.12: Options in the DECOMP_MASTER Statement
Description |
decomp-master-option |
Different |
---|---|---|
Default |
||
Algorithm Option |
||
Specifies the master algorithm |
PS† |
|
Presolve Option |
||
Controls the dualization of the problem |
OFF |
|
Specifies, for the first master solve only, the type of presolve |
||
Specifies the type of presolve |
NONE (ALGORITHM=PS) † |
|
Control Options |
||
Specifies the feasibility tolerance |
1E–7 |
|
Specifies how frequently to print the solution progress |
||
Specifies the level of detail of solution progress to print in the log |
||
Specifies the maximum number of iterations |
||
Specifies the time limit for the optimization process |
||
Specifies the number of threads to use in the master solver |
||
Specifies the optimality tolerance |
1E–7 |
|
Enables or disables printing summary (OPTLP procedure only) |
||
Specifies whether time units are CPU time or real time |
||
Specifies the type of initial basis |
WARMSTART (ALGORITHM=PS)† |
|
Specifies the type of pricing strategy |
||
Specifies the queue size for determining the entering variable |
||
Enables or disables scaling of the problem |
||
Specifies the initial seed for the random number generator |
||
Interior Point Algorithm Options |
||
Enables or disables interior crossover |
||
Specifies the stopping criterion based on a duality gap |
||
Specifies the stopping criterion based on dual infeasibility |
||
Specifies the stopping criterion based on primal infeasibility |
† The different defaults (ALGORITHM=PS, PRESOLVER=NONE, and BASIS=WARMSTART) are motivated by the fact that primal feasibility of the master problem is preserved when columns are added, so a warm start from the previous optimal basis tends to be more efficient than solving the master from scratch in each iteration.
The following options, listed in Table 15.12, are specific to the DECOMP_MASTER statement and are not described in the LP solver sections.