| |
| |
| Preface | |
| |
| |
| |
| Introduction to Spreadsheet Models for Optimization | |
| |
| |
| |
| Elements of a Model | |
| |
| |
| |
| Spreadsheet Models | |
| |
| |
| |
| A Hierarchy for Analysis | |
| |
| |
| |
| Optimization Software | |
| |
| |
| |
| Using Solver | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| References | |
| |
| |
| |
| Linear Programming: Allocation, Covering, and Blending Models | |
| |
| |
| |
| Linear Models | |
| |
| |
| |
| Linear Constraints | |
| |
| |
| |
| Formulation | |
| |
| |
| |
| Layout | |
| |
| |
| |
| Results | |
| |
| |
| |
| Allocation Models | |
| |
| |
| |
| The Product Mix Problem | |
| |
| |
| |
| Covering Models | |
| |
| |
| |
| The Staff-Scheduling Problem | |
| |
| |
| |
| Blending Models | |
| |
| |
| |
| Modeling Errors in Linear Programming | |
| |
| |
| |
| Exceptions | |
| |
| |
| |
| Debugging | |
| |
| |
| |
| Logic | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: JetGreen | |
| |
| |
| |
| Linear Programming: Network Models | |
| |
| |
| |
| The Transportation Model | |
| |
| |
| |
| The Assignment Model | |
| |
| |
| |
| The Transshipment Model | |
| |
| |
| |
| Features of Special Network Models | |
| |
| |
| |
| Building Network Models with Balance Equations | |
| |
| |
| |
| General Network Models with Yields | |
| |
| |
| |
| Models with Yield Losses | |
| |
| |
| |
| Models with Yield Gains | |
| |
| |
| |
| General Network Models with Transformed Flows | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: Casey's Famous Roast Beef | |
| |
| |
| Case: Hollingsworth Paper Company | |
| |
| |
| Production and Distribution Facilities | |
| |
| |
| Patterns of Distribution | |
| |
| |
| Expansion Proposals | |
| |
| |
| |
| Sensitivity Analysis in Linear Programs | |
| |
| |
| |
| Parameter Analysis in the Transportation Example | |
| |
| |
| |
| Parameter Analysis in the Allocation Example | |
| |
| |
| |
| The Sensitivity Report and the Transportation Example | |
| |
| |
| |
| The Sensitivity Report and the Allocation Example | |
| |
| |
| |
| Degeneracy and Alternative Optima | |
| |
| |
| |
| Patterns in Linear Programming Solutions | |
| |
| |
| |
| The Transportation Model | |
| |
| |
| |
| The Product Portfolio Model | |
| |
| |
| |
| The Investment Model | |
| |
| |
| |
| The Allocation Model | |
| |
| |
| |
| The Refinery Model | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: Cox Cable and Wire Company | |
| |
| |
| Background | |
| |
| |
| The Contract | |
| |
| |
| The Analysis | |
| |
| |
| |
| Linear Programming: Data Envelopment Analysis | |
| |
| |
| |
| A Graphical Perspective on DEA | |
| |
| |
| |
| An Algebraic Perspective on DEA | |
| |
| |
| |
| A Spreadsheet Model for DEA | |
| |
| |
| |
| Indexing | |
| |
| |
| |
| Finding Reference Sets and HCUs | |
| |
| |
| |
| Assumptions and Limitations of DEA | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: Branch Performance at Nashville National Bank | |
| |
| |
| Branch Growth at Nashville National Bank | |
| |
| |
| Assessing Branch Productivity | |
| |
| |
| Branch Managers Revolt | |
| |
| |
| Measuring Branches: Available Techniques | |
| |
| |
| The DEA Study | |
| |
| |
| |
| Integer Programming: Binary Choice Models | |
| |
| |
| |
| Using Solver with Integer Requirements | |
| |
| |
| |
| The Capital Budgeting Problem | |
| |
| |
| |
| Set Covering | |
| |
| |
| |
| Set Packing | |
| |
| |
| |
| Set Partitioning | |
| |
| |
| |
| Playoff Scheduling | |
| |
| |
| |
| Solving a Large-Scale Set Partitioning Problem | |
| |
| |
| |
| The Algorithm for Solving Integer Programs | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: Motel Location for Nature's Inn | |
| |
| |
| |
| Integer Programming: Logical Constraints | |
| |
| |
| |
| Simple Logical Constraints: Exclusivity and Contingency | |
| |
| |
| |
| Linking Constraints: The Fixed Cost Problem | |
| |
| |
| |
| Linking Constraints: The Threshold Level Problem | |
| |
| |
| |
| Linking Constraints: The Facility Location Model | |
| |
| |
| |
| Capacitated Version | |
| |
| |
| |
| Uncapacilated Version | |
| |
| |
| |
| Disjunctive Constraints: The Machine Sequencing Problem | |
| |
| |
| |
| Tour and Subset Constraints: The Traveling Salesperson Problem | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: Hornby Products Company | |
| |
| |
| History | |
| |
| |
| Alternatives | |
| |
| |
| |
| Nonlinear Programming | |
| |
| |
| |
| One-variable Models | |
| |
| |
| |
| An Inventory Example | |
| |
| |
| |
| A Quantity Discount Example | |
| |
| |
| |
| Local Optima and the Search for an Optimum | |
| |
| |
| |
| Two-Variable Models | |
| |
| |
| |
| Curve Fitting | |
| |
| |
| |
| Two-dimensional Location | |
| |
| |
| |
| Nonlinear Models with Constraints | |
| |
| |
| |
| A Pricing Example | |
| |
| |
| |
| Sensitivity Analysis for Nonlinear Programs | |
| |
| |
| |
| The Portfolio Optimization Model | |
| |
| |
| |
| Linearizations | |
| |
| |
| |
| Linearizing the Maximum | |
| |
| |
| |
| Linearizing the Absolute Value | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: Delhi Foods | |
| |
| |
| |
| Heuristic Solutions with the Evolutionary Solver | |
| |
| |
| |
| Features of the Evolutionary Solver | |
| |
| |
| |
| An Illustrative Example: Nonlinear Regression | |
| |
| |
| |
| The Machine-Sequencing Problem Revisited | |
| |
| |
| |
| The Traveling Salesperson Problem Revisited | |
| |
| |
| |
| Two-dimensional Location | |
| |
| |
| |
| Line Balancing | |
| |
| |
| |
| Group Assignment | |
| |
| |
| Summary | |
| |
| |
| Exercises | |
| |
| |
| Case: Colgate Wave (Abridged) | |
| |
| |
| Introduction | |
| |
| |
| The Study | |
| |
| |
| Case Appendix: Market Share Simulation Model (CoIgate.xls) | |
| |
| |
| Data | |
| |
| |
| Calculations | |
| |
| |
| Simulation | |
| |
| |
| Appendices | |
| |
| |
| |
| Optimization Software and Supplemental Files | |
| |
| |
| |
| Risk Solver Platform | |
| |
| |
| |
| Supplemental Excel Files | |
| |
| |
| |
| Graphical Methods in Linear Programming | |
| |
| |
| |
| An Example | |
| |
| |
| |
| Generalities | |
| |
| |
| |
| The Simplex Method | |
| |
| |
| |
| An Example | |
| |
| |
| |
| Variations of the Algorithm | |
| |
| |
| References | |
| |
| |
| |
| Stochastic Programming | |
| |
| |
| |
| One-Stage Decisions with Uncertainty | |
| |
| |
| |
| Two-Stage Decisions with Uncertainty | |
| |
| |
| |
| Using Solver | |
| |
| |
| Index | |