The Linear Programming Solver |
Functional Summary |
Table 10.1 summarizes the list of options available for the SOLVE WITH LP statement, classified by function.
Description |
Option |
---|---|
Solver Options: |
|
Enable or disable IIS detection |
|
Type of solver |
|
Presolve Option: |
|
Type of presolve |
|
Control Options: |
|
Feasibility tolerance |
|
Maximum number of iterations |
|
Upper limit on real time used to solve the problem |
|
Optimality tolerance |
|
Frequency of printing solution progress |
|
Use CPU/real time |
|
Simplex Algorithm Options: |
|
Type of initial basis |
|
Type of pricing strategy |
|
Queue size for determining entering variable |
|
Enable or disable scaling of the problem |
|
Interior Point Algorithm Options: |
|
Stopping criterion based on duality gap |
|
Stopping criterion based on dual infeasibility |
|
Stopping criterion based on primal infeasibility |
Copyright © SAS Institute, Inc. All Rights Reserved.