SAS/OR User's Guide 13.1
Example Programs
Introduction to Mathematical Programming
Introduction to Mathematical Programming Legacy Procedures
Introduction to Project Management
- Project Definition (intpm1)
- Work Breakdown Structure (intpm2)
- Project Scheduling and Reporting (intpm3)
- Summarizing the Schedule (intpm4)
- Resource Constrained Scheduling (intpm5)
- Multiple Projects (intpm6)
- Sequential Scheduling of Projects (intpm7)
- Cost Analysis (intpm8)
- Subcontracting Decision (intpm9)
BOM Procedure
- Getting Started and Details Examples (bom0)
- Bill of Material with Single Input Data Set (bom1)
- Bill of Material with Lead Time Information (bom2)
- Bill of Material with Scrap Factor Information (bom3)
- Planning Bill of Material (bom4)
- Modular Bill of Material (bom5)
- Bill of Material w/ Repeated Relationships (bom6)
- Bill of Material Verification (bom7)
- Roll-Up Cost in Indented Bill of Material (bom8)
- Bill of Material Explosion (bom9)
- Aggregating Forecasts Using PROC BOM (bom10)
- Examples from the BOM Macros chapter (bommacro)
CLP Procedure
- Getting Started Examples (clp0)
- Logic Based Puzzles (clp1)
- Alphabet Blocks Problem (clp2)
- Work-Shift Scheduling: Finding Optimal Assignment (clp3)
- A Nonlinear Optimization Problem (clp4)
- Car Painting Problem (clp5)
- Scene Allocation Problem (clp6)
- The Car Sequencing Problem (clp7)
- Round Robin Tournament Scheduling (clp8)
- Resource Scheduling w/ Nonstandard Temporal Constraints (clp9)
- Scheduling with Alternate Resources (clp10)
- 10X10 Job Shop Scheduling Problem (clp11)
- Scheduling a Major Basketball Conference (clp12)
- Balanced Incomplete Block Design (clp13)
- Progressive Party Problem (clp14)
CPM Procedure
- Software Development Project (cpm0)
- Activity-on-Node Representation (cpm1)
- Activity-on-Arc Representation of Project (cpm2)
- Meeting Project Deadlines (cpm3)
- Printing the Schedule on a Calendar (cpm4)
- Precedence Gantt Chart (cpm5)
- Changing Duration Units (cpm6)
- Controlling the Project Calendar (cpm7)
- Scheduling Around Holidays (cpm8)
- Specifying CALEDATA and WORKDATA Data Sets (cpm9)
- Multiple Calendars (cpm10)
- Nonstandard Relationships (cpm11)
- Activity Time Constraints (cpm12)
- Progress Update and Target Schedules (cpm13)
- Summarizing Resource Utilization (cpm14)
- Resource Allocation (cpm15)
- Using Supplementary Resources (cpm16)
- Use of the INFEASDIAGNOSTIC Option (cpm17)
- Variable Activity Delay (cpm18)
- Activity Splitting (cpm19)
- Scheduling with Alternate Resources (cpm20)
- PERT Assumptions and Calculations (cpm21)
- Scheduling Course / Teacher Combinations (cpm22)
- Multiproject Scheduling (cpm23)
- Resource Driven Durations and Res.Calendars (cpm24)
- Resource Driven Durations and Alt Resources (cpm25)
- Multiple Alternate Resources (cpm26)
- Auxiliary and Alternate Resources (cpm27)
- Use of the SETFINISHMILESTONE Option (cpm28)
- Negative Resource Requirements (cpm29)
- Auxiliary Resources and Negative Resource Reqmts (cpm30)
- Resource-Driven Durations and Negative Requirements (cpm31)
Decomposition Algorithm
- Getting Started Example (dcmpg01)
- Getting Started Example (dcmpg02)
- Getting Started Example (dcmpg03)
- Multicommodity Flow Problem (dcmpe01)
- Generalized Assignment Problem (dcmpe02)
- Block-diagonal Structure (dcmpe03)
- Block-diagonal Structure in Distributed Mode (dcmpe04)
- Bin Packing Problem (dcmpe05)
- Resource Allocation (dcmpe06)
- Vehicle Routing Problem (dcmpe07)
- ATM Cash Management in single-machine mode (dcmpe08)
- ATM Cash Management in Distributed Mode (dcmpe09)
- Kidney Donor Exchange (dcmpe10)
DTREE Procedure
- Oil Wildcatter's Problem (dtree0)
- Oil Wildcatter's Problem with an Insurance (dtree1)
- Oil Wildcatter's Problem in Risk Averse Setting
- Contract Bidding Problem (dtree3)
- Research and Development Decision Problem (dtree4)
- Loan Grant Decision Problem (dtree5)
- Petroleum Distributor's Decision Problem (dtree6)
Earned Value Macros
GA Procedure
- Getting Started Example (ga0)
- Traveling Salesman Prob with Local Optimization(ga1)
- Nonlinear Objective and Constraints Using Repair(ga2)
- Quadratic Obj with Linear Cons, Using Bicriterion(ga3)
GANTT Procedure
- Software Development Project (gantt0)
- Line-printer Gantt Chart (gantt1)
- Customizing the Line-printer Gantt Chart (gantt2)
- Marking Holidays (gantt3)
- Marking Milestones and Special Dates (gantt4)
- Using the COMPRESS option (gantt5)
- Using the MININTERVAL= and SCALE= Options(gantt6)
- Use of MINDATE and MAXDATE Options (gantt7)
- Variable Length Holidays (gantt8)
- Multiple Calendars (gantt9)
- Plotting ACTUAL Schedule (gantt10)
- Comparing Progress against a BASELINE (gantt11)
- Using the COMBINE option (gantt12)
- Plotting the Resource Constrained Schedule (gantt13)
- Specifying the Schedule Data Directly (gantt14)
- BY Processing (gantt15)
- GANTT Chart by Persons (gantt16)
- Using the HEIGHT= and HTOFF= options (gantt17)
- Logic Gantt chart: (AON) & LEVEL= Option (gantt18)
- Specifying the Logic Options (gantt19)
- Non Standard Precedence Relationships (gantt20)
- Using the ANNOTATE= Option (gantt21)
- Using Automatic Text Annotation Facility (gantt22)
- Multiproject GANTT Charts (gantt23)
- Segmented Gantt Charts (gantt24)
- Zoned Gantt Chart (gantt25)
- Producing Web Enabled Gantt Charts (gantt26)
- Using the CHARTWIDTH= Option (gantt27)
- Time Axis Labeling (gantt28)
INTPOINT Procedure
- All Examples From INPOINT (For Consecutive Runs)
- Getting Started: NPSC Problems (int0a)
- Getting Started: LP Problems (int0b)
- Missing S Supply and Missing D Demand Values (int0c)
- Production, Inventory, Distribution Problem (int1)
- Altering Arc Data (int2)
- Adding Side Constraints (int3)
- Using Constraints/More Alteration to Arc Data (int4)
- Nonarc Variables in the Side Constraints (int5)
- Solving an LP Problem with Data in MPS Format (int6)
- Converting to an MPS-Format SAS Data Set (int7)
- Migration to OPTMODEL: Production, Inventory, Distribution (int8)
Linear Programming Solver
- Getting Started Example (lpsol0)
- Diet Problem (lpsol1)
- Reoptimizing Using BASIS=WARMSTART (lpsol2)
- Two-Person Zero-Sum Game (lpsol3)
- Finding an Irreducible Infeasible Set (lpsol4)
- Min-cost Network Flow Problem Using Network Simplex (lpsol5)
- Migration: Generalized Networks (lpsol6)
- Migration: Maximum Flow (lpsol7)
- Migration: Production, Inventory, Distribution (lpsol8)
- Migration: Shortest Path (lpsol9)
LP Procedure
- Oil Blending Problem (lp1)
- Sparse View of Oil Blending Problem (lp2)
- Analyzing Solution Sensitivity to Obj Coeffs (lp3)
- More Objective Sensitivity Analysis (lp4)
- Parametric Programming for the Oil Blending (lp5)
- SOS Set and the Oil Blending Problem (lp6)
- Goal-Programming a Product Mix Problem (lp7)
- A Simple Integer Program (lp8)
- An Infeasible Problem (lp9)
- Restarting an Integer Program (lp10)
- Alternative B & B Search Strategy (lp11)
- An Assignment Problem (lp12)
- A Scheduling Problem (lp13)
- Multi-Commodity Transshipment Problem (lp14)
- Converting to an MPS-Format SAS Data Set (lp15)
- Migration to OPTMODEL: Assignment (lp16)
- Migration to OPTMODEL: Multicommodity Transshipment (lp17)
Network Solver
- Shortest Paths To and From SAS (netslg01)
- Examples from the Details section (netsld01)
- Articulation Points in a Terrorist Network (netsle01)
- Cycle Detection for Kidney Donor Exchange (netsle02)
- Linear Assignment Problem for Minimizing Swim Times (netsle03)
- Linear Assignment Problem, Sparse vs. Dense Input (netsle04)
- Minimum Spanning Tree for Computer Network Design (netsle05)
- Transitive Closure: Bug Tracking Circular Dependencies (netsle06)
- Traveling Salesman Tour Through U.S. Capital Cities (netsle07)
OPTLSO Procedure
- Example Code from Details Section (lsod01)
- Using Dense Format (lsoe01)
- Using MPS Format (lsoe02)
- Using QPS Format (lsoe03)
- Combining MPS and FCMP Function Definitions (lsoe04)
- Linear Constraints and a Nonlinear Objective (lsoe05)
- Using Nonlinear Constraints (lsoe06)
- Using External Data Sets (lsoe07)
- Johnson's System of Distribution (lsoe08)
- Discontinuous Function With a Lookup Table (lsoe09)
- Multiobjective Optimization (lsoe10)
- Getting Started Example (lsog01)
Mathematical Programming Examples
- Food Manufacture 1 (mpex01)
- Food Manufacture 2 (mpex02)
- Factory Planning 1 (mpex03)
- Factory Planning 2 (mpex04)
- Manpower Planning (mpex05)
- Refinery Optimization (mpex06)
- Mining (mpex07)
- Farm Planning (mpex08)
- Economic Planning (mpex09)
- Decentralization (mpex10)
- Curve Fitting (mpex11)
- Logical Design (mpex12)
- Market Sharing (mpex13)
- Opencast Mining (mpex14)
- Tariff Rates (Power Generation) (mpex15)
- Hydro Power (mpex16)
- Three-Dimensional Noughts and Crosses (mpex17)
- Optimizing a Constraint (mpex18)
- Distribution 1 (mpex19)
- Depot Location (Distribution 2) (mpex20)
- Agricultural Pricing (mpex21)
- Efficiency Analysis (mpex22)
- Milk Collection (mpex23)
- Yield Management (mpex24)
- Car Rental 1 (mpex25)
- Car Rental 2 (mpex26)
- Lost Baggage Distribution (mpex27)
- Protein Folding (mpex28)
- Protein Comparison (mpex29)
Mixed Integer Linear Programming Solver
- Getting Started Example (milpsl0)
- Scheduling (milpsl1)
- Multicommodity Transshipment w/ Fixed Charges (milpsl2)
- Facility Location (milpsl3)
- Traveling Salesman Problem (milpsl4)
MPS-Format SAS Data Set
NETDRAW Procedure
- Software Development Project (netdr0)
- Line-printer Network Diagram (netdr1)
- Graphics Network Diagram (netdr2)
- Spanning Multiple Pages (netdr3)
- The COMPRESS and PCOMPRESS Options (netdr4)
- Controlling Display Format (netdr5)
- Non Standard Precedence Relationships (netdr6)
- Controlling Arc Routing Algorithm (netdr7)
- Specifying PATTERN and SHOWSTATUS (netdr8)
- Time Scaled Network Diagram (netdr9)
- Time Scale Options (netdr10)
- Zoned Network Diagrams (netdr11)
- Schematic Diagrams (netdr12)
- Modifying Network Layout (netdr13)
- A Distribution Network (netdr14)
- Tree Diagrams and Organizational Charts (netdr15)
- Annotate Facility with PROC NETDRAW (netdr16)
- AOA Network Using the Annotate Facility (netdr17)
- Branch and Bound Tree (netdr18)
- Scheduling a Hospital Move (netdr19)
NETFLOW Procedure
NLP Procedure
Nonlinear Programming Solver
- Getting Started Example (nlp0)
- Solving Highly Nonlinear Optimization Problems (nlps1)
- Solving Unconstrained Optimization Problems (nlps2)
- Solving NLP Problems With Range Constraints (nlps3)
- Solving Large-Scale NLP Problems (nlps4)
- Solving NLP Problems With Several Local Minima (nlps5)
OPTLP Procedure
- Getting Started Example (optlp0)
- Oil Refinery Problem (optlp1)
- Solving the Oil Problem by the Interior Point Solver (optlp2)
- The Diet Problem (optlp3)
- Reoptimizing After Modifying the Objective Function (optlp4)
- Reoptimizing After Modifying the Right-Hand Side (optlp5)
- Reoptimizing After Adding a New Constraint (optlp6)
- Finding an Irreducible Infeasible Set (optlp7)
- Min-cost Network Flow Problem Using Network Simplex (optlp8)
OPTMILP Procedure
- Getting Started Example (optmilp0)
- Simple Integer Linear Program (optmilp1)
- MIPLIB Benchmark Instance (optmilp2)
- Facility Location (optmilp3)
- Scheduling (optmilp4)
OPTMILP Option Tuner
- Getting Started Examples (tunerg01)
- Tuning the Default Set of Options on a Single Problem (tunere01)
- Tuning a Defined Set of Options on Multiple Problems (tunere02)
OPTMODEL Procedure
- Getting Started Examples (omod0a)
- Syntax Examples (omod0c)
- Details Examples (omod0e)
- Matrix Square Root (omod1)
- Reading from and Creating a Data Set (omod2)
- Model Construction (omod3)
- Set Manipulation (omod4)
- Cutting Stock (omod5)
- Traveling Salesman Problem (omod6)
- Sparse Modeling (omod7)
- Chemical Equilibrium (omod8)
OPTNET Procedure
- Getting Started Examples (onetg01)
- Details Examples (onetd01)
- Articulation Points in a Terrorist Network (onete01)
- Cycle Detection for Kidney Donor Exchange (onete02)
- Linear Assignment Problem for Minimizing Swim Times (onete03)
- Linear Assignment Problem, Sparse vs. Dense Input (onete04)
- Minimum Spanning Tree for Computer Network Design (onete05)
- Transitive Closure: Bug Tracking Circular Dependencies (onete06)
- Traveling Salesman Tour Through U.S. Capital Cities (onete07)
OPTQP Procedure
- Getting Started Example (optqp0)
- Linear Least-Squares Problem (optqp1)
- Portfolio Optimization (optqp2)
- Portfolio Selection with Transactions (optqp3)
PM Procedure
Quadratic Programming Solver
- Getting Started Example (qpsol0)
- Linear Least-Squares Problem (qpsol1)
- Portfolio Optimization (qpsol2)
- Portfolio Selection with Transactions (qpsol3)
Miscellaneous Project Management Examples
- Pool Project
- Factory Expansion Project
- LAN Selection Project
- Integrated Assembly Test Project
- Subdivision Construction Project
- Landfill Site Project
- Pipeline Maintenance Project
- Pharmaceutical Project
- Course Scheduling Project
- Software Development Project
Microsoft Project Conversion Macros
- Simple %MSPTOSAS Conversion (mspsas1)
- Importing Activity Attributes (mspsas2)
- Importing Multiple Projects (mspsas3)
- Simple %MSPTOSAS Conversion (mspsas4)
- Simple %SASTOMSP Conversion (mspsas5)
- Exporting Data Set and Variable Names (mspsas6)
- Exporting Calendars and Holidays (mspsas7)
- Exporting Resource-Constrained Schedules (mspsas8)
- Round Trip between SAS and Microsoft Project (mspsas9)