Previous Page
|
Next Page
Previous Page
|
Next Page
The NETFLOW Procedure
The NETFLOW Procedure
Overview: NETFLOW Procedure
Introduction
Network Models
Side Constraints
Advantages of Network Models over LP Models
Mathematical Description of NPSC
Flow Conservation Constraints
Nonarc Variables
Warm Starts
Getting Started: NETFLOW Procedure
Introductory Example
Syntax: NETFLOW Procedure
Functional Summary
Dictionary of Options
Interactivity
PROC NETFLOW Statement
CAPACITY Statement
COEF Statement
COLUMN Statement
CONOPT Statement
COST Statement
DEMAND Statement
HEADNODE Statement
ID Statement
LO Statement
MULT Statement
NAME Statement
NODE Statement
PIVOT Statement
PRINT Statement
QUIT Statement
RESET Statement
RHS Statement
ROW Statement
RUN Statement
SAVE Statement
SHOW Statement
SUPDEM Statement
SUPPLY Statement
TAILNODE Statement
TYPE Statement
VAR Statement
Details: NETFLOW Procedure
Input Data Sets
Output Data Sets
Converting Any PROC NETFLOW Format to an MPS-Format SAS Data Set
Case Sensitivity
Loop Arcs
Multiple Arcs
Pricing Strategies
Dual Variables, Reduced Costs, and Status
The Working Basis Matrix
Flow and Value Bounds
Tightening Bounds and Side Constraints
Reasons for Infeasibility
Missing S Supply and Missing D Demand Values
Balancing Total Supply and Total Demand
Warm Starts
How to Make the Data Read of PROC NETFLOW More Efficient
Macro Variable _ORNETFL
Memory Limit
The Interior Point Algorithm: NETFLOW Procedure
Introduction
Network Models: Interior Point Algorithm
Linear Programming Models: Interior Point Algorithm
Generalized Networks: NETFLOW Procedure
What Is a Generalized Network?
How to Specify Data for Arc Multipliers
Using the New EXCESS= Option in Pure Networks: NETFLOW Procedure
Handling Excess Supply or Demand
Handling Missing Supply and Demand Simultaneously
Maximum Flow Problems
Handling Supply and Demand Ranges
Using the New EXCESS= Option in Generalized Networks: NETFLOW Procedure
Total Supply and Total Demand: How Generalized Networks Differ from Pure Networks
The EXCESS=SUPPLY Option
The EXCESS=DEMAND Option
Examples: NETFLOW Procedure
Shortest Path Problem
Minimum Cost Flow Problem
Using a Warm Start
Production, Inventory, Distribution Problem
Using an Unconstrained Solution Warm Start
Adding Side Constraints, Using a Warm Start
Using a Constrained Solution Warm Start
Nonarc Variables in the Side Constraints
Pure Networks: Using the EXCESS= Option
Maximum Flow Problem
Generalized Networks: Using the EXCESS= Option
Generalized Networks: Maximum Flow Problem
Machine Loading Problem
Generalized Networks: Distribution Problem
Converting to an MPS-Format SAS Data Set
References
Previous Page
|
Next Page
|
Top of Page
Copyright © SAS Institute, Inc. All Rights Reserved.
Previous Page
|
Next Page
|
Top of Page