Previous Page
|
Next Page
Details
Previous Page
|
Next Page
The Linear Programming Solver
Overview
Getting Started
Syntax
Functional Summary
LP Solver Options
Details
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
Problem Statistics
Variable and Constraint Status
Irreducible Infeasible Set
Macro Variable _OROPTMODEL_
Examples
Diet Problem
Reoptimizing the Diet Problem Using BASIS=WARMSTART
Two-Person Zero-Sum Game
Finding an Irreducible Infeasible Set
Using the Network Simplex Solver
Migration to OPTMODEL: Generalized Networks
Migration to OPTMODEL: Maximum Flow
Migration to OPTMODEL: Production, Inventory, Distribution
Migration to OPTMODEL: Shortest Path
References
Details: LP Solver
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
Problem Statistics
Variable and Constraint Status
Irreducible Infeasible Set
Macro Variable _OROPTMODEL_
Previous Page
|
Next Page
|
Top of Page
Copyright © SAS Institute Inc. All Rights Reserved.
Previous Page
|
Next Page
|
Top of Page