The Linear Programming Solver
- Overview
- Getting Started
-
Syntax
-
DetailsPresolvePricing Strategies 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 ProcessingProblem StatisticsVariable and Constraint StatusIrreducible Infeasible SetMacro Variable _OROPTMODEL_
-
ExamplesDiet ProblemReoptimizing the Diet Problem Using BASIS=WARMSTARTTwo-Person Zero-Sum GameFinding an Irreducible Infeasible SetUsing the Network Simplex AlgorithmMigration to OPTMODEL: Generalized NetworksMigration to OPTMODEL: Maximum FlowMigration to OPTMODEL: Production, Inventory, DistributionMigration to OPTMODEL: Shortest Path
- References
Table 7.1 summarizes the list of options available for the SOLVE WITH LP statement, classified by function.
Table 7.1: Options for the LP Solver
|
Description |
Option |
|---|---|
|
Solver Options |
|
|
Specifies the type of algorithm |
|
|
Specifies the type of algorithm called after network simplex |
|
|
Enables or disables IIS detection |
|
|
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 |
|
|
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 determining 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 duality gap |
|
|
Specifies the stopping criterion based on dual infeasibility |
|
|
Specifies the stopping criterion based on primal infeasibility |
|
|
Decomposition Algorithm Options |
|
|
Enables decomposition algorithm and specifies general control options |
DECOMP= () |
|
Specifies options for the master problem |
|
|
Specifies options for the subproblem |