The OPTLP Procedure
- Overview
- Getting Started
-
Syntax
-
DetailsData Input and OutputPresolvePricing Strategies for the Primal and Dual Simplex AlgorithmsWarm Start for the Primal and Dual Simplex AlgorithmsThe Network Simplex AlgorithmThe Interior Point AlgorithmIteration Log for the Primal and Dual Simplex AlgorithmsIteration Log for the Network Simplex AlgorithmIteration Log for the Interior Point AlgorithmIteration Log for the Crossover AlgorithmConcurrent LPParallel ProcessingODS TablesIrreducible Infeasible SetMacro Variable _OROPTLP_
-
Examples
- References
Functional Summary
Table 12.1 summarizes the list of options available for the OPTLP procedure, classified by function.
Table 12.1: Options for the OPTLP Procedure
|
Description |
Option |
|---|---|
|
Data Set Options |
|
|
Specifies the input data set |
|
|
Specifies the dual input data set for warm start |
|
|
Specifies the dual solution output data set |
|
|
Specifies whether the LP model is a maximization or minimization problem |
|
|
Specifies the primal input data set for warm start |
|
|
Specifies the primal solution output data set |
|
|
Saves output data sets only if optimal |
|
|
Solver Options |
|
|
Enables or disables IIS detection |
|
|
Specifies the type of algorithm |
|
|
Specifies the type of algorithm called after network simplex |
|
|
Presolve Option |
|
|
Specifies the type of presolve |
|
|
Controls the dualization of the problem |
|
|
Control Options |
|
|
Specifies the feasibility tolerance |
|
|
Specifies the frequency of printing solution progress |
|
|
Specifies the detail of solution progress printed in log |
|
|
Specifies the maximum number of iterations |
|
|
Specifies the time limit for the optimization process |
|
|
Specifies the optimality tolerance |
|
|
Enables or disables printing summary |
|
|
Specifies units of CPU time or real time |
|
|
Simplex Algorithm Options |
|
|
Specifies the type of initial basis |
|
|
Specifies the type of pricing strategy |
|
|
Specifies the queue size for pricing |
|
|
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 duality gap |
|
|
Specifies the stopping criterion based on dual infeasibility |
|
|
Specifies the stopping criterion based on primal infeasibility |