| The Linear Programming Solver |
Functional Summary
Table 8.1 summarizes the list of options available for the SOLVE WITH LP statement, classified by function.
Table 8.1: Options for the LP Solver| Description | Option |
| Solver Options: | |
| enable or disable IIS detection (experimental) | IIS= |
| type of solver | SOLVER= |
| Presolve Option: | |
| type of presolve | PRESOLVER= |
| Control Options: | |
| feasibility tolerance | FEASTOL= |
| maximum number of iterations | MAXITER= |
| upper limit on real time used to solve the problem | MAXTIME= |
| optimality tolerance | OPTTOL= |
| frequency of printing solution progress | PRINTFREQ= |
| use CPU/real time | TIMETYPE= |
| Simplex Algorithm Options: | |
| type of initial basis | BASIS= |
| type of pricing strategy | PRICETYPE= |
| queue size for determining entering variable | QUEUESIZE= |
| enable or disable scaling of the problem | SCALE= |
| Interior Point Algorithm Options: | |
| stopping criterion based on duality gap | STOP_DG= |
| stopping criterion based on dual infeasibility | STOP_DI= |
| stopping criterion based on primal infeasibility | STOP_PI= |
Copyright © 2008 by SAS Institute Inc., Cary, NC, USA. All rights reserved.