The Linear Programming Solver
- Overview
- Getting Started
-
Syntax
-
DetailsPresolvePricing Strategies for the Primal and Dual Simplex SolversThe Network Simplex AlgorithmThe Interior Point AlgorithmIteration Log for the Primal and Dual Simplex SolversIteration Log for the Network Simplex SolverIteration Log for the Interior Point SolverIteration 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 SolverMigration to OPTMODEL: Generalized NetworksMigration to OPTMODEL: Maximum FlowMigration to OPTMODEL: Production, Inventory, DistributionMigration to OPTMODEL: Shortest Path
- References
Subsections:
- Presolve
- Pricing Strategies for the Primal and Dual Simplex Solvers
- The Network Simplex Algorithm
- The Interior Point Algorithm
- Iteration Log for the Primal and Dual Simplex Solvers
- Iteration Log for the Network Simplex Solver
- Iteration Log for the Interior Point Solver
- Iteration Log for the Crossover Algorithm
- Concurrent LP
- Parallel Processing
- Problem Statistics
- Variable and Constraint Status
- Irreducible Infeasible Set
- Macro Variable _OROPTMODEL_