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
The interior point and concurrent LP algorithms can be run in single-machine mode (in single-machine mode, the computation is executed by multiple threads on a single computer). The decomposition algorithm can be run in either single-machine or distributed mode (in distributed mode, the computation is executed on multiple computing nodes in a distributed computing environment).
Note: Distributed mode requires SAS High-Performance Optimization.
You can specify options for parallel processing in the PERFORMANCE statement, which is documented in the section PERFORMANCE Statement in Chapter 4: Shared Concepts and Topics.