SAS/OR User's Guide 14.1
Example Programs
Introduction to Mathematical Programming
Introduction to Mathematical Programming Legacy Procedures
Introduction to Project Management
- Project Definition (intpme01)
- Work Breakdown Structure (intpme02)
- Project Scheduling and Reporting (intpme03)
- Summarizing the Schedule (intpme04)
- Resource Constrained Scheduling (intpme05)
- Multiple Projects (intpme06)
- Sequential Scheduling of Projects (intpme07)
- Cost Analysis (intpme08)
- Subcontracting Decision (intpme09)
BOM Procedure
- Details Examples (bomd01)
- Bill of Material with Single Input Data Set
- Bill of Material with Lead Time Information
- Bill of Material with Scrap Factor Information
- Planning Bill of Material (bome04)
- Modular Bill of Material (bome05)
- Bill of Material w/ Repeated Relationships
- Bill of Material Verification (bome07)
- Roll-Up Cost in Indented Bill of Material (bome08)
- Bill of Material Explosion (bome09)
- Aggregating Forecasts Using PROC BOM (bome10)
- Getting Started Examples (bomg01)
- Examples from the BOM Macros chapter (bommad01)
CLP Procedure
- Getting Started Examples (clpg01)
- Logic Based Puzzles (clpe01)
- Alphabet Blocks Problem (clpe02)
- Work-Shift Scheduling: Finding Optimal Assignment
- A Nonlinear Optimization Problem (clpe04)
- Car Painting Problem (clpe05)
- Scene Allocation Problem (clpe06)
- The Car Sequencing Problem (clpe07)
- Round Robin Tournament Scheduling (clpe08)
- Resource Scheduling w/ Nonstandard Temporal Constraints
- Scheduling with Alternate Resources (clpe10)
- 10X10 Job Shop Scheduling Problem (clpe11)
- Scheduling a Major Basketball Conference (clpe12)
- Balanced Incomplete Block Design (clpe13)
- Progressive Party Problem (clpe14)
CPM Procedure
- Software Development Project (cpmg01)
- Activity-on-Node Representation (cpme01)
- Activity-on-Arc Representation of Project (cpme02)
- Meeting Project Deadlines (cpme03)
- Printing the Schedule on a Calendar (cpme04)
- Precedence Gantt Chart (cpme05)
- Changing Duration Units (cpme06)
- Controlling the Project Calendar (cpme07)
- Scheduling Around Holidays (cpme08)
- Specifying CALEDATA and WORKDATA Data Sets (cpme09)
- Multiple Calendars (cpme10)
- Nonstandard Relationships (cpme11)
- Activity Time Constraints (cpme12)
- Progress Update and Target Schedules (cpme13)
- Summarizing Resource Utilization (cpme14)
- Resource Allocation (cpme15)
- Using Supplementary Resources (cpme16)
- Use of the INFEASDIAGNOSTIC Option (cpme17)
- Variable Activity Delay (cpme18)
- Activity Splitting (cpme19)
- Scheduling with Alternate Resources (cpme20)
- PERT Assumptions and Calculations (cpme21)
- Scheduling Course / Teacher Combinations (cpme22)
- Multiproject Scheduling (cpme23)
- Resource Driven Durations and Res.Calendars (cpme24)
- Resource Driven Durations and Alt Resources (cpme25)
- Multiple Alternate Resources (cpme26)
- Auxiliary and Alternate Resources (cpme27)
- Use of the SETFINISHMILESTONE Option (cpme28)
- Negative Resource Requirements (cpme29)
- Auxiliary Resources and Negative Resource Reqmts (cpme30)
- Resource-Driven Durations and Negative Requirements (cpme31)
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 in Single-machine Mode (dcmpe03)
- Block-diagonal Structure in Distributed Mode (dcmpe04)
- Block-angular Structure (dcmpe05)
- Bin Packing Problem (dcmpe06)
- Resource Allocation (dcmpe07)
- Vehicle Routing Problem (dcmpe08)
- ATM Cash Management in Single-machine Mode (dcmpe09)
- ATM Cash Management in Distributed Mode (dcmpe10)
- Kidney Donor Exchange (dcmpe11)
DTREE Procedure
- Oil Wildcatter's Problem (dtreeg01)
- Oil Wildcatter's Problem with an Insurance
- Oil Wildcatter's Problem in Risk Averse Setting
- Contract Bidding Problem (dtreee03)
- Research and Development Decision Problem
- Loan Grant Decision Problem (dtreee05)
- Petroleum Distributor's Decision Problem
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 (ganttg01)
- Line-printer Gantt Chart (gantte01)
- Customizing the Line-printer Gantt Chart (gantte02)
- Marking Holidays (gantte03)
- Marking Milestones and Special Dates (gantte04)
- Using the COMPRESS option (gantte05)
- Using the MININTERVAL= and SCALE= Options(gantte06)
- Use of MINDATE and MAXDATE Options (gantte07)
- Variable Length Holidays (gantte08)
- Multiple Calendars (gantte09)
- Plotting ACTUAL Schedule (gantte10)
- Comparing Progress against a BASELINE (gantte11)
- Using the COMBINE option (gantte12)
- Plotting the Resource Constrained Schedule
- Specifying the Schedule Data Directly (gantte14)
- BY Processing (gantte15)
- GANTT Chart by Persons (gantte16)
- Using the HEIGHT= and HTOFF= options (gantte17)
- Logic Gantt chart: (AON) & LEVEL= Option (gantte18)
- Specifying the Logic Options (gantte19)
- Non Standard Precedence Relationships (gantte20)
- Using the ANNOTATE= Option (gantte21)
- Using Automatic Text Annotation Facility (gantte22)
- Multiproject GANTT Charts (gantte23)
- Segmented Gantt Charts (gantte24)
- Zoned Gantt Chart (gantte25)
- Producing Web Enabled Gantt Charts (gantte26)
- Using the CHARTWIDTH= Option (gantte27)
- Time Axis Labeling (gantte28)
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 (lpsolg01)
- Diet Problem (lpsole01)
- Reoptimizing Using BASIS=WARMSTART (lpsole02)
- Two-Person Zero-Sum Game (lpsole03)
- Finding an Irreducible Infeasible Set (lpsole04)
- Min-cost Network Flow Problem Using Network Simplex (lpsole05)
- Migration: Generalized Networks (lpsole06)
- Migration: Maximum Flow (lpsole07)
- Migration: Production, Inventory, Distribution (lpsole08)
- Migration: Shortest Path (lpsole09)
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)
Constraint Programming Solver
- Samples from the Getting Started section (oclpg01)
- Logic Based Puzzles (oclpe01)
- Alphabet Blocks Problem (oclpe02)
- Optimal Work-Shift Scheduling Assignment (oclpe03)
- A Nonlinear Optimization Problem (oclpe04)
- Car Painting Problem (oclpe05)
- Scene Allocation Problem (oclpe06)
- The Car Sequencing Problem (oclpe07)
- Balanced Incomplete Block Design (oclpe08)
- Progressive Party Problem (oclpe09)
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 (misolg01)
- Scheduling (misole01)
- Multicommodity Transshipment w/Fixed Charges (misole02)
- Facility Location (misole03)
- Traveling Salesman Problem (misole04)
MPS-Format SAS Data Set
NETDRAW Procedure
- Software Development Project (netdrg01)
- Line-printer Network Diagram (netdre01)
- Graphics Network Diagram (netdre02)
- Spanning Multiple Pages (netdre03)
- The COMPRESS and PCOMPRESS Options (netdre04)
- Controlling Display Format (netdre05)
- Non Standard Precedence Relationships (netdre06)
- Controlling Arc Routing Algorithm (netdre07)
- Specifying PATTERN and SHOWSTATUS (netdre08)
- Time Scaled Network Diagram (netdre09)
- Time Scale Options (netdre10)
- Zoned Network Diagrams (netdre11)
- Schematic Diagrams (netdre12)
- Modifying Network Layout (netdre13)
- A Distribution Network (netdre14)
- Tree Diagrams and Organizational Charts (netdre15)
- Annotate Facility with PROC NETDRAW (netdre16)
- AOA Network Using the Annotate Facility (netdre17)
- Branch and Bound Tree (netdre18)
- Scheduling a Hospital Move (netdre19)
NETFLOW Procedure
NLP Procedure
Nonlinear Programming Solver
- Getting Started Example (nlpsg01)
- Solving Highly Nonlinear Optimization Problems (nlpse01)
- Solving Unconstrained Optimization Problems (nlpse02)
- Solving NLP Problems With Range Constraints (nlpse03)
- Solving Large-Scale NLP Problems (nlpse04)
- Solving NLP Problems With Several Local Minima (nlpse05)
- Maximum Likelihood Weibull Model (nlpse06)
- Finding an Irreducible Infeasible Set (nlpse07)
OPTLP Procedure
- Getting Started Example (optlpg01)
- Oil Refinery Problem (optlpe01)
- Solving the Oil Problem by the IPM Algorithm (optlpe02)
- The Diet Problem (optlpe03)
- Reoptimizing After Modifying the Objective Function (optlpe04)
- Reoptimizing After Modifying the Right-Hand Side (optlpe05)
- Reoptimizing After Adding a New Constraint (optlpe06)
- Finding an Irreducible Infeasible Set (optlpe07)
- Min-cost Network Flow Problem Using Network Simplex (optlpe08)
OPTMILP Procedure
- Getting Started Example (optmig01)
- Simple Integer Linear Program (optmie01)
- MIPLIB Benchmark Instance (optmie02)
- Facility Location (optmie03)
- Scheduling (optmie04)
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 (omodg01)
- Syntax Examples (omods01)
- Details Examples (omodd01)
- Matrix Square Root Example (omode01)
- Reading from and Creating a Data Set (omode02)
- Model Construction Example (omode03)
- Set Manipulation Example (omode04)
- Cutting Stock Example (omode05)
- Traveling Salesman Problem Example (omode06)
- Sparse Modeling Example (omode07)
- Chemical Equilibrium Example (omode08)
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 (optqpg01)
- Linear Least-Squares Problem (optqpe01)
- Portfolio Optimization (optqpe02)
- Portfolio Selection with Transactions (optqpe03)
PM Procedure
Quadratic Programming Solver
- Getting Started Example (qpsolg01)
- Linear Least-Squares Problem (qpsole01)
- Portfolio Optimization (qpsole02)
- Portfolio Selection with Transactions (qpsole03)
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 (mspsae01)
- Importing Activity Attributes (mspsae02)
- Importing Multiple Projects (mspsae03)
- Simple %MSPTOSAS Conversion (mspsae04)
- Simple %SASTOMSP Conversion (mspsae05)
- Exporting Data Set and Variable Names (mspsae06)
- Exporting Calendars and Holidays (mspsae07)
- Exporting Resource-Constrained Schedules (mspsae08)
- Round Trip between SAS and Microsoft Project (mspsae09)