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:
- 6.1 Diet Problem
- 6.2 Reoptimizing the Diet Problem Using BASIS=WARMSTART
- 6.3 Two-Person Zero-Sum Game
- 6.4 Finding an Irreducible Infeasible Set
- 6.5 Using the Network Simplex Solver
- 6.6 Migration to OPTMODEL: Generalized Networks
- 6.7 Migration to OPTMODEL: Maximum Flow
- 6.8 Migration to OPTMODEL: Production, Inventory, Distribution
- 6.9 Migration to OPTMODEL: Shortest Path