• Previous Page
  • |
  • Next Page
Details
Previous Page | Next Page

The Linear Programming Solver

  • Overview
  • Getting Started
  • Syntax Procedure Syntax
    Functional Summary LP Solver Options
  • Details Procedure Details
    Presolve Pricing Strategies for the Primal and Dual Simplex Solvers The Network Simplex Algorithm The Interior Point Algorithm Macro Variable OROPTMODEL Iteration Log for the Primal and Dual Simplex Solvers Iteration Log for the Network Simplex Solver Iteration Log for the Interior Point Solver Problem Statistics Data Magnitude and Variable Bounds Variable and Constraint Status Irreducible Infeasible Set
  • Examples Procedure 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
  • Macro Variable _OROPTMODEL_
  • Iteration Log for the Primal and Dual Simplex Solvers
  • Iteration Log for the Network Simplex Solver
  • Iteration Log for the Interior Point Solver
  • Problem Statistics
  • Data Magnitude and Variable Bounds
  • Variable and Constraint Status
  • Irreducible Infeasible Set
Previous Page | Next Page | Top of Page
Copyright © SAS Institute Inc. All rights reserved.
  • Previous Page
  • |
  • Next Page
  • |
  • Top of Page