Project Management

profileh85zel239
QuantitativeAnalysisforManagement13thEdition1.pdf

BARRY RENDER • RALPH M. STAIR, JR. • MICHAEL E. HANNA • TREVOR S. HALE

T H I R T E E N T H E D I T I O N

QUANTITATIVE ANALYSIS for MANAGEMENT

New York, NY

BARRY RENDER Charles Harwood Professor Emeritus of Management Science

Crummer Graduate School of Business, Rollins College

MICHAEL E. HANNA Professor of Decision Sciences,

University of Houston–Clear Lake

TREVOR S. HALE Associate Professor of Management Sciences,

University of Houston–Downtown

T H I R T E E N T H E D I T I O N

QUANTITATIVE ANALYSIS for MANAGEMENT

RALPH M. STAIR, JR. Professor Emeritus of Information and Management Sciences,

Florida State University

A01_REND3161_13_AIE_FM.indd 1 02/11/16 10:04 PM

Vice President, Business Publishing: Donna Battista Director, Courseware Portfolio Management: Ashley Dodge Director of Portfolio Management: Stephanie Wall Senior Sponsoring Editor: Neeraj Bhalla Managing Producer: Vamanan Namboodiri M.S. Editorial Assistant: Linda Albelli Vice President, Product Marketing: Roxanne McCarley Director of Strategic Marketing: Brad Parkins Strategic Marketing Manager: Deborah Strickland Product Marketer: Becky Brown Field Marketing Manager: Natalie Wagner Field Marketing Assistant: Kristen Compton Product Marketing Assistant: Jessica Quazza Vice President, Production and Digital Studio, Arts and Business: Etain O’Dea Director of Production, Business: Jeff Holcomb

Managing Producer, Business: Ashley Santora Operations Specialist: Carol Melville Creative Director: Blair Brown Manager, Learning Tools: Brian Surette Content Developer, Learning Tools: Lindsey Sloan Managing Producer, Digital Studio, Arts and Business: Diane Lombardo Digital Studio Producer: Regina DaSilva Digital Studio Producer: Alana Coles Full-Service Project Management and Composition: Thistle Hill Publishing Services / Cenveo® Publisher Services Interior Design: Cenveo® Publisher Services Cover Design: Bruce Kenselaar Cover Art: 123RF Printer/Binder: Edward Bros./Malloy Cover Printer: Phoenix Color

Microsoft and/or its respective suppliers make no representations about the suitability of the information contained in the documents and related graphics published as part of the services for any purpose. All such documents and related graphics are provided “as is” without warranty of any kind. Microsoft and/or its respective suppliers hereby disclaim all warranties and conditions with regard to this informa- tion, including all warranties and conditions of merchantability, whether express, implied or statutory, fitness for a particular purpose, title and non-infringement. In no event shall Microsoft and/or its respective suppliers be liable for any special, indirect or consequential damages or any damages whatsoever resulting from loss of use, data or profits, whether in an action of contract, negligence or other tor- tious action, arising out of or in connection with the use or performance of information available from the services.

The documents and related graphics contained herein could include technical inaccuracies or typographical errors. Changes are periodi- cally added to the information herein. Microsoft and/or its respective suppliers may make improvements and/or changes in the product(s) and/or the program(s) described herein at any time. Partial screen shots may be viewed in full within the software version specified.

Microsoft® and Windows® are registered trademarks of the Microsoft Corporation in the U.S.A. and other countries. This book is not sponsored or endorsed by or affiliated with the Microsoft Corporation.

Copyright © 2018, 2015, 2012 by Pearson Education, Inc. or its affiliates. All Rights Reserved. Manufactured in the United States of America. This publication is protected by copyright, and permission should be obtained from the publisher prior to any prohibited repro- duction, storage in a retrieval system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise. For information regarding permissions, request forms, and the appropriate contacts within the Pearson Education Global Rights and Permissions department, please visit www.pearsoned.com/permissions/.

Acknowledgments of third-party content appear on the appropriate page within the text.

Unless otherwise indicated herein, any third-party trademarks, logos, or icons that may appear in this work are the property of their respective owners, and any references to third-party trademarks, logos, icons, or other trade dress are for demonstrative or descriptive purposes only. Such references are not intended to imply any sponsorship, endorsement, authorization, or promotion of Pearson’s prod- ucts by the owners of such marks, or any relationship between the owner and Pearson Education, Inc., or its affiliates, authors, licensees, or distributors.

Library of Congress Cataloging-in-Publication Data Names: Render, Barry, author. | Stair, Ralph M., author. | Hanna, Michael E.,    author. | Hale, Trevor S., author. Title: Quantitative analysis for management / Barry Render, Charles Harwood    Professor of Management Science, Crummer Graduate School of Business,    Rollins College; Ralph M. Stair, Jr., Professor of Information and    Management Sciences, Florida State University; Michael E. Hanna, Professor    of Decision Sciences, University of Houston/Clear Lake; Trevor S. Hale,    Associate Professor of Management Sciences, University of Houston/Downtown. Description: Thirteenth edition. | Boston : Pearson, 2016. | Includes    bibliographical references and index. Identifiers: LCCN 2016037461| ISBN 9780134543161 (hardcover) | ISBN    0134543165 (hardcover) Subjects: LCSH: Management science—Case studies. | Operations research—Case    studies. Classification: LCC T56 .R543 2016 | DDC 658.4/03—dc23 LC record available at https://lccn.loc.gov/ 2016037461

ISBN 10: 0-13-454316-5 ISBN 13: 978-0-13-454316-1

10 9 8 7 6 5 4 3 2 1

To my wife and sons—BR

To Lila and Leslie—RMS

To Zoe and Gigi—MEH

To Valerie and Lauren—TSH

A01_REND3161_13_AIE_FM.indd 2 28/10/16 10:13 AM

iii

Barry Render is Professor Emeritus, the Charles Harwood Distinguished Professor of Operations Management, Crummer Graduate School of Business, Rollins College, Winter Park, Florida. He received his B.S. in Mathematics and Physics at Roosevelt University and his M.S. in Operations Research and his Ph.D. in Quantitative Analysis at the University of Cincinnati. He previously taught at George Washington University, the University of New Orleans, Boston University, and George Mason University, where he held the Mason Foundation Professorship in Decision Sciences and was Chair of the Decision Science Department. Dr. Render has also worked in the aerospace industry for General Electric, McDonnell Douglas, and NASA.

Dr. Render has coauthored 10 textbooks published by Pearson, including Managerial Decision Modeling with Spreadsheets, Operations Management, Principles of Operations Management, Service Management, Introduction to Management Science, and Cases and Readings in Management Science. More than 100 articles by Dr. Render on a variety of man- agement topics have appeared in Decision Sciences, Production and Operations Management, Interfaces, Information and Management, Journal of Management Information Systems, Socio- Economic Planning Sciences, IIE Solutions, and Operations Management Review, among others.

Dr. Render has been honored as an AACSB Fellow and was named twice as a Senior Fulbright Scholar. He was Vice President of the Decision Science Institute Southeast Region and served as software review editor for Decision Line for six years and as Editor of the New York Times Operations Management special issues for five years. From 1984 to 1993, Dr. Render was President of Management Service Associates of Virginia, Inc., whose technology clients included the FBI, the U.S. Navy, Fairfax County, Virginia, and C&P Telephone. He is currently Consulting Editor to Financial Times Press.

Dr. Render has taught operations management courses at Rollins College for MBA and Executive MBA programs. He has received that school’s Welsh Award as leading professor and was selected by Roosevelt University as the 1996 recipient of the St. Claire Drake Award for Outstanding Scholarship. In 2005, Dr. Render received the Rollins College MBA Student Award for Best Overall Course, and in 2009 was named Professor of the Year by full-time MBA students.

Ralph Stair is Professor Emeritus at Florida State University. He earned a B.S. in chemical engi- neering from Purdue University and an M.B.A. from Tulane University. Under the guidance of Ken Ramsing and Alan Eliason, he received a Ph.D. in operations management from the University of Oregon. He has taught at the University of Oregon, the University of Washington, the University of New Orleans, and Florida State University.

He has taught twice in Florida State University’s Study Abroad Program in London. Over the years, his teaching has been concentrated in the areas of information systems, operations research, and operations management.

Dr. Stair is a member of several academic organizations, including the Decision Sciences Institute and INFORMS, and he regularly participates in national meetings. He has published numerous articles and books, including Managerial Decision Modeling with Spreadsheets, Introduction to Management Science, Cases and Readings in Management Science, Production and Operations Management: A Self-Correction Approach, Fundamentals of Information Systems, Principles of Information Systems, Introduction to Information Systems, Computers in

About the Authors

A01_REND3161_13_AIE_FM.indd 3 28/10/16 10:13 AM

iv  ABOUT THE AUTHORS

Today’s World, Principles of Data Processing, Learning to Live with Computers, Programming in BASIC, Essentials of BASIC Programming, Essentials of FORTRAN Programming, and Essentials of COBOL Programming. Dr. Stair divides his time between Florida and Colorado. He enjoys skiing, biking, kayaking, and other outdoor activities.

Michael E. Hanna is Professor of Decision Sciences at the University of Houston–Clear Lake (UHCL). He holds a B.A. in Economics, an M.S. in Mathematics, and a Ph.D. in Operations Research from Texas Tech University. For more than 25 years, he has been teaching courses in sta- tistics, management science, forecasting, and other quantitative methods. His dedication to teach- ing has been recognized with the Beta Alpha Psi teaching award in 1995 and the Outstanding Educator Award in 2006 from the Southwest Decision Sciences Institute (SWDSI).

Dr. Hanna has authored textbooks in management science and quantitative methods, has published numerous articles and professional papers, and has served on the Editorial Advisory Board of Computers and Operations Research. In 1996, the UHCL Chapter of Beta Gamma Sigma presented him with the Outstanding Scholar Award.

Dr. Hanna is very active in the Decision Sciences Institute (DSI), having served on the Innovative Education Committee, the Regional Advisory Committee, and the Nominating Committee. He has served on the board of directors of DSI for two terms and also as regionally elected vice president of DSI. For SWDSI, he has held several positions, including president, and he received the SWDSI Distinguished Service Award in 1997. For overall service to the profession and to the university, he received the UHCL President’s Distinguished Service Award in 2001.

Trevor S. Hale is Associate Professor of Management Science at the University of Houston– Downtown (UHD). He received a B.S. in Industrial Engineering from Penn State University, an M.S. in Engineering Management from Northeastern University, and a Ph.D. in Operations Research from Texas A&M University. He was previously on the faculty of both Ohio University– Athens and Colorado State University–Pueblo.

Dr. Hale was honored three times as an Office of Naval Research Senior Faculty Fellow. He spent the summers of 2009, 2011, and 2013 performing energy security/cyber security research for the U.S. Navy at Naval Base Ventura County in Port Hueneme, California.

Dr. Hale has published dozens of articles in the areas of operations research and quantita- tive analysis in journals such as the International Journal of Production Research, the European Journal of Operational Research, Annals of Operations Research, the Journal of the Operational Research Society, and the International Journal of Physical Distribution and Logistics Management, among several others. He teaches quantitative analysis courses at the University of Houston–Downtown. He is a senior member of both the Decision Sciences Institute and INFORMS.

A01_REND3161_13_AIE_FM.indd 4 28/10/16 10:13 AM

v

CHAPTER 1 Introduction to Quantitative Analysis 1

CHAPTER 2 Probability Concepts and Applications 21

CHAPTER 3 Decision Analysis 63

CHAPTER 4 Regression Models 111

CHAPTER 5 Forecasting 147

CHAPTER 6 Inventory Control Models 185

CHAPTER 7 Linear Programming Models: Graphical and Computer Methods 237

CHAPTER 8 Linear Programming Applications 289

CHAPTER 9 Transportation, Assignment, and Network Models 319

CHAPTER 10 Integer Programming, Goal Programming, and Nonlinear Programming 357

CHAPTER 11 Project Management 387

CHAPTER 12 Waiting Lines and Queuing Theory Models 427

CHAPTER 13 Simulation Modeling 461

CHAPTER 14 Markov Analysis 501

CHAPTER 15 Statistical Quality Control 529

ONLINE MODULES

1 Analytic Hierarchy Process M1-1

2 Dynamic Programming M2-1

3 Decision Theory and the Normal Distribution M3-1

4 Game Theory M4-1

5 Mathematical Tools: Determinants and Matrices M5-1

6 Calculus-Based Optimization M6-1

7 Linear Programming: The Simplex Method M7-1

8 Transportation, Assignment, and Network Algorithms M8-1

Brief Contents

A01_REND3161_13_AIE_FM.indd 5 28/10/16 10:13 AM

vi

PREFACE xiii

CHAPTER 1 Introduction to Quantitative Analysis 1 1.1 What Is Quantitative Analysis? 2 1.2 Business Analytics 2 1.3 The Quantitative Analysis Approach 3

Defining the Problem 4

Developing a Model 4

Acquiring Input Data 4

Developing a Solution 5

Testing the Solution 5

Analyzing the Results and Sensitivity Analysis 6

Implementing the Results 6

The Quantitative Analysis Approach and Modeling in the Real World 6

1.4 How to Develop a Quantitative Analysis Model 6 The Advantages of Mathematical Modeling 9

Mathematical Models Categorized by Risk 9

1.5 The Role of Computers and Spreadsheet Models in the Quantitative Analysis Approach 9

1.6 Possible Problems in the Quantitative Analysis Approach 12 Defining the Problem 12

Developing a Model 13

Acquiring Input Data 14

Developing a Solution 14

Testing the Solution 14

Analyzing the Results 15

1.7 Implementation—Not Just the Final Step 15 Lack of Commitment and Resistance to

Change 16

Lack of Commitment by Quantitative Analysts 16

Summary 16 Glossary 16 Key Equations 17

Self-Test 17 Discussion Questions and Problems 18 Case Study: Food and Beverages at Southwestern University Football Games 19 Bibliography 20

CHAPTER 2 Probability Concepts and Applications 21

2.1 Fundamental Concepts 22 Two Basic Rules of Probability 22

Types of Probability 22

Mutually Exclusive and Collectively Exhaustive Events 23

Unions and Intersections of Events 25

Probability Rules for Unions, Intersections, and Conditional Probabilities 25

2.2 Revising Probabilities with Bayes’ Theorem 27 General Form of Bayes’ Theorem 28

2.3 Further Probability Revisions 29 2.4 Random Variables 30 2.5 Probability Distributions 32

Probability Distribution of a Discrete Random Variable 32

Expected Value of a Discrete Probability Distribution 32

Variance of a Discrete Probability Distribution 33

Probability Distribution of a Continuous Random Variable 34

2.6 The Binomial Distribution 35 Solving Problems with the Binomial

Formula 36

Solving Problems with Binomial Tables 37

2.7 The Normal Distribution 38 Area Under the Normal Curve 40

Using the Standard Normal Table 40

Haynes Construction Company Example 41

The Empirical Rule 44

2.8 The F Distribution 44 2.9 The Exponential Distribution 46

Arnold’s Muffler Example 47

2.10 The Poisson Distribution 48 Summary 50 Glossary 50 Key Equations 51 Solved Problems 52 Self-Test 54 Discussion Questions and Problems 55 Case Study: WTVX 61 Bibliography 61

Appendix 2.1: Derivation of Bayes’ Theorem 61

Contents

A01_REND3161_13_AIE_FM.indd 6 28/10/16 10:13 AM

CONTENTS  vii

CHAPTER 3 Decision Analysis 63 3.1 The Six Steps in Decision Making 63 3.2 Types of Decision-Making

Environments 65 3.3 Decision Making Under Uncertainty 65

Optimistic 66

Pessimistic 66

Criterion of Realism (Hurwicz Criterion) 67

Equally Likely (Laplace) 67

Minimax Regret 67

3.4 Decision Making Under Risk 69 Expected Monetary Value 69

Expected Value of Perfect Information 70

Expected Opportunity Loss 71

Sensitivity Analysis 72

A Minimization Example 73

3.5 Using Software for Payoff Table Problems 75 QM for Windows 75

Excel QM 75

3.6 Decision Trees 77 Efficiency of Sample Information 82

Sensitivity Analysis 82

3.7 How Probability Values Are Estimated by Bayesian Analysis 83 Calculating Revised Probabilities 83

Potential Problem in Using Survey Results 85

3.8 Utility Theory 86 Measuring Utility and Constructing a Utility

Curve 86

Utility as a Decision-Making Criterion 88

Summary 91 Glossary 91 Key Equations 92 Solved Problems 92 Self-Test 97 Discussion Questions and Problems 98 Case Study: Starting Right Corporation 107 Case Study: Toledo Leather Company 107 Case Study: Blake Electronics 108 Bibliography 110

CHAPTER 4 Regression Models 111 4.1 Scatter Diagrams 112 4.2 Simple Linear Regression 113 4.3 Measuring the Fit of the Regression

Model 114 Coefficient of Determination 116

Correlation Coefficient 116

4.4 Assumptions of the Regression Model 117 Estimating the Variance 119

4.5 Testing the Model for Significance 119 Triple A Construction Example 121

The Analysis of Variance (ANOVA) Table 122

Triple A Construction ANOVA Example 122

4.6 Using Computer Software for Regression 122 Excel 2016 122

Excel QM 123

QM for Windows 125

4.7 Multiple Regression Analysis 126 Evaluating the Multiple Regression

Model 127

Jenny Wilson Realty Example 128

4.8 Binary or Dummy Variables 129 4.9 Model Building 130

Stepwise Regression 131

Multicollinearity 131

4.10 Nonlinear Regression 131 4.11 Cautions and Pitfalls in Regression

Analysis 134 Summary 135 Glossary 135 Key Equations 136 Solved Problems 137 Self-Test 139 Discussion Questions and Problems 139 Case Study: North–South Airline 144 Bibliography 145

Appendix 4.1: Formulas for Regression Calculations 145

CHAPTER 5 Forecasting 147 5.1 Types of Forecasting Models 147

Qualitative Models 147

Causal Models 148

Time-Series Models 149

5.2 Components of a Time-Series 149 5.3 Measures of Forecast Accuracy 151 5.4 Forecasting Models—Random Variations

Only 154 Moving Averages 154

Weighted Moving Averages 154

Exponential Smoothing 156

Using Software for Forecasting Time Series 158

5.5 Forecasting Models—Trend and Random Variations 160 Exponential Smoothing with Trend 160

Trend Projections 163

5.6 Adjusting for Seasonal Variations 164 Seasonal Indices 165

Calculating Seasonal Indices with No Trend 165

Calculating Seasonal Indices with Trend 166

5.7 Forecasting Models—Trend, Seasonal, and Random Variations 167 The Decomposition Method 167

Software for Decomposition 170

Using Regression with Trend and Seasonal Components 170

5.8 Monitoring and Controlling Forecasts 172 Adaptive Smoothing 174

Summary 174 Glossary 174 Key Equations 175 Solved Problems 176 Self-Test 177 Discussion Questions and Problems 178 Case Study: Forecasting Attendance at SWU Football Games 182 Case Study: Forecasting Monthly Sales 183 Bibliography 184

A01_REND3161_13_AIE_FM.indd 7 01/11/16 12:31 PM

viii  CONTENTS

CHAPTER 6 Inventory Control Models 185 6.1 Importance of Inventory Control 186

Decoupling Function 186

Storing Resources 187

Irregular Supply and Demand 187

Quantity Discounts 187

Avoiding Stockouts and Shortages 187

6.2 Inventory Decisions 187 6.3 Economic Order Quantity: Determining

How Much to Order 189 Inventory Costs in the EOQ Situation 189

Finding the EOQ 191

Sumco Pump Company Example 192

Purchase Cost of Inventory Items 193

Sensitivity Analysis with the EOQ Model 194

6.4 Reorder Point: Determining When to Order 194

6.5 EOQ Without the Instantaneous Receipt Assumption 196 Annual Carrying Cost for Production Run

Model 196

Annual Setup Cost or Annual Ordering Cost 197

Determining the Optimal Production Quantity 197

Brown Manufacturing Example 198

6.6 Quantity Discount Models 200 Brass Department Store Example 202

6.7 Use of Safety Stock 203 6.8 Single-Period Inventory Models 209

Marginal Analysis with Discrete Distributions 210

Café du Donut Example 210

Marginal Analysis with the Normal Distribution 212

Newspaper Example 212

6.9 ABC Analysis 214 6.10 Dependent Demand: The Case for

Material Requirements Planning 214 Material Structure Tree 215

Gross and Net Material Requirements Plans 216

Two or More End Products 218

6.11 Just-In-Time Inventory Control 219 6.12 Enterprise Resource Planning 220

Summary 221 Glossary 221 Key Equations 222 Solved Problems 223 Self-Test 225 Discussion Questions and Problems 226 Case Study: Martin-Pullin Bicycle Corporation 234 Bibliography 235

Appendix 6.1: Inventory Control with QM for Windows 235

CHAPTER 7 Linear Programming Models: Graphical and Computer Methods 237

7.1 Requirements of a Linear Programming Problem 238

7.2 Formulating LP Problems 239 Flair Furniture Company 240

7.3 Graphical Solution to an LP Problem 241 Graphical Representation of Constraints 241

Isoprofit Line Solution Method 245

Corner Point Solution Method 248

Slack and Surplus 250

7.4 Solving Flair Furniture’s LP Problem Using QM for Windows, Excel 2016, and Excel QM 251 Using QM for Windows 251

Using Excel’s Solver Command to Solve LP Problems 252

Using Excel QM 255

7.5 Solving Minimization Problems 257 Holiday Meal Turkey Ranch 257

7.6 Four Special Cases in LP 261 No Feasible Solution 261

Unboundedness 261

Redundancy 262

Alternate Optimal Solutions 263

7.7 Sensitivity Analysis 264 High Note Sound Company 265

Changes in the Objective Function Coefficient 266

QM for Windows and Changes in Objective Function Coefficients 266

Excel Solver and Changes in Objective Function Coefficients 267

Changes in the Technological Coefficients 268

Changes in the Resources or Right-Hand-Side Values 269

QM for Windows and Changes in Right-Hand- Side Values 270

Excel Solver and Changes in Right-Hand-Side Values 270

Summary 272 Glossary 272 Solved Problems 273 Self-Test 277 Discussion Questions and Problems 278 Case Study: Mexicana Wire Winding, Inc. 286 Bibliography 288

CHAPTER 8 Linear Programming Applications 289 8.1 Marketing Applications 289

Media Selection 289

Marketing Research 291

8.2 Manufacturing Applications 293 Production Mix 293

Production Scheduling 295

8.3 Employee Scheduling Applications 299 Labor Planning 299

8.4 Financial Applications 300 Portfolio Selection 300

Truck Loading Problem 303

8.5 Ingredient Blending Applications 305

A01_REND3161_13_AIE_FM.indd 8 01/11/16 12:31 PM

CONTENTS  ix

Diet Problems 305

Ingredient Mix and Blending Problems 306

8.6 Other Linear Programming Applications 308 Summary 310 Self-Test 310 Problems 311 Case Study: Cable & Moore 318 Bibliography 318

CHAPTER 9 Transportation, Assignment, and Network Models 319

9.1 The Transportation Problem 320 Linear Program for the Transportation

Example 320

Solving Transportation Problems Using Computer Software 321

A General LP Model for Transportation Problems 322

Facility Location Analysis 323

9.2 The Assignment Problem 325 Linear Program for Assignment Example 325

9.3 The Transshipment Problem 327 Linear Program for Transshipment

Example 327

9.4 Maximal-Flow Problem 330 Example 330

9.5 Shortest-Route Problem 332 9.6 Minimal-Spanning Tree Problem 334

Summary 337 Glossary 338 Solved Problems 338 Self-Test 340 Discussion Questions and Problems 341 Case Study: Andrew–Carter, Inc. 352 Case Study: Northeastern Airlines 353 Case Study: Southwestern University Traffic Problems 354 Bibliography 355

Appendix 9.1: Using QM for Windows 355

CHAPTER 10 Integer Programming, Goal Programming, and Nonlinear Programming 357

10.1 Integer Programming 358 Harrison Electric Company Example of Integer

Programming 358

Using Software to Solve the Harrison Integer Programming Problem 360

Mixed-Integer Programming Problem Example 360

10.2 Modeling with 0–1 (Binary) Variables 363 Capital Budgeting Example 364

Limiting the Number of Alternatives Selected 365

Dependent Selections 365

Fixed-Charge Problem Example 366

Financial Investment Example 367

10.3 Goal Programming 368 Example of Goal Programming: Harrison Electric

Company Revisited 369

Extension to Equally Important Multiple Goals 370

Ranking Goals with Priority Levels 371

Goal Programming with Weighted Goals 371

10.4 Nonlinear Programming 372 Nonlinear Objective Function and Linear

Constraints 373

Both Nonlinear Objective Function and Nonlinear Constraints 373

Linear Objective Function with Nonlinear Constraints 374

Summary 375 Glossary 375 Solved Problems 376 Self-Test 378 Discussion Questions and Problems 379 Case Study: Schank Marketing Research 384 Case Study: Oakton River Bridge 385 Bibliography 385

CHAPTER 11 Project Management 387 11.1 PERT/CPM 389

General Foundry Example of PERT/CPM 389

Drawing the PERT/CPM Network 390

Activity Times 391

How to Find the Critical Path 392

Probability of Project Completion 395

What PERT Was Able to Provide 398

Using Excel QM for the General Foundry Example 398

Sensitivity Analysis and Project Management 399

11.2 PERT/Cost 400 Planning and Scheduling Project Costs:

Budgeting Process 400

Monitoring and Controlling Project Costs 403

11.3 Project Crashing 405 General Foundry Example 406

Project Crashing with Linear Programming 407

11.4 Other Topics in Project Management 410 Subprojects 410

Milestones 410

Resource Leveling 410

Software 410

Summary 410 Glossary 410 Key Equations 411 Solved Problems 412 Self-Test 414 Discussion Questions and Problems 415 Case Study: Southwestern University Stadium Construction 422 Case Study: Family Planning Research Center of Nigeria 423 Bibliography 424

Appendix 11.1: Project Management with QM for Windows 424

CHAPTER 12 Waiting Lines and Queuing Theory Models 427

12.1 Waiting Line Costs 428 Three Rivers Shipping Company Example 428

12.2 Characteristics of a Queuing System 429 Arrival Characteristics 429

Waiting Line Characteristics 430

A01_REND3161_13_AIE_FM.indd 9 01/11/16 2:59 PM

x  CONTENTS

Service Facility Characteristics 430

Identifying Models Using Kendall Notation 431

12.3 Single-Channel Queuing Model with Poisson Arrivals and Exponential Service Times (M/M /1) 434 Assumptions of the Model 434

Queuing Equations 434

Arnold’s Muffler Shop Case 435

Enhancing the Queuing Environment 438

12.4 Multichannel Queuing Model with Poisson Arrivals and Exponential Service Times (M/M/m) 439 Equations for the Multichannel Queuing

Model 439

Arnold’s Muffler Shop Revisited 440

12.5 Constant Service Time Model (M/D/1) 442 Equations for the Constant Service Time

Model 442

Garcia-Golding Recycling, Inc. 443

12.6 Finite Population Model (M/M/1 with Finite Source) 443 Equations for the Finite Population

Model 444

Department of Commerce Example 444

12.7 Some General Operating Characteristic Relationships 445

12.8 More Complex Queuing Models and the Use of Simulation 446 Summary 446 Glossary 447 Key Equations 447 Solved Problems 449 Self-Test 451 Discussion Questions and Problems 452 Case Study: New England Foundry 457 Case Study: Winter Park Hotel 459 Bibliography 459

Appendix 12.1: Using QM for Windows 460

CHAPTER 13 Simulation Modeling 461 13.1 Advantages and Disadvantages of

Simulation 462 13.2 Monte Carlo Simulation 463

Harry’s Auto Tire Example 464

Using QM for Windows for Simulation 468

Simulation with Excel Spreadsheets 469

13.3 Simulation and Inventory Analysis 471 Simkin’s Hardware Store 472

Analyzing Simkin’s Inventory Costs 475

13.4 Simulation of a Queuing Problem 476 Port of New Orleans 476

Using Excel to Simulate the Port of New Orleans Queuing Problem 478

13.5 Simulation Model for a Maintenance Policy 479 Three Hills Power Company 479

Cost Analysis of the Simulation 481

13.6 Other Simulation Issues 484 Two Other Types of Simulation Models 484

Verification and Validation 485

Role of Computers in Simulation 485

Summary 486 Glossary 486 Solved Problems 487 Self-Test 489 Discussion Questions and Problems 490 Case Study: Alabama Airlines 496 Case Study: Statewide Development Corporation 497 Case Study: FB Badpoore Aerospace 498 Bibliography 500

CHAPTER 14 Markov Analysis 501 14.1 States and State Probabilities 502

The Vector of State Probabilities for Grocery Store Example 503

14.2 Matrix of Transition Probabilities 504 Transition Probabilities for Grocery Store

Example 504

14.3 Predicting Future Market Shares 505 14.4 Markov Analysis of Machine

Operations 506 14.5 Equilibrium Conditions 507 14.6 Absorbing States and the Fundamental

Matrix: Accounts Receivable Application 510 Summary 514 Glossary 514 Key Equations 514 Solved Problems 515 Self-Test 518 Discussion Questions and Problems 519 Case Study: Rentall Trucks 523 Bibliography 525

Appendix 14.1: Markov Analysis with QM for Windows 525

Appendix 14.2: Markov Analysis with Excel 526

CHAPTER 15 Statistical Quality Control 529 15.1 Defining Quality and TQM 529 15.2 Statistical Process Control 531

Variability in the Process 531

15.3 Control Charts for Variables 532 The Central Limit Theorem 533

Setting x--Chart Limits 534

Setting Range Chart Limits 536

15.4 Control Charts for Attributes 537 p-Charts 537

c-Charts 539

Summary 541 Glossary 541 Key Equations 541 Solved Problems 542 Self-Test 543 Discussion Questions and Problems 543 Bibliography 546

Appendix 15.1: Using QM for Windows for SPC 547

APPENDICES 549

APPENDIX A Areas Under the Standard Normal Curve 550

APPENDIX B Binomial Probabilities 552

APPENDIX C Values of e−L for Use in the Poisson Distribution 557

A01_REND3161_13_AIE_FM.indd 10 01/11/16 12:31 PM

CONTENTS  xi

APPENDIX D F Distribution Values 558

APPENDIX E Using POM-QM for Windows 560

APPENDIX F Using Excel QM and Excel Add-Ins 563

APPENDIX G Solutions to Selected Problems 564

APPENDIX H Solutions to Self-Tests 568

INDEX 571

ONLINE MODULES

MODULE 1 Analytic Hierarchy Process M1-1 M1.1 Multifactor Evaluation Process M1-2 M1.2 Analytic Hierarchy Process M1-3

Judy Grim’s Computer Decision M1-3

Using Pairwise Comparisons M1-5

Evaluations for Hardware M1-5

Determining the Consistency Ratio M1-6

Evaluations for the Other Factors M1-7

Determining Factor Weights M1-8

Overall Ranking M1-9

Using the Computer to Solve Analytic Hierarchy Process Problems M1-9

M1.3 Comparison of Multifactor Evaluation and Analytic Hierarchy Processes M1-9 Summary M1-10 Glossary M1-10 Key Equations M1-10 Solved Problems M1-11 Self-Test M1-12 Discussion Questions and Problems M1-12 Bibliography M1-14

Appendix M1.1: Using Excel for the Analytic Hierarchy Process M1-14

MODULE 2 Dynamic Programming M2-1 M2.1 Shortest-Route Problem Solved Using

Dynamic Programming M2-2 M2.2 Dynamic Programming

Terminology M2-5 M2.3 Dynamic Programming Notation M2-7 M2.4 Knapsack Problem M2-8

Types of Knapsack Problems M2-8

Roller’s Air Transport Service Problem M2-8

Summary M2-13 Glossary M2-14 Key Equations M2-14 Solved Problem M2-14 Self-Test M2-16 Discussion Questions and Problems M2-17 Case Study: United Trucking M2-19 Bibliography M2-20

MODULE 3 Decision Theory and the Normal Distribution M3-1

M3.1 Break-Even Analysis and the Normal Distribution M3-1

Barclay Brothers Company’s New Product Decision M3-1

Probability Distribution of Demand M3-2

Using Expected Monetary Value to Make a Decision M3-4

M3.2 Expected Value of Perfect Information and the Normal Distribution M3-5 Opportunity Loss Function M3-5

Expected Opportunity Loss M3-5

Summary M3-7 Glossary M3-7 Key Equations M3-7 Solved Problems M3-7 Self-Test M3-8 Discussion Questions and Problems M3-9 Bibliography M3-10

Appendix M3.1: Derivation of the Break-Even Point M3-10

Appendix M3.2: Unit Normal Loss Integral M3-11

MODULE 4 Game Theory M4-1 M4.1 Language of Games M4-2 M4.2 The Minimax Criterion M4-2 M4.3 Pure Strategy Games M4-3 M4.4 Mixed Strategy Games M4-4 M4.5 Dominance M4-6

Summary M4-7 Glossary M4-7 Solved Problems M4-14 Self-Test M4-8 Discussion Questions and Problems M4-9 Bibliography M4-10

MODULE 5 Mathematical Tools: Determinants and Matrices M5-1

M5.1 Matrices and Matrix Operations M5-1 Matrix Addition and Subtraction M5-2

Matrix Multiplication M5-2

Matrix Notation for Systems of Equations M5-5

Matrix Transpose M5-5

M5.2 Determinants, Cofactors, and Adjoints M5-5 Determinants M5-5

Matrix of Cofactors and Adjoint M5-7

M5.3 Finding the Inverse of a Matrix M5-9 Summary M5-10 Glossary M5-10 Key Equations M5-10 Self-Test M5-11 Discussion Questions and Problems M5-11 Bibliography M5-12

Appendix M5.1: Using Excel for Matrix Calculations M5-13

MODULE 6 Calculus-Based Optimization M6-1 M6.1 Slope of a Straight Line M6-1 M6.2 Slope of a Nonlinear Function M6-2 M6.3 Some Common Derivatives M6-5

Second Derivatives M6-6

M6.4 Maximum and Minimum M6-6 M6.5 Applications M6-8

Economic Order Quantity M6-8

Total Revenue M6-8

Summary M6-9 Glossary M6-10 Key Equations M6-10 Solved Problems M6-10 Self-Test M6-11 Discussion Questions and Problems M6-11 Bibliography M6-12

A01_REND3161_13_AIE_FM.indd 11 01/11/16 12:31 PM

xii  CONTENTS

MODULE 7 Linear Programming: The Simplex Method M7-1

M7.1 How to Set Up the Initial Simplex Solution M7-2 Converting the Constraints to Equations M7-2

Finding an Initial Solution Algebraically M7-3

The First Simplex Tableau M7-4

M7.2 Simplex Solution Procedures M7-7 The Second Simplex Tableau M7-8

Interpreting the Second Tableau M7-11

The Third Simplex Tableau M7-12

Review of Procedures for Solving LP Maximization Problems M7-14

M7.3 Surplus and Artificial Variables M7-15 Surplus Variables M7-15

Artificial Variables M7-15

Surplus and Artificial Variables in the Objective Function M7-16

M7.4 Solving Minimization Problems M7-16

The Muddy River Chemical Corporation Example M7-16

Graphical Analysis M7-17

Converting the Constraints and Objective Function M7-18

Rules of the Simplex Method for Minimization Problems M7-18

First Simplex Tableau for the Muddy River Chemical Corporation Problem M7-19

Developing a Second Tableau M7-20

Developing a Third Tableau M7-22

Fourth Tableau for the Muddy River Chemical Corporation Problem M7-23

Review of Procedures for Solving LP Minimization Problems M7-24

M7.5 Special Cases M7-25 Infeasibility M7-25

Unbounded Solutions M7-25

Degeneracy M7-26

More Than One Optimal Solution M7-27

M7.6 Sensitivity Analysis with the Simplex Tableau M7-27 High Note Sound Company Revisited M7-27

Changes in the Objective Function Coefficients M7-28

Changes in Resources or RHS Values M7-30

M7.7 The Dual M7-32 Dual Formulation Procedures M7-33

Solving the Dual of the High Note Sound Company Problem M7-33

M7.8 Karmarkar’s Algorithm M7-34 Summary M7-35 Glossary M7-35 Key Equations M7-36 Solved Problems M7-36 Self-Test M7-40 Discussion Questions and Problems M7-41 Bibliography M7-50

MODULE 8 Transportation, Assignment, and Network Algorithms M8-1

M8.1 The Transportation Algorithm M8-1

Developing an Initial Solution: Northwest Corner Rule M8-2

Stepping-Stone Method: Finding a Least-Cost Solution M8-3

Special Situations with the Transportation Algorithm M8-9

Unbalanced Transportation Problems M8-9

Degeneracy in Transportation Problems M8-10

More Than One Optimal Solution M8-12

Maximization Transportation Problems M8-13

Unacceptable or Prohibited Routes M8-13

Other Transportation Methods M8-13

M8.2 The Assignment Algorithm M8-13 The Hungarian Method (Flood’s Technique) 14

Making the Final Assignment M8-18

Special Situations with the Assignment Algorithm M8-18

Unbalanced Assignment Problems M8-18

Maximization Assignment Problems M8-19

M8.3 Maximal-Flow Problem M8-20 Maximal-Flow Technique M8-20

M8.4 Shortest-Route Problem M8-24 Shortest-Route Technique M8-24

Summary M8-26 Glossary M8-26 Solved Problems M8-26 Self-Test M8-33 Discussion Questions and Problems M8-33 Bibliography M8-43

A01_REND3161_13_AIE_FM.indd 12 01/11/16 12:31 PM

xiii

Overview

Welcome to the thirteenth edition of Quantitative Analysis for Management. Our goal is to pro- vide undergraduate and graduate students with a genuine foundation in business analytics, quan- titative methods, and management science. In doing so, we owe thanks to the hundreds of users and scores of reviewers who have provided invaluable counsel and pedagogical insight for more than 30 years.

To help students connect how the techniques presented in this book apply in the real world, computer-based applications and examples are a major focus of this edition. Mathematical models, with all the necessary assumptions, are presented in a clear and “plain-English” manner. The ensuing solution procedures are then applied to example problems alongside step-by-step “how-to” instructions. We have found this method of presentation to be very effective, and stu- dents are very appreciative of this approach. In places where the mathematical computations are intricate, the details are presented in such a manner that the instructor can omit these sections without interrupting the flow of material. The use of computer software enables the instructor to focus on the managerial problem and spend less time on the details of the algorithms. Computer output is provided for many examples throughout the book.

The only mathematical prerequisite for this textbook is algebra. One chapter on probability and another on regression analysis provide introductory coverage on these topics. We employ standard notation, terminology, and equations throughout the book. Careful explanation is pro- vided for the mathematical notation and equations that are used.

Special Features

Many features have been popular in previous editions of this textbook, and they have been updated and expanded in this edition. They include the following:

●● Modeling in the Real World boxes demonstrate the application of the quantitative analysis approach to every technique discussed in the book. Three new ones have been added.

●● Procedure boxes summarize the more complex quantitative techniques, presenting them as a series of easily understandable steps.

●● Margin notes highlight the important topics in the text.

●● History boxes provide interesting asides related to the development of techniques and the people who originated them.

●● QA in Action boxes illustrate how real organizations have used quantitative analysis to solve problems. Several new QA in Action boxes have been added.

●● Solved Problems, included at the end of each chapter, serve as models for students in solving their own homework problems.

●● Discussion Questions are presented at the end of each chapter to test the student’s under- standing of the concepts covered and definitions provided in the chapter.

Preface

A01_REND3161_13_AIE_FM.indd 13 28/10/16 10:13 AM

xiv  PREFACE

●● Problems included in every chapter are applications-oriented and test the student’s ability to solve exam-type problems. They are graded by level of difficulty: introductory (one bullet), moderate (two bullets), and challenging (three bullets). Twenty-six new problems have been added.

●● Internet Homework Problems provide additional problems for students to work. They are available on the Companion Website.

●● Self-Tests allow students to test their knowledge of important terms and concepts in prepara- tion for quizzes and examinations.

●● Case Studies, at the end of most chapters, provide additional challenging managerial applications.

●● Glossaries, at the end of each chapter, define important terms.

●● Key Equations, provided at the end of each chapter, list the equations presented in that chapter.

●● End-of-chapter bibliographies provide a current selection of more advanced books and articles.

●● The software POM-QM for Windows uses the full capabilities of Windows to solve quantita- tive analysis problems.

●● Excel QM and Excel 2016 are used to solve problems throughout the book.

●● Data files with Excel spreadsheets and POM-QM for Windows files containing all the examples in the textbook are available for students to download from the Companion Website. Instructors can download these plus additional files containing computer solutions to the relevant end-of-chapter problems from the Instructor Resource Center Website.

●● Online modules provide additional coverage of topics in quantitative analysis.

●● The Companion Website, at www.pearsonhighered.com/render, provides the online modules, additional problems, cases, and other material for every chapter.

Significant Changes to the Thirteenth Edition

In the thirteenth edition, we have introduced Excel 2016 in all of the chapters. Updated screen- shots are integrated in the appropriate sections so that students can easily learn how to use Excel 2016 for the calculations. The Excel QM add-in is used with Excel 2016, allowing students with limited Excel experience to easily perform the necessary calculations. This also allows students to improve their Excel skills as they see the formulas automatically written in Excel QM.

From the Companion Website, students can access files for all of the examples used in the textbook in Excel 2016, QM for Windows, and Excel QM. Other files with all of the end-of- chapter problems involving these software tools are available to the instructors.

Business analytics, one of the hottest topics in the business world, makes extensive use of the models in this book. A discussion of the business analytics categories is provided, and the relevant management science techniques are placed into the appropriate category.

Examples and problems have been updated, and many new ones have been added. New screenshots are provided for almost all of the examples in the book. A brief summary of the changes in each chapter of the thirteenth edition is presented here.

Chapter 1 Introduction to Quantitative Analysis. The section on business analytics has been updated, and a new end-of-chapter problem has been added.

Chapter 2 Probability Concepts and Applications. The Modeling in the Real World box has been updated. New screenshots of Excel 2016 have been added throughout.

Chapter 3 Decision Analysis. A new QA in Action box has been added. New screenshots of Excel 2016 have been added throughout. A new case study has been added.

Chapter 4 Regression Models. New screenshots of Excel 2016 have been added throughout. A new end-of-chapter problem has been added.

A01_REND3161_13_AIE_FM.indd 14 28/10/16 10:13 AM

PREFACE  xv

Chapter 5 Forecasting. A new QA in Action box has been added. New screenshots of Excel 2016 have been added throughout. Two new end-of-chapter problems have been added.

Chapter 6 Inventory Control Models. A new QA in Action box has been added. New screenshots of Excel 2016 have been added throughout. Two new end-of-chapter problems have been added.

Chapter 7 Linear Programming Models: Graphical and Computer Methods. The Learning Objectives have been modified slightly. Screenshots have been updated to Excel 2016.

Chapter 8 Linear Programming Applications. Two new problems have been added to the Internet Homework Problems. Excel 2016 screenshots have been incorporated throughout.

Chapter 9 Transportation, Assignment, and Network Models. Two new problems have been added to the Internet Homework Problems. Excel 2016 screenshots have been incorporated throughout.

Chapter 10 Integer Programming, Goal Programming, and Nonlinear Programming. Two new problems have been added to the Internet Homework Problems. Excel 2016 screenshots have been incorporated throughout.

Chapter 11 Project Management. Four new end-of-chapter problems and a new Modeling in the Real World box have been added.

Chapter 12 Waiting Lines and Queuing Theory Models. Four new end-of-chapter problems have been added.

Chapter 13 Simulation Modeling. Two new end-of-chapter problems have been added.

Chapter 14 Markov Analysis. Two new end-of-chapter problems have been added.

Chapter 15 Statistical Quality Control. Two new end-of-chapter problems have been added. Excel 2016 screenshots have been updated throughout.

Modules 1–8 The only significant change to the modules is the update to Excel 2016 throughout.

Online Modules

To streamline the book, eight topics are contained in modules available on the Companion Website for the book.

1. Analytic Hierarchy Process

2. Dynamic Programming

3. Decision Theory and the Normal Distribution

4. Game Theory

5. Mathematical Tools: Determinants and Matrices

6. Calculus-Based Optimization

7. Linear Programming: The Simplex Method

8. Transportation, Assignment, and Network Algorithms

Software

Excel 2016 Excel 2016 instructions and screen captures are provided, throughout the book. Instructions for activating the Solver and Analysis ToolPak add-ins in Excel 2016 are provided in an appendix. The use of Excel is more prevalent in this edition of the book than in previous editions.

A01_REND3161_13_AIE_FM.indd 15 28/10/16 10:13 AM

xvi  PREFACE

Excel QM Using the Excel QM add-in that is available on the Companion Website makes the use of Excel even easier. Students with limited Excel experience can use this and learn from the formulas that are automatically provided by Excel QM. This is used in many of the chapters.

POM-QM for Windows This software, developed by Professor Howard Weiss, is available to students at the Companion Website. This is very user-friendly and has proven to be a very popular software tool for users of this textbook. Modules are available for every major prob- lem type presented in the textbook. At press time, only version 4.0 of POM-QM for Windows was available. Updates for version 5.0 will be released on the Companion Website as they become available.

Companion Website

The Companion Website, located at www.pearsonhighered.com/render, contains a variety of materials to help students master the material in this course. These include the following:

Modules There are eight modules containing additional material that the instructor may choose to include in the course. Students can download these from the Companion Website.

Files for Examples in Excel, Excel QM, and POM-QM for Windows Students can download the files that were used for examples throughout the book. This helps them become familiar with the software, and it helps them understand the input and formulas necessary for working the examples.

Internet Homework Problems In addition to the end-of-chapter problems in the textbook, there are additional problems that instructors may assign. These are available for download at the Companion Website.

Internet Case Studies Additional case studies are available for most chapters.

POM-QM for Windows Developed by Howard Weiss, this very user-friendly software can be used to solve most of the homework problems in the text.

Excel QM This Excel add-in will automatically create worksheets for solving problems. This is very helpful for instructors who choose to use Excel in their classes but who may have students with limited Excel experience. Students can learn by examining the formulas that have been created and by seeing the inputs that are automatically generated for using the Solver add-in for linear programming.

Instructor Resources

●● Instructor Resource Center: The Instructor Resource Center contains the electronic files for the test bank, PowerPoint slides, the Solutions Manual, and data files for both Excel and POM-QM for Windows for all relevant examples and end-of-chapter problems (www .pearsonhighered.com/render).

●● Register, Redeem, Login: At www.pearsonhighered.com/irc, instructors can access a variety of print, media, and presentation resources that are available with this text in downloadable, digital format. For most texts, resources are also available for course management platforms such as Blackboard, WebCT, and Course Compass.

●● Need help? Our dedicated technical support team is ready to assist instructors with questions about the media supplements that accompany this text. Visit support.pearson.com/getsupport for answers to frequently asked questions and toll-free user support phone numbers. The supplements are available to adopting instructors. Detailed descriptions are provided in the Instructor Resource Center.

A01_REND3161_13_AIE_FM.indd 16 28/10/16 10:13 AM

PREFACE  xvii

Instructor’s Solutions Manual The Instructor’s Solutions Manual, updated by the authors, is available for download from the Instructor Resource Center. Solutions to all Internet Homework Problems and Internet Case Studies are also included in the manual.

PowerPoint Presentation An extensive set of PowerPoint slides is available for download from the Instructor Resource Center.

Test Bank The updated test bank is available for download from the Instructor Resource Center.

TestGen The computerized TestGen package allows instructors to customize, save, and generate classroom tests. The test program permits instructors to edit, add, or delete questions from the test bank; edit existing graphics and create new graphics; analyze test results; and organize a database of test and student results. This software allows instructors to benefit from the extensive flexibility and ease of use. It provides many options for organizing and displaying tests, along with search and sort features. The software and the test banks can be downloaded from the Instructor Resource Center.

Acknowledgments

We gratefully thank the users of previous editions and the reviewers who provided valuable suggestions and ideas for this edition. Your feedback is valuable in our efforts for continuous improvement. The continued success of Quantitative Analysis for Management is a direct result of instructor and student feedback, which is truly appreciated.

The authors are indebted to many people who have made important contributions to this project. Special thanks go to Professors Faizul Huq, F. Bruce Simmons III, Khala Chand Seal, Victor E. Sower, Michael Ballot, Curtis P. McLaughlin, and Zbigniew H. Przanyski for their contributions to the excellent cases included in this edition.

We thank Howard Weiss for providing Excel QM and POM-QM for Windows, two of the most outstanding packages in the field of quantitative methods. We would also like to thank the reviewers who have helped to make this textbook the most widely used one in the field of quan- titative analysis:

Stephen Achtenhagen, San Jose University M. Jill Austin, Middle Tennessee State University Raju Balakrishnan, University of Michigan–Dearborn Hooshang Beheshti, Radford University Jason Bergner, University of Nevada Bruce K. Blaylock, Radford University Rodney L. Carlson, Tennessee Technological University Edward Chu, California State University, Dominguez Hills John Cozzolino, Pace University–Pleasantville Ozgun C. Demirag, Penn State–Erie Shad Dowlatshahi, University of Missouri–Kansas City Ike Ehie, Kansas State University Richard Ehrhardt, University of North Carolina–Greensboro Sean Eom, Southeast Missouri State University Ephrem Eyob, Virginia State University Mira Ezvan, Lindenwood University Wade Ferguson, Western Kentucky University Robert Fiore, Springfield College Frank G. Forst, Loyola University of Chicago Stephen H. Goodman, University of Central Florida Irwin Greenberg, George Mason University Nicholas G. Hall, Ohio State University Robert R. Hill, University of Houston–Clear Lake Bharat Jain, Towson University Vassilios Karavas, Nomura International

Arun Khanal, Nobel College Kenneth D. Lawrence, New Jersey Institute of Technology Jooh Lee, Rowan College Richard D. Legault, University of Massachusetts–Dartmouth Douglas Lonnstrom, Siena College Daniel McNamara, University of St. Thomas Peter Miller, University of Windsor Ralph Miller, California State Polytechnic University Shahriar Mostashari, Campbell University David Murphy, Boston College Robert C. Myers, University of Louisville Barin Nag, Towson State University Nizam S. Najd, St. Gregory’s University Harvey Nye, Central State University Alan D. Olinsky, Bryant College Savas Ozatalay, Widener University Young Park, California University of Pennsylvania Yusheng Peng, Brooklyn College Dane K. Peterson, Missouri State University Sanjeev Phukan, Bemidji State University Ranga Ramasesh, Texas Christian University Bonnie Robeson, Johns Hopkins University Grover Rodich, Portland State University Vijay Shah, West Virginia University–Parkersburg L. Wayne Shell, Nicholls State University

A01_REND3161_13_AIE_FM.indd 17 28/10/16 10:13 AM

xviii  PREFACE

We are very grateful to all the people at Pearson who worked so hard to make this book a success. These include Donna Battista, Jeff Holcomb, Ashley Santora, Neeraj Bhalla, Vamanan Namboodiri, and Dan Tylman. We are also grateful to Angela Urquhart and Andrea Archer at Thistle Hill Publishing Services. Thank you all!

Barry Render [email protected]

Ralph Stair

Michael Hanna [email protected]

Trevor S. Hale [email protected]

Thomas Sloan, University of Massachusetts–Lowell Richard Slovacek, North Central College Alan D. Smith, Robert Morris University John Swearingen, Bryant College Jack Taylor, Portland State University Andrew Tiger, Union University

Chris Vertullo, Marist College James Vigen, California State University, Bakersfield Larry Weinstein, Wright State University Fred E. Williams, University of Michigan–Flint Mela Wyeth, Charleston Southern University Oliver Yu, San Jose State University

A01_REND3161_13_AIE_FM.indd 18 28/10/16 10:13 AM

 1

1.4 Prepare a quantitative analysis model.

1.5 Use computers and spreadsheet models to perform quantitative analysis.

1.6 Recognize possible problems in using quantitative analysis.

1.7 Recognize implementation concerns of quantitative analysis.

1.1 Describe the quantitative analysis approach and understand how to apply it to a real situation.

1.2 Describe the three categories of business analytics.

1.3 Describe the use of modeling in quantitative analysis.

After completing this chapter, students will be able to:

Introduction to Quantitative Analysis

LEARNING OBJECTIVES

1 CHAPTER

People have been using mathematical tools to help solve problems for thousands of years; however, the formal study and application of quantitative techniques to practical decision making is largely a product of the twentieth century. The techniques we study in this book have been applied successfully to an increasingly wide variety of complex problems in business, government, health care, education, and many other areas. Many such successful uses are dis- cussed throughout this book.

It isn’t enough, though, just to know the mathematics of how a particular quantitative tech- nique works; you must also be familiar with the limitations, assumptions, and specific applica- bility of the technique. The successful use of quantitative techniques usually results in a solution that is timely, accurate, flexible, economical, reliable, and easy to understand and use.

In this and other chapters, there are QA (Quantitative Analysis) in Action boxes that provide success stories on the applications of management science. They show how organizations have used quantitative techniques to make better decisions, operate more efficiently, and generate more profits. For example, Taco Bell has reported saving over $150 million with better fore- casting of demand and better scheduling of employees. NBC television increased advertising revenue by over $200 million by using a model to help develop sales plans for advertisers. Be- fore it merged with United Airlines, Continental Airlines saved over $40 million a year by using mathematical models to quickly recover from disruptions caused by weather delays and other factors. These are but a few of the many companies discussed in QA in Action boxes throughout this book.

M01_REND3161_13_AIE_C01.indd 1 27/10/16 3:20 PM

2  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

To see other examples of how companies use quantitative analysis or operations research methods to operate better and more efficiently, go to the website www.scienceofbetter.org. The success stories presented there are categorized by industry, functional area, and benefit. These success stories illustrate how operations research is truly the “science of better.”

1.1 What Is Quantitative Analysis?

Quantitative analysis is the scientific approach to managerial decision making. This field of study has several different names, including quantitative analysis, management science, and operations research. These terms are used interchangeably in this book. Also, many of the quan- titative analysis methods presented in this book are used extensively in business analytics.

Whim, emotions, and guesswork are not part of the quantitative analysis approach. The ap- proach starts with data. Like raw material for a factory, these data are manipulated or processed into information that is valuable to people making decisions. This processing and manipulating of raw data into meaningful information is the heart of quantitative analysis. Computers have been instrumental in the increasing use of quantitative analysis.

In solving a problem, managers must consider both qualitative and quantitative factors. For example, we might consider several different investment alternatives, including certificates of deposit at a bank, investments in the stock market, and an investment in real estate. We can use quantitative analysis to determine how much our investment will be worth in the future when de- posited at a bank at a given interest rate for a certain number of years. Quantitative analysis can also be used in computing financial ratios from the balance sheets for several companies whose stock we are considering. Some real estate companies have developed computer programs that use quantitative analysis to analyze cash flows and rates of return for investment property.

In addition to quantitative analysis, qualitative factors should be considered. The weather, state and federal legislation, new technological breakthroughs, the outcome of an election, and so on may all be factors that are difficult to quantify.

Because of the importance of qualitative factors, the role of quantitative analysis in the deci- sion-making process can vary. When there is a lack of qualitative factors and when the problem, model, and input data remain the same, the results of quantitative analysis can automate the decision-making process. For example, some companies use quantitative inventory models to determine automatically when to order additional new materials. In most cases, however, quanti- tative analysis will be an aid to the decision-making process. The results of quantitative analysis will be combined with other (qualitative) information in making decisions.

Quantitative analysis has been particularly important in many areas of management. The field of production management, which evolved into production/operations management (POM) as society became more service oriented, uses quantitative analysis extensively. While POM focuses on the internal operations of a company, the field of supply chain management takes a more complete view of the business and considers the entire process of obtaining materials from suppliers, using the materials to develop products, and distributing these products to the final consumers. Supply chain management makes extensive use of many management science mod- els. Another area of management that could not exist without the quantitative analysis methods presented in this book, and perhaps the hottest discipline in business today, is business analytics.

1.2 Business Analytics

Business analytics is a data-driven approach to decision making that allows companies to make better decisions. The study of business analytics involves the use of large amounts of data, which means that information technology related to the management of the data is very important. Sta- tistical and quantitative methods are used to analyze the data and provide useful information to the decision maker.

Business analytics is often broken into three categories: descriptive, predictive, and prescrip- tive. Descriptive analytics involves the study and consolidation of historical data for a business and an industry. It helps a company measure how it has performed in the past and how it is per- forming now. Predictive analytics is aimed at forecasting future outcomes based on patterns in the past data. Statistical and mathematical models are used extensively for this purpose. Prescrip- tive analytics involves the use of optimization methods to provide new and better ways to operate

Quantitative analysis uses a scientific approach to decision making.

Both qualitative and quantitative factors must be considered.

M01_REND3161_13_AIE_C01.indd 2 27/10/16 3:20 PM

1.3 THE QUAnTITATIvE AnAlysIs APPRoACH  3

based on specific business objectives. The optimization models presented in this book are very important to prescriptive analytics. While there are only three business analytics categories, many business decisions are made based on information obtained from two or three of these categories.

Many of the quantitative analysis techniques presented in the chapters of this book are used extensively in business analytics. Table 1.1 highlights the three categories of business analytics, and it places many of the topics and chapters in this book in the most relevant category. Keep in mind that some topics (and certainly some chapters with multiple concepts and models) could possibly be placed in a different category. Some of the material in this book could overlap two or even three of these categories. Nevertheless, all of these quantitative analysis techniques are very important tools in business analytics.

1.3 The Quantitative Analysis Approach

The quantitative analysis approach consists of defining a problem, developing a model, acquir- ing input data, developing a solution, testing the solution, analyzing the results, and implement- ing the results (see Figure 1.1). One step does not have to be finished completely before the next is started; in most cases, one or more of these steps will be modified to some extent before the final results are implemented. This would cause all of the subsequent steps to be changed. In some cases, testing the solution might reveal that the model or the input data are not correct. This would mean that all steps that follow defining the problem would need to be modified.

The three categories of business analytics are descriptive, predictive, and prescriptive.

Defining the problem can be the most important step.

Concentrate on only a few problems.

TABLE 1.1 Business Analytics and Quantitative Analysis Models

BUSINESS ANALYTICS CATEGORY QUANTITATIVE ANALYSIS TECHNIQUE

Descriptive analytics Statistical measures such as means and standard deviations (Chapter 2)

Statistical quality control (Chapter 15)

Predictive analytics Decision analysis and decision trees (Chapter 3)

Regression models (Chapter 4)

Forecasting (Chapter 5)

Project scheduling (Chapter 11)

Waiting line models (Chapter 12)

Simulation (Chapter 13)

Markov analysis (Chapter 14)

Prescriptive analytics Inventory models such as the economic order quantity (Chapter 6)

Linear programming (Chapters 7, 8)

Transportation and assignment models (Chapter 9)

Integer programming, goal programming, and nonlinear programming (Chapter 10)

Network models (Chapter 9)

Quantitative analysis has been in existence since the begin- ning of recorded history, but it was Frederick Winslow Taylor who in the late 1800s and early 1900s pioneered the appli- cation of the principles of the scientific approach to manage- ment. Dubbed the “Father of Industrial Engineering,” Taylor is credited with introducing many new scientific and quantitative techniques. These new developments were so successful that many companies still use his techniques in managerial deci- sion making and planning today. Indeed, many organizations employ a staff of operations research or management science

personnel or consultants to apply the principles of scien- tific management to the challenges and opportunities of the twenty-first century.

The origin of many of the techniques discussed in this book can be traced to individuals and organizations that have applied the principles of scientific management first developed by Taylor; they are discussed in History boxes throughout the book. Trivia: Taylor was also a world-class golfer and tennis player, finishing just off the medal stand in golf at the 1900 Olympics and winning the inaugural men’s doubles title (with Clarence Clark) at the U.S. Open Tennis Championships.

The origin of Quantitative AnalysisHISTORY

M01_REND3161_13_AIE_C01.indd 3 27/10/16 3:20 PM

4  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

Defining the Problem The first step in the quantitative approach is to develop a clear, concise statement of the prob- lem. This statement will give direction and meaning to the following steps.

In many cases, defining the problem is the most important and the most difficult step. It is essential to go beyond the symptoms of the problem and identify the true causes. One problem may be related to other problems; solving one problem without regard to other, related problems can make the entire situation worse. Thus, it is important to analyze how the solution to one problem affects other problems or the situation in general.

It is likely that an organization will have several problems. However, a quantitative analysis group usually cannot deal with all of an organization’s problems at one time. Thus, it is usually necessary to concentrate on only a few problems. For most companies, this means selecting those problems whose solutions will result in the greatest increase in profits or reduction in costs for the company. The importance of selecting the right problems to solve cannot be overempha- sized. Experience has shown that bad problem definition is a major reason for failure of manage- ment science or operations research groups to serve their organizations well.

When the problem is difficult to quantify, it may be necessary to develop specific, measur- able objectives. A problem might be inadequate health care delivery in a hospital. The objectives might be to increase the number of beds, reduce the average number of days a patient spends in the hospital, increase the physician-to-patient ratio, and so on. When objectives are used, however, the real problem should be kept in mind. It is important to avoid setting specific and measurable objectives that may not solve the real problem.

Developing a Model Once we select the problem to be analyzed, the next step is to develop a model. Simply stated, a model is a representation (usually mathematical) of a situation.

Even though you might not have been aware of it, you have been using models most of your life. You may have developed models about people’s behavior. Your model might be that friend- ship is based on reciprocity, an exchange of favors. If you need a favor such as a small loan, your model would suggest that you ask a good friend.

Of course, there are many other types of models. Architects sometimes make a physical model of a building that they will construct. Engineers develop scale models of chemical plants, called pilot plants. A schematic model is a picture, drawing, or chart of reality. Automobiles, lawn mowers, gears, fans, smartphones, and numerous other devices have schematic models (drawings and pictures) that reveal how these devices work. What sets quantitative analysis apart from other techniques is that the models that are used are mathematical. A mathematical model is a set of mathematical relationships. In most cases, these relationships are expressed in equa- tions and inequalities, as they are in a spreadsheet model that computes sums, averages, or stan- dard deviations.

Although there is considerable flexibility in the development of models, most of the models presented in this book contain one or more variables and parameters. A variable, as the name implies, is a measurable quantity that may vary or is subject to change. Variables can be control- lable or uncontrollable. A controllable variable is also called a decision variable. An example would be how many inventory items to order. A parameter is a measurable quantity that is in- herent in the problem. The cost of placing an order for more inventory items is an example of a parameter. In most cases, variables are unknown quantities, while parameters are known quanti- ties. Hence, in our example, how much inventory to order is a variable that needs to be decided, whereas how much it will cost to place the order is a parameter that is already known. All mod- els should be developed carefully. They should be solvable, realistic, and easy to understand and modify, and the required input data should be obtainable. The model developer has to be careful to include the appropriate amount of detail to be solvable yet realistic.

Acquiring Input Data Once we have developed a model, we must obtain the data that are used in the model (input data). Obtaining accurate data for the model is essential; even if the model is a perfect represen- tation of reality, improper data will result in misleading results. This situation is called garbage in, garbage out. For a larger problem, collecting accurate data can be one of the most difficult steps in performing quantitative analysis.

The types of models include physical, scale, schematic, and mathematical models.

Garbage in, garbage out means that improper data will result in misleading results.

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

FIGURE 1.1 The Quantitative Analysis Approach

M01_REND3161_13_AIE_C01.indd 4 27/10/16 3:20 PM

1.3 THE QUAnTITATIvE AnAlysIs APPRoACH  5

There are a number of sources that can be used in collecting data. In some cases, company reports and documents can be used to obtain the necessary data. Another source is interviews with employees or other persons related to the firm. These individuals can sometimes provide excellent information, and their experience and judgment can be invaluable. A production super- visor, for example, might be able to tell you with a great degree of accuracy the amount of time it takes to produce a particular product. Sampling and direct measurement provide other sources of data for the model. You may need to know how many pounds of raw material are used in producing a new photochemical product. This information can be obtained by going to the plant and actually measuring with scales the amount of raw material that is being used. In other cases, statistical sampling procedures can be used to obtain data.

Developing a Solution Developing a solution involves manipulating the model to arrive at the best (optimal) solution to the problem. In some cases, this requires that an equation be solved for the best decision. In other cases, you can use a trial-and-error method, trying various approaches and picking the one that results in the best decision. For some problems, you may wish to try all possible values for the variables in the model to arrive at the best decision. This is called complete enumera- tion. This book also shows you how to solve very difficult and complex problems by repeat- ing a few simple steps until you find the best solution. A series of steps or procedures that are repeated is called an algorithm, named after Algorismus (derived from Muhammad ibn Musa al-Khwarizmi), a Persian mathematician of the ninth century.

The accuracy of a solution depends on the accuracy of the input data and the model. If the input data are accurate to only two significant digits, then the results can be accurate to only two significant digits. For example, the results of dividing 2.6 by 1.4 should be 1.9, not 1.857142857.

Testing the Solution Before a solution can be analyzed and implemented, it needs to be tested completely. Because the solution depends on the input data and the model, both require testing.

Testing the input data and the model includes determining the accuracy and completeness of the data used by the model. Inaccurate data will lead to an inaccurate solution. There are several ways to test input data. One method of testing the data is to collect additional data from a differ- ent source. If the original data were collected using interviews, perhaps some additional data can be collected by direct measurement or sampling. These additional data can then be compared with the original data, and statistical tests can be employed to determine whether there are dif- ferences between the original data and the additional data. If there are significant differences, more effort is required to obtain accurate input data. If the data are accurate but the results are inconsistent with the problem, the model may not be appropriate. The model can be checked to make sure that it is logical and represents the real situation.

The input data and model determine the accuracy of the solution.

Testing the data and model is done before the results are analyzed.

operations Research and oil spills

Operations researchers and decision scientists have been in- vestigating oil spill response and alleviation strategies since long before the BP oil spill disaster of 2010 in the Gulf of Mexico. A four-phase classification system has emerged for disaster re- sponse research: mitigation, preparedness, response, and recov- ery. Mitigation means reducing the probability that a disaster will occur and implementing robust, forward-thinking strategies to re- duce the effects of a disaster that does occur. Preparedness is any and all organization efforts that happen in advance of a disaster. Response is the location, allocation, and overall coordination of resources and procedures during the disaster that are aimed at preserving life and property. Recovery is the set of actions taken

to minimize the long-term impacts of a particular disaster after the immediate situation has stabilized.

Many quantitative tools have helped in areas of risk analysis, insurance, logistical preparation and supply management, evacu- ation planning, and development of communication systems. Re- cent research has shown that while many strides and discoveries have been made, much research is still needed. Certainly each of the four disaster response areas could benefit from additional research, but recovery seems to be of particular concern and per- haps the most promising for future research.

Source: Based on N. Altay and W. Green, “OR/MS Research in Disaster Op- erations Management,” European Journal of Operational Research 175, 1 (2006): 475–493, © Trevor S. Hale.

IN ACTION

M01_REND3161_13_AIE_C01.indd 5 27/10/16 3:20 PM

6  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

Although most of the quantitative techniques discussed in this book have been computer- ized, you will probably be required to solve a number of problems by hand. To help detect both logical and computational mistakes, you should check the results to make sure that they are con- sistent with the structure of the problem. For example, (1.96)(301.7) is close to (2)(300), which is equal to 600. If your computations are significantly different from 600, you know you have made a mistake.

Analyzing the Results and Sensitivity Analysis Analyzing the results starts with determining the implications of the solution. In most cases, a solution to a problem will result in some kind of action or change in the way an organization is operating. The implications of these actions or changes must be determined and analyzed before the results are implemented.

Because a model is only an approximation of reality, the sensitivity of the solution to changes in the model and input data is a very important part of analyzing the results. This type of analysis is called sensitivity analysis or postoptimality analysis. It determines how much the solution will change if there are changes in the model or the input data. When the solution is sensitive to changes in the input data and the model specification, additional testing should be performed to make sure that the model and input data are accurate and valid. If the model or data are wrong, the solution could be wrong, resulting in financial losses or reduced profits.

The importance of sensitivity analysis cannot be overemphasized. Because input data may not always be accurate or model assumptions may not be completely appropriate, sensitivity analysis can become an important part of the quantitative analysis approach. Most of the chap- ters in this book cover the use of sensitivity analysis as part of the decision-making and problem- solving process.

Implementing the Results The final step is to implement the results. This is the process of incorporating the solution into the company’s operations. This can be much more difficult than you would imagine. Even if the solution is optimal and will result in millions of dollars in additional profits, if managers resist the new solution, all of the efforts of the analysis are of no value. Experience has shown that a large number of quantitative analysis teams have failed in their efforts because they have failed to implement a good, workable solution properly.

After the solution has been implemented, it should be closely monitored. Over time, there may be numerous changes that call for modifications of the original solution. A changing econ- omy, fluctuating demand, and model enhancements requested by managers and decision makers are only a few examples of changes that might require the analysis to be modified.

The Quantitative Analysis Approach and Modeling in the Real World The quantitative analysis approach is used extensively in the real world. These steps, first seen in Figure 1.1 and described in this section, are the building blocks of any successful use of quantita- tive analysis. As seen in our first Modeling in the Real World box, the steps of the quantitative analysis approach can be used to help a large company such as CSX plan for critical scheduling needs now and for decades into the future. Throughout this book, you will see how the steps of the quantitative analysis approach are used to help countries and companies of all sizes save mil- lions of dollars, plan for the future, increase revenues, and provide higher-quality products and services. The Modeling in the Real World boxes will demonstrate to you the power and impor- tance of quantitative analysis in solving real problems for real organizations. Using the steps of quantitative analysis, however, does not guarantee success. These steps must be applied carefully.

1.4 How to Develop a Quantitative Analysis Model

Developing a model is an important part of the quantitative analysis approach. Let’s see how we can use the following mathematical model, which represents profit:

Profit = Revenue - Expenses

In many cases, we can express revenue as the selling price per unit multiplied times the num- ber of units sold. Expenses can often be determined by summing fixed cost and variable cost.

Sensitivity analysis determines how the solution will change with a different model or input data.

Expenses include fixed and variable costs.

M01_REND3161_13_AIE_C01.indd 6 27/10/16 3:20 PM

1.4 How To DEvEloP A QUAnTITATIvE AnAlysIs MoDEl  7

Defining the Problem CSX Transportation, Inc., has 35,000 employees and annual revenue of $11 billion. It provides rail freight services to 23 states east of the Mississippi River, as well as parts of Canada. CSX receives orders for rail delivery service and must send empty railcars to customer locations. Moving these empty railcars results in hundreds of thousands of empty-car miles every day. If allocations of railcars to customers is not done properly, problems arise from excess costs, wear and tear on the system, and congestion on the tracks and at rail yards.

Developing a Model In order to provide a more efficient scheduling system, CSX spent 2 years and $5 million developing its Dynamic Car-Planning (DCP) system. This model will minimize costs, including car travel distance, car han- dling costs at the rail yards, car travel time, and costs for being early or late. It does this while at the same time filling all orders, making sure the right type of car is assigned to the job, and getting the car to the destination in the allowable time.

Acquiring Input Data In developing the model, the company used historical data for testing. In running the model, DCP uses three external sources to obtain information on the customer car orders, the available cars of the type needed, and the transit-time standards. In addition to these, two internal input sources provide informa- tion on customer priorities and preferences and on cost parameters.

Developing a Solution This model takes about 1 minute to load but only 10 seconds to solve. Because supply and demand are constantly changing, the model is run about every 15 minutes. This allows final decisions to be delayed until absolutely necessary.

Testing the Solution The model was validated and verified using existing data. The solutions found using DCP were determined to be very good compared to assignments made without DCP.

Analyzing the Results Since the implementation of DCP in 1997, more than $51 million has been saved annually. Due to the im- proved efficiency, it is estimated that CSX avoided spending another $1.4 billion to purchase an additional 18,000 railcars that would have been needed without DCP. Other benefits include reduced congestion in the rail yards and reduced congestion on the tracks, which are major concerns. This greater efficiency means that more freight can ship by rail rather than by truck, resulting in significant public benefits. These benefits include reduced pollution and greenhouse gases, improved highway safety, and reduced road maintenance costs.

Implementing the Results Both senior-level management who championed DCP and key car-distribution experts who supported the new approach were instrumental in gaining acceptance of the new system and overcoming problems dur- ing the implementation. The job description of the car distributors was changed from car allocators to cost technicians. They are responsible for seeing that accurate cost information is entered into DCP, and they also manage any exceptions that must be made. They were given extensive training on how DCP works so they could understand and better accept the new system. Due to the success of DCP, other railroads have implemented similar systems and achieved similar benefits. CSX continues to enhance DCP to make it even more customer friendly and to improve car-order forecasts.

Source: Based on M. F. Gorman et al., “CSX Railway Uses OR to Cash In on Optimized Equipment Distribution,” Interfaces 40, 1 (January–February 2010): 5–16, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Railroad Uses optimization Models to save Millions

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M01_REND3161_13_AIE_C01.indd 7 27/10/16 3:20 PM

8  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

Variable cost is often expressed as the variable cost per unit multiplied times the number of units. Thus, we can also express profit in the following mathematical model:

Profit = Revenue - 1Fixed cost + Variable cost2 Profit = 1Selling price per unit21Number of units sold2 - 3Fixed cost + 1Variable cost per unit21Number of units sold24 Profit = sX - 3 f + nX4 Profit = sX - f - nX (1-1)

where

s = selling price per unit f = fixed cost n = variable cost per unit X = number of units sold

The parameters in this model are f, n, and s, as these are inputs that are inherent in the model. The number of units sold (X) is the decision variable of interest.

EXAMPLE: PRITCHETT’S PRECIOUS TIME PIECES We will use the Bill Pritchett clock repair shop ex- ample to demonstrate the use of mathematical models. Bill’s company, Pritchett’s Precious Time Pieces, buys, sells, and repairs old clocks and clock parts. Bill sells rebuilt springs for a price per unit of $8. The fixed cost of the equipment to build the springs is $1,000. The variable cost per unit is $3 for spring material. In this example,

s = 8 f = 1,000 n = 3

The number of springs sold is X, and our profit model becomes

Profit = +8X - +1,000 - +3X

If sales are 0, Bill will realize a $1,000 loss. If sales are 1,000 units, he will realize a profit of +4,000 [+4,000 = 1+8211,0002 - +1,000 - 1+3211,0002]. See if you can determine the profit for other values of units sold.

In addition to the profit model shown here, decision makers are often interested in the break-even point (BEP). The BEP is the number of units sold that will result in $0 profits. We set profits equal to $0 and solve for X, the number of units at the BEP:

0 = sX - f - nX

This can be written as

0 = 1s - n2X - f Solving for X, we have

f = 1s - n2X X =

f

s - n

This quantity (X) that results in a profit of zero is the BEP, and we now have this model for the BEP:

BEP = Fixed cost

1Selling price per unit2 - 1Variable cost per unit2

BEP = f

s - n (1-2)

The BEP results in $0 profits.

M01_REND3161_13_AIE_C01.indd 8 27/10/16 3:20 PM

1.5 THE RolE oF CoMPUTERs AnD sPREADsHEET MoDEls In THE QUAnTITATIvE AnAlysIs APPRoACH  9

For the Pritchett’s Precious Time Pieces example, the BEP can be computed as follows:

BEP = +1,000>1+8 - +32 = 200 units, or springs,

The Advantages of Mathematical Modeling There are a number of advantages of using mathematical models:

1. Models can accurately represent reality. If properly formulated, a model can be extremely accurate. A valid model is one that is accurate and correctly represents the problem or sys- tem under investigation. The profit model in the example is accurate and valid for many business problems.

2. Models can help a decision maker formulate problems. In the profit model, for example, a decision maker can determine the important factors or contributors to revenues and ex- penses, such as sales, returns, selling expenses, production costs, and transportation costs.

3. Models can give us insight and information. For example, using the profit model, we can see what impact changes in revenue and expenses will have on profits. As discussed in the previous section, studying the impact of changes in a model, such as a profit model, is called sensitivity analysis.

4. Models can save time and money in decision making and problem solving. It usually takes less time, effort, and expense to analyze a model. We can use a profit model to analyze the impact of a new marketing campaign on profits, revenues, and expenses. In most cases, us- ing models is faster and less expensive than actually trying a new marketing campaign in a real business setting and observing the results.

5. A model may be the only way to solve some large or complex problems in a timely fash- ion. A large company, for example, may produce literally thousands of sizes of nuts, bolts, and fasteners. The company may want to make the highest profits possible given its manu- facturing constraints. A mathematical model may be the only way to determine the highest profits the company can achieve under these circumstances.

6. A model can be used to communicate problems and solutions to others. A decision analyst can share his or her work with other decision analysts. Solutions to a mathematical model can be given to managers and executives to help them make final decisions.

Mathematical Models Categorized by Risk Some mathematical models, like the profit and break-even models previously discussed, do not involve risk or chance. We assume that we know all values used in the model with complete cer- tainty. These are called deterministic models. A company, for example, might want to minimize manufacturing costs while maintaining a certain quality level. If we know all these values with certainty, the model is deterministic.

Other models involve risk or chance. For example, the market for a new product might be “good” with a chance of 60% (a probability of 0.6) or “not good” with a chance of 40% (a prob- ability of 0.4). Models that involve chance or risk, often measured as a probability value, are called probabilistic models. In this book, we will investigate both deterministic and probabilis- tic models.

1.5 The Role of Computers and Spreadsheet Models in the Quantitative Analysis Approach

Developing a solution, testing the solution, and analyzing the results are important steps in the quantitative analysis approach. Because we will be using mathematical models, these steps re- quire mathematical calculations. Excel 2016 can be used to help with these calculations, and some spreadsheets developed in Excel will be shown in some chapters. However, some of the techniques presented in this book require sophisticated spreadsheets and are quite tedious to de- velop. Fortunately, there are two software programs available from the Companion Website for this book that make this much easier:

1. POM-QM for Windows is an easy-to-use decision support program that was developed for production and operations management (POM) and quantitative methods (QM) courses.

Deterministic means with complete certainty.

M01_REND3161_13_AIE_C01.indd 9 27/10/16 3:20 PM

10  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

POM for Windows and QM for Windows were originally separate software packages for each type of course. These are now combined into one program called POM-QM for Win- dows. As seen in Program 1.1, it is possible to display all the modules, only the POM mod- ules, or only the QM modules. The images shown in this textbook will typically display only the QM modules. Hence, in this book, reference will usually be made to QM for Windows. Appendix E at the end of the book provides more information about QM for Windows.

To use QM for Windows to solve the break-even problem presented earlier, from the Mod- ule drop-down menu select Breakeven/Cost-Volume Analysis. Then select New-Breakeven Analysis to enter the problem. When the window opens, enter a name for the problem and select OK. Upon doing this, you will see the screen shown in Program 1.2A. The solution is shown in Program 1.2B. Notice the additional output available from the Window drop-down menu.

Select a module from the drop-down menu.

To see the modules relevant for this book, select Display QM Modules only.

PROGRAM 1.1 The QM for windows Main Menu

Click Solve to run the program.

Enter the data.

PROGRAM 1.2A Entering the Data for Pritchett’s Precious Time Pieces Example into QM for windows

Additional output is available from the Window menu.

PROGRAM 1.2B QM for windows solution screen for Pritchett’s Precious Time Pieces Example

M01_REND3161_13_AIE_C01.indd 10 27/10/16 3:20 PM

1.5 THE RolE oF CoMPUTERs AnD sPREADsHEET MoDEls In THE QUAnTITATIvE AnAlysIs APPRoACH  11

Files for the QM for Windows examples throughout the book can be downloaded from the Companion Website. Opening these files will demonstrate how data are input for the various modules of QM for Windows.

2. Excel QM, an add-in for Excel, can also be used to perform the mathematical calculations for the techniques discussed in each chapter. When installed in Excel 2016, Excel QM will appear as a tab on the ribbon. From this tab, the appropriate model can be selected from a menu, as shown in Program 1.3. Appendix F has more information about this. Excel files with the example problems shown can be downloaded from the Companion Website.

To use Excel QM in Excel 2016 to solve the break-even problem presented earlier, from the Alphabetical menu (see Program 1.3) select Breakeven Analysis. When this is done, a worksheet is prepared automatically, and the user simply inputs the fixed cost, variable cost, and revenue (selling price per unit), as shown in Program 1.4. The solution is calculated when all the inputs have been entered.

Excel 2016 contains some functions, special features, formulas, and tools that help with some of the questions that might be posed in analyzing a business problem. One such feature, Goal Seek, is shown in Program 1.5 as it is applied to the break-even example. Excel 2016 also has some add-ins that must be activated before using them the first time. These include the Data Analysis add-in and the Solver add-in, which will be discussed in later chapters.

Select the Excel QM tab.

Select the Alphabetical menu to see the techniques.

PROGRAM 1.3 Excel QM in Excel 2016 Ribbon and Menu of Techniques

The problem data are entered here.

The results are shown here.

PROGRAM 1.4 Entering the Data for Pritchett’s Precious Time Pieces Example into Excel QM in Excel 2016

M01_REND3161_13_AIE_C01.indd 11 27/10/16 3:20 PM

12  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

1.6 Possible Problems in the Quantitative Analysis Approach

We have presented the quantitative analysis approach as a logical, systematic means of tackling decision-making problems. Even when these steps are followed carefully, there are many diffi- culties that can hurt the chances of implementing solutions to real-world problems. We now take a look at what can happen during each of the steps.

Defining the Problem One view of decision makers is that they sit at a desk all day long, waiting until a problem arises, and then stand up and attack the problem until it is solved. Once it is solved, they sit down, relax, and wait for the next big problem. In the worlds of business, government, and education, prob- lems are, unfortunately, not easily identified. There are four potential roadblocks that quantita- tive analysts face in defining a problem. We use an application, inventory analysis, throughout this section as an example.

CONFLICTING VIEWPOINTS The first difficulty is that quantitative analysts must often consider conflicting viewpoints in defining the problem. For example, there are at least two views that

From the Data tab, select What-If Analysis. From the menu that drops down, select Goal Seek.

If the goal is $175 profit (B23) and this is obtained by changing the volume (B12), the Goal Seek window inputs are these.

PROGRAM 1.5 Using Goal seek in the Break-Even Problem to Achieve a specified Profit

Major league operations Research at the Department of Agriculture

In 1997, the Pittsburgh Pirates signed Ross Ohlendorf because of his 95-mph sinking fastball. Little did they know that Ross pos- sessed operations research skills also worthy of national merit. Ross Ohlendorf had graduated from Princeton University with a 3.8 GPA in operations research and financial engineering.

Indeed, after the 2009 baseball season, when Ross applied for an 8-week unpaid internship with the U.S. Department of Agriculture, he didn’t need to mention his full-time employer because the Secretary of the Department of Agriculture at the time, Tom Vilsack, was born and raised in Pittsburgh and was an

avid Pittsburgh Pirates fan. Ross spent 2 months of the ensuing off-season utilizing his educational background in operations re- search, helping the Department of Agriculture track disease mi- gration in livestock, a subject Ross has a vested interest in, as his family runs a cattle ranch in Texas. Moreover, when ABC News asked Ross about his off-season unpaid internship experience, he replied, “This one’s been, I’d say, the most exciting off-season I’ve had.”

Source: From “Ross Ohlendorf: From Major League Pitcher to Unpaid Intern,” by Rick Klein, © 2009, ABCnews.com.

IN ACTION

M01_REND3161_13_AIE_C01.indd 12 27/10/16 3:20 PM

1.6 PossIBlE PRoBlEMs In THE QUAnTITATIvE AnAlysIs APPRoACH  13

managers take when dealing with inventory problems. Financial managers usually feel that in- ventory is too high, as inventory represents cash not available for other investments. Sales man- agers, on the other hand, often feel that inventory is too low, as high levels of inventory may be needed to fill an unexpected order. If analysts assume either one of these statements as the problem definition, they have essentially accepted one manager’s perception and can expect re- sistance from the other manager when the “solution” emerges. So it’s important to consider both points of view before stating the problem. Good mathematical models should include all perti- nent information. As we shall see in Chapter 6, both of these factors are included in inventory models.

IMPACT ON OTHER DEPARTMENTS The next difficulty is that problems do not exist in isolation and are not owned by just one department of a firm. Inventory is closely tied with cash flows and various production problems. A change in ordering policy can seriously hurt cash flows and up- set production schedules to the point that savings on inventory are more than offset by increased costs for finance and production. The problem statement should thus be as broad as possible and include input from all departments that have a stake in the solution. When a solution is found, the benefits and risks to all areas of the organization should be identified and communicated to the people involved.

BEGINNING ASSUMPTIONS The third difficulty is that people have a tendency to state problems in terms of solutions. The statement that inventory is too low implies a solution that inventory levels should be raised. The quantitative analyst who starts off with this assumption will prob- ably indeed find that inventory should be raised. From an implementation standpoint, a “good” solution to the right problem is much better than an “optimal” solution to the wrong problem. If a problem has been defined in terms of a desired solution, the quantitative analyst should ask questions about why this solution is desired. By probing further, the true problem will surface and can be defined properly.

SOLUTION OUTDATED Even with the best of problem statements, however, there is a fourth danger. The problem can change as the model is being developed. In our rapidly changing business environment, it is not unusual for problems to appear or disappear virtually overnight. The ana- lyst who presents a solution to a problem that no longer exists can’t expect credit for providing timely help. However, one of the benefits of mathematical models is that once the original model has been developed, it can be used over and over again whenever similar problems arise. This allows a solution to be found very easily in a timely manner.

Developing a Model FITTING THE TEXTBOOK MODELS One problem in developing quantitative models is that a manager’s perception of a problem won’t always match the textbook approach. Most inventory models involve minimizing the total of holding and ordering costs. Some managers view these costs as unimportant; instead, they see the problem in terms of cash flow, turnover, and level of customer satisfaction. Results of a model based on holding and ordering costs are probably not acceptable to such managers. This is why the analyst must completely understand the model and not simply use the computer as a “black box” where data are input and results are given with no understand- ing of the process. The analyst who understands the process can explain to the manager how the model does consider these other factors when estimating the different types of inventory costs. If other factors are important as well, the analyst can consider these and use sensitivity analysis and good judgment to modify the computer solution before it is implemented.

UNDERSTANDING THE MODEL A second major concern involves the trade-off between the complex- ity of the model and ease of understanding. Managers simply will not use the results of a model they do not understand. Complex problems, though, require complex models. One trade-off is to simplify assumptions in order to make the model easier to understand. The model loses some of its reality but gains some acceptance by management.

One simplifying assumption in inventory modeling is that demand is known and constant. This means that probability distributions are not needed and it allows us to build simple, easy- to-understand models. Demand, however, is rarely known and constant, so the model we build

All viewpoints should be considered before formally defining the problem.

An optimal solution to the wrong problem leaves the real problem unsolved.

M01_REND3161_13_AIE_C01.indd 13 27/10/16 3:20 PM

14  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

lacks some reality. Introducing probability distributions provides more realism but may put com- prehension beyond all but the most mathematically sophisticated managers. One approach is for the quantitative analyst to start with the simple model and make sure that it is completely understood. Later, more complex models can be introduced slowly as managers gain more confi- dence in using the new approach. Explaining the impact of the more sophisticated models (e.g., carrying extra inventory called safety stock) without going into complete mathematical details is sometimes helpful. Managers can understand and identify with this concept, even if the specific mathematics used to find the appropriate quantity of safety stock is not totally understood.

Acquiring Input Data Gathering the data to be used in the quantitative approach to problem solving is often not a simple task. One-fifth of all firms in a recent study had difficulty with data access.

USING ACCOUNTING DATA One problem is that most data generated in a firm come from basic ac- counting reports. The accounting department collects its inventory data, for example, in terms of cash flows and turnover. But quantitative analysts tackling an inventory problem need to collect data on holding costs and ordering costs. If they ask for such data, they may be shocked to find that the data were simply never collected for those specified costs.

Professor Gene Woolsey tells a story of a young quantitative analyst sent down to account- ing to get “the inventory holding cost per item per day for part 23456/AZ.” The accountant asked the young man if he wanted the first-in, first-out figure, the last-in, first-out figure, the lower of cost or market figure, or the “how-we-do-it” figure. The young man replied that the inventory model required only one number. The accountant at the next desk said, “Hell, Joe, give the kid a number.” The kid was given a number and departed.

VALIDITY OF DATA A lack of “good, clean data” means that whatever data are available must often be distilled and manipulated (we call it “fudging”) before being used in a model. Unfortunately, the validity of the results of a model is no better than the validity of the data that go into the model. You cannot blame a manager for resisting a model’s “scientific” results when he or she knows that questionable data were used as input. This highlights the importance of the analyst understanding other business functions so that good data can be found and evaluated by the analyst. It also emphasizes the importance of sensitivity analysis, which is used to determine the impact of minor changes in input data. Some solutions are very robust and do not change at all following certain changes in the input data.

Developing a Solution HARD-TO-UNDERSTAND MATHEMATICS The first concern in developing solutions is that although the mathematical models we use may be complex and powerful, they may not be completely under- stood. Fancy solutions to problems may have faulty logic or data. The aura of mathematics often causes managers to remain silent when they should be critical. The well-known operations re- searcher C. W. Churchman cautions that “because mathematics has been so revered a discipline in recent years, it tends to lull the unsuspecting into believing that he who thinks elaborately thinks well.”1

ONLY ONE ANSWER IS LIMITING The second problem is that quantitative models usually give just one answer to a problem. Most managers would like to have a range of options and not be put in a take-it-or-leave-it position. A more appropriate strategy is for an analyst to present a range of options, indicating the effect that each solution has on the objective function. This gives managers a choice, as well as information on how much it will cost to deviate from the optimal solution. It also allows problems to be viewed from a broader perspective, since nonquantitative factors can be considered.

Testing the Solution The results of quantitative analysis often take the form of predictions of how things will work in the future if certain changes are made now. To get a preview of how well solutions will really

Obtaining accurate input data can be very difficult.

Hard-to-understand mathematics and single solutions can become problematic in developing a solution.

1C. W. Churchman, “Reliability of Models in the Social Sciences,” Interfaces 4, 1 (November 1973): 1–12.

M01_REND3161_13_AIE_C01.indd 14 27/10/16 3:20 PM

1.7 IMPlEMEnTATIon—noT JUsT THE FInAl sTEP  15

work, managers are often asked how good the solution looks to them. The problem is that com- plex models tend to give solutions that are not intuitively obvious. Such solutions tend to be rejected by managers. The quantitative analyst now has the chance to work through the model and the assumptions with the manager in an effort to convince the manager of the validity of the results. In the process of convincing the manager, the analyst will have to review every assump- tion that went into the model. If there are errors, they may be revealed during this review. In addition, the manager will be casting a critical eye on everything that went into the model, and if he or she can be convinced that the model is valid, there is a good chance that the solution results are also valid.

Analyzing the Results Once a solution has been tested, the results must be analyzed in terms of how they will affect the total organization. You should be aware that even small changes in organizations are often difficult to bring about. If the results indicate large changes in organization policy, the quantita- tive analyst can expect resistance. In analyzing the results, the analyst should ascertain who must change and by how much, if the people who must change will be better or worse off, and who has the power to direct the change.

1.7 Implementation—Not Just the Final Step

We have just presented some of the many problems that can affect the ultimate acceptance of the quantitative analysis approach and use of its models. It should be clear now that implementation isn’t just another step that takes place after the modeling process is over. Each one of these steps greatly affects the chances of implementing the results of a quantitative study.

Assumptions should be reviewed.

PlATo Helps 2004 olympic Games in Athens

The 2004 Olympic Games were held in Athens, Greece, over a period of 16 days. More than 2,000 athletes competed in 300 events in 28 sports. The events were held in 36 different venues (stadia, competition centers, etc.), and 3.6 million tickets were sold to people who would view these events. In addition, 2,500 members of international committees and 22,000 journalists and broadcasters attended these games. Home viewers spent more than 34 billion hours watching these sporting events. The 2004 Olympic Games was the biggest sporting event in the history of the world up to that point.

In addition to the sporting venues, other noncompetitive ven- ues, such as the airport and Olympic village, had to be considered. A successful Olympics requires tremendous planning for the transpor- tation system that will handle the millions of spectators. Three years of work and planning were needed for the 16 days of the Olympics.

The Athens Olympic Games Organizing Committee (ATHOC) had to plan, design, and coordinate systems that would be de- livered by outside contractors. ATHOC personnel would later be responsible for managing the efforts of volunteers and paid staff during the operations of the games. To make the Athens Olym- pics run efficiently and effectively, the Process Logistics Advanced Technical Optimization (PLATO) project was begun. Innovative

techniques from management science, systems engineering, and information technology were used to change the planning, de- sign, and operations of venues.

The objectives of PLATO were to (1) facilitate effective orga- nizational transformation, (2) help plan and manage resources in a cost-effective manner, and (3) document lessons learned so future Olympic committees could benefit. The PLATO project de- veloped business-process models for the various venues, devel- oped simulation models that enable the generation of what-if scenarios, developed software to aid in the creation and manage- ment of these models, and developed process steps for training ATHOC personnel in using these models. Generic solutions were developed so that this knowledge and approach could be made available to other users.

PLATO was credited with reducing the cost of the 2004 Olym- pics by over $69 million. Perhaps even more important is the fact that the Athens games were universally deemed an unqualified success. The resulting increase in tourism is expected to result in economic benefit to Greece for many years in the future.

Source: Based on D. A. Beis et al., “PLATO Helps Athens Win Gold: Olympic Games Knowledge Modeling for Organizational Change and Resource Man- agement,” Interfaces 36, 1 (January–February 2006): 26–42, © Trevor S. Hale.

IN ACTION

M01_REND3161_13_AIE_C01.indd 15 27/10/16 3:20 PM

16  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

Lack of Commitment and Resistance to Change Even though many business decisions can be made intuitively, based on hunches and experience, there are more and more situations in which quantitative models can assist. Some managers, however, fear that the use of a formal analysis process will reduce their decision-making power. Others fear that it may expose some previous intuitive decisions as inadequate. Still others just feel uncomfortable about having to reverse their thinking patterns with formal decision making. These managers often argue against the use of quantitative methods.

Many action-oriented managers do not like the lengthy formal decision-making process and prefer to get things done quickly. They prefer “quick and dirty” techniques that can yield imme- diate results. Once managers see some QA results that have a substantial payoff, the stage is set for convincing them that quantitative analysis is a beneficial tool.

We have known for some time that management support and user involvement are critical to the successful implementation of quantitative analysis projects. A Swedish study found that only 40% of projects suggested by quantitative analysts were ever implemented. But 70% of the quantitative projects initiated by users, and fully 98% of the projects suggested by top managers, were implemented.

Lack of Commitment by Quantitative Analysts Just as managers’ attitudes are to blame for some implementation problems, analysts’ attitudes are to blame for others. When the quantitative analyst is not an integral part of the department facing the problem, he or she sometimes tends to treat the modeling activity as an end in itself. That is, the analyst accepts the problem as stated by the manager and builds a model to solve only that problem. When the results are computed, he or she hands them back to the manager and considers the job done. The analyst who does not care whether these results help make the final decision is not concerned with implementation.

Successful implementation requires that the analyst not tell the users what to do but rather work with them and take their feelings into account. An article in Operations Research describes an inventory control system that calculated reorder points and order quantities. But instead of insisting that computer-calculated quantities be ordered, a manual override feature was installed. This allowed users to disregard the calculated figures and substitute their own. The override was used quite often when the system was first installed. Gradually, however, as users came to real- ize that the calculated figures were right more often than not, they allowed the system’s figures to stand. Eventually, the override feature was used only in special circumstances. This is a good example of how good relationships can aid in model implementation.

Management support and user involvement are important.

Quantitative analysis is a scientific approach to decision mak- ing. The quantitative analysis approach includes defining the problem, developing a model, acquiring input data, develop- ing a solution, testing the solution, analyzing the results, and implementing the results. In using the quantitative approach, however, there can be potential problems, including conflicting viewpoints, the impact of quantitative analysis models on other

departments, beginning assumptions, outdated solutions, fitting textbook models, understanding the model, acquiring good in- put data, hard-to-understand mathematics, obtaining only one answer, testing the solution, and analyzing the results. In using the quantitative analysis approach, implementation is not the final step. There can be a lack of commitment to the approach and resistance to change.

Summary

Glossary

Algorithm A set of logical and mathematical operations per- formed in a specific sequence.

Break-Even Point The quantity of sales that results in zero profit.

Business Analytics A data-driven approach to decision making that allows companies to make better decisions.

Descriptive Analytics The study and consolidation of his- torical data to describe how a company has performed in the past and how it is performing now.

Deterministic Model A model in which all values used in the model are known with complete certainty.

Input Data Data that are used in a model in arriving at the final solution.

Mathematical Model A model that uses mathematical equa- tions and statements to represent the relationships within the model.

Model A representation of reality or of a real-life situation.

M01_REND3161_13_AIE_C01.indd 16 27/10/16 3:20 PM

sElF-TEsT  17

1. In analyzing a problem, you should normally study a. the qualitative aspects. b. the quantitative aspects. c. both a and b. d. neither a nor b. 2. Quantitative analysis is a. a logical approach to decision making. b. a rational approach to decision making. c. a scientific approach to decision making. d. all of the above. 3. Frederick Winslow Taylor a. was a world-class golfer and tennis player. b. pioneered the principles of scientific management. c. is known as the “Father of Industrial Engineering.” d. all of the above. 4. An input (such as variable cost per unit or fixed cost) for

a model is an example of a. a decision variable. b. a parameter. c. an algorithm. d. a stochastic variable. 5. The point at which total revenue equals total cost

(meaning zero profit) is called the

a. zero-profit solution. b. optimal-profit solution. c. break-even point. d. fixed-cost solution. 6. Quantitative analysis is typically associated with the use

of a. schematic models. b. physical models. c. mathematical models. d. scale models. 7. Sensitivity analysis is most often associated with which

step of the quantitative analysis approach? a. defining a problem b. acquiring input data c. implementing the results d. analyzing the results 8. A deterministic model is one in which a. there is some uncertainty about the parameters used in

the model. b. there is a measurable outcome. c. all parameters used in the model are known with com-

plete certainty. d. there is no available computer software.

Parameter A measurable input quantity that is inherent in a problem.

Predictive Analytics The use of techniques to forecast how things will be in the future based on patterns of past data.

Prescriptive Analytics The use of optimization methods to provide new and better ways to operate based on specific business objectives.

Probabilistic Model A model in which all values used in the model are not known with certainty but rather involve some chance or risk, often measured as a probability value.

Problem A statement, which should come from a manager, that indicates a problem to be solved or an objective or a goal to be reached.

Quantitative Analysis or Management Science A scientific approach that uses quantitative techniques as a tool in deci- sion making.

Sensitivity Analysis A process that involves determining how sensitive a solution is to changes in the formulation of a problem.

Variable A measurable quantity that is subject to change.

Key Equations

(1-1) Profit = sX - f - nX

where

s = selling price per unit f = fixed cost n = variable cost per unit X = number of units sold

An equation to determine profit as a function of the sell- ing price per unit, fixed cost, variable cost, and number of units sold.

(1-2) BEP = f

s - n

An equation to determine the break-even point (BEP) in units as a function of the selling price per unit (s), fixed cost ( f ), and variable cost (n).

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book (see Appendix H) to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

M01_REND3161_13_AIE_C01.indd 17 27/10/16 3:20 PM

18  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

9. The term algorithm a. is named after Algorismus. b. is named after a ninth-century Persian mathematician. c. describes a series of steps or procedures to be repeated. d. all of the above. 10. An analysis to determine how much a solution would

change if there were changes in the model or the input data is called

a. sensitivity or postoptimality analysis. b. schematic or iconic analysis. c. futurama conditioning. d. both b and c.

11. Decision variables are a. controllable. b. uncontrollable. c. parameters. d. constant numerical values associated with any complex

problem. 12. Which of the following categories of business analytics

involves the use of optimization models? a. descriptive b. predictive c. prescriptive d. none of the above

Discussion Questions and Problems

Discussion Questions 1-1 What is the difference between quantitative and

qualitative analysis? Give several examples. 1-2 Define quantitative analysis. What are some of the

organizations that support the use of the scientific approach?

1-3 What are the three categories of business analytics? 1-4 What is the quantitative analysis process? Give sev-

eral examples of this process. 1-5 Brief ly trace the history of quantitative analysis.

What happened to the development of quantitative analysis during World War II?

1-6 Give some examples of various types of models. What is a mathematical model? Develop two exam- ples of mathematical models.

1-7 List some sources of input data. 1-8 What is implementation, and why is it important? 1-9 Describe the use of sensitivity analysis and postopti-

mality analysis in analyzing the results. 1-10 Managers are quick to claim that quantitative ana-

lysts talk to them in a jargon that does not sound like English. List four terms that might not be un- derstood by a manager. Then explain in nontechnical language what each term means.

1-11 Why do you think many quantitative analysts don’t like to participate in the implementation process? What could be done to change this attitude?

1-12 Should people who will be using the results of a new quantitative model become involved in the technical aspects of the problem-solving procedure?

1-13 C. W. Churchman once said that “mathematics … tends to lull the unsuspecting into believing that he who thinks elaborately thinks well.” Do you think that the best QA models are the ones that are most elaborate and complex mathematically? Why?

1-14 What is the break-even point? What parameters are necessary to find it?

Problems 1-15 Gina Fox has started her own company, Foxy Shirts,

which manufactures imprinted shirts for special oc- casions. Since she has just begun this operation, she rents the equipment from a local printing shop when necessary. The cost of using the equipment is $350. The materials used in one shirt cost $8, and Gina can sell these for $15 each.

(a) If Gina sells 20 shirts, what will her total rev- enue be? What will her total variable cost be?

(b) How many shirts must Gina sell to break even? What is the total revenue for this?

1-16 Ray Bond sells handcrafted yard decorations at county fairs. The variable cost to make these is $20 each, and he sells them for $50. The cost to rent a booth at the fair is $150. How many of these must Ray sell to break even?

1-17 Ray Bond, from Problem 1-16, is trying to find a new supplier that will reduce his variable cost of production to $15 per unit. If he was able to succeed in reducing this cost, what would the break-even point be?

1-18 Katherine D’Ann is planning to finance her college education by selling programs at the football games for State University. There is a fixed cost of $400 for printing these programs, and the variable cost is $3. There is also a $1,000 fee that is paid to the univer- sity for the right to sell these programs. If Katherine was able to sell programs for $5 each, how many would she have to sell in order to break even?

1-19 Katherine D’Ann, from Problem 1-18, has become concerned that sales may fall, as the team is on a ter- rible losing streak and attendance has fallen off. In fact, Katherine believes that she will sell only 500 programs for the next game. If it was possible to raise the selling price of the program and still sell 500, what would the price have to be for Katherine to break even by selling 500?

Note: means the problem may be solved with QM for Windows; means the problem may be solved with

Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M01_REND3161_13_AIE_C01.indd 18 27/10/16 3:20 PM

CAsE sTUDy  19

1-20 Farris Billiard Supply sells all types of billiard equipment and is considering manufacturing its own brand of pool cues. Mysti Farris, the produc- tion manager, is currently investigating the produc- tion of a standard house pool cue that should be very popular. Upon analyzing the costs, Mysti determines that the materials and labor cost for each cue is $25 and the fixed cost that must be covered is $2,400 per week. With a selling price of $40 each, how many pool cues must be sold to break even? What would the total revenue be at this break-even point?

1-21 Mysti Farris (see Problem 1-20) is considering rais- ing the selling price of each cue to $50 instead of $40. If this is done while the costs remain the same, what would the new break-even point be? What would the total revenue be at this break-even point?

1-22 Mysti Farris (see Problem 1-20) believes that there is a high probability that 120 pool cues can be sold if the selling price is appropriately set. What selling price would cause the break-even point to be 120?

1-23 Golden Age Retirement Planners specializes in pro- viding financial advice for people planning for a comfortable retirement. The company offers semi- nars on the important topic of retirement planning. For a typical seminar, the room rental at a hotel is $1,000, and the cost of advertising and other inci- dentals is about $10,000 per seminar. The cost of the materials and special gifts for each attendee is $60 per person attending the seminar. The company charges $250 per person to attend the seminar, as this seems to be competitive with other companies in the same business. How many people must attend each seminar for Golden Age to break even?

1-24 A couple of entrepreneurial business students at State University decided to put their education into practice by developing a tutoring company for busi- ness students. While private tutoring was offered, it was determined that group tutoring before tests in the large statistics classes would be most beneficial. The students rented a room close to campus for $300 for 3 hours. They developed handouts based on past tests, and these handouts (including color graphs)

cost $5 each. The tutor was paid $25 per hour, for a total of $75 for each tutoring session.

(a) If students are charged $20 to attend the session, how many students must enroll for the company to break even?

(b) A somewhat smaller room is available for $200 for 3 hours. The company is considering this possibility. How would this affect the break-even point?

1-25 Zoe Garcia is the manager of a small office-support business that supplies copying, binding, and other services for local companies. Zoe must replace a worn-out copy machine that is used for black-and- white copying. Two machines are being considered, and each of these has a monthly lease cost plus a cost for each page that is copied. Machine 1 has a monthly lease cost of $600, and there is a cost of $0.010 per page copied. Machine 2 has a monthly lease cost of $400, and there is a cost of $0.015 per page copied. Customers are charged $0.05 per page for copies.

(a) What is the break-even point for each machine? (b) If Zoe expects to make 10,000 copies per month,

what would be the cost for each machine? (c) If Zoe expects to make 30,000 copies per month,

what would be the cost for each machine? (d) At what volume (the number of copies) would

the two machines have the same monthly cost? What would the total revenue be for this number of copies?

1-26 Bismarck Manufacturing intends to increase capac- ity through the addition of new equipment. Two vendors have presented proposals. The fixed cost for proposal A is $65,000 and for proposal B, $34,000. The variable cost for A is $10 and for B, $14. The revenue generated by each unit is $18.

(a) What is the break-even point for each proposal? (b) If the expected volume is 8,300 units, which al-

ternative should be chosen?

Southwestern University (SWU), a large state college in Ste- phenville, Texas, 30 miles southwest of the Dallas/Fort Worth metroplex, enrolls close to 20,000 students. The school is the dominant force in the small city, with more students during fall and spring than permanent residents.

A longtime football powerhouse, SWU is a member of the Big Eleven conference and is usually in the top 20 in college football rankings. To bolster its chances of reaching the elusive

and long-desired number-one ranking, in 2013 SWU hired the legendary Billy Bob Dillon as its head coach. Although the number-one ranking remained out of reach, attendance at the six Saturday home games each year increased. Prior to Dillon’s arrival, attendance generally averaged 25,000–29,000. Season ticket sales bumped up by 10,000 just with the announcement of the new coach’s arrival. Stephenville and SWU were ready to move to the big time!

Case Study

Food and Beverages at Southwestern University Football Games

M01_REND3161_13_AIE_C01.indd 19 27/10/16 3:20 PM

20  CHAPTER 1 • InTRoDUCTIon To QUAnTITATIvE AnAlysIs

With the growth in attendance came more fame, the need for a bigger stadium, and more complaints about seating, park- ing, long lines, and concession stand prices. Southwestern Uni- versity’s president, Dr. Marty Starr, was concerned not only about the cost of expanding the existing stadium versus building a new stadium but also about the ancillary activities. He wanted to be sure that these various support activities generated revenue adequate to pay for themselves. Consequently, he wanted the parking lots, game programs, and food service to all be han- dled as profit centers. At a recent meeting discussing the new stadium, Starr told the stadium manager, Hank Maddux, to de- velop a break-even chart and related data for each of the centers. He instructed Maddux to have the food service area break-even report ready for the next meeting. After discussion with other facility managers and his subordinates, Maddux developed the following table showing the suggested selling prices, his es- timate of variable costs, and his estimate of the percentage of the total revenues that would be expected for each of the items based on historical sales data.

Maddux’s fixed costs are interesting. He estimated that the prorated portion of the stadium cost would be as follows: salaries for food services at $300,000 ($60,000 for each of the six home games); 2,400 square feet of stadium space at $5 per square foot per game; and six people per booth in each of the six booths for 5 hours at $12 an hour. These fixed costs will be proportionately allocated to each of the products based on the percentages provided in the table. For example, the revenue from soft drinks would be expected to cover 25% of the total fixed costs.

ITEM SELLING

PRICE/UNIT VARIABLE COST/UNIT

PERCENT REVENUE

Soft drink $5.00 $1.50 25%

Coffee 4.00 1.00 25

Hot dogs 6.00 2.00 20

Hamburgers 7.50 3.00 20

Misc. snacks 2.00 1.00 10

Maddux wants to be sure that he has a number of things for President Starr: (1) the total fixed cost that must be cov- ered at each of the games; (2) the portion of the fixed cost al- located to each of the items; (3) what his unit sales would be at breakeven for each item—that is, what sales of soft drinks, coffee, hot dogs, hamburgers, and snacks are necessary to cover the portion of the fixed cost allocated to each of these items; (4) what the dollar sales for each of these would be at these break-even points; and (5) realistic sales estimates per attendee for attendance of 60,000 and 35,000. (In other words, he wants to know how many dollars each attendee is spending on food at his projected break-even sales at present and if attendance grows to 60,000.) He felt this last piece of information would be helpful to understand how realistic the assumptions of his model are, and this information could be compared with similar figures from previous seasons.

Discussion Question 1. Prepare a brief report for Dr. Starr that covers the items

noted.

HEIZER, JAY; RENDER, BARRY, OPERATIONS MANAGEMENT, 6th ed., © 2001. Reprinted and Electronically reproduced by permission of Pearson Education, Inc., New York, NY.

Bibliography

Ackoff, R. L. Scientific Method: Optimizing Applied Research Decisions. New York: John Wiley & Sons, Inc., 1962.

Beam, Carrie. “ASP, the Art and Science of Practice: How I Started an OR/MS Consulting Practice with a Laptop, a Phone, and a PhD,” Interfaces 34 (July–August 2004): 265–271.

Board, John, Charles Sutcliffe, and William T. Ziemba. “Applying Operations Research Techniques to Financial Markets,” Interfaces 33 (March–April 2003): 12–24.

Churchman, C. W. “Reliability of Models in the Social Sciences,” Interfaces 4, 1 (November 1973): 1–12.

Churchman, C. W. The Systems Approach. New York: Delacort Press, 1968.

Dekker, Rommert, Jacqueline Bloemhof, and Ioannis Mallidis . “Operations Research for Green Logistics—An Overview of Aspects, Issues, Con- tributions and Challenges,” European Journal of Operational Research 219, 3 (June 2012): 671–679.

Dutta, Goutam. “Lessons for Success in OR/MS Practice Gained from Expe- riences in Indian and U.S. Steel Plants,” Interfaces 30, 5 (September– October 2000): 23–30.

Eom, Sean B., and Eyong B. Kim. “A Survey of Decision Support System Applications (1995–2001),” Journal of the Operational Research Society 57, 11 (2006): 1264–1278.

Evans, James. R. “Business Analytics: The Next Frontier for Decision Sci- ences,” Decision Line 43, 2 (March 2012): 4–6.

Horowitz, Ira. “Aggregating Expert Ratings Using Preference-Neutral Weights: The Case of the College Football Polls,” Interfaces 34 (July– August 2004): 314–320.

Keskinocak, Pinar, and Sridhar Tayur. “Quantitative Analysis for Internet- Enabled Supply Chains,” Interfaces 31, 2 (March–April 2001): 70–89.

Laval, Claude, Marc Feyhl, and Steve Kakouros. “Hewlett-Packard Combined OR and Expert Knowledge to Design Its Supply Chains,” Interfaces 35 (May–June 2005): 238–247.

Pidd, Michael. “Just Modeling Through: A Rough Guide to Modeling,” Inter- faces 29, 2 (March–April 1999): 118–132.

Saaty, T. L. “Reflections and Projections on Creativity in Operations Research and Management Science: A Pressing Need for a Shifting Paradigm,” Operations Research 46, 1 (1998): 9–16.

Salveson, Melvin. “The Institute of Management Science: A Prehistory and Commentary,” Interfaces 27, 3 (May–June 1997): 74–85.

Wright, P. Daniel, Matthew J. Liberatore, and Robert L. Nydick. “A Survey of Operations Research Models and Applications in Homeland Security,” Interfaces 36 (November–December 2006): 514–529.

M01_REND3161_13_AIE_C01.indd 20 27/10/16 3:20 PM

 21

2.6 Understand the binomial distribution.

2.7 Understand the normal distribution and use the normal table.

2.8 Understand the F distribution. 2.9 Understand the exponential distribution and its

relation to queuing theory.

2.10 Understand the Poisson distribution and its relation to queuing theory.

2.1 Understand the basic foundations of probability analysis.

2.2 Use Bayes’ Theorem to establish posterior probabilities.

2.3 Use Bayes’ Theorem to establish further probability revisions.

2.4 Describe and provide examples of both discrete and continuous random variables.

2.5 Explain the difference between discrete and continuous probability distributions.

After completing this chapter, students will be able to:

LEARNING OBJECTIVES

Probability Concepts and Applications

2 CHAPTER

Life would be simpler if we knew without doubt what was going to happen in the future. The outcome of any decision would depend only on how logical and rational the decision was. If you lost money in the stock market, it would be because you failed to consider all the information or to make a logical decision. If you got caught in the rain, it would be because you simply forgot your umbrella. You could always avoid building a plant that was too large, investing in a company that would lose money, running out of supplies, or losing crops because of bad weather. There would be no such thing as a risky investment. Life would be simpler—but boring.

It wasn’t until the sixteenth century that people started to quantify risks and to apply this concept to everyday situations. Today, the idea of risk or probability is a part of our lives. “There is a 40% chance of rain in Omaha today.” “The Florida State University Seminoles are favored 2 to 1 over the Louisiana State University Tigers this Saturday.” “There is a 50–50 chance that the stock market will reach an all-time high next month.”

A probability is a numerical statement about the likelihood that an event will occur. In this chapter, we examine the basic concepts, terms, and relationships of probability and probability distributions that are useful in solving many quantitative analysis problems. Table 2.1 lists some of the topics covered in this book that rely on probability theory. You can see that the study of quantitative analysis and business analytics would be quite dif- ficult without it.

A probability is a numerical statement about the chance that an event will occur.

M02_REND3161_13_AIE_C02.indd 21 28/10/16 10:16 AM

22  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

2.1 Fundamental Concepts

There are several rules, definitions, and concepts associated with probability that are very impor- tant in understanding the use of probability in decision making. These will be briefly presented with some examples to help clarify them.

Two Basic Rules of Probability There are two basic rules regarding the mathematics of probability:

1. The probability, P, of any event or state of nature occurring is greater than or equal to 0 and less than or equal to 1. That is,

0 … P1event2 … 1 (2-1) A probability of 0 indicates that an event is never expected to occur. A probability of 1

means that an event is always expected to occur. 2. The sum of the simple probabilities for all possible outcomes of an activity must equal 1.

Regardless of how probabilities are determined, they must adhere to these two rules.

Types of Probability There are two different ways to determine probability: the objective approach and the subjec- tive approach.

The relative frequency approach is an objective probability assessment. The probability assigned to an event is the relative frequency of that occurrence. In general,

P1event2 = Number of occurrences of the event Total number of trials or outcomes

Here is an example. Demand for white latex paint at Diversey Paint and Supply has always been 0, 1, 2, 3, or 4 gallons per day. Over the past 200 working days, the owner notes the frequencies of demand as shown in Table 2.2. If this past distribution is a good indicator of future sales, we can find the probability of each possible outcome occurring in the future by converting the data into percentages.

Thus, the probability that sales are 2 gallons of paint on any given day is P12 gallons2= 0.25 = 25%. The probability of any level of sales must be greater than or equal to 0 and less than or equal to 1. Since 0, 1, 2, 3, and 4 gallons exhaust all possible events or outcomes, the sum of their probability values must equal 1.

Objective probabilities can also be determined using what is called the classical or logi- cal method. Without performing a series of trials, we can often logically determine what the

People often misuse the two basic rules of probabilities when they use statements such as “I’m 110% sure we’re going to win the big game.”

CHAPTER TITLE

3 Decision Analysis

4 Regression Models

5 Forecasting

6 Inventory Control Models

11 Project Management

12 Waiting Lines and Queuing Theory Models

13 Simulation Modeling

14 Markov Analysis

15 Statistical Quality Control

Module 3 Decision Theory and the Normal Distribution

Module 4 Game Theory

TABLE 2.1 Chapters in This Book That Use Probability

M02_REND3161_13_AIE_C02.indd 22 28/10/16 10:16 AM

2.1 FUnDAmEnTAL ConCEPTs  23

probabilities of various events should be. For example, the probability of tossing a fair coin once and getting a head is

P1head2 = 1 2

d Number of ways of getting a head d Number of possible outcomes (head or tail)

Similarly, the probability of drawing a spade out of a deck of 52 playing cards can be logically set as

P1spade2 = 13 52

d Number of chances of drawing a spade d Number of possible outcomes

= 1�4 = 0.25 = 25%

When logic and past history are not available or appropriate, probability values can be assessed subjectively. The accuracy of subjective probabilities depends on the experience and judgment of the person making the estimates. A number of probability values cannot be determined un- less the subjective approach is used. What is the probability that the price of gasoline will be more than $4 in the next few years? What is the probability that our economy will be in a severe depression in 2020? What is the probability that you will be president of a major corporation within 20 years?

There are several methods for making subjective probability assessments. Opinion polls can be used to help in determining subjective probabilities for possible election returns and potential political candidates. In some cases, experience and judgment must be used in making subjec- tive assessments of probability values. A production manager, for example, might believe that the probability of manufacturing a new product without a single defect is 0.85. In the Delphi method, a panel of experts is assembled to make their predictions of the future. This approach is discussed in Chapter 5.

Mutually Exclusive and Collectively Exhaustive Events Events are said to be mutually exclusive if only one of the events can occur on any one trial. They are called collectively exhaustive if the list of outcomes includes every possible outcome. Many common experiences involve events that have both of these properties.

In tossing a coin, the possible outcomes are a head and a tail. Since both of them can- not occur on any one toss, the outcomes head and tail are mutually exclusive. Since obtain- ing a head and obtaining a tail represent every possible outcome, they are also collectively exhaustive.

Figure 2.1 provides a Venn diagram representation of mutually exclusive events. Let A be the event that a head is tossed, and let B be the event that a tail is tossed. The circles representing these events do not overlap, so the events are mutually exclusive.

The following situation provides an example of events that are not mutually exclusive. You are asked to draw one card from a standard deck of 52 playing cards. The following events are defined:

A = event that a 7 is drawn B = event that a heart is drawn

QUANTITY DEMANDED (GALLONS)

NUMBER OF DAYS

PROBABILITY

0 40 0.201= 40>2002 1 80 0.401= 80>2002 2 50 0.251= 50>2002 3 20 0.101= 20>2002 4 10 0.051= 10>2002

Total 200 1.001= 200>2002

TABLE 2.2 Relative Frequency Approach to Probability for Paint sales

Where do probabilities come from? Sometimes they are subjective and based on personal experiences. Other times they are objectively based on logical observations such as the roll of a die. Often, probabilities are derived from historical data.

BA

FIGURE 2.1 Venn Diagram for Events That Are mutually Exclusive

M02_REND3161_13_AIE_C02.indd 23 28/10/16 10:16 AM

24  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

BA

FIGURE 2.2 Venn Diagram for Events That Are not mutually Exclusive

Defining the Problem The scarcity of liver organs for transplants has reached critical levels in the United States. Every year about 1,500 people die waiting for a liver transplant (liverfoundation.org). There is a need to develop a model to evaluate policies for allocating livers to terminally ill patients who need them.

Developing a Model Doctors, engineers, researchers, and scientists worked together with Pritsker Corp. consultants in the pro- cess of creating the liver allocation model, called ULAM. One of the model’s jobs would be to evaluate whether to list potential recipients on a national basis or regionally.

Acquiring Input Data Historical information was available from the United Network for Organ Sharing (UNOS) for 1990 to 1995. The data were then stored in ULAM. “Poisson” probability processes described the arrivals of donors at 63 organ procurement centers and the arrivals of patients at 106 liver transplant centers.

Developing a Solution ULAM provides probabilities of accepting an offered liver, where the probability is a function of the pa- tient’s medical status, the transplant center, and the quality of the offered liver. ULAM also models the daily probability of a patient changing from one status of criticality to another.

Testing the Solution Testing involved a comparison of the model output to actual results over the 1992–1994 time period. Model results were close enough to actual results that ULAM was declared valid.

Analyzing the Results ULAM was used to compare more than 100 liver allocation policies and was then updated in 1998, with more recent data, for presentation to Congress.

Implementing the Results Based on the projected results, the UNOS committee voted 18–0 to implement an allocation policy based on regional, not national, waiting lists. This decision is expected to save 2,414 lives over an 8-year period.

Source: Based on A. A. B. Pritsker, “Life and Death Decisions,” OR/MS Today 25, 4 (August 1998): 22–28, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Liver Transplants in the United states

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

The probabilities can be assigned to these using the relative frequency approach. There are four 7s in the deck and thirteen hearts in the deck. Thus, we have

P1a 7 is drawn2 = P1A2 = 4�52 P1a heart is drawn2 = P1B2 = 13�52

These events are not mutually exclusive, as the 7 of hearts is common to both event A and event B. Figure 2.2 provides a Venn diagram representing this situation. Notice that the two circles intersect, and this intersection is whatever is common to both. In this example, the intersection would be the 7 of hearts.

M02_REND3161_13_AIE_C02.indd 24 28/10/16 10:16 AM

2.1 FUnDAmEnTAL ConCEPTs  25

Unions and Intersections of Events The intersection of two events is the set of all outcomes that are common to both events. The word and is commonly associated with the intersection, as is the symbol ¨. There are several notations for the intersection of two events:

Intersection of event A and event B = A and B = A ¨ B = AB

The notation for the probability would be

P1intersection of event A and event B2 = P1A and B2 = P1A ¨ B2 = P1AB2

The probability of the intersection is sometimes called a joint probability, which implies that both events are occurring at the same time or jointly.

The union of two events is the set of all outcomes that are contained in either of these two events. Thus, any outcome that is in event A is in the union of the two events, and any outcome that is in event B is also in the union of the two events. The word or is commonly associated with the union, as is the symbol ´. Typical notation for the union of two events would be

Union of event A and event B = 1A or B2 The notation for the probability of the union of events would be

P1union of event A and event B2 = P1A or B2 = P1A ´ B2

In the previous example, the intersection of event A and event B would be

(A and B) = the 7 of hearts is drawn

The notation for the probability would be

P1A and B2 = P1the 7 of hearts is drawn2 = 1�52 Also, the union of event A and event B would be

1A or B2 = 1either a 7 is drawn or a heart is drawn2 and the probability would be

P1A or B2 = P1any 7 or any heart is drawn2 = 16�52 To see why P1A or B2 = 16�52 and not 17�52 (which is P1A2 + P1B2), count all of the cards that are in the union, and you will see there are 16. This will help you understand the general rule for the probability of the union of two events that is presented next.

Probability Rules for Unions, Intersections, and Conditional Probabilities The general rule for the probability of the union of two events (sometimes called the additive rule) is the following:

P1A or B2 = P1A2 + P1B2 - P1A and B2 (2-2) To illustrate this with the example we have been using, to find the probability of the union of the two events (a 7 or a heart is drawn), we have

P1A or B2 = P1A2 + P1B2 - P1A and B2 = 4�52 + 13�52 - 1�52 = 16�52

M02_REND3161_13_AIE_C02.indd 25 28/10/16 10:16 AM

26  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

One of the most important probability concepts in decision making is the concept of a con- ditional probability. A conditional probability is the probability of an event occurring given that another event has already happened. The probability of event A given that event B has oc- curred is written as P1A �B2. When businesses make decisions, they often use market research of some type to help determine the likelihood of success. Given a good result from the market research, the probability of success would increase.

The probability that A will occur given that event B has occurred can be found by dividing the probability of the intersection of the two events (A and B) by the probability of the event that has occurred (B):

P1A �B2 = P1AB2 P1B2 (2-3)

From this, the formula for the probability of the intersection of two events can be easily derived and written as

P1AB2 = P1A �B2P1B2 (2-4) In the card example, what is the probability that a 7 is drawn (event A) given that we know

that the card drawn is a heart (event B)? With what we already know and given the formula for conditional probability, we have

P1A �B2 = P1AB2 P1B2 =

1�52 13�52

= 1�13

With this card example, it might be possible to determine this probability without using the formula. Given that a heart was drawn and there are 13 hearts with only one of these being a 7, we can determine that the probability is 1>13. In business, however, we sometimes do not have this complete information, and the formula is absolutely essential.

Two events are said to be independent if the occurrence of one has no impact on the occur- rence of the other. Otherwise, the events are dependent.

For example, suppose a card is drawn from a deck of cards and it is then returned to the deck and a second drawing occurs. The probability of drawing a seven on the second draw is 4>52 regardless of what was drawn on the first draw because the deck is exactly the same as it was on the first draw. Now contrast this with a similar situation with two draws from a deck of cards, but the first card is not returned to the deck. Now there are only 51 cards left in the deck, and there are either three or four 7s in the deck, depending on what the first card drawn happens to be.

A more precise definition of statistical independence would be the following: Event A and event B are independent if

P1A �B2 = P1A2 Independence is a very important condition in probability, as many calculations are simplified. One of these is the formula for the intersection of two events. If A and B are independent, then the probability of the intersection is

P1A and B2 = P1A2P1B2 Suppose a fair coin is tossed twice. The events are defined as

A = event that a head is the result of the first toss B = event that a head is the result of the second toss

These events are independent because the probability of a head on the second toss will be the same regardless of the result on the first toss. Because it is a fair coin, we know there are two equally likely outcomes on each toss (head and tail), so

P1A2 = 0.5

M02_REND3161_13_AIE_C02.indd 26 28/10/16 10:16 AM

2.2 REVising PRoBABiLiTiEs wiTH BAyEs’ THEoREm  27

and

P1B2 = 0.5 Because A and B are independent,

P1AB2 = P1A2P1B2 = 0.510.52 = 0.25 Thus, there is a 0.25 probability that two tosses of a coin will result in two heads.

If events are not independent, then finding probabilities may be a bit more difficult. How- ever, the results may be very valuable to a decision maker. A market research study about open- ing a new store in a particular location may have a positive outcome, and this would cause a revision of our probability assessment that the new store would be successful. The next section provides a means of revising probabilities based on new information.

2.2 Revising Probabilities with Bayes’ Theorem

Bayes’ Theorem is used to incorporate additional information as it is made available and help create revised or posterior probabilities from the original or prior probabilities. This means that we can take new or recent data and then revise and improve upon our old probability estimates for an event (see Figure 2.3). Let us consider the following example.

A cup contains two dice identical in appearance. One, however, is fair (unbiased) and the other is loaded (biased). The probability of rolling a 3 on the fair die is 1�6, or 0.166. The prob- ability of tossing the same number on the loaded die is 0.60.

We have no idea which die is which but select one by chance and toss it. The result is a 3. Given this additional piece of information, can we find the (revised) probability that the die rolled was fair? Can we determine the probability that it was the loaded die that was rolled?

The answer to these questions is yes, and we do so by using the formula for joint probability under statistical dependence and Bayes’ Theorem. First, we take stock of the information and probabilities available. We know, for example, that since we randomly selected the die to roll, the probability of it being fair or loaded is 0.50:

P1fair2 = 0.50 P1loaded2 = 0.50 We also know that

P13 � fair2 = 0.166 P13 � loaded2 = 0.60 Next, we compute joint probabilities P(3 and fair) and P(3 and loaded) using the formula P1AB2 = P1A �B2 * P1B2:

P13 and fair2 = P13 � fair2 * P1fair2 = 10.166210.502 = 0.083

P13 and loaded2 = P13 � loaded2 * P1loaded2 = 10.60210.502 = 0.300

New Information

Bayes’ Process

Posterior Probabilities

Prior Probabilities

FIGURE 2.3 Using Bayes’ Process

M02_REND3161_13_AIE_C02.indd 27 28/10/16 10:16 AM

28  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

A 3 can occur in combination with the state “fair die” or in combination with the state “loaded die.” The sum of their probabilities gives the unconditional or marginal probability of a 3 on the toss; namely, P132 = 0.083 + 0.300 = 0.383.

If a 3 does occur, and if we do not know which die it came from, the probability that the die rolled was the fair one is

P1fair � 32 = P1fair and 32 P132 =

0.083

0.383 = 0.22

The probability that the die rolled was loaded is

P1loaded � 32 = P1loaded and 32 P132 =

0.300

0.383 = 0.78

These two conditional probabilities are called the revised or posterior probabilities for the next roll of the die.

Before the die was rolled in the preceding example, the best we could say was that there was a 50–50 chance that it was fair (0.50 probability) and a 50–50 chance that it was loaded. After one roll of the die, however, we are able to revise our prior probability estimates. The new posterior estimate is that there is a 0.78 probability that the die rolled was loaded and only a 0.22 probability that it was not.

Using a table is often helpful in performing the calculations associated with Bayes’ Theo- rem. Table 2.3 provides the general layout for this, and Table 2.4 provides this specific example.

General Form of Bayes’ Theorem Revised probabilities can also be computed in a more direct way using a general form for Bayes’ Theorem:

P1A �B2 = P1B �A2P1A2 P1B �A2P1A2 + P1B �A′2P1A′2 (2-5)

where

A′ = the complement of the event A; for example, if A is the event “fair die,” then A′ is “loaded die”

We originally saw in Equation 2-3 the conditional probability of event A, given event B, is

P1A �B2 = P1AB2 P1B2

Thomas Bayes derived his theorem from this. Appendix 2.1 shows the mathematical steps lead- ing to Equation 2-5. Now let’s return to the example.

STATE OF NATURE

P(B �STATE OF NATURE)

PRIOR PROBABILITY

JOINT PROBABILITY

POSTERIOR PROBABILITY

A P(B �A) *P(A) =P(B and A) P(B and A)>P(B) = P(A �B) A′ P(B �A′) *P(A′) =P(B and A′)

P(B) P(B and A′)>P(B) = P(A′ �B)

TABLE 2.3 Tabular Form of Bayes’ Calculations given That Event B Has occurred

STATE OF NATURE

P(3 �STATE OF NATURE)

PRIOR PROBABILITY

JOINT PROBABILITY

POSTERIOR PROBABILITY

Fair die 0.166 *0.5 = 0.083 0.083>0.383 = 0.22 Loaded die 0.600 *0.5 = 0.300 0.300>0.383 = 0.78

P(3) = 0.383

TABLE 2.4 Bayes’ Calculations given That a 3 is Rolled in This Example

A Presbyterian minister, Thomas Bayes (1702–1761), did the work leading to this theorem.

Another way to compute revised probabilities is with Bayes’ Theorem.

M02_REND3161_13_AIE_C02.indd 28 28/10/16 10:16 AM

2.3 FURTHER PRoBABiLiTy REVisions  29

Although it may not be obvious to you at first glance, we used this basic equation to com- pute the revised probabilities. For example, if we want the probability that the fair die was rolled, given the first toss was a 3—namely, P(fair die � 3 rolled)—we can let

event ;fair die< replace A in Equation 2@5

event ;loaded die< replace A′ in Equation 2@5 event ;3 rolled< replace B in Equation 2@5

We can then rewrite Equation 2-5 and solve as follows:

P1fair die � 3 rolled2 = P13 � fair2P1fair2 P13 � fair2P1fair2 + P13 � loaded2P1loaded2

= 10.166210.502

10.166210.502 + 10.60210.502

= 0.083

0.383 = 0.22

This is the same answer that we computed earlier. Can you use this alternative approach to show that P1loaded die � 3 rolled2 = 0.78? Either method is perfectly acceptable, but when we deal with probability revisions again in Chapter 3, we may find that Equation 2-5 or the tabular ap- proach is easier to apply.

2.3 Further Probability Revisions

Although one revision of prior probabilities can provide useful posterior probability es- timates, additional information can be gained from performing the experiment a second time. If it is financially worthwhile, a decision maker may even decide to make several more revisions.

Returning to the previous example, we now attempt to obtain further information about the posterior probabilities as to whether the die just rolled is fair or loaded. To do so, let us toss the die a second time. Again, we roll a 3. What are the further revised probabilities?

To answer this question, we proceed as before, with only one exception. The prob- abilities P1fair2 = 0.50 and P1loaded2 = 0.50 remain the same, but now we must compute P13, 3 � fair2 = 10.166210.1662 = 0.027 and P13, 3 � loaded2 = 10.6210.62 = 0.36. With these joint probabilities of two 3s on successive rolls, given the two types of dice, we may revise the probabilities:

P13, 3 and fair2 = P13, 3 � fair2 * P1fair2 = 10.027210.52 = 0.013

P13, 3 and loaded2 = P13, 3 � loaded2 * P1loaded2 = 10.36210.52 = 0.18

Thus, the probability of rolling two 3s, a marginal probability, is 0.013 + 0.18 = 0.193, the sum of the two joint probabilities:

P1fair � 3, 32 = P13, 3 and fair2 P13, 32

= 0.013

0.193 = 0.067

P1loaded � 3, 32 = P13, 3 and loaded2 P13, 32

= 0.18

0.193 = 0.933

M02_REND3161_13_AIE_C02.indd 29 28/10/16 10:16 AM

30  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

What has this second roll accomplished? Before we rolled the die the first time, we knew only that there was a 0.50 probability that it was either fair or loaded. When the first die was rolled in the previous example, we were able to revise these probabilities:

Probability the die is fair = 0.22 Probability the die is loaded = 0.78

Now, after the second roll in this example, our refined revisions tell us that

Probability the die is fair = 0.067 Probability the die is loaded = 0.933

This type of information can be extremely valuable in business decision making.

2.4 Random Variables

We have just discussed various ways of assigning probability values to the outcomes of an ex- periment. Let us now use this probability information to compute the expected outcome, vari- ance, and standard deviation of the experiment. This can help select the best decision among a number of alternatives.

A random variable assigns a real number to every possible outcome or event in an experi- ment. It is normally represented by a letter such as X or Y. When the outcome itself is numerical or quantitative, the outcome numbers can be the random variable. For example, consider refrig- erator sales at an appliance store. The number of refrigerators sold during a given day can be the random variable. Using X to represent this random variable, we can express this relationship as follows:

X = number of refrigerators sold during the day

Flight safety and Probability Analysis

With the horrific events of September 11, 2001, and the use of airplanes as weapons of mass destruction, airline safety has become an even more important international issue. How can we reduce the impact of terrorism on air safety? What can be done to make air travel safer overall? One answer is to evaluate various air safety programs and to use probability theory in the analysis of the costs of these programs.

Determining airline safety is a matter of applying the con- cepts of objective probability analysis. The chance of getting killed in a scheduled domestic flight is about 1 in 5 million. This is a probability of about 0.0000002. Another measure is the number of deaths per passenger mile flown. The number is about 1 passenger per billion passenger miles flown, or a prob- ability of about 0.000000001. Without question, flying is safer than many other forms of transportation, including driving. For a typical weekend, more people are killed in car accidents than a typical air disaster.

Analyzing new airline safety measures involves costs and the subjective probability that lives will be saved. One airline expert proposed a number of new airline safety measures. When the

costs involved and probability of saving lives were taken into ac- count, the result was a cost of about $1 billion for every life saved on average. Using probability analysis will help determine which safety programs will result in the greatest benefit, and these programs can be expanded.

In addition, some proposed safety issues are not completely certain. For example, a Thermal Neutron Analysis device used to detect explosives at airports had a probability of 0.15 of giving a false alarm, resulting in a high cost of inspection and long flight delays. This would indicate that money should be spent on de- veloping more reliable equipment for detecting explosives. The result would be safer air travel with fewer unnecessary delays.

Without question, the use of probability analysis to deter- mine and improve flight safety is indispensable. Many transporta- tion experts hope that the same rigorous probability models used in the airline industry will some day be applied to the much more deadly system of highways and the drivers who use them.

Sources: Based on Robert Machol, “Flying Scared,” OR/MS Today 23, 5 (October 1996): 32–37; and Arnold Barnett, “The Worst Day Ever,” OR/MS Today 28, 6 (December 2001): 28–31, © Trevor S. Hale.

IN ACTION

M02_REND3161_13_AIE_C02.indd 30 28/10/16 10:16 AM

2.4 RAnDom VARiABLEs  31

In general, whenever the experiment has quantifiable outcomes, it is beneficial to define these quantitative outcomes as the random variable. Examples are given in Table 2.5.

When the outcome itself is not numerical or quantitative, it is necessary to define a random variable that associates each outcome with a unique real number. Several examples are given in Table 2.6.

There are two types of random variables: discrete random variables and continuous random variables. Developing probability distributions and making computations based on these distri- butions depend on the type of random variable.

A random variable is a discrete random variable if it can assume only a finite or limited set of values. Which of the random variables in Table 2.5 are discrete random variables? Look- ing at Table 2.5, we can see that the variables associated with stocking 50 Christmas trees, in- specting 600 items, and sending out 5,000 letters are all examples of discrete random variables. Each of these random variables can assume only a finite or limited set of values. The number of Christmas trees sold, for example, can only be integer numbers from 0 to 50. There are 51 values that the random variable X can assume in this example.

A continuous random variable is a random variable that has an infinite or an unlimited set of values. Are there any examples of continuous random variables in Table 2.5 or 2.6? Looking at Table 2.5, we can see that testing the lifetime of a lightbulb is an experiment whose results can be described with a continuous random variable. In this case, the random variable, S, is the time the bulb burns. It can last for 3,206 minutes, 6,500.7 minutes, 251.726 minutes, or any other value between 0 and 80,000 minutes. In most cases, the range of a continuous random variable is stated as lower value … S … upper value, such as 0 … S … 80,000. The random variable R in Table 2.5 is also continuous. Can you explain why?

TABLE 2.5 Examples of Random Variables

EXPERIMENT

OUTCOME

RANDOM VARIABLE

RANGE OF RANDOM VARIABLES

Stock 50 Christmas trees Number of Christmas trees sold X = number of Christmas trees sold 0, 1, 2, . . . , 50

Inspect 600 items Number of acceptable items Y = number of acceptable items 0, 1, 2, . . . , 600

Send out 5,000 sales letters Number of people responding to the letters

Z = number of people responding to the letters

0, 1, 2, . . . , 5,000

Build an apartment building Percent of building completed after 4 months

R = percent of building completed after 4 months

0 … R … 100

Test the lifetime of a lightbulb (minutes)

Length of time the bulb lasts up to 80,000 minutes

S = time the bulb burns 0 … S … 80,000

Try to develop a few more examples of discrete random variables to be sure you understand this concept.

EXPERIMENT

OUTCOME

RANGE OF RANDOM VARIABLES

RANDOM VARIABLES

Students respond to a questionnaire

Strongly agree (SA)

Agree (A)

Neutral (N)

Disagree (D)

Strongly disagree (SD)

X = e 5 if SA4 if A3 if N 2 if D

1 if SD

1, 2, 3, 4, 5

One machine is inspected

Defective

Not defective Y = b 0 if defective1 if not defective 0, 1 Consumers respond to how they like a product

Good

Average

Poor Z = c 3 if good2 if average

1 if poor

1, 2, 3

TABLE 2.6 Random Variables for outcomes That Are not numbers

M02_REND3161_13_AIE_C02.indd 31 28/10/16 10:16 AM

32  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

2.5 Probability Distributions

Earlier we discussed the probability values of an event. We now explore the properties of prob- ability distributions. We see how popular distributions, such as the normal, Poisson, binomial, and exponential probability distributions, can save us time and effort. Since a random variable may be discrete or continuous, we consider discrete probability distributions and continuous probability distributions seperately.

Probability Distribution of a Discrete Random Variable When we have a discrete random variable, there is a probability value assigned to each event. These values must be between 0 and 1, and they must sum to 1. Let’s look at an example.

The 100 students in Pat Shannon’s statistics class have just completed a math quiz that he gives on the first day of class. The quiz consists of five very difficult algebra problems. The grade on the quiz is the number of correct answers, so the grades theoretically could range from 0 to 5. However, no one in this class received a score of 0, so the grades ranged from 1 to 5. The random variable X is defined to be the grade on this quiz, and the grades are summarized in Table 2.7. This discrete prob- ability distribution was developed using the relative frequency approach presented earlier.

The distribution follows the three rules required of all probability distributions: (1) the events are mutually exclusive and collectively exhaustive, (2) the individual probability values are between 0 and 1 inclusive, and (3) the total of the probability values is 1.

Although listing the probability distribution as we did in Table 2.7 is adequate, it can be difficult to get an idea about characteristics of the distribution. To overcome this problem, the probability values are often presented in graph form. The graph of the distribution in Table 2.7 is shown in Figure 2.4.

The graph of this probability distribution gives us a picture of its shape. It helps us identify the central tendency of the distribution, called the mean or expected value, and the amount of variability or spread of the distribution, called the variance.

Expected Value of a Discrete Probability Distribution Once we have established a probability distribution, the first characteristic that is usually of interest is the central tendency of the distribution. The expected value, a measure of central ten- dency, is computed as the weighted average of the values of the random variable:

E1X2 = a n

i=1 Xi P1Xi2

= X1P1X12 + X2P1X22 + Á + XnP1Xn2 (2-6) where

Xi = random variable’s possible values

P1Xi2 = probability of each possible value of the random variable

a n

i=1 = summation sign indicating we are adding all n possible values

E1X2 = expected value or mean of the random variable

The expected value of a discrete distribution is the weighted average of the values of the random variable.

RANDOM VARIABLE X (SCORE)

NUMBER

PROBABILITY P(X)

5 10 0.1 = 10>100 4 20 0.2 = 20>100 3 30 0.3 = 30>100 2 30 0.3 = 30>100 1 10 0.1 = 10>100

Total 100 1.0 = 100>100

TABLE 2.7 Probability Distribution for Quiz scores

M02_REND3161_13_AIE_C02.indd 32 28/10/16 10:16 AM

2.5 PRoBABiLiTy DisTRiBUTions  33

The expected value or mean of any discrete probability distribution can be computed by multiplying each possible value of the random variable, Xi, times the probability, P1Xi2, that out- come will occur and summing the results, g . Here is how the expected value can be computed for the quiz scores:

E1X2 = a 5

i=1 XiP1Xi2

= X1P1X12 + X2P1X22 + X3P1X32 + X4P1X42 + X5P1X52 = 15210.12 + 14210.22 + 13210.32 + 12210.32 + 11210.12 = 2.9

The expected value of 2.9 is the mean score on the quiz.

Variance of a Discrete Probability Distribution In addition to the central tendency of a probability distribution, most people are interested in the variability or the spread of the distribution. If the variability is low, it is much more likely that the outcome of an experiment will be close to the average or expected value. On the other hand, if the variability of the distribution is high, which means that the probability is spread out over the various random variable values, there is less chance that the outcome of an experiment will be close to the expected value.

The variance of a probability distribution is a number that reveals the overall spread or dis- persion of the distribution. For a discrete probability distribution, it can be computed using the following equation:

s2 = Variance = a n

i=1 3Xi - E1X242P1Xi2 (2-7)

where

Xi = random variable’s possible values E1X2 = expected value of the random variable

3Xi - E1X24 = difference between each value of the random variable and the expected value P1Xi2 = probability of each possible value of the random variable

To compute the variance, each value of the random variable is subtracted from the expected value, squared, and multiplied times the probability of occurrence of that value. The results

0.4

0.3

0.2

0.1

0 1 2 3

X

P (X

)

4 5

FIGURE 2.4 Probability Distribution for Dr. shannon’s Class

A probability distribution is often described by its mean and variance. Even if most of the men in class (or the United States) have heights between 5 feet 6 inches and 6 feet 2 inches, there is still some small probability of outliers.

M02_REND3161_13_AIE_C02.indd 33 28/10/16 10:16 AM

34  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

are then summed to obtain the variance. Here is how this procedure is done for Dr. Shannon’s quiz scores:

Variance = a 5

i=1 3Xi - E1X242P1Xi2

Variance = 15 - 2.92210.12 + 14 - 2.92210.22 + 13 - 2.92210.32 + 12 - 2.92210.32 + 11 - 2.92210.12

= 12.12210.12 + 11.12210.22 + 10.12210.32 + 1-0.92210.32 + 1-1.92210.12 = 0.441 + 0.242 + 0.003 + 0.243 + 0.361 = 1.29

A related measure of dispersion or spread is the standard deviation. This quantity is also used in many computations involved with probability distributions. The standard deviation is just the square root of the variance:

s = 1Variance = 2s2 (2-8) where

1 = square root s = standard deviation

The standard deviation for the random variable X in the example is

s = 1Variance = 11.29 = 1.14

These calculations are easily performed in Excel. Program 2.1A provides the output for this ex- ample. Program 2.1B shows the inputs and formulas in Excel for calculating the mean, variance, and standard deviation in this example.

Probability Distribution of a Continuous Random Variable There are many examples of continuous random variables. The time it takes to finish a project, the number of ounces in a barrel of butter, the high temperature during a given day, the exact length of a given type of lumber, and the weight of a railroad car of coal are all examples of con- tinuous random variables. Since random variables can take on an infinite number of values, the fundamental probability rules for continuous random variables must be modified.

As with discrete probability distributions, the sum of the probability values must equal 1. Because there are an infinite number of values of the random variables, however, the probability of each value of the random variable must be 0. If the probability values for the random variable values were greater than 0, the sum would be infinitely large.

PROGRAM 2.1A Excel 2016 output for the Dr. shannon Example

PROGRAM 2.1B Formulas in an Excel spreadsheet for the Dr. shannon Example

M02_REND3161_13_AIE_C02.indd 34 28/10/16 10:16 AM

2.6 THE BinomiAL DisTRiBUTion  35

With a continuous probability distribution, there is a continuous mathematical function that describes the probability distribution. This function is called the probability density function or simply the probability function. It is usually represented by f 1X2. When working with con- tinuous probability distributions, the probability function can be graphed, and the area under- neath the curve represents probability. Thus, to find any probability, we simply find the area under the curve associated with the range of interest.

We now look at the sketch of a sample density function in Figure 2.5. This curve represents the probability density function for the weight of a particular machined part. The weight could vary from 5.06 to 5.30 grams, with weights around 5.18 grams being the most likely. The shaded area represents the probability the weight is between 5.22 and 5.26 grams.

If we wanted to know the probability of a part weighing exactly 5.1300000 grams, for ex- ample, we would have to compute the area of a line of width 0. Of course, this would be 0. This result may seem strange, but if we insist on enough decimal places of accuracy, we are bound to find that the weight differs from 5.1300000 grams exactly, be the difference ever so slight.

This is important because it means that, for any continuous distribution, the probability does not change if a single point is added to the range of values that is being considered. In Figure 2.5, this means the following probabilities are all exactly the same:

P15.22 6 X 6 5.262 = P15.22 6 X … 5.262 = P15.22 … X 6 5.262 = P15.22 … X … 5.262

The inclusion or exclusion of either or both endpoints (5.22 or 5.26) has no impact on the probability.

In this section, we have investigated the fundamental characteristics and properties of prob- ability distributions in general. In the next five sections, we introduce three important continuous distributions—the normal distribution, the F distribution, and the exponential distribution—and two discrete distributions—the Poisson distribution and the binomial distribution.

2.6 The Binomial Distribution

Many business experiments can be characterized by the Bernoulli process. The probability of obtaining specific outcomes in a Bernoulli process is described by the binomial probabil- ity distribution. In order to be a Bernoulli process, an experiment must have the following characteristics:

1. Each trial in a Bernoulli process has only two possible outcomes. These are typically called a success and a failure, although examples might be yes or no, heads or tails, pass or fail, defective or good, and so on.

2. The probability stays the same from one trial to the next.

P ro

ba bi

lit y

5.06 5.10 5.14 5.18 5.22 5.26 5.30 Weight (grams)

FIGURE 2.5 graph of sample Density Function

A probability density function, f(X), is a mathematical way of describing the probability distribution.

M02_REND3161_13_AIE_C02.indd 35 28/10/16 10:16 AM

36  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

3. The trials are statistically independent. 4. The number of trials is a positive integer.

A common example of this process is tossing a coin. The binomial distribution is used to find the probability of a specific number of successes

out of n trials of a Bernoulli process. To find this probability, it is necessary to know the following:

n = the number of trials p = the probability of a success on any single trial

We let

r = the number of successes q = 1 - p = the probability of a failure

The binomial formula is

Probability of r successes in n trials = n!

r!1n - r2! p r qn - r (2-9)

The symbol ! means factorial, and n! = n1n - 121n - 22c (1). For example, 4! = 142132122112 = 24

Also, 1! = 1, and 0! = 1 by definition.

Solving Problems with the Binomial Formula A common example of a binomial distribution is the tossing of a coin and counting the number of heads. For example, if we wished to find the probability of 4 heads in 5 tosses of a coin, we would have

n = 5, r = 4, p = 0.5, and q = 1 - 0.5 = 0.5

Thus,

P14 successes in 5 trials2 = 5! 4!15 - 42! 0.5

40.55 - 4

= 5142132122112 413212211211!2 10.0625210.52 = 0.15625

Thus, the probability of 4 heads in 5 tosses of a coin is 0.15625, or about 16%. Using Equation 2-9, it is also possible to find the entire probability distribution (all the pos-

sible values for r and the corresponding probabilities) for a binomial experiment. The probability distribution for the number of heads in 5 tosses of a fair coin is shown in Table 2.8 and then graphed in Figure 2.6.

NUMBER OF HEADS (r)

PROBABILITY = 5!

r!(5 − r)! (0.5)r(0.5)5− r

0 0.03125 =

5!

0!15 - 02!10.52 010.525 - 0

1 0.15625 =

5!

1!15 - 12!10.52 110.525 - 1

2 0.31250 =

5!

2!15 - 22!10.52 210.525 - 2

3 0.31250 =

5!

3!15 - 32!10.52 310.525 - 3

4 0.15625 =

5!

4!15 - 42!10.52 410.525 - 4

5 0.03125 =

5!

5!15 - 52!10.52 510.525 - 5

TABLE 2.8 Binomial Probability Distribution for n = 5 and p = 0.50

M02_REND3161_13_AIE_C02.indd 36 28/10/16 10:16 AM

2.6 THE BinomiAL DisTRiBUTion  37

TABLE 2.9 A sample Table for the Binomial Distribution

P

n r 0.05 0.10 0.15 0.20 0.25 0.30 0.35 0.40 0.45 0.50

1 0 0.9500 0.9000 0.8500 0.8000 0.7500 0.7000 0.6500 0.6000 0.5500 0.5000 1 0.0500 0.1000 0.1500 0.2000 0.2500 0.3000 0.3500 0.4000 0.4500 0.5000

2 0 0.9025 0.8100 0.7225 0.6400 0.5625 0.4900 0.4225 0.3600 0.3025 0.2500 1 0.0950 0.1800 0.2500 0.3200 0.3750 0.4200 0.4550 0.4800 0.4950 0.5000 2 0.0025 0.0100 0.0225 0.0400 0.0625 0.0900 0.1225 0.1600 0.2025 0.2500

3 0 0.8574 0.7290 0.6141 0.5120 0.4219 0.3430 0.2746 0.2160 0.1664 0.1250 1 0.1354 0.2430 0.3251 0.3840 0.4219 0.4410 0.4436 0.4320 0.4084 0.3750 2 0.0071 0.0270 0.0574 0.0960 0.1406 0.1890 0.2389 0.2880 0.3341 0.3750 3 0.0001 0.0010 0.0034 0.0080 0.0156 0.0270 0.0429 0.0640 0.0911 0.1250

4 0 0.8145 0.6561 0.5220 0.4096 0.3164 0.2401 0.1785 0.1296 0.0915 0.0625 1 0.1715 0.2916 0.3685 0.4096 0.4219 0.4116 0.3845 0.3456 0.2995 0.2500 2 0.0135 0.0486 0.0975 0.1536 0.2109 0.2646 0.3105 0.3456 0.3675 0.3750 3 0.0005 0.0036 0.0115 0.0256 0.0469 0.0756 0.1115 0.1536 0.2005 0.2500 4 0.0000 0.0001 0.0005 0.0016 0.0039 0.0081 0.0150 0.0256 0.0410 0.0625

5 0 0.7738 0.5905 0.4437 0.3277 0.2373 0.1681 0.1160 0.0778 0.0503 0.0313 1 0.2036 0.3281 0.3915 0.4096 0.3955 0.3602 0.3124 0.2592 0.2059 0.1563 2 0.0214 0.0729 0.1382 0.2048 0.2637 0.3087 0.3364 0.3456 0.3369 0.3125 3 0.0011 0.0081 0.0244 0.0512 0.0879 0.1323 0.1811 0.2304 0.2757 0.3125 4 0.0000 0.0005 0.0022 0.0064 0.0146 0.0284 0.0488 0.0768 0.1128 0.1563 5 0.0000 0.0000 0.0001 0.0003 0.0010 0.0024 0.0053 0.0102 0.0185 0.0313

6 0 0.7351 0.5314 0.3771 0.2621 0.1780 0.1176 0.0754 0.0467 0.0277 0.0156 1 0.2321 0.3543 0.3993 0.3932 0.3560 0.3025 0.2437 0.1866 0.1359 0.0938 2 0.0305 0.0984 0.1762 0.2458 0.2966 0.3241 0.3280 0.3110 0.2780 0.2344 3 0.0021 0.0146 0.0415 0.0819 0.1318 0.1852 0.2355 0.2765 0.3032 0.3125 4 0.0001 0.0012 0.0055 0.0154 0.0330 0.0595 0.0951 0.1382 0.1861 0.2344 5 0.0000 0.0001 0.0004 0.0015 0.0044 0.0102 0.0205 0.0369 0.0609 0.0938 6 0.0000 0.0000 0.0000 0.0001 0.0002 0.0007 0.0018 0.0041 0.0083 0.0156

Solving Problems with Binomial Tables MSA Electronics is experimenting with the manufacture of a new type of transistor that is very difficult to mass-produce at an acceptable quality level. Every hour a supervisor takes a random sample of 5 transistors produced on the assembly line. The probability that any one transistor is defective is considered to be 0.15. MSA wants to know the probability of finding 3, 4, or 5 de- fectives if the true percentage defective is 15%.

For this problem, n = 5, p = 0.15, and r = 3, 4, or 5. Although we could use the formula for each of these values, it is easier to use binomial tables for this. Appendix B gives a bino- mial table for a broad range of values for n, r, and p. A portion of this appendix is shown in Table 2.9. To find these probabilities, we look through the n = 5 section and find the p = 0.15

0.4

0.3

0.2

0.1

0 1 2 3 4 5 6

P ro

ba bi

lit y,

P (r

)

Value of r (number of successes)

FIGURE 2.6 Binomial Probability Distribution for n = 5 and p = 0.50

M02_REND3161_13_AIE_C02.indd 37 28/10/16 10:16 AM

38  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

column. In the row where r = 3, we see 0.0244. Thus, P1r = 32 = 0.0244. Similarly, P1r = 42 = 0.0022, and P1r = 52 = 0.0001. By adding these three probabilities, we have the probability that the number of defects is 3 or more:

P13 or more defects2 = P132 + P142 + P152 = 0.0244 + 0.0022 + 0.0001 = 0.0267

The expected value (or mean) and the variance of a binomial random variable may be easily found. These are

Expected value 1mean2 = np (2-10) Variance = np11 - p2 (2-11)

The expected value and variance for the MSA Electronics example are computed as follows:

Expected value = np = 510.152 = 0.75 Variance = np11 - p2 = 510.15210.852 = 0.6375

Programs 2.2A and 2.2B illustrate how Excel is used for binomial probabilities.

2.7 The Normal Distribution

One of the most popular and useful continuous probability distributions is the normal distribu- tion. The probability density function of this distribution is given by the rather complex formula

f 1X2 = 1 s12p e - 1x -m222s2 (2-12)

The normal distribution is specified completely when values for the mean, m, and the stan- dard deviation, s, are known. Figure 2.7 shows several different normal distributions with the same standard deviation and different means. As shown, differing values of m will shift the aver- age or center of the normal distribution. The overall shape of the distribution remains the same. On the other hand, when the standard deviation is varied, the normal curve either flattens out or becomes steeper. This is shown in Figure 2.8.

As the standard deviation, s, becomes smaller, the normal distribution becomes steeper. When the standard deviation becomes larger, the normal distribution has a tendency to flatten out or become broader.

Using the cell references eliminates the need to retype the formula if you change a parameter such as p or r.

The function BINOMDIST (r,n,p,TRUE) returns the cumulative probability.

PROGRAM 2.2A Excel output for the Binomial Example

PROGRAM 2.2B Function in an Excel 2016 spreadsheet for Binomial Probabilities

The normal distribution affects a large number of processes in our lives (e.g., filling boxes of cereal with 32 ounces of corn flakes). Each normal distribution depends on the mean and standard deviation.

M02_REND3161_13_AIE_C02.indd 38 28/10/16 10:16 AM

2.7 THE noRmAL DisTRiBUTion  39

Smaller m, same s

Larger m, same s

m 5 50 6040

50 60m 5 40

50 m 5 6040

FIGURE 2.7 normal Distribution with Different Values for m

Same m, smaller s

Same m, larger s

m

FIGURE 2.8 normal Distribution with Different Values for s

Probability Assessments of Curling Champions

Probabilities are used every day in sporting activities. In many sport- ing events, there are questions involving strategies that must be an- swered to provide the best chance of winning the game. In baseball, should a particular batter be intentionally walked in key situations at the end of the game? In football, should a team elect to try for a two- point conversion after a touchdown? In soccer, should a penalty kick ever be aimed directly at the goalkeeper? In curling, in the last round, or “end” of a game, is it better to be behind by one point and have the hammer, or is it better to be ahead by one point and not have the hammer? An attempt was made to answer this last question.

In curling, a granite stone, or “rock,” is slid across a sheet of ice 14 feet wide and 146 feet long. Four players on each of two teams take alternating turns sliding the rock, trying to get it as close as possible to the center of a circle called the “house.” The team with the rock closest to this scores points. The team that is behind at the completion of a round or end has the advantage in

the next end by being the last team to slide the rock. This team is said to “have the hammer.” A survey was taken of a group of ex- perts in curling, including a number of former world champions. In this survey, about 58% of the respondents favored having the hammer and being down by one going into the last end. Only about 42% preferred being ahead and not having the hammer.

Data were also collected from 1985 to 1997 at the Canadian Men’s Curling Championships (also called the Brier). Based on the results over this time period, it is better to be ahead by one point and not have the hammer at the end of the ninth end rather than being behind by one and having the hammer, as many people prefer. This differed from the survey results. Apparently, world champions and other experts preferred to have more control of their destiny by having the hammer even though it put them in a worse situation.

Source: Based on Keith A. Willoughby and Kent J. Kostuk, “Preferred Sce- narios in the Sport of Curling,” Interfaces 34, 2 (March–April 2004): 117–122, © Trevor S. Hale.

IN ACTION

M02_REND3161_13_AIE_C02.indd 39 28/10/16 10:16 AM

40  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

Area Under the Normal Curve Because the normal distribution is symmetrical, its midpoint (and highest point) is at the mean. Values on the X axis are then measured in terms of how many standard deviations they lie from the mean. As you may recall from our earlier discussion of probability distributions, the area un- der the curve (in a continuous distribution) describes the probability that a random variable has a value in a specified interval. When dealing with the uniform distribution, it is easy to compute the area between any points a and b. The normal distribution requires mathematical calculations beyond the scope of this book, but tables that provide areas or probabilities are readily available.

Using the Standard Normal Table When finding probabilities for the normal distribution, it is best to draw the normal curve and shade the area corresponding to the probability being sought. The normal distribution table can then be used to find probabilities by following two steps.

STEP 1. Convert the normal distribution to what we call a standard normal distribution. A stan- dard normal distribution has a mean of 0 and a standard deviation of 1. All normal tables are set up to handle random variables with m = 0 and s = 1. Without a standard normal distribution, a different table would be needed for each pair of m and s values. We call the new standard random variable Z. The value for Z for any normal distribution is computed from this equation:

Z = X - m

s (2-13)

where

X = value of the random variable we want to measure m = mean of the distribution s = standard deviation of the distribution Z = number of standard deviations from X to the mean, m

For example, if m = 100, s = 15, and we are interested in finding the probability that the random variable X (IQ) is less than 130, we want P1X 6 1302:

Z = X - m

s =

130 - 100 15

= 30

15 = 2 standard deviations

This means that the point X is 2.0 standard deviations to the right of the mean. This is shown in Figure 2.9.

m 5 100 s 5 15P(X < 130)

55 70 85 100 115 130 145

–3 –2 –1 0 1 2 3 Z 5

X 5 IQ

x – m s

m

FIGURE 2.9 normal Distribution showing the Relationship Between Z Values and X Values

M02_REND3161_13_AIE_C02.indd 40 28/10/16 10:16 AM

2.7 THE noRmAL DisTRiBUTion  41

STEP 2. Look up the probability from a table of normal curve areas. Table 2.10, which also ap- pears as Appendix A, is such a table of areas for the standard normal distribution. It is set up to provide the area under the curve to the left of any specified value of Z.

Let’s see how Table 2.10 can be used. The column on the left lists values of Z, with the sec- ond decimal place of Z appearing in the top row. For example, for a value of Z = 2.00 as just computed, find 2.0 in the left-hand column and 0.00 in the top row. In the body of the table, we find that the area sought is 0.97725, or 97.7%. Thus,

P1X 6 1302 = P1Z 6 2.002 = 97.7% This suggests that if the mean IQ score is 100, with a standard deviation of 15 points, the

probability that a randomly selected person’s IQ is less than 130 is 97.7%. This is also the prob- ability that the IQ is less than or equal to 130. To find the probability that the IQ is greater than 130, we simply note that this is the complement of the previous event and the total area under the curve (the total probability) is 1. Thus,

P1X 7 1302 = 1 - P1X … 1302 = 1 - P1Z … 22 = 1 - 0.97725 = 0.02275 While Table 2.10 does not give negative Z values, the symmetry of the normal distribu- tion can be used to find probabilities associated with negative Z values. For example, P1Z 6 -22 = P1Z 7 22.

To feel comfortable with the use of the standard normal probability table, we need to work a few more examples. We now use the Haynes Construction Company as a case in point.

Haynes Construction Company Example Haynes Construction Company builds primarily three- and four-unit apartment buildings (called triplexes and quadraplexes) for investors, and it is believed that the total construction time in days follows a normal distribution. The mean time to construct a triplex is 100 days, and the standard deviation is 20 days. Recently, the president of Haynes Construction signed a contract to complete a triplex in 125 days. Failure to complete the triplex in 125 days would result in severe penalty fees. What is the probability that Haynes Construction will not be in violation of its construction contract? The normal distribution for the construction of triplexes is shown in Figure 2.10.

To compute this probability, we need to find the shaded area under the curve. We begin by computing Z for this problem:

Z = X - m

s

= 125 - 100

20

= 25

20 = 1.25

Looking in Table 2.10 for a Z value of 1.25, we find an area under the curve of 0.89435. (We do this by looking up 1.2 in the left-hand column of the table and then moving to the 0.05 column to find the value for Z = 1.25.) Therefore, the probability of not violating the contract is 0.89435, or about an 89% chance.

To be sure you understand the concept of symmetry in Table 2.10, try to find a probability such as P(X < 85). Note that the standard normal table shows only positive Z values.

s 5 20 days

X 5 125 days

Z 5 1.25

m 5 100 days

P(X # 125)

0.89435

FIGURE 2.10 normal Distribution for Haynes Construction

M02_REND3161_13_AIE_C02.indd 41 28/10/16 10:16 AM

42  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

TABLE 2.10 standardized normal Distribution Function

AREA UNDER THE NORMAL CURVE

Z 0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09

0.0 .50000 .50399 .50798 .51197 .51595 .51994 .52392 .52790 .53188 .53586

0.1 .53983 .54380 .54776 .55172 .55567 .55962 .56356 .56749 .57142 .57535

0.2 .57926 .58317 .58706 .59095 .59483 .59871 .60257 .60642 .61026 .61409

0.3 .61791 .62172 .62552 .62930 .63307 .63683 .64058 .64431 .64803 .65173

0.4 .65542 .65910 .66276 .66640 .67003 .67364 .67724 .68082 .68439 .68793

0.5 .69146 .69497 .69847 .70194 .70540 .70884 .71226 .71566 .71904 .72240

0.6 .72575 .72907 .73237 .73565 .73891 .74215 .74537 .74857 .75175 .75490

0.7 .75804 .76115 .76424 .76730 .77035 .77337 .77637 .77935 .78230 .78524

0.8 .78814 .79103 .79389 .79673 .79955 .80234 .80511 .80785 .81057 .81327

0.9 .81594 .81859 .82121 .82381 .82639 .82894 .83147 .83398 .83646 .83891

1.0 .84134 .84375 .84614 .84849 .85083 .85314 .85543 .85769 .85993 .86214

1.1 .86433 .86650 .86864 .87076 .87286 .87493 .87698 .87900 .88100 .88298

1.2 .88493 .88686 .88877 .89065 .89251 .89435 .89617 .89796 .89973 .90147

1.3 .90320 .90490 .90658 .90824 .90988 .91149 .91309 .91466 .91621 .91774

1.4 .91924 .92073 .92220 .92364 .92507 .92647 .92785 .92922 .93056 .93189

1.5 .93319 .93448 .93574 .93699 .93822 .93943 .94062 .94179 .94295 .94408

1.6 .94520 .94630 .94738 .94845 .94950 .95053 .95154 .95254 .95352 .95449

1.7 .95543 .95637 .95728 .95818 .95907 .95994 .96080 .96164 .96246 .96327

1.8 .96407 .96485 .96562 .96638 .96712 .96784 .96856 .96926 .96995 .97062

1.9 .97128 .97193 .97257 .97320 .97381 .97441 .97500 .97558 .97615 .97670

2.0 .97725 .97778 .97831 .97882 .97932 .97982 .98030 .98077 .98124 .98169

2.1 .98214 .98257 .98300 .98341 .98382 .98422 .98461 .98500 .98537 .98574

2.2 .98610 .98645 .98679 .98713 .98745 .98778 .98809 .98840 .98870 .98899

2.3 .98928 .98956 .98983 .99010 .99036 .99061 .99086 .99111 .99134 .99158

2.4 .99180 .99202 .99224 .99245 .99266 .99286 .99305 .99324 .99343 .99361

2.5 .99379 .99396 .99413 .99430 .99446 .99461 .99477 .99492 .99506 .99520

2.6 .99534 .99547 .99560 .99573 .99585 .99598 .99609 .99621 .99632 .99643

2.7 .99653 .99664 .99674 .99683 .99693 .99702 .99711 .99720 .99728 .99736

2.8 .99744 .99752 .99760 .99767 .99774 .99781 .99788 .99795 .99801 .99807

2.9 .99813 .99819 .99825 .99831 .99836 .99841 .99846 .99851 .99856 .99861

3.0 .99865 .99869 .99874 .99878 .99882 .99886 .99889 .99893 .99896 .99900

3.1 .99903 .99906 .99910 .99913 .99916 .99918 .99921 .99924 .99926 .99929

3.2 .99931 .99934 .99936 .99938 .99940 .99942 .99944 .99946 .99948 .99950

3.3 .99952 .99953 .99955 .99957 .99958 .99960 .99961 .99962 .99964 .99965

3.4 .99966 .99968 .99969 .99970 .99971 .99972 .99973 .99974 .99975 .99976

3.5 .99977 .99978 .99978 .99979 .99980 .99981 .99981 .99982 .99983 .99983

3.6 .99984 .99985 .99985 .99986 .99986 .99987 .99987 .99988 .99988 .99989

3.7 .99989 .99990 .99990 .99990 .99991 .99991 .99992 .99992 .99992 .99992

3.8 .99993 .99993 .99993 .99994 .99994 .99994 .99994 .99995 .99995 .99995

3.9 .99995 .99995 .99996 .99996 .99996 .99996 .99996 .99996 .99997 .99997

Source: Based on Richard I. Levin and Charles A. Kirkpatrick, Quantitative Approaches to Management, 4th ed. 1978, 1975, 1971, 1965 by McGraw-Hill, Inc., © Trevor S. Hale.

M02_REND3161_13_AIE_C02.indd 42 28/10/16 10:16 AM

2.7 THE noRmAL DisTRiBUTion  43

Now let us look at the Haynes problem from another perspective. If the firm finishes this triplex in 75 days or less, it will be awarded a bonus payment of $5,000. What is the probability that Haynes will receive the bonus?

Figure 2.11 illustrates the probability we are looking for in the shaded area. The first step is again to compute the Z value:

Z = X - m

s

= 75 - 100

20

= -25 20

= -1.25

This Z value indicates that 75 days is -1.25 standard deviations to the left of the mean. But the standard normal table is structured to handle only positive Z values. To solve this problem, we observe that the curve is symmetric. The probability that Haynes will finish in 75 days or less is equivalent to the probability that it will finish in more than 125 days. A moment ago (in Fig- ure 2.10) we found the probability that Haynes will finish in less than 125 days. That value is 0.89435. So the probability it takes more than 125 days is

P1X 7 1252 = 1.0 - P1X … 1252 = 1.0 - 0.89435 = 0.10565

Thus, the probability of completing the triplex in 75 days or less is 0.10565, or about 11%. One final example: What is the probability that the triplex will take between 110 and 125

days? We see in Figure 2.12 that

P1110 6 X 6 1252 = P1X … 1252 - P1X 6 1102 That is, the shaded area in the graph can be computed by finding the probability of completing the building in 125 days or less minus the probability of completing it in 110 days or less.

P(X # 75 days) Area of interest

X 5 75 days m 5 100 days

Z 5 21.25

0.89435

FIGURE 2.11 Probability That Haynes will Receive the Bonus by Finishing in 75 Days or Less

s 5 20 days

m 5 100 days

110 days

125 days

FIGURE 2.12 Probability That Haynes will Complete in 110 to 125 Days

M02_REND3161_13_AIE_C02.indd 43 28/10/16 10:16 AM

44  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

Recall that P1X … 125 days2 is equal to 0.89435. To find P1X 6 110 days2, we follow the two steps developed earlier:

1. Z = X - m

s =

110 - 100 20

= 10

20

= 0.5 standard deviations

2. From Table 2.10, the area for Z = 0.50 is 0.69146. So the probability the triplex can be completed in less than 110 days is 0.69146. Finally,

P1110 … X … 1252 = 0.89435 - 0.69146 = 0.20289 The probability that it will take between 110 and 125 days is about 20%. Programs 2.3A and 2.3B show how Excel can be used for this.

The Empirical Rule While the probability tables for the normal distribution can provide precise probabilities, many situations require less precision. The empirical rule was derived from the normal distribution and is an easy way to remember some basic information about normal distributions. The empiri- cal rule states that for a normal distribution

approximately 68% of the values will be within {1 standard deviation of the mean approximately 95% of the values will be within {2 standard deviations of the mean almost all (about 99.7%) of the values will be within {3 standard deviations of the mean

Figure 2.13 illustrates the empirical rule. The area from point a to point b in the first drawing represents the probability, approximately 68%, that the random variable will be within {1 stan- dard deviation of the mean. The middle drawing illustrates the probability, approximately 95%, that the random variable will be within {2 standard deviations of the mean. The last drawing illustrates the probability, about 99.7%, that the random variable will be within {3 standard deviations of the mean.

2.8 The F Distribution The F distribution is a continuous probability distribution that is helpful in testing hypotheses about variances. The F distribution will be used in Chapter 4 when regression models are tested for significance. Figure 2.14 provides a graph of the F distribution. As with a graph for any con- tinuous distribution, the area underneath the curve represents probability. Note that for a large value of F, the probability is very small.

The F statistic is the ratio of two sample variances from independent normal distributions. Every F distribution has two sets of degrees of freedom associated with it. One of the degrees of freedom is associated with the numerator of the ratio, and the other is associated with the de- nominator of the ratio. The degrees of freedom are based on the sample sizes used in calculating the numerator and denominator.

PROGRAM 2.3A Excel 2016 output for the normal Distribution Example

PROGRAM 2.3B Function in an Excel 2016 spreadsheet for the normal Distribution Example

M02_REND3161_13_AIE_C02.indd 44 28/10/16 10:16 AM

2.8 THE F DisTRiBUTion  45

Appendix D provides values of F associated with the upper tail of the distribution for cer- tain probabilities (denoted by a) and degrees of freedom for the numerator 1df12 and degrees of freedom for the denominator 1df22.

To find the F value that is associated with a particular probability and degrees of freedom, refer to Appendix D. The following notation will be used:

df1 = degrees of freedom for the numerator df2 = degrees of freedom for the denominator

Consider the following example:

df1 = 5 df2 = 6

a = 0.05

16% 16%

2.5% 2.5%

68%

a m b 2 1s 1 1s

95%

a m b

22s 12s

99.7%

a m b

23s 13s

0.15% 0.15%

FIGURE 2.13 Approximate Probabilities from the Empirical Rule

Fa

FIGURE 2.14 The F Distribution

Figure 2.13 is very important, and you should comprehend the meanings of ± 1, 2, and 3 standard deviation symmetrical areas.

Managers often speak of 95% and 99% confidence intervals, which roughly refer to ± 2 and 3 standard deviation graphs.

M02_REND3161_13_AIE_C02.indd 45 28/10/16 10:16 AM

46  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

From Appendix D, we get

Fa, df1, df2 = F0.05, 5, 6 = 4.39

This means

P1F 7 4.392 = 0.05 The probability is very low (only 5%) that the F value will exceed 4.39. There is a 95% prob- ability that it will not exceed 4.39. This is illustrated in Figure 2.15. Appendix D also provides F values associated with a = 0.01. Programs 2.4A and 2.4B illustrate Excel functions for the F distribution.

2.9 The Exponential Distribution

The exponential distribution, also called the negative exponential distribution, is used in deal- ing with queuing problems. The exponential distribution often describes the time required to service a customer. The exponential distribution is a continuous distribution. Its probability function is given by

f 1X2 = me-mx (2-14) where

X = random variable (service times) m = average number of units the service facility can handle in a specific period of time e = 2.718 (the base of the natural logarithm)

F = 4.39 0.05

FIGURE 2.15 F Value for 0.05 Probability with 5 and 6 Degrees of Freedom

PROGRAM 2.4A Excel 2016 output for the F Distribution

PROGRAM 2.4B Functions in an Excel 2016 spreadsheet for the F Distribution

M02_REND3161_13_AIE_C02.indd 46 28/10/16 10:16 AM

2.9 THE ExPonEnTiAL DisTRiBUTion  47

The general shape of the exponential distribution is shown in Figure 2.16. Its expected value and variance can be shown to be

Expected value = 1 m

= Average service time (2-15)

Variance = 1

m2 (2-16)

As with any other continuous distribution, probabilities are found by determining the area under the curve. For the normal distribution, we found the area by using a table of probabilities. For the exponential distribution, the probabilities can be found using the exponent key on a calcula- tor with the formula below. The probability that an exponentially distributed time, X, required to serve a customer is less than or equal to time t is given by the formula

P1X … t2 = 1 - e-mt (2-17) The time period used in describing m determines the units for the time t. For example, if m is the average number served per hour, the time t must be given in hours. If m is the average number served per minute, the time t must be given in minutes.

Arnold’s Muffler Example Arnold’s Muffler Shop installs new mufflers on automobiles and small trucks. The mechanic can install new mufflers at a rate of about three per hour, and this service time is exponentially distributed. What is the probability that the time to install a new muffler will be 1�2 hour or less? Using Equation 2-17, we have

X = exponentially distributed service time m = average number that can be served per time period = 3 per hour t = 1�2 hour = 0.5 hour

P1X … 0.52 = 1 - e-310.52 = 1 - e-1.5 = 1 - 0.2231 = 0.7769 Figure 2.17 shows the area under the curve from 0 to 0.5 to be 0.7769. Thus, there is about a 78% chance the time will be no more than 0.5 hour and about a 22% chance that the time will be longer than this. Similarly, we could find the probability that the service time is no more 1>3 hour or 2>3 hour, as follows:

P aX … 1 3 b = 1 - e-31132 = 1 - e-1 = 1 - 0.3679 = 0.6321

P aX … 2 3 b = 1 - e-31232 = 1 - e-2 = 1 - 0.1353 = 0.8647

f(X )

X

FIGURE 2.16 Exponential Distribution

M02_REND3161_13_AIE_C02.indd 47 28/10/16 10:16 AM

48  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

While Equation 2-17 provides the probability that the time (X) is less than or equal to a particu- lar value t, the probability that the time is greater than a particular value t is found by observing that these two events are complementary. For example, to find the probability that the mechanic at Arnold’s Muffler Shop would take longer than 0.5 hour, we have

P1X 7 0.52 = 1 - P1X … 0.52 = 1 - 0.7769 = 0.2231 Programs 2.5A and 2.5B illustrate how a function in Excel can find exponential probabilities.

2.10 The Poisson Distribution

An important discrete probability distribution is the Poisson distribution.1 We examine it be- cause of its key role in complementing the exponential distribution in queuing theory in Chap- ter 12. The distribution describes situations in which customers arrive independently during a certain time interval, and the number of arrivals depends on the length of the time interval. Ex- amples are patients arriving at a health clinic, customers arriving at a bank window, passengers arriving at an airport, and telephone calls going through a central exchange.

The formula for the Poisson distribution is

P1X2 = l xe-l

X! (2-18)

FIGURE 2.17 Probability That the mechanic will install a muffler in 0.5 Hour

PROGRAM 2.5B Function in an Excel 2016 spreadsheet for the Exponential Distribution

0 0

0.5

1

1.5

0.7769

P(service time # 0.5) 5 0.7769

2

2.5

0.5 1 1.5 2 2.5

PROGRAM 2.5A Excel 2016 output for the Exponential Distribution

The Poisson probability distribution is used in many queuing models to represent arrival patterns.

1This distribution, derived by Siméon Denis Poisson in 1837, is pronounced “pwah-sahn.”

M02_REND3161_13_AIE_C02.indd 48 28/10/16 10:16 AM

2.10 THE Poisson DisTRiBUTion  49

where

P1X2 = probability of exactly X arrivals or occurrences l = average number of arrivals per unit of time (the mean arrival rate), pronounced “lambda”

e = 2.718, the base of the natural logarithm X = number of occurrences 10, 1, 2, c2

The mean and variance of the Poisson distribution are equal and are computed simply as

Expected value = l (2-19)

Variance = l (2-20)

With the help of the table in Appendix C, the values of e-l are easy to find. We can use these in the formula to find probabilities. For example, if l = 2, from Appendix C we find e-2 = 0.1353. The Poisson probabilities that X is 0, 1, and 2 when l = 2 are as follows:

P1X2 = e -llx

X!

P102 = e -220

0! =

10.135321 1

= 0.1353 ≈ 14%

P112 = e -221

1! =

e-22

1 =

0.1353122 1

= 0.2706 ≈ 27%

P122 = e -222

2! =

e-24

2112 = 0.1353142

2 = 0.2706 ≈ 27%

These probabilities, as well as others for l = 2 and l = 4, are shown in Figure 2.18. No- tice that the chances that 9 or more customers will arrive in a particular time period are virtually nil. Programs 2.6A and 2.6B illustrate how Excel can be used to find Poisson probabilities.

It should be noted that the exponential and Poisson distributions are related. If the number of occurrences per time period follows a Poisson distribution, then the time between occurrences follows an exponential distribution. For example, if the number of phone calls arriving at a cus- tomer service center followed a Poisson distribution with a mean of 10 calls per hour, the time between each phone call would be exponentially distributed with a mean time between calls of 1>10 hour (6 minutes).

0.30

0.25

0.20

0.15

0.10

0.05

0.00 0 1 2 3 4 5

X

l 5 2 Distribution l 5 4 Distribution

P ro

ba bi

lit y

6 7 8 9

0.25

0.20

0.15

0.10

0.05

0.00 0 1 2 3 4 5

X

P ro

ba bi

lit y

6 7 8 9

FIGURE 2.18 sample Poisson Distributions with l = 2 and l = 4

M02_REND3161_13_AIE_C02.indd 49 28/10/16 10:17 AM

50  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

PROGRAM 2.6A Excel 2016 output for the Poisson Distribution

PROGRAM 2.6B Functions in an Excel 2016 spreadsheet for the Poisson Distribution

This chapter presents the fundamental concepts of probability and probability distributions. Probability values can be ob- tained objectively or subjectively. A single probability value must be between 0 and 1, and the sum of all probability val- ues for all possible outcomes must be equal to 1. In addition, probability values and events can have a number of properties. These properties include mutually exclusive, collectively ex- haustive, statistically independent, and statistically dependent events. Rules for computing probability values depend on these fundamental properties. It is also possible to revise probability values when new information becomes available. This can be done using Bayes’ Theorem.

We also covered the topics of random variables, discrete probability distributions (such as Poisson and binomial), and continuous probability distributions (such as normal, F, and exponential). A probability distribution is any statement of a probability function having a set of collectively exhaustive and mutually exclusive events. All probability distributions follow the basic probability rules mentioned previously.

The topics presented here will be very important in many of the chapters to come. Basic probability concepts and distri- butions are used for decision theory, inventory control, Markov analysis, project management, simulation, and statistical qual- ity control.

Summary

Glossary

Bayes’ Theorem A formula that is used to revise probabili- ties based on new information.

Bernoulli Process A process with two outcomes in each of a series of independent trials in which the probabilities of the outcomes do not change.

Binomial Distribution A discrete distribution that describes the number of successes in independent trials of a Bernoulli process.

Classical or Logical Method An objective way of assessing probabilities based on logic.

Collectively Exhaustive Events A collection of all possible outcomes of an experiment.

Conditional Probability The probability of one event occur- ring given that another has taken place.

Continuous Probability Distribution A probability distri- bution with a continuous random variable.

Continuous Random Variable A random variable that can assume an infinite or unlimited set of values.

Discrete Probability Distribution A probability distribution with a discrete random variable.

Discrete Random Variable A random variable that can only assume a finite or limited set of values.

Expected Value The (weighted) average of a probability distribution.

F Distribution A continuous probability distribution that is the ratio of the variances of samples from two independent normal distributions.

Independent Events The situation in which the occurrence of one event has no effect on the probability of occurrence of a second event.

Intersection The set of all outcomes that are common to both events.

Joint Probability The probability of events occurring to- gether (or one after the other).

Mutually Exclusive Events A situation in which only one of two or more events can occur on any given trial or experiment.

Negative Exponential Distribution A continuous probabil- ity distribution that describes the time between customer arrivals in a queuing situation.

M02_REND3161_13_AIE_C02.indd 50 28/10/16 10:17 AM

Normal Distribution A continuous bell-shaped distribution that is a function of two parameters, the mean and standard deviation of the distribution.

Objective Approach A method of determining probability values based on historical data or logic.

Poisson Distribution A discrete probability distribution used in queuing theory.

Prior Probability A probability value determined before new or additional information is obtained. It is sometimes called an a priori probability estimate.

Probability A statement about the likelihood of an event oc- curring. It is expressed as a numerical value between 0 and 1, inclusive.

Probability Density Function The mathematical function that describes a continuous probability distribution. It is represented by f(X).

Probability Distribution The set of all possible values of a random variable and their associated probabilities.

Random Variable A variable that assigns a number to every possible outcome of an experiment.

Relative Frequency Approach An objective way of deter- mining probabilities based on observing frequencies over a number of trials.

Revised or Posterior Probability A probability value that re- sults from new or revised information and prior probabilities.

Standard Deviation The square root of the variance. Subjective Approach A method of determining probability

values based on experience or judgment. Union The set of all outcomes that are contained in either of

these two events. Variance A measure of dispersion or spread of the probabil-

ity distribution.

Key Equations

(2-1) 0 … P1event2 … 1 A basic statement of probability.

(2-2) P1A or B2 = P1A2 + P1B2 - P1A and B2 Probability of the union of two events.

(2-3) P1A �B2 = P1AB2 P1B2

Conditional probability.

(2-4) P1AB2 = P1A �B2P1B2 Probability of the intersection of two events.

(2-5) P1A �B2 = P1B �A2P1A2 P1B �A2P1A2 + P1B �A′2P1A′2

Bayes’ Theorem in general form.

(2-6) E1X2 = a n

i=1 XiP1Xi2

An equation that computes the expected value (mean) of a discrete probability distribution.

(2-7) s2 = Variance = a n

i=1 3Xi - E1X242P1Xi2

An equation that computes the variance of a discrete probability distribution.

(2-8) s = 1Variance = 2s2 An equation that computes the standard deviation from the variance.

(2-9) Probability of r successes in n trials = n!

r!1n - r2! p rqn - r

A formula that computes probabilities for the binomial probability distribution.

(2-10) Expected value 1mean2 = np The expected value of the binomial distribution.

(2-11) Variance = np11 - p2 The variance of the binomial distribution.

(2-12) f 1X2 = 1 s12p e - 1x -m222s2

The density function for the normal probability distribution.

(2-13) Z = X - m

s

An equation that computes the number of standard deviations, Z, the point X is from the mean m.

(2-14) f 1X ) = me-mx

The exponential distribution.

(2-15) Expected value = 1 m

The expected value of an exponential distribution.

(2-16) Variance = 1

m2

The variance of an exponential distribution.

(2-17) P1X … t2 = 1 - e-mt

Formula to find the probability that an exponential ran- dom variable, X, is less than or equal to time t.

(2-18) P1X2 = l xe-l

X!

The Poisson distribution.

(2-19) Expected value = l

The mean of a Poisson distribution.

(2-20) Variance = l

The variance of a Poisson distribution.

KEy EQUATions  51

M02_REND3161_13_AIE_C02.indd 51 28/10/16 10:17 AM

52  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

Solved Problems

Solved Problem 2-1 In the past 30 days, Roger’s Rural Roundup has sold 8, 9, 10, or 11 lottery tickets. It never sold fewer than 8 or more than 11. Assuming that the past is similar to the future, find the probabilities for the number of tickets sold if sales were 8 tickets on 10 days, 9 tickets on 12 days, 10 tickets on 6 days, and 11 tickets on 2 days.

Solution

SALES NO. DAYS PROBABILITY

8 10 0.333

9 12 0.400

10 6 0.200

11 2 0.067

Total 30 1.000

Solved Problem 2-2 A class contains 30 students. Ten are female (F) and U.S. citizens (U); 12 are male (M) and U.S. citizens; 6 are female and non-U.S. citizens (N); 2 are male and non-U.S. citizens.

A name is randomly selected from the class roster, and it is female. What is the probability that the student is a U.S. citizen?

Solution

P1FU2 = 10>30 = 0.333 P1FN2 = 6>30 = 0.200

P1MU2 = 12>30 = 0.400 P1MN2 = 2>30 = 0.067

P1F2 = P1FU2 + P1FN2 = 0.333 + 0.200 = 0.533 P1M2 = P1MU2 + P1MN2 = 0.400 + 0.067 = 0.467 P1U2 = P1FU2 + P1MU2 = 0.333 + 0.400 = 0.733 P1N2 = P1FN2 + P1MN2 = 0.200 + 0.067 = 0.267

P1U �F2 = P1FU2 P1F2 =

0.333

0.533 = 0.625

Solved Problem 2-3 Your professor tells you that if you score an 85 or better on your midterm exam, then you have a 90% chance of getting an A for the course. You think you have only a 50% chance of scoring 85 or better. Find the probability that both your score is 85 or better and you receive an A in the course.

Solution P1A and 852 = P1A � 852 * P1852 = 10.90210.502

= 45%

Solved Problem 2-4 A statistics class was asked if it believed that all tests on the Monday following the football game win over their archrival should be postponed automatically. The results were as follows:

M02_REND3161_13_AIE_C02.indd 52 28/10/16 10:17 AM

soLVED PRoBLEms  53

Strongly agree 40

Agree 30

Neutral 20

Disagree 10

Strongly disagree 0

100

Transform this into a numeric score, using the following random variable scale, and find a prob- ability distribution for the results:

Strongly agree 5

Agree 4

Neutral 3

Disagree 2

Strongly disagree 1

Solution

OUTCOME PROBABILITY, P (X)

Strongly agree (5) 0.4 = 40>100 Agree (4) 0.3 = 30>100 Neutral (3) 0.2 = 20>100 Disagree (2) 0.1 = 10>100 Strongly disagree (1) 0.0 = 0>100 Total 1.0 = 100>100

Solved Problem 2-5 For Solved Problem 2-4, let X be the numeric score. Compute the expected value of X.

Solution

E1X2 = a 5

i=1 XiP1Xi2 = X1P1X12 + X2P1X22

+ X3P1X32 + X4P1X42 + X5P1X52 = 510.42 + 410.32 + 310.22 + 210.12 + 1102 = 4.0

Solved Problem 2-6 Compute the variance and standard deviation for the random variable X in Solved Problems 2-4 and 2-5.

Solution

Variance = a 5

i=1 1Xi - E1X222P1Xi2

= 15 - 42210.42 + 14 - 42210.32 + 13 - 42210.22 + 12 - 42210.12 + 11 - 42210.02 = 112210.42 + 102210.32 + 1-12210.22 + 1-22210.12 + 1-32210.02 = 0.4 + 0.0 + 0.2 + 0.4 + 0.0 = 1.0

The standard deviation is

s = 1Variance = 11 = 1 M02_REND3161_13_AIE_C02.indd 53 28/10/16 10:17 AM

Solved Problem 2-7 A candidate for public office has claimed that 60% of voters will vote for her. If 5 registered voters were sampled, what is the probability that exactly 3 would say they favor this candidate?

Solution We use the binomial distribution with n = 5, p = 0.6, and r = 3:

P1exactly 3 successes in 5 trials2 = n! r!1n - r2! p

rqn - r = 5!

3!15 - 32!10.62 310.425 - 3 = 0.3456

Solved Problem 2-8 The length of the rods coming out of our new cutting machine can be said to approximate a normal distribution with a mean of 10 inches and a standard deviation of 0.2 inch. Find the probability that a rod selected randomly will have a length

(a) of less than 10.0 inches. (b) between 10.0 and 10.4 inches. (c) between 10.0 and 10.1 inches. (d) between 10.1 and 10.4 inches. (e) between 9.6 and 9.9 inches. (f) between 9.9 and 10.4 inches. (g) between 9.886 and 10.406 inches.

Solution First, compute the standard normal distribution, the Z value:

Z = X - m

s

Next, find the area under the curve for the given Z value by using a standard normal distribution table.

(a) P1X 6 10.02 = 0.50000 (b) P110.0 6 X 6 10.42 = 0.97725 - 0.50000 = 0.47725 (c) P110.0 6 X 6 10.12 = 0.69146 - 0.50000 = 0.19146 (d) P110.1 6 X 6 10.42 = 0.97725 - 0.69146 = 0.28579 (e) P19.6 6 X 6 9.92 = 0.97725 - 0.69146 = 0.28579 (f) P19.9 6 X 6 10.42 = 0.19146 + 0.47725 = 0.66871 (g) P19.886 6 X 6 10.4062 = 0.47882 + 0.21566 = 0.69448

54  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

Self-Test

●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the glossary at the end of the chapter.

●● Use the key at the back of the book (see Appendix H) to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. If only one event may occur on any one trial, then the events are said to be a. independent. b. exhaustive. c. mutually exclusive. d. continuous.

2. New probabilities that have been found using Bayes’ Theorem are called a. prior probabilities. b. posterior probabilities. c. Bayesian probabilities. d. joint probabilities.

3. A measure of central tendency is a. expected value. b. variance. c. standard deviation. d. all of the above.

4. To compute the variance of a discrete random variable, you need to know a. the variable’s possible values. b. the expected value of the variable. c. the probability of each possible value of the

variable. d. all of the above.

M02_REND3161_13_AIE_C02.indd 54 28/10/16 10:17 AM

DisCUssion QUEsTions AnD PRoBLEms  55

5. The square root of the variance is a. the expected value. b. the standard deviation. c. the area under the normal curve. d. all of the above.

6. Which of the following is an example of a discrete distribution? a. the normal distribution b. the exponential distribution c. the Poisson distribution d. the Z distribution

7. The total area under the curve for any continuous distribution must equal a. 1. b. 0. c. 0.5. d. none of the above.

8. Probabilities for all the possible values of a discrete random variable a. may be greater than 1. b. may be negative on some occasions. c. must sum to 1. d. are represented by the area underneath the curve.

9. In a standard normal distribution, the mean is equal to a. 1. b. 0. c. the variance. d. the standard deviation.

10. The probability of two or more independent events occurring is a. the marginal probability. b. the simple probability. c. the conditional probability. d. the joint probability. e. all of the above.

11. In the normal distribution, 95.45% of the population lies within a. 1 standard deviation of the mean. b. 2 standard deviations of the mean. c. 3 standard deviations of the mean. d. 4 standard deviations of the mean.

12. If a normal distribution has a mean of 200 and a standard deviation of 10, 99.7% of the population falls within what range of values? a. 170–230 b. 180–220 c. 190–210 d. 175–225 e. 170–220

13. If two events are mutually exclusive, then the probability of the intersection of these two events a. is 0. b. is 0.5. c. is 1.0. d. cannot be determined without more information.

14. If P1A2 = 0.4 and P1B2 = 0.5 and P1A and B2 = 0.2, then P1B �A2 = a. 0.80. b. 0.50. c. 0.10. d. 0.40. e. none of the above.

15. If P1A2 = 0.4 and P1B2 = 0.5 and P1A and B2 = 0.2, then P1A or B2 = a. 0.7. b. 0.9. c. 1.1. d. 0.2. e. none of the above.

Discussion Questions and Problems

Discussion Questions 2-1 What are the two basic laws of probability? 2-2 What is the meaning of mutually exclusive events?

What is meant by collectively exhaustive? Give an example of each.

2-3 Describe the various approaches used in determining probability values.

2-4 Why is the probability of the intersection of two events subtracted in the sum of the probability of two events?

2-5 Describe what it means for two events to be independent.

2-6 What is Bayes’ Theorem, and when can it be used? 2-7 Describe the characteristics of a Bernoulli process.

How is a Bernoulli process associated with the bino- mial distribution?

2-8 What is a random variable? What are the various types of random variables?

2-9 What is the difference between a discrete probability distribution and a continuous probability distribu- tion? Give your own example of each.

2-10 What is the expected value, and what does it mea- sure? How is it computed for a discrete probability distribution?

2-11 What is the variance, and what does it measure? How is it computed for a discrete probability distribution?

2-12 Name three business processes that can be described by the normal distribution.

2-13 A card is drawn from a standard deck of playing cards. For each of the following pairs of events, in- dicate if the events are mutually exclusive, and indi- cate if the events are exhaustive.

(a) Draw a spade and draw a club. (b) Draw a face card and draw a number card. (c) Draw an ace and draw a three. (d) Draw a red card and draw a black card.

M02_REND3161_13_AIE_C02.indd 55 28/10/16 10:17 AM

56  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

(e) Draw a five and draw a diamond. (f) Draw a red card and draw a diamond.

Problems 2-14 A student taking Management Science 301 at East

Haven University will receive one of the five pos- sible grades for the course: A, B, C, D, or F. The distribution of grades over the past 2 years is as follows:

GRADE NUMBER OF STUDENTS

A 80

B 75

C 90

D 30

F 25

Total 300

If this past distribution is a good indicator of future grades, what is the probability of a student receiving a C in the course?

2-15 A silver dollar is flipped twice. Calculate the prob- ability of each of the following occurring:

(a) a head on the first flip (b) a tail on the second flip given that the first toss

was a head (c) two tails (d) a tail on the first and a head on the second (e) a tail on the first and a head on the second or a

head on the first and a tail on the second (f) at least one head on the two flips

2-16 An urn contains 8 red chips, 10 green chips, and 2 white chips. A chip is drawn and replaced, and then a second chip drawn. What is the probability of

(a) a white chip on the first draw? (b) a white chip on the first draw and a red on the

second? (c) two green chips being drawn? (d) a red chip on the second given that a white chip

was drawn on the first?

2-17 Evertight, a leading manufacturer of quality nails, produces 1-, 2-, 3-, 4-, and 5-inch nails for various uses. In the production process, if there is an over- run or the nails are slightly defective, they are placed in a common bin. Yesterday, 651 of the 1-inch nails, 243 of the 2-inch nails, 41 of the 3-inch nails, 451 of the 4-inch nails, and 333 of the 5-inch nails were placed in the bin.

(a) What is the probability of reaching into the bin and getting a 4-inch nail?

(b) What is the probability of getting a 5-inch nail?

(c) If a particular application requires a nail that is 3 inches or shorter, what is the probability of get- ting a nail that will satisfy the requirements of the application?

2-18 Last year, at Northern Manufacturing Company, 200 people had colds during the year. One hundred fifty- five people who did no exercising had colds, and the remainder of the people with colds were involved in a weekly exercise program. Half of the 1,000 em- ployees were involved in some type of exercise.

(a) What is the probability that an employee will have a cold next year?

(b) Given that an employee is involved in an exer- cise program, what is the probability that he or she will get a cold next year?

(c) What is the probability that an employee who is not involved in an exercise program will get a cold next year?

(d) Are exercising and getting a cold independent events? Explain your answer.

2-19 The Springfield Kings, a professional basketball team, has won 12 of its last 20 games and is expected to con- tinue winning at the same percentage rate. The team’s ticket manager is anxious to attract a large crowd to tomorrow’s game but believes that depends on how well the Kings perform tonight against the Galveston Comets. He assesses the probability of drawing a large crowd to be 0.90 should the team win tonight. What is the probability that the team wins tonight and that there will be a large crowd at tomorrow’s game?

2-20 David Mashley teaches two undergraduate statistics courses at Kansas College. The class for Statistics 201 consists of 7 sophomores and 3 juniors. The more advanced course, Statistics 301, has 2 sopho- mores and 8 juniors enrolled. As an example of a business sampling technique, Professor Mashley ran- domly selects, from the stack of Statistics 201 regis- tration cards, the class card of one student and then places that card back in the stack. If that student was a sophomore, Mashley draws another card from the Statistics 201 stack; if not, he randomly draws a card from the Statistics 301 group. Are these two draws independent events? What is the probability of

(a) a junior’s name on the first draw? (b) a junior’s name on the second draw given that a

sophomore’s name was drawn first? (c) a junior’s name on the second draw given that a

junior’s name was drawn first? (d) a sophomore’s name on both draws? (e) a junior’s name on both draws? (f) one sophomore’s name and one junior’s name on

the two draws, regardless of order drawn?

2-21 The oasis outpost of Abu Ilan, in the heart of the Negev desert, has a population of 20 Bedouin

Note: means the problem may be solved with QM for Windows; means the problem may be solved with

Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M02_REND3161_13_AIE_C02.indd 56 28/10/16 10:17 AM

DisCUssion QUEsTions AnD PRoBLEms  57

tribesmen and 20 Farima tribesmen. El Kamin, a nearby oasis, has a population of 32 Bedouins and 8 Farima. A lost Israeli soldier, accidentally sepa- rated from his army unit, is wandering through the desert and arrives at the edge of one of the oases. The soldier has no idea which oasis he has found, but the first person he spots at a distance is a Bed- ouin. What is the probability that he has wandered into Abu Ilan? What is the probability that he is in El Kamin?

2-22 The lost Israeli soldier mentioned in Problem 2-21 decides to rest for a few minutes before en- tering the desert oasis he has just found. Closing his eyes, he dozes off for 15 minutes, wakes, and walks toward the center of the oasis. The first per- son he spots this time he again recognizes as a Bedouin. What is the posterior probability that he is in El Kamin?

2-23 Ace Machine Works estimates that the probability its lathe tool is properly adjusted is 0.8. When the lathe is properly adjusted, there is a 0.9 probability that the parts produced pass inspection. If the lathe is out of adjustment, however, the probability of a good part being produced is only 0.2. A part randomly chosen is inspected and found to be acceptable. At this point, what is the posterior probability that the lathe tool is properly adjusted?

2-24 The Boston South Fifth Street Softball League consists of three teams: Mama’s Boys, team 1; the Killers, team 2; and the Machos, team 3. Each team plays the other teams just once during the sea- son. The win–loss record for the past 5 years is as follows:

WINNER (1) (2) (3)

Mama’s Boys (1) X 3 4

The Killers (2) 2 X 1

The Machos (3) 1 4 X

Each row represents the number of wins over the past 5 years. Mama’s Boys beat the Killers 3 times, beat the Machos 4 times, and so on.

(a) What is the probability that the Killers will win every game next year?

(b) What is the probability that the Machos will win at least one game next year?

(c) What is the probability that Mama’s Boys will win exactly one game next year?

(d) What is the probability that the Killers will win fewer than two games next year?

2-25 The schedule for the Killers next year is as follows (refer to Problem 2-24):

Game 1: The Machos Game 2: Mama’s Boys

(a) What is the probability that the Killers will win their first game?

(b) What is the probability that the Killers will win their last game?

(c) What is the probability that the Killers will break even—win exactly one game?

(d) What is the probability that the Killers will win every game?

(e) What is the probability that the Killers will lose every game?

(f) Would you want to be the coach of the Killers?

2-26 The Northside rif le team has two markspersons, Dick and Sally. Dick hits a bull’s-eye 90% of the time, and Sally hits a bull’s-eye 95% of the time.

(a) What is the probability that either Dick or Sally or both will hit the bull’s-eye if each takes one shot?

(b) What is the probability that Dick and Sally will both hit the bull’s-eye?

(c) Did you make any assumptions in answering the preceding questions? If you answered yes, do you think that you are justified in making the assumption(s)?

2-27 In a sample of 1,000 representing a survey from the entire population, 650 people were from Laketown, and the rest of the people were from River City. Out of the sample, 19 people had some form of cancer. Thirteen of these people were from Laketown.

(a) Are the events of living in Laketown and having some sort of cancer independent?

(b) Which city would you prefer to live in, assum- ing that your main objective was to avoid having cancer?

2-28 Compute the probability of “loaded die given that a 3 was rolled,” as shown in the example in Section 2.3, this time using the general form of Bayes’ Theorem from Equation 2-5.

2-29 Which of the following are probability distributions? Why?

(a)

RANDOM VARIABLE X PROBABILITY

2 0.1

-1 0.2 0 0.3

1 0.25

2 0.15

(b)

RANDOM VARIABLE Y PROBABILITY

1 1.1

1.5 0.2

2 0.3

2.5 0.25

3 -1.25

M02_REND3161_13_AIE_C02.indd 57 28/10/16 10:17 AM

58  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

(c)

RANDOM VARIABLE Z PROBABILITY

1 0.1

2 0.2

3 0.3

4 0.4

5 0.0

2-30 Harrington Health Food stocks 5 loaves of Neutro- Bread. The probability distribution for the sales of Neutro-Bread is listed in the following table. How many loaves will Harrington sell on average?

NUMBER OF LOAVES SOLD PROBABILITY

0 0.05

1 0.15

2 0.20

3 0.25

4 0.20

5 0.15

2-31 What are the expected value and variance of the fol- lowing probability distribution?

RANDOM VARIABLE X PROBABILITY

1 0.05

2 0.05

3 0.10

4 0.10

5 0.15

6 0.15

7 0.25

8 0.15

2-32 There are 10 questions on a true–false test. A student feels unprepared for this test and randomly guesses the answer for each of these.

(a) What is the probability that the student gets exactly 7 correct?

(b) What is the probability that the student gets exactly 8 correct?

(c) What is the probability that the student gets exactly 9 correct?

(d) What is the probability that the student gets exactly 10 correct?

(e) What is the probability that the student gets more than 6 correct?

2-33 Gary Schwartz is the top salesman for his company. Records indicate that he makes a sale on 70% of his sales calls. If he calls on four potential clients, what is the probability that he makes exactly 3 sales? What is the probability that he makes exactly 4 sales?

2-34 If 10% of all disk drives produced on an assembly line are defective, what is the probability that there will be exactly one defect in a random sample of 5

of these? What is the probability that there will be no defects in a random sample of 5?

2-35 Trowbridge Manufacturing produces cases for per- sonal computers and other electronic equipment. The quality control inspector for this company be- lieves that a particular process is out of control. Nor- mally, only 5% of all cases are deemed defective due to discolorations. If 6 such cases are sampled, what is the probability that there will be 0 defective cases if the process is operating correctly? What is the probability that there will be exactly 1 defective case?

2-36 Refer to the Trowbridge Manufacturing example in Problem 2-35. The quality control inspection pro- cedure is to select 6 items, and if there are 0 or 1 defective cases in the group of 6, the process is said to be in control. If the number of defects is more than 1, the process is out of control. Suppose that the true proportion of defective items is 0.15. What is the probability that there will be 0 or 1 defects in a sample of 6 if the true proportion of defects is 0.15?

2-37 An industrial oven used to cure sand cores for a fac- tory manufacturing engine blocks for small cars is able to maintain fairly constant temperatures. The temperature range of the oven follows a normal dis- tribution with a mean of 450°F and a standard devia- tion of 25°F. Leslie Larsen, president of the factory, is concerned about the large number of defective cores that have been produced in the past several months. If the oven gets hotter than 475°F, the core is defective. What is the probability that the oven will cause a core to be defective? What is the prob- ability that the temperature of the oven will range from 460° to 470°F?

2-38 Steve Goodman, production foreman for the Florida Gold Fruit Company, estimates that the average sale of oranges is 4,700 and the standard deviation is 500 oranges. Sales follow a normal distribution.

(a) What is the probability that sales will be greater than 5,500 oranges?

(b) What is the probability that sales will be greater than 4,500 oranges?

(c) What is the probability that sales will be less than 4,900 oranges?

(d) What is the probability that sales will be less than 4,300 oranges?

2-39 Susan Williams has been the production manager of Medical Suppliers, Inc., for the past 17 years. Medi- cal Suppliers, Inc., is a producer of bandages and arm slings. During the past 5 years, the demand for No-Stick bandages has been fairly constant. On aver- age, sales have been about 87,000 packages of No- Stick. Susan has reason to believe that the distribution of No-Stick follows a normal curve, with a standard de- viation of 4,000 packages. What is the probability that sales will be less than 81,000 packages?

M02_REND3161_13_AIE_C02.indd 58 28/10/16 10:17 AM

DisCUssion QUEsTions AnD PRoBLEms  59

2-40 Armstrong Faber produces a standard number-two pencil called Ultra-Lite. Since Chuck Armstrong started Armstrong Faber, sales have grown steadily. With the increase in the price of wood products, however, Chuck has been forced to increase the price of the Ultra-Lite pencils. As a result, the demand for Ultra-Lite has been fairly stable over the past 6 years. On average, Armstrong Faber has sold 457,000 pencils each year. Furthermore, 90% of the time sales have been between 454,000 and 460,000 pencils. It is expected that the sales follow a normal distribution with a mean of 457,000 pencils. Estimate the standard deviation of this distribution. (Hint: Work backward from the normal table to find Z. Then apply Equation 2-13.)

2-41 The time to complete a construction project is nor- mally distributed with a mean of 60 weeks and a standard deviation of 4 weeks.

(a) What is the probability the project will be fin- ished in 62 weeks or less?

(b) What is the probability the project will be fin- ished in 66 weeks or less?

(c) What is the probability the project will take lon- ger than 65 weeks?

2-42 A new integrated computer system is to be installed worldwide for a major corporation. Bids on this project are being solicited, and the contract will be awarded to one of the bidders. As a part of the pro- posal for this project, bidders must specify how long the project will take. There will be a significant pen- alty for finishing late. One potential contractor de- termines that the average time to complete a project of this type is 40 weeks with a standard deviation of 5 weeks. The time required to complete this project is assumed to be normally distributed.

(a) If the due date of this project is set at 40 weeks, what is the probability that the contractor will have to pay a penalty (i.e., the project will not be finished on schedule)?

(b) If the due date of this project is set at 43 weeks, what is the probability that the contractor will have to pay a penalty (i.e., the project will not be finished on schedule)?

(c) If the bidder wishes to set the due date in the pro- posal so that there is only a 5% chance of being late (and consequently only a 5% chance of having to pay a penalty), what due date should be set?

2-43 Patients arrive at the emergency room of Costa Val- ley Hospital at an average of 5 per day. The demand for emergency room treatment at Costa Valley fol- lows a Poisson distribution.

(a) Using Appendix C, compute the probability of exactly 0, 1, 2, 3, 4, and 5 arrivals per day.

(b) What is the sum of these probabilities, and why is the number less than 1?

2-44 Using the data in Problem 2-43, determine the prob- ability of more than 3 visits for emergency room ser- vice on any given day.

2-45 Cars arrive at Carla’s Muffler Shop for repair work at an average of 3 per hour, following an exponential distribution.

(a) What is the expected time between arrivals? (b) What is the variance of the time between

arrivals?

2-46 A particular test for the presence of steroids is to be used after a professional track meet. If steroids are present, the test will accurately indicate this 95% of the time. However, if steroids are not present, the test will indicate this 90% of the time (so it is wrong 10% of the time and predicts the presence of steroids). Based on past data, it is believed that 2% of the ath- letes do use steroids. This test is administered to one athlete, and the test is positive for steroids. What is the probability that this person actually used steroids?

2-47 Market Researchers, Inc., has been hired to perform a study to determine if the market for a new product will be good or poor. In similar studies performed in the past, whenever the market actually was good, the market research study indicated that it would be good 85% of the time. On the other hand, when- ever the market actually was poor, the market study incorrectly predicted it would be good 20% of the time. Before the study is performed, it is believed there is a 70% chance the market will be good. When Market Researchers, Inc., performs the study for this product, the results predict the market will be good. Given the results of this study, what is the probability that the market actually will be good?

2-48 Policy Pollsters is a market research firm specializ- ing in political polls. Records indicate in past elec- tions, when a candidate was elected, Policy Pollsters had accurately predicted this 80% of the time and was wrong 20% of the time. Records also show, for losing candidates, Policy Pollsters accurately pre- dicted they would lose 90% of the time and was wrong only 10% of the time. Before the poll is taken, there is a 50% chance of winning the election. If Policy Pollsters predicts a candidate will win the election, what is the probability that the candidate will actually win? If Policy Pollsters predicts that a candidate will lose the election, what is the probabil- ity that the candidate will actually lose?

2-49 Burger City is a large chain of fast-food restaurants specializing in gourmet hamburgers. A mathe- matical model is now used to predict the success of new restaurants based on location and demo- graphic information for that area. In the past, 70% of all restaurants that were opened were success- ful. The mathematical model has been tested in the existing restaurants to determine how effective it is. For the restaurants that were successful, 90%

M02_REND3161_13_AIE_C02.indd 59 28/10/16 10:17 AM

60  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

of the time the model predicted they would be, while 10% of the time the model predicted a fail- ure. For the restaurants that were not successful, when the mathematical model was applied, 20% of the time it incorrectly predicted a successful restaurant, while 80% of the time it was accurate and predicted an unsuccessful restaurant. If the model is used on a new location and predicts the restaurant will be successful, what is the probabil- ity that it actually is successful?

2-50 A mortgage lender attempted to increase its business by marketing its subprime mortgage. This mort- gage is designed for people with a less-than-perfect credit rating, and the interest rate is higher to offset the extra risk. In the past year, 20% of these mort- gages resulted in foreclosure as customers defaulted on their loans. A new screening system has been de- veloped to determine whether to approve customers for the subprime loans. When the system is applied to a credit application, the system will classify the application as “Approve for loan” or “Reject for loan.” When this new system was applied to recent customers who had defaulted on their loans, 90% of these customers were classified as “Reject.” When this same system was applied to recent loan custom- ers who had not defaulted on their loan payments, 70% of these customers were classified as “Approve for loan.”

(a) If a customer did not default on a loan, what is the probability that the rating system would have classified the applicant in the reject category?

(b) If the rating system had classified the applicant in the reject category, what is the probability that the customer would not default on a loan?

2-51 Use the F table in Appendix D to find the value of F for the upper 5% of the F distribution with

(a) df1 = 5, df2 = 10 (b) df1 = 8, df2 = 7 (c) df1 = 3, df2 = 5 (d) df1 = 10, df2 = 4

2-52 Use the F table in Appendix D to find the value of F for the upper 1% of the F distribution with

(a) df1 = 15, df2 = 6 (b) df1 = 12, df2 = 8 (c) df1 = 3, df2 = 5 (d) df1 = 9, df2 = 7

2-53 For each of the following F values, determine whether the probability indicated is greater than or less than 5%:

(a) P1F3,4 7 6.82 (b) P1F7,3 7 3.62 (c) P1F20,20 7 2.62 (d) P1F7,5 7 5.12 (e) P1F7,5 6 5.12

2-54 For each of the following F values, determine whether the probability indicated is greater than or less than 1%:

(a) P1F5,4 7 142 (b) P1F6,3 7 302 (c) P1F10,12 7 4.22 (d) P1F2,3 7 352 (e) P1F2,3 6 352

2-55 Nite Time Inn has a toll-free telephone number so that customers can call at any time to make a reser- vation. A typical call takes about 4 minutes to com- plete, and the time required follows an exponential distribution. Find the probability that a call takes

(a) 3 minutes or less. (b) 4 minutes or less. (c) 5 minutes or less. (d) longer than 5 minutes.

2-56 During normal business hours on the east coast, calls to the toll-free reservation number of the Nite Time Inn arrive at a rate of 5 per minute. It has been de- termined that the number of calls per minute can be described by the Poisson distribution. Find the prob- ability that in the next minute, the number of calls arriving will be

(a) exactly 5. (b) exactly 4. (c) exactly 3. (d) exactly 6. (e) less than 2.

2-57 In the Arnold’s Muffler example for the exponen- tial distribution in this chapter, the average rate of service was given as 3 per hour, and the times were expressed in hours. Convert the average service rate to the number per minute and convert the times to minutes. Find the probabilities that the service times will be less than 1>2 hour, 1>3 hour, and 2>3 hour. Com- pare these probabilities to the probabilities found in the example.

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 2-58 to 2-65.

Internet Homework Problems

M02_REND3161_13_AIE_C02.indd 60 28/10/16 10:17 AM

APPEnDix 2.1: DERiVATion oF BAyEs’ THEoREm  61

WTVX, Channel 6, is located in Eugene, Oregon, home of the University of Oregon. The station was owned and oper- ated by George Wilcox, a former Duck (University of Or- egon football player). Although there were other television stations in Eugene, WTVX was the only station that had a weatherperson who was a member of the American Meteoro- logical Society (AMS). Every night, Joe Hummel would be introduced as the only weatherperson in Eugene who was a member of the AMS. This was George’s idea, and he believed that this gave his station the mark of quality and helped with market share.

In addition to being a member of the AMS, Joe was the most popular person on any of the local news programs. Joe was always trying to find innovative ways to make the weather interesting, and this was especially difficult during the winter months, when the weather seemed to remain the same over long periods of time. Joe’s forecast for next month, for example, was that there would be a 70% chance of rain every day and that what happens on one day (rain or shine) was not in any way dependent on what happened the day before.

One of Joe’s most popular features of the weather re- port was to invite questions during the actual broadcast.

Questions would be phoned in, and they were answered on the spot by Joe. Once a 10-year-old boy asked what caused fog, and Joe did an excellent job of describing some of the various causes.

Occasionally, Joe would make a mistake. For example, a high school senior asked Joe what the chances were of getting 15 days of rain in the next month (30 days). Joe made a quick calcu- lation: 170%2 * 115 days>30 days2 = 170%211>22 = 35,. Joe quickly found out what it was like being wrong in a univer- sity town. He had over 50 phone calls from scientists, mathema- ticians, and other university professors, telling him that he had made a big mistake in computing the chances of getting 15 days of rain during the next 30 days. Although Joe didn’t understand all of the formulas the professors mentioned, he was determined to find the correct answer and make a correction during a future broadcast.

Discussion Question 1. What are the chances of getting 15 days of rain during the

next 30 days? 2. What do you think about Joe’s assumptions concerning

the weather for the next 30 days?

Case Study

WTVX

Bibliography

Berenson, Mark, David Levine, and Timothy Krehbiel. Basic Business Statis- tics, 10th ed. Upper Saddle River, NJ: Prentice Hall, 2006.

Campbell, S. Flaws and Fallacies in Statistical Thinking. Upper Saddle River, NJ: Prentice Hall, 1974.

Feller, W. An Introduction to Probability Theory and Its Applications, Vols. 1 and 2. New York: John Wiley & Sons, Inc., 1957 and 1968.

Groebner, David, Patrick Shannon, Phillip Fry, and Kent Smith. Business Sta- tistics, 8th ed. Upper Saddle River, NJ: Prentice Hall, 2011.

Hanke, J. E., A. G. Reitsch, and D. W. Wichern. Business Forecasting, 9th ed. Upper Saddle River, NJ: Prentice Hall, 2008.

Huff, D. How to Lie with Statistics. New York: W. W. Norton & Company, Inc., 1954.

Newbold, Paul, William Carlson, and Betty Thorne. Statistics for Business and Economics, 6th ed. Upper Saddle River, NJ: Prentice Hall, 2007.

Appendix 2.1: Derivation of Bayes’ Theorem

We know that the following formulas are correct:

P1A �B2 = P1AB2 P1B2 (1)

P1B �A2 = P1AB2 P1A2 (2)

3which can be rewritten as P1AB2 = P1B �A2P1A24 and

P1B �A′2 = P1A′B2 P1A′2

3which can be rewritten as P1A′B2 = P1B �A′2P1A′24. (3)

M02_REND3161_13_AIE_C02.indd 61 28/10/16 10:17 AM

62  CHAPTER 2 • PRoBABiLiTy ConCEPTs AnD APPLiCATions

Furthermore, by definition, we know that

P1B2 = P1AB2 + P1A′B2 = P1B �A2P1A2 + P1B �A′2P1A′2 (4)

from (2) from (3)

Substituting Equations 2 and 4 into Equation 1, we have

P1A �B2 = P1AB2 P1B2

= P1B �A2P1A2

P1B �A2P1A2 + P1B �A′2P1A′2 (5)

This is the general form of Bayes’ Theorem, shown as Equation 2-5 in this chapter.

i from (2) from (4)

M02_REND3161_13_AIE_C02.indd 62 28/10/16 10:17 AM

 63

3.5 Use computers to solve basic decision-making problems.

3.6 Develop accurate and useful decision trees.

3.7 Revise probability estimates using Bayesian analysis.

3.8 Understand the importance and use of utility theory in decision making.

3.1 List the steps of the decision-making process.

3.2 Describe the types of decision-making environments.

3.3 Make decisions under uncertainty.

3.4 Use probability values to make decisions under risk.

After completing this chapter, students will be able to:

Decision Analysis

LEARNING OBJECTIVES

3 CHAPTER

To a great extent, the successes or failures that a person experiences in life depend on the decisions that he or she makes. The person who managed the ill-fated space shuttle Chal-lenger is no longer working for NASA. The person who designed the top-selling Mustang became president of Ford. Why and how did these people make their respective decisions? In general, what is involved in making good decisions? One decision may make the difference between a successful career and an unsuccessful one. Decision theory is an analytic and sys- tematic approach to the study of decision making. In this chapter, we present the mathematical models useful in helping managers make the best possible decisions.

What makes the difference between good and bad decisions? A good decision is one that is based on logic, considers all available data and possible alternatives, and applies the quantita- tive approach we are about to describe. Occasionally, a good decision results in an unexpected or unfavorable outcome. But if it is made properly, it is still a good decision. A bad decision is one that is not based on logic, does not use all available information, does not consider all al- ternatives, and does not employ appropriate quantitative techniques. If you make a bad decision but are lucky and a favorable outcome occurs, you have still made a bad decision. Although occasionally good decisions yield bad results, in the long run, using decision theory will result in successful outcomes.

3.1 The Six Steps in Decision Making

Whether you are deciding about getting a haircut today, building a multimillion-dollar plant, or buying a new camera, the steps in making a good decision are basically the same:

Decision theory is an analytic and systematic way to tackle problems.

A good decision is based on logic.

M03_REND3161_13_AIE_C03.indd 63 28/10/16 10:19 AM

64  CHAPTER 3 • DECision AnALysis

Six Steps in Decision Making

1. Clearly define the problem at hand. 2. List the possible alternatives. 3. Identify the possible outcomes or states of nature. 4. List the payoff (typically profit) of each combination of alternatives and outcomes. 5. Select one of the mathematical decision theory models. 6. Apply the model and make your decision.

We use the Thompson Lumber Company case as an example to illustrate these decision theory steps. John Thompson is the founder and president of Thompson Lumber Company, a profitable firm located in Portland, Oregon.

Step 1. The problem that John Thompson identifies is whether to expand his product line by manufacturing and marketing a new product, backyard storage sheds.

Step 2. Thompson’s second step is to generate the alternatives that are available to him. In deci- sion theory, an alternative is defined as a course of action or a strategy that the decision maker can choose. John decides that his alternatives are to construct (1) a large new plant to manufac- ture the storage sheds, (2) a small plant, or (3) no plant at all (i.e., he has the option of not devel- oping the new product line).

One of the biggest mistakes that decision makers make is to leave out some important alter- natives. Although a particular alternative may seem to be inappropriate or of little value, it might turn out to be the best choice.

The next step involves identifying the possible outcomes of the various alternatives. A com- mon mistake is to forget about some of the possible outcomes. Optimistic decision makers tend to ignore bad outcomes, whereas pessimistic managers may discount a favorable outcome. If you don’t consider all possibilities, you will not be making a logical decision, and the results may be undesirable. If you do not think the worst can happen, you may design another Edsel automobile. In decision theory, those outcomes over which the decision maker has little or no control are called states of nature.

Step 3. Thompson determines that there are only two possible outcomes: the market for the storage sheds could be favorable, meaning that there is a high demand for the product, or it could be unfavorable, meaning that there is a low demand for the sheds.

Once the alternatives and states of nature have been identified, the next step is to express the payoff resulting from each possible combination of alternatives and outcomes. In decision theory, we call such payoffs or profits conditional values. Not every decision, of course, can be based on money alone–-any appropriate means of measuring benefit is acceptable.

Step 4. Because Thompson wants to maximize his profits, he can use profit to evaluate each consequence.

John Thompson has already evaluated the potential profits associated with the various outcomes. With a favorable market, he thinks a large facility would result in a net profit of $200,000 to his firm. This $200,000 is a conditional value because Thompson’s receiving the money is conditional upon both his building a large factory and having a good market. The conditional value if the market is unfavorable would be a $180,000 net loss. A small plant would result in a net profit of $100,000 in a favorable market, but a net loss of $20,000 would occur if the market was unfavorable. Finally, doing nothing would result in $0 profit in either market. The easiest way to present these values is by constructing a decision table, sometimes called a payoff table. A decision table for Thompson’s conditional values is shown in Table 3.1. All of the alternatives are listed down the left side of the table, and all of the possible outcomes or states of nature are listed across the top. The body of the table contains the actual payoffs.

Steps 5 and 6. The last two steps are to select a decision theory model and apply it to the data to help make the decision. Selecting the model depends on the environment in which you’re oper- ating and the amount of risk and uncertainty involved.

The first step is to define the problem.

The second step is to list alternatives.

The third step is to identify possible outcomes.

The fourth step is to list payoffs.

During the fourth step, the decision maker can construct decision or payoff tables.

The last two steps are to select and apply the decision theory model.

M03_REND3161_13_AIE_C03.indd 64 28/10/16 10:19 AM

3.3 DECision MAKinG UnDER UnCERTAinTy  65

3.2 Types of Decision-Making Environments

The types of decisions people make depend on how much knowledge or information they have about the situation. There are three decision-making environments:

●● Decision making under certainty

●● Decision making under uncertainty

●● Decision making under risk

In the environment of decision making under certainty, decision makers know with cer- tainty the consequence of every alternative or decision choice. Naturally, they will choose the alternative that will maximize their well-being or will result in the best outcome. For example, let’s say that you have $1,000 to invest for a 1-year period. One alternative is to open a savings account paying 4% interest, and another is to invest in a government Treasury bond paying 6% interest. If both investments are secure and guaranteed, there is a certainty that the Treasury bond will pay a higher return. The return after 1 year will be $60 in interest.

In decision making under uncertainty, there are several possible outcomes for each al- ternative, and the decision maker does not know the probabilities of the various outcomes. As an example, the probability that a Democrat will be president of the United States 25 years from now is not known. Sometimes it is impossible to assess the probability of success of a new undertaking or product. The criteria for decision making under uncertainty are explained in Section 3.4.

In decision making under risk, there are several possible outcomes for each alternative, and the decision maker knows the probability of occurrence of each outcome. We know, for example, that when playing cards using a standard deck, the probability of being dealt a club is 0.25. The probability of rolling a 5 on a die is 1/6. In decision making under risk, the decision maker usually attempts to maximize his or her expected well-being. Decision theory models for business problems in this environment typically employ two equivalent criteria: maximization of expected monetary value and minimization of expected opportunity loss.

In the Thompson Lumber example, John Thompson is faced with decision making under uncertainty. If either a large plant or a small plant is constructed, the actual payoff depends on the state of nature, and probabilities are not known. If probabilities for a favorable market and for an unfavorable market were known, the environment would change from uncertainty to risk. For the third alternative, do nothing, the payoff does not depend on the state of nature and is known with certainty.

3.3 Decision Making Under Uncertainty

The presentation in this section of the criteria for decision making under uncertainty (and also for decision making under risk) is based on the assumption that the payoff is something in which larger values are better and high values are desirable. For payoffs such as profit, total sales, total return on investment, and interest earned, the best decision would be one that resulted in some type of maximum payoff. However, there are situations in which lower payoff values (e.g., cost) are better, and these payoffs would be minimized rather than maximized. The statement of the decision criteria would be modified slightly for such minimization problems. These differences will be mentioned in this section, and an example will be provided in a later section.

Probabilities are not known.

Probabilities are known.

TABLE 3.1 Decision Table with Conditional Values for Thompson Lumber

STATE OF NATURE

ALTERNATIVE FAVORABLE MARKET

($) UNFAVORABLE MARKET

($)

Construct a large plant 200,000 -180,000 Construct a small plant 100,000 -20,000 Do nothing 0 0

Note: It is important to include all alternatives, including “do nothing.”

M03_REND3161_13_AIE_C03.indd 65 28/10/16 10:19 AM

66  CHAPTER 3 • DECision AnALysis

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

MINIMUM IN A ROW

($)

Construct a large plant 200,000 -180,000 -180,000 Construct a small plant 100,000 -20,000 -20,000 Do nothing 0 0 0

Maximin

Several criteria exist for making decisions under conditions of uncertainty. The ones that we cover in this section are as follows:

1. Optimistic 2. Pessimistic 3. Criterion of realism (Hurwicz) 4. Equally likely (Laplace) 5. Minimax regret

The first four criteria can be computed directly from the decision (payoff) table, whereas the minimax regret criterion requires use of an opportunity loss table. Let’s take a look at each of the five models and apply them to the Thompson Lumber example.

Optimistic In using the optimistic criterion, the best (maximum) payoff for each alternative is considered, and the alternative with the best (maximum) of these is selected. Hence, the optimistic criterion is sometimes called the maximax criterion. In Table 3.2, we see that Thompson’s optimistic choice is the first alternative, “construct a large plant.” By using this criterion, the highest of all possible payoffs ($200,000 in this example) may be achieved, while if any other alternative were selected, it would be impossible to achieve a payoff this high.

In using the optimistic criterion for minimization problems in which lower payoffs (e.g., cost) are better, you would look at the best (minimum) payoff for each alternative and choose the alternative with the best (minimum) of these.

Pessimistic In using the pessimistic criterion, the worst (minimum) payoff for each alternative is considered, and the alternative with the best (maximum) of these is selected. Hence, the pessimistic criterion is sometimes called the maximin criterion. This criterion guarantees the payoff will be at least the maximin value (the best of the worst values). Choosing any other alternative may allow a worse (lower) payoff to occur.

Thompson’s maximin choice, “do nothing,” is shown in Table 3.3. This decision is associ- ated with the maximum of the minimum number within each row or alternative.

In using the pessimistic criterion for minimization problems in which lower payoffs (e.g., cost) are better, you would look at the worst (maximum) payoff for each alternative and choose the alternative with the best (minimum) of these.

Maximax is an optimistic approach.

Maximin is a pessimistic approach.

TABLE 3.2 Thompson’s Maximax Decision

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

MAXIMUM IN A ROW

($)

Construct a large plant 200,000 -180,000 200,000 Maximax

Construct a small plant 100,000 -20,000 100,000 Do nothing 0 0 0

TABLE 3.3 Thompson’s Maximin Decision

M03_REND3161_13_AIE_C03.indd 66 28/10/16 10:19 AM

3.3 Decision Making UnDer Uncertainty  67

Both the maximax and maximin criteria consider only one extreme payoff for each alterna- tive, while all other payoffs are ignored. The next criterion considers both of these extremes.

Criterion of Realism (Hurwicz Criterion) Often called the weighted average, the criterion of realism (the Hurwicz criterion) is a com- promise between an optimistic and a pessimistic decision. To begin, a coefficient of realism, A, is selected. This measures the degree of optimism of the decision maker and is between 0 and 1. When a is 1, the decision maker is 100% optimistic about the future. When a is 0, the decision maker is 100% pessimistic about the future. The advantage of this approach is that it allows the decision maker to build in personal feelings about relative optimism and pessimism. The weighted average is computed as follows:

Weighted average = a1Best in row2 + 11 - a21Worst in row2

For a maximization problem, the best payoff for an alternative is the highest value, and the worst payoff is the lowest value. Note that when a = 1, this is the same as the optimistic criterion, and when a = 0, this is the same as the pessimistic criterion. This value is computed for each alter- native, and the alternative with the highest weighted average is then chosen.

If we assume that John Thompson sets his coefficient of realism, a, to be 0.80, the best de- cision would be to construct a large plant. As seen in Table 3.4, this alternative has the highest weighted average: $124,000 = 10.8021$200,0002 + 10.2021-$180,0002.

In using the criterion of realism for minimization problems, the best payoff for an alterna- tive would be the lowest payoff in the row, and the worst would be the highest payoff in the row. The alternative with the lowest weighted average is then chosen.

Because there are only two states of nature in the Thompson Lumber example, only two payoffs for each alternative are present and both are considered. However, if there are more than two states of nature, this criterion will ignore all payoffs except the best and the worst. The next criterion will consider all possible payoffs for each decision.

Equally Likely (Laplace) One criterion that uses all the payoffs for each alternative is the equally likely, also called Laplace, decision criterion. This involves finding the average payoff for each alternative and selecting the alternative with the best or highest average. The equally likely approach assumes that all probabilities of occurrence for the states of nature are equal, and thus each state of nature is equally likely.

The equally likely choice for Thompson Lumber is the second alternative, “construct a small plant.” This strategy, shown in Table 3.5, is the one with the maximum average payoff.

In using the equally likely criterion for minimization problems, the calculations are exactly the same, but the best alternative is the one with the lowest average payoff.

Minimax Regret The next decision criterion that we discuss is based on opportunity loss or regret. Opportunity loss refers to the difference between the optimal profit or payoff for a given state of nature and the actual payoff received for a particular decision for that state of nature. In other words, it’s the amount lost by not picking the best alternative in a given state of nature.

Criterion of realism uses the weighted average approach.

Equally likely criterion uses the average outcome.

Minimax regret criterion is based on opportunity loss.

TABLE 3.4 thompson’s criterion of realism Decision

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

CRITERION OF REALISM OR WEIGHTED AVERAGE

(A = 0.8) ($)

Construct a large plant 200,000 -180,000 124,000 Realism

Construct a small plant 100,000 -20,000 76,000 Do nothing 0 0 0

M03_REND3161_13_AIE_C03.indd 67 31/10/16 10:13 AM

68  CHAPTER 3 • DECision AnALysis

The first step is to create the opportunity loss table by determining the opportunity loss for not choosing the best alternative for each state of nature. Opportunity loss for any state of nature, or any column, is calculated by subtracting each payoff in the column from the best payoff in the same column. For a favorable market, the best payoff is $200,000 as a result of the first alterna- tive, “construct a large plant.” The opportunity loss is 0, meaning that it is impossible to achieve a higher payoff in this state of nature. If the second alternative is selected, a profit of $100,000 would be realized in a favorable market, and this is compared to the best payoff of $200,000. Thus, the opportunity loss is 200,000 - 100,000 = 100,000. Similarly, if “do nothing” is se- lected, the opportunity loss would be 200,000 - 0 = 200,000.

For an unfavorable market, the best payoff is $0 as a result of the third alternative, “do noth- ing,” so this has 0 opportunity loss. The opportunity losses for the other alternatives are found by subtracting the payoffs from this best payoff ($0) in this state of nature, as shown in Table 3.6. Thompson’s opportunity loss table is shown as Table 3.7.

Using the opportunity loss (regret) table, the minimax regret criterion first considers the maximum (worst) opportunity loss for each alternative. Next, looking at these maximum values, pick the alternative with the minimum (or best) number. By doing this, the opportunity loss actually realized is guaranteed to be no more than this minimax value. In Table 3.8, we can see that the minimax regret choice is the second alternative, “construct a small plant.” When this al- ternative is selected, we know the maximum opportunity loss cannot be more than 100,000 (the minimum of the maximum regrets).

In calculating the opportunity loss for minimization problems such as those involving costs, the best (lowest) payoff or cost in a column is subtracted from each payoff in that column. Once the opportunity loss table has been constructed, the minimax regret criterion is applied in exactly the same way as just described. The maximum opportunity loss for each alternative is found, and the alternative with the minimum of these maximums is selected. As with maximiza- tion problems, the opportunity loss can never be negative.

We have considered several decision-making criteria to be used when probabilities of the states of nature are not known and cannot be estimated. Now we will see what to do if the prob- abilities are available.

TABLE 3.7 opportunity Loss Table for Thompson Lumber

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

Construct a large plant 0 180,000

Construct a small plant 100,000 20,000

Do nothing 200,000 0

TABLE 3.6 Determining opportunity Losses for Thompson Lumber

STATE OF NATURE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

200,000 – 200,000 0 – (–180,000)

200,000 – 100,000 0 – (–20,000)

200,000 – 0 0 – 0

TABLE 3.5 Thompson’s Equally Likely Decision

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($) ROW AVERAGE

($)

Construct a large plant 200,000 -180,000 10,000 Construct a small plant 100,000 -20,000 40,000

Equally likely

Do nothing 0 0 0

M03_REND3161_13_AIE_C03.indd 68 28/10/16 10:19 AM

3.4 DECision MAKinG UnDER RisK  69

3.4 Decision Making Under Risk

Decision making under risk is a decision situation in which several possible states of nature may occur and the probabilities of these states of nature are known. In this section, we consider one of the most popular methods of making decisions under risk: selecting the alternative with the highest expected monetary value (or simply expected value). We also use the probabilities with the opportunity loss table to minimize the expected opportunity loss.

Expected Monetary Value Given a decision table with conditional values (payoffs) that are monetary values and prob- ability assessments for all states of nature, it is possible to determine the expected monetary value (EMV) for each alternative. The expected value, or the mean value, is the long-run aver- age value of that decision. The EMV for an alternative is just the sum of possible payoffs of the alternative, each weighted by the probability of that payoff occurring.

This could also be expressed simply as the expected value of X, or E(X), which was discussed in Section 2.6 of Chapter 2.

EMV1alternative i2 = gXiP1Xi2 (3-1) where

Xi = payoff for the alternative in state of nature i P1Xi2 = probability of achieving payoff Xi (i.e., probability of state of nature i)

g = summation symbol If this were expanded, it would become

EMV 1alternative2 = 1Payoff in first state of nature2 * 1Probability of first state of nature2

+ 1Payoff in second state of nature2 * 1Probability of second state of nature2 + Á + 1Payoff in last state of nature2 * 1Probability of last state of nature2

EMV is the weighted sum of possible payoffs for each alternative.

Ford Uses Decision Theory to Choose Parts suppliers

Ford Motor Company manufactures about 5 million cars and trucks annually and employs more than 200,000 people at about 100 facilities around the globe. Such a large company often needs to make large supplier decisions under tight deadlines.

This was the situation when researchers at MIT teamed up with Ford management and developed a data-driven supplier se- lection tool. This computer program aids in decision making by applying some of the decision-making criteria presented in this

chapter. Decision makers at Ford are asked to input data about their suppliers (part costs, distances, lead times, supplier reliabil- ity, etc.), as well as the type of decision criterion they want to use. Once these are entered, the model outputs the best set of suppli- ers to meet the specified needs. The result is a system that is now saving Ford Motor Company over $40 million annually.

Source: Based on E. Klampfl, Y. Fradkin, C. McDaniel, and M. Wolcott, “Ford Uses OR to Make Urgent Sourcing Decisions in a Distressed Supplier Environ- ment,” Interfaces 39, 5 (2009): 428–442, © Trevor S. Hale.

IN ACTION

TABLE 3.8 Thompson’s Minimax Decision Using opportunity Loss

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

MAXIMUM IN A ROW

($)

Construct a large plant 0 180,000 180,000

Construct a small plant 100,000 20,000 100,000

Minimax

Do nothing 200,000 0 200,000

M03_REND3161_13_AIE_C03.indd 69 28/10/16 10:19 AM

70  CHAPTER 3 • DECision AnALysis

The alternative with the maximum EMV is then chosen. Suppose that John Thompson now believes that the probability of a favorable market is

exactly the same as the probability of an unfavorable market; that is, each state of nature has a 0.50 probability. Which alternative would give the greatest EMV? To determine this, John has expanded the decision table, as shown in Table 3.9. His calculations follow:

EMV 1large plant2 = 1$200,000210.502 + 1-$180,000210.502 = $10,000 EMV 1small plant2 = 1$100,000210.502 + 1-$20,000210.502 = $40,000 EMV 1do nothing2 = 1$0210.502 + 1$0210.502 = $0

The largest expected value ($40,000) results from the second alternative, “construct a small plant.” Thus, Thompson should proceed with the project and put up a small plant to manufacture storage sheds. The EMVs for constructing the large plant and for doing nothing are $10,000 and $0, respectively.

When using the EMV criterion with minimization problems, the calculations are the same, but the alternative with the smallest EMV is selected.

Expected Value of Perfect Information John Thompson has been approached by Scientific Marketing, Inc., a firm that proposes to help John make the decision about whether to build the plant to produce storage sheds. Scientific Marketing claims that its technical analysis will tell John with certainty whether the market is favorable for his proposed product. In other words, it will change his environment from one of decision making under risk to one of decision making under certainty. This information could prevent John from making a very expensive mistake. Scientific Marketing would charge Thomp- son $65,000 for the information. What would you recommend to John? Should he hire the firm to make the marketing study? Even if the information from the study is perfectly accurate, is it worth $65,000? What would it be worth? Although some of these questions are difficult to answer, determining the value of such perfect information can be very useful. It places an upper bound on what you should be willing to spend on information such as that being sold by Scien- tific Marketing. In this section, two related terms are investigated: the expected value of perfect information (EVPI) and the expected value with perfect information (EVwPI). These tech- niques can help John make his decision about hiring the marketing firm.

The expected value with perfect information is the expected or average return, in the long run, if we have perfect information before a decision has to be made. To calculate this value, we choose the best alternative for each state of nature and multiply its payoff times the probability of occurrence of that state of nature.

EVwPI = g1Best payoff in state of nature i21probability of state of nature i2 (3-2) If this were expanded, it would become

EVwPI

= 1Best payoff in first state of nature2 * 1Probability of first state of nature2 + 1Best payoff in second state of nature2 * 1Probability of second state of nature2 + Á + 1Best payoff in last state of nature2 * 1Probability of last state of nature2

EVPI places an upper bound on what to pay for information.

TABLE 3.9 Decision Table with Probabilities and EMVs for Thompson Lumber

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($) EMV ($)

Construct a large plant 200,000 –180,000 10,000

Construct a small plant 100,000 –20,000 40,000

Best EMV

Do nothing 0 0 0

Probabilities 0.50 0.50

M03_REND3161_13_AIE_C03.indd 70 28/10/16 10:19 AM

3.4 DECision MAKinG UnDER RisK  71

The EVPI is the expected value with perfect information minus the expected value without perfect information (i.e., the best or maximum EMV). Thus, the EVPI is the improvement in EMV that results from having perfect information.

EVPI = EVwPI - Best EMV (3-3)

By referring to Table 3.9, Thompson can calculate the maximum that he would pay for in- formation, that is, the EVPI. He follows a three-stage process. First, the best payoff in each state of nature is found. If the perfect information says the market will be favorable, the large plant will be constructed, and the profit will be $200,000. If the perfect information says the market will be unfavorable, the “do nothing” alternative is selected, and the profit will be 0. These val- ues are shown in the “with perfect information” row in Table 3.10. Second, the expected value with perfect information is computed. Then, using this result, EVPI is calculated.

The expected value with perfect information is

EVwPI = 1$200,000210.502 + 1$0210.502 = $100,000 Thus, if we had perfect information, the payoff would average $100,000.

The maximum EMV without additional information is $40,000 (from Table 3.9 ). Therefore, the increase in EMV is

EVPI = EVwPI - Maximum EMV = $100,000 - $40,000 = $60,000

Thus, the most Thompson would be willing to pay for perfect information is $60,000. This, of course, is again based on the assumption that the probability of each state of nature is 0.50.

This EVPI also tells us that the most we would pay for any information (perfect or im- perfect) is $60,000. In a later section, we’ll see how to place a value on imperfect or sample information.

In finding the EVPI for minimization problems, the approach is similar. The best payoff in each state of nature is found, but this is the lowest payoff for that state of nature rather than the highest. The EVwPI is calculated from these lowest payoffs, and this is compared to the best (lowest) EMV without perfect information. The EVPI is the improvement that results, and this is the best EMV - EVwPI.

Expected Opportunity Loss An alternative approach to maximizing EMV is to minimize expected opportunity loss (EOL). First, an opportunity loss table is constructed. Then the EOL is computed for each alternative by multiplying the opportunity loss by the probability and adding these together. In Table 3.7, we presented the opportunity loss table for the Thompson Lumber example. Using these opportu- nity losses, we compute the EOL for each alternative by multiplying the probability of each state of nature times the appropriate opportunity loss value and adding these together:

EVPI is the expected value with perfect information minus the maximum EMV.

EOL is the cost of not picking the best solution.

TABLE 3.10 Decision Table with Perfect information

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($) EMV ($)

Construct a large plant 200,000 –180,000 10,000

Construct a small plant 100,000 –20,000 40,000

Do nothing 0 0 0

With perfect information 200,000 0 100,000

EVwPI

Probabilities 0.50 0.50

M03_REND3161_13_AIE_C03.indd 71 28/10/16 10:19 AM

72  CHAPTER 3 • DECision AnALysis

EOL1construct large plant2 = 10.521$02 + 10.521$180,0002 = $90,000

EOL1construct small plant2 = 10.521$100,0002 + 10.521$20,0002 = $60,000

EOL1do nothing2 = 10.521$200,0002 + 10.521$02 = $100,000

Table 3.11 gives these results. Using minimum EOL as the decision criterion, the best decision would be the second alternative, “construct a small plant.”

It is important to note that minimum EOL will always result in the same decision as maxi- mum EMV and that the EVPI will always equal the minimum EOL. Referring to the Thompson case, we used the payoff table to compute the EVPI to be $60,000. Note that this is the minimum EOL we just computed.

Sensitivity Analysis In previous sections, we determined that the best decision (with the probabilities known) for Thompson Lumber was to construct the small plant, with an expected value of $40,000. This conclusion depends on the values of the economic consequences and the two probability val- ues of a favorable and an unfavorable market. Sensitivity analysis investigates how our decision might change given a change in the problem data. In this section, we investigate the impact that a change in the probability values would have on the decision facing Thompson Lumber. We first define the following variable:

P = probability of a favorable market

Because there are only two states of nature, the probability of an unfavorable market must be 1 - P.

We can now express the EMVs in terms of P, as shown in the following equations. A graph of these EMV values is shown in Figure 3.1.

EMV1large plant2 = $200,000P - $180,00011 - P2 = $200,000P - $180,000 + 180,000P = $380,000P - $180,000

EMV1small plant2 = $100,000P - $20,00011 - P2 = $100,000P - $20,000 + 20,000P = $120,000P - $20,000

EMV1do nothing2 = $0P + $011 - P2 = $0 As you can see in Figure 3.1, the best decision is to do nothing as long as P is between 0 and

the probability associated with point 1, where the EMV for doing nothing is equal to the EMV for the small plant. When P is between the probabilities for points 1 and 2, the best decision is to build the small plant. Point 2 is where the EMV for the small plant is equal to the EMV for the large plant. When P is greater than the probability for point 2, the best decision is to construct

EOL will always result in the same decision as the maximum EMV.

Sensitivity analysis investigates how our decision might change with different input data.

TABLE 3.11 EoL Table for Thompson Lumber

STATE OF NATURE

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($) EOL ($)

Construct a large plant 0 180,000 90,000

Construct a small plant 100,000 20,000 60,000

Best EOL

Do nothing 200,000 0 100,000

Probabilities 0.50 0.50

M03_REND3161_13_AIE_C03.indd 72 28/10/16 10:19 AM

3.4 DECision MAKinG UnDER RisK  73

the large plant. Of course, this is what you would expect as P increases. The value of P at points 1 and 2 can be computed as follows:

Point 1: EMV 1do nothing2 = EMV 1small plant2 0 = $120,000P - $20,000 P =

20,000

120,000 = 0.167

Point 2: EMV 1small plant2 = EMV 1large plant2 $120,000P - $20,000 = $380,000P - $180,000

260,000P = 160,000 P = 160,000

260,000 = 0.615

The results of this sensitivity analysis are displayed in the following table:

BEST ALTERNATIVE RANGE OF P VALUES

Do nothing Less than 0.167

Construct a small plant 0.167 – 0.615

Construct a large plant Greater than 0.615

A Minimization Example The previous examples have illustrated how to apply the decision-making criterion when the payoffs are to be maximized. The following example illustrates how the criteria are applied to problems in which the payoffs are costs that should be minimized.

The Business Analytics department at State University will be signing a 3-year lease for a new copy machine, and three different machines are being considered. For each of these, there is a monthly fee, which includes service on the machine, plus a charge for each copy. The number of copies that would be made each month is uncertain, but the department has estimated that the number of copies per month could be 10,000 or 20,000 or 30,000 per month. The monthly cost for each machine based on each of the three levels of activity is shown in Table 3.12.

Which machine should be selected? To determine the best alternative, a specific criterion must be chosen. If the decision maker is optimistic, only the best (minimum) payoff for each decision is considered. These are shown in Table 3.13, and the best (minimum) of these is 700. Thus, Machine C would be selected, allowing the possibility of achieving this best cost of $700.

If the decision maker is pessimistic, only the worst (maximum) payoff for each decision is considered. These are also shown in Table 3.13, and the best (minimum) of these is 1,150. Thus, Machine A would be selected based on the pessimistic criterion. This would guarantee that the cost would be no more than 1,150, regardless of which state of nature occurred.

0

EMV (large plant)

EMV (small plant)

EMV (do nothing)

Value of P

Point 2

Point 1

EMV Value

$300,000

$200,000

$100,000

2$100,000

2$200,000

1.615.167

FIGURE 3.1 sensitivity Analysis

M03_REND3161_13_AIE_C03.indd 73 28/10/16 10:19 AM

74  CHAPTER 3 • DECision AnALysis

Using the Hurwicz criterion, if we assume that the decision maker is 70% optimistic (the coefficient of realism is 0.7), the weighted average of the best and the worst payoff for each alternative would be calculated using the formula

Weighted average = 0.71Best payoff2 + 11 - 0.721Worst payoff2 For each of the three copy machines, we would get the following values:

Machine A: 0.719502 + 0.311,1502 = 1,010 Machine B: 0.718502 + 0.311,3502 = 1,000 Machine C: 0.717002 + 0.311,3002 = 880

The decision would be to select Machine C based on this criterion because it has the lowest weighted average cost.

For the equally likely criterion, the average payoff for each machine would be calculated.

Machine A: 1950 + 1,050 + 1,1502>3 = 1,050 Machine B: 1850 + 1,100 + 1,3502>3 = 1,100 Machine C: 1700 + 1,000 + 1,3002>3 = 1,000

Based on the equally likely criterion, Machine C would be selected because it has the lowest average cost.

To apply the EMV criterion, probabilities must be known for each state of nature. Past re- cords indicate that 40% of the time the number of copies made in a month was 10,000, while 30% of the time it was 20,000 and 30% of the time it was 30,000. The probabilities for the three states of nature would be 0.4, 0.3, and 0.3. We can use these to calculate the EMVs, and the results are shown in Table 3.14. Machine C would be selected because it has the lowest EMV. The monthly cost would average $970 with this machine, while the other machines would aver- age a higher cost.

To find the EVPI, we first find the payoffs (costs) that would be experienced with perfect information. The best payoff in each state of nature is the lowest value (cost) in that state of nature, as shown in the bottom row of Table 3.14. These values are used to calculate the EVwPI. With these costs, we find

EVwPI = $925 Best EMV without perfect information = $970

EVPI = 970 - 925 = $45

Perfect information would lower the expected value by $45.

TABLE 3.12 Payoff Table with Monthly Copy Costs for Business Analytics Department

10,000 COPIES PER

MONTH

20,000 COPIES PER

MONTH

30,000 COPIES PER

MONTH

Machine A 950 1,050 1,150

Machine B 850 1,100 1,350

Machine C 700 1,000 1,300

TABLE 3.13 Best and Worst Payoffs (Costs) for Business Analytics Department

10,000 COPIES PER

MONTH

20,000 COPIES PER

MONTH

30,000 COPIES PER

MONTH

BEST PAYOFF

(MINIMUM)

WORST PAYOFF

(MAXIMUM)

Machine A 950 1,050 1,150 950 1,150

Machine B 850 1,100 1,350 850 1,350

Machine C 700 1,000 1,300 700 1,300

M03_REND3161_13_AIE_C03.indd 74 28/10/16 10:19 AM

3.5 UsinG soFTWARE FoR PAyoFF TABLE PRoBLEMs  75

To apply criteria based on opportunity loss, we must first develop the opportunity loss table. In each state of nature, the opportunity loss indicates how much worse each payoff is than the best possible payoff in that state of nature. The best payoff (cost) would be the lowest cost. Thus, to get the opportunity loss in this case, we subtract the lowest value in each column from all the values in that column, and we obtain the opportunity loss table.

Once the opportunity loss table has been developed, the minimax regret criterion is applied exactly as it was for the Thompson Lumber example. The maximum regret for each alternative is found, and the alternative with the minimum of these maximums is selected. As seen in Table 3.15, the minimum of these maximums is 150, so Machine C would be selected based on this criterion.

The probabilities are used to compute the expected opportunity losses as shown in Table 3.15. Machine C has the lowest EOL of $45, so it would be selected based on the minimum EOL criterion. As previously noted, the minimum EOL is equal to the expected value of perfect information.

3.5 Using Software for Payoff Table Problems

It is easy to use QM for Windows or Excel QM or even Excel 2016 without any add-ins to per- form the calculations associated with payoff tables. The Thompson Lumber example is used in the following examples for illustration.

QM for Windows To use QM for Windows for the Thompson Lumber example, select Module – Decision Theory. Then enter New-Payoff Tables, and a window appears allowing you to set up the problem. Enter a title, the number of options (alternatives), and the number of scenarios (states of nature), and specify if it is to be maximized or minimized. In this example, there are three alternatives or options and two states of nature or scenarios. When these are entered, click OK and a window appears (Program 3.1A ) allowing you to enter the probabilities and payoffs. You can also change the names of the alternatives and states of nature by simply typing over the default names. When you click Solve, the output in Program 3.1B appears. Additional output such as EVPI and oppor- tunity loss results are available by clicking Window on the screen where the output is displayed.

Excel QM To use Excel QM for the Thompson Lumber example, from the Excel QM ribbon in Excel 2016, click the Alphabetical menu and select Decision Analysis – Decision Tables. When the window

TABLE 3.14 Expected Monetary Values and Expected Values with Perfect information for Business Analytics Department

10,000 COPIES PER

MONTH

20,000 COPIES PER

MONTH

30,000 COPIES PER

MONTH EMV

Machine A 950 1,050 1,150 1,040

Machine B 850 1,100 1,350 1,075

Machine C 700 1,000 1,300 970

With perfect information 700 1,000 1,150 925

Probability 0.4 0.3 0.3

TABLE 3.15 opportunity Loss Table for Business Analytics Department

10,000 COPIES PER

MONTH

20,000 COPIES PER

MONTH

30,000 COPIES PER

MONTH MAXIMUM EOL

Machine A 250 50 0 250 115

Machine B 150 100 200 200 150

Machine C 0 0 150 150 45

Probability 0.4 0.3 0.3

M03_REND3161_13_AIE_C03.indd 75 28/10/16 10:19 AM

76  CHAPTER 3 • DECision AnALysis

opens to enter the parameters of the problem, you should enter a title, the number of alternatives, and the number of states of nature and specify if it is to be maximized or minimized. Click OK and an empty payoff table is created. You simply enter the probabilities, payoffs, and names for the rows and columns. The calculations are performed automatically, and the results are shown in Program 3.2A. While the formulas are automatically developed in Excel QM, Program 3.2B shows the important formulas in this example. To see the formulas in Excel, simply hold down the control key and press the grave accent ( ̀ ) key (usually found above the Tab key). To return the Excel 2016 spreadsheet display to the numbers instead of the formulas, simply press the keys again.

Enter data into table and type the row and column names.

PROGRAM 3.1A QM for Windows input for Thompson Lumber Example

Click Window to see more information.

PROGRAM 3.1B QM for Windows output screen for Thompson Lumber Example

To see the formulas, hold down the control key (Ctrl) and press the ` (grave accent) key, which is usually found above the Tab key.

PROGRAM 3.2A Excel QM Results for Thompson Lumber Example

M03_REND3161_13_AIE_C03.indd 76 28/10/16 10:19 AM

3.6 DECision TREEs  77

3.6 Decision Trees

Any problem that can be presented in a decision table can also be graphically illustrated in a decision tree. All decision trees are similar in that they contain decision nodes or decision points and state-of-nature nodes or state-of-nature points:

●● A decision node from which one of several alternatives may be chosen

●● A state-of-nature node out of which one state of nature will occur

In drawing the tree, we begin at the left and move to the right. Thus, the tree presents the decisions and outcomes in sequential order. Lines or branches from the squares (decision nodes) represent alternatives, and branches from the circles represent the states of nature. Figure 3.2 gives the basic decision tree for the Thompson Lumber example. First, John decides whether to construct a large plant, a small plant, or no plant. Then, once that decision is made, the possible states of nature or outcomes (favorable or unfavorable market) will occur. The next step is to put the payoffs and probabilities on the tree and begin the analysis.

Analyzing problems with decision trees involves five steps:

Five Steps of Decision Tree Analysis

1. Define the problem. 2. Structure or draw the decision tree. 3. Assign probabilities to the states of nature. 4. Estimate payoffs for each possible combination of alternatives and states of nature. 5. Solve the problem by computing EMVs for each state-of-nature node. This is done by

working backward, that is, starting at the right of the tree and working back to decision nodes on the left. Also, at each decision node, the alternative with the best EMV is selected.

PROGRAM 3.2B Key Formulas in Excel QM for Thompson Lumber Example

A Decision Node A State-of-Nature Node

Favorable Market

Unfavorable Market

Favorable Market

Unfavorable Market

Construct Small Plant

Co nst

ruc t

Lar ge

Pla nt

Do Nothing

1

2

FIGURE 3.2 Thompson’s Decision Tree

M03_REND3161_13_AIE_C03.indd 77 28/10/16 10:19 AM

78  CHAPTER 3 • DECision AnALysis

from the market survey. Of course, you would expect to find a high probability of a favorable market given that the research indicated that the market was good. Don’t forget, though, there is a chance that John’s $10,000 market survey didn’t result in perfect or even reliable information. Any market research study is subject to error. In this case, there is a 22% chance that the market for sheds will be unfavorable given that the survey results are positive.

We note that there is a 27% chance that the market for sheds will be favorable given that John’s survey results are negative. The probability is much higher, 0.73, that the market will actually be unfavorable given that the survey was negative.

Finally, when we look to the payoff column in Figure 3.4, we see that $10,000, the cost of the marketing study, had to be subtracted from each of the top 10 tree branches. Thus, a large plant with a favorable market would normally net a $200,000 profit. But because the market study was conducted, this figure is reduced by $10,000 to $190,000. In the unfavorable case, the loss of $180,000 would increase to a greater loss of $190,000. Similarly, conducting the survey and building no plant now results in a -$10,000 payoff.

With all probabilities and payoffs specified, we can start calculating the EMV at each state- of-nature node. We begin at the end, or right side of the decision tree, and work back toward the origin. When we finish, the best decision will be known.

Most of the probabilities are conditional probabilities.

The cost of the survey had to be subtracted from the original payoffs.

We start by computing the EMV of each branch.

The final decision tree with the payoffs and probabilities for John Thompson’s decision situation is shown in Figure 3.3. Note that the payoffs are placed at the right side of each of the tree’s branches. The probabilities are shown in parentheses next to each state of nature. Begin- ning with the payoffs on the right of the figure, the EMVs for each state-of-nature node are then calculated and placed by their respective nodes. The EMV of the first node is $10,000. This represents the branch from the decision node to construct a large plant. The EMV for node 2, to construct a small plant, is $40,000. Building no plant or doing nothing has, of course, a payoff of $0. The branch leaving the decision node leading to the state-of-nature node with the highest EMV should be chosen. In Thompson’s case, a small plant should be built.

A MORE COMPLEX DECISION FOR THOMPSON LUMBER—SAMPLE INFORMATION When sequential deci- sions need to be made, decision trees are much more powerful tools than decision tables. Let’s say that John Thompson has two decisions to make, with the second decision dependent on the outcome of the first. Before deciding about building a new plant, John has the option of conduct- ing his own marketing research survey, at a cost of $10,000. The information from his survey could help him decide whether to construct a large plant or a small plant or not to build at all. John recognizes that such a market survey will not provide him with perfect information, but it may help quite a bit nevertheless.

John’s new decision tree is represented in Figure 3.4. Let’s take a careful look at this more complex tree. Note that all possible outcomes and alternatives are included in their logical sequence. This is one of the strengths of using decision trees in making decisions. The user is forced to examine all possible outcomes, including unfavorable ones. He or she is also forced to make decisions in a logical, sequential manner.

Examining the tree, we see that Thompson’s first decision point is whether to conduct the $10,000 market survey. If he chooses not to do the study (the lower part of the tree), he can con- struct a large plant, a small plant, or no plant. This is John’s second decision point. The market will be either favorable (0.50 probability) or unfavorable (also 0.50 probability) if he builds. The payoffs for each of the possible consequences are listed along the right side. As a matter of fact, the lower portion of John’s tree is identical to the simpler decision tree shown in Figure 3.3. Why is this so?

The upper part of Figure 3.4 reflects the decision to conduct the market survey. State-of- nature node 1 has two branches. There is a 45% chance that the survey results will indicate a fa- vorable market for storage sheds. We also note that the probability is 0.55 that the survey results will be negative. The derivation of this probability will be discussed in the next section.

The rest of the probabilities shown in parentheses in Figure 3.4 are all conditional proba- bilities or posterior probabilities (these probabilities will also be discussed in the next section). For example, 0.78 is the probability of a favorable market for the sheds given a favorable result

All outcomes and alternatives must be considered.

Favorable Market (0.5)

Unfavorable Market (0.5)

Favorable Market (0.5)

Unfavorable Market (0.5)

Construct Small Plant Con

stru ct L

arg e P

lant

Do Nothing

= (0.5)($200,000) + (0.5)( –$180,000)

Payo�s

$200,000

–$180,000

$100,000

–$20,000

$0

1

2

EMV for Node 1 = $10,000

EMV for Node 2 = $40,000

= (0.5)($100,000) + (0.5)( –$20,000)

Alternative with Best EMV Is Selected

FIGURE 3.3 Completed and solved Decision Tree for Thompson Lumber

M03_REND3161_13_AIE_C03.indd 78 28/10/16 10:19 AM

3.6 DECision TREEs  79

from the market survey. Of course, you would expect to find a high probability of a favorable market given that the research indicated that the market was good. Don’t forget, though, there is a chance that John’s $10,000 market survey didn’t result in perfect or even reliable information. Any market research study is subject to error. In this case, there is a 22% chance that the market for sheds will be unfavorable given that the survey results are positive.

We note that there is a 27% chance that the market for sheds will be favorable given that John’s survey results are negative. The probability is much higher, 0.73, that the market will actually be unfavorable given that the survey was negative.

Finally, when we look to the payoff column in Figure 3.4, we see that $10,000, the cost of the marketing study, had to be subtracted from each of the top 10 tree branches. Thus, a large plant with a favorable market would normally net a $200,000 profit. But because the market study was conducted, this figure is reduced by $10,000 to $190,000. In the unfavorable case, the loss of $180,000 would increase to a greater loss of $190,000. Similarly, conducting the survey and building no plant now results in a -$10,000 payoff.

With all probabilities and payoffs specified, we can start calculating the EMV at each state- of-nature node. We begin at the end, or right side of the decision tree, and work back toward the origin. When we finish, the best decision will be known.

Most of the probabilities are conditional probabilities.

The cost of the survey had to be subtracted from the original payoffs.

We start by computing the EMV of each branch.

Favorable Market (0.78) $190,000

Unfavorable Market (0.22) –$190,000

Favorable Market (0.78) $90,000

Unfavorable Market (0.22) –$30,000

No Plant

Small Plant

Lar ge

Pla nt

–$10,000

Favorable Market (0.27) $190,000

Unfavorable Market (0.73) –$190,000

Favorable Market (0.27) $90,000

Unfavorable Market (0.73) –$30,000

No Plant

Small Plant

Lar ge

Pla nt

–$10,000

Favorable Market (0.50) $200,000

Unfavorable Market (0.50) –$180,000

Favorable Market (0.50) $100,000

Unfavorable Market (0.50) –$20,000

No Plant

Small Plant

Lar ge

Pla nt

$0

Su rv

ey Re

su lts

Fa vo

ra ble

(0

.4 5) Survey

Results

Negative

(0.55)

C on

du ct

M ar

ke t S

ur ve

y

Do Not Conduct Survey

First Decision Point

Second Decision Point

Payo�s

2

3

5

6

7

4

1

FIGURE 3.4 Larger Decision Tree with Payoffs and Probabilities for Thompson Lumber

M03_REND3161_13_AIE_C03.indd 79 28/10/16 10:19 AM

80  CHAPTER 3 • DECision AnALysis

1. Given favorable survey results,

EMV1node 22 = EMV1large plant � positive survey2 = 10.7821$190,0002 + 10.2221-$190,0002 = $106,400

EMV1node 32 = EMV1small plant � positive survey2 = 10.7821$90,0002 + 10.2221-$30,0002 = $63,600

The EMV of no plant in this case is -$10,000. Thus, if the survey results are favorable, a large plant should be built. Note that we bring the expected value of this decision ($106,400) to the decision node to indicate that if the survey results are positive, our expected value will be $106,400. This is shown in Figure 3.5.

2. Given negative survey results,

EMV1node 42 = EMV1large plant � negative survey2 = 10.2721$190,0002 + 10.7321-$190,0002 = -$87,400

EMV1node 52 = EMV1small plant � negative survey2 = 10.2721$90,0002 + 10.7321-$30,0002 = $2,400

EMV calculations for favorable survey results are made first.

Su rv

ey Re

su lts

Fa vo

ra ble

(0. 45

)

Favorable Market (0.78) $190,000

Unfavorable Market (0.22) –$190,000

Favorable Market (0.78) $90,000

Unfavorable Market (0.22) –$30,000

No Plant

Small Plant

Lar ge

Pla nt

–$10,000

Favorable Market (0.27) $190,000

Unfavorable Market (0.73) –$190,000

Favorable Market (0.27) $90,000

Unfavorable Market (0.73) –$30,000

No Plant

Small Plant

–$10,000

Favorable Market (0.50) $200,000

Unfavorable Market (0.50) –$180,000

Favorable Market (0.50) $100,000

Unfavorable Market (0.50) –$20,000

No Plant

Small Plant

$0

Survey

Results

Negative

(0.55)

C on

du ct

M ar

ke t S

ur ve

y

Do Not Conduct Survey

First Decision Point

Second Decision Point

Payo�s

$106,400

$63,600

–$87,400

$2,400

$10,000

Lar ge

Pla nt

Lar ge

Pla nt

$40,000

49,200

2

3

5

6

7

1

4

$4 0,

00 0

$2 ,4

00 $1

06 ,4

00

$4 9,

20 0

FIGURE 3.5 Thompson’s Decision Tree with EMVs shown

M03_REND3161_13_AIE_C03.indd 80 28/10/16 10:19 AM

3.6 DECision TREEs  81

The EMV of no plant is again -$10,000 for this branch. Thus, given a negative survey result, John should build a small plant with an expected value of $2,400, and this figure is indicated at the decision node.

3. Continuing on the upper part of the tree and moving backward, we compute the expected value of conducting the market survey:

EMV1node 12 = EMV1conduct survey2 = 10.4521$106,4002 + 10.5521$2,4002 = $47,880 + $1,320 = $49,200

4. If the market survey is not conducted,

EMV1node 62 = EMV1large plant2 = 10.5021$200,0002 + 10.5021-$180,0002 = $10,000

EMV1node 72 = EMV1small plant2 = 10.5021$100,0002 + 10.5021-$20,0002 = $40,000

The EMV of no plant is $0. Thus, building a small plant is the best choice, given that the marketing research is not

performed, as we saw earlier. 5. We move back to the first decision node and choose the best alternative. The EMV of con-

ducting the survey is $49,200, versus an EMV of $40,000 for not conducting the study, so the best choice is to seek marketing information. If the survey results are favorable, John should construct a large plant, but if the research is negative, John should construct a small plant.

In Figure 3.5, these expected values are placed on the decision tree. Notice on the tree that a pair of slash lines / / through a decision branch indicates that particular alternative is dropped from further consideration. This is because its EMV is lower than the EMV for the best alterna- tive. After you have solved several decision tree problems, you may find it easier to do all of your computations on the tree diagram.

EXPECTED VALUE OF SAMPLE INFORMATION With the market survey he intends to conduct, John Thomp- son knows that his best decision will be to build a large plant if the survey is favorable or a small plant if the survey results are negative. But John also realizes that conducting the market research is not free. He would like to know what the actual value of doing a survey is. One way of measuring the value of market information is to compute the expected value of sample information (EVSI), which is the increase in expected value resulting from the sample information.

The expected value with sample information (EV with SI) is found from the decision tree, and the cost of the sample information is added to this, since this was subtracted from all the payoffs before the EV with SI was calculated. The expected value without sample information (EV without SI) is then subtracted from this to find the value of the sample information.

EVSI = 1EV with SI + cost2 - 1EV without SI2 (3-4) where

EVSI = expected value of sample information EV with SI = expected value with sample information EV without SI = expected value without sample information

In John’s case, his EMV would be $59,200 if he hadn’t already subtracted the $10,000 study cost from each payoff. (Do you see why this is so? If not, add $10,000 back into each payoff, as in the original Thompson problem, and recompute the EMV of conducting the market study.) From the lower branch of Figure 3.5, we see that the EMV of not gathering the sample informa- tion is $40,000. Thus,

EVSI = 1$49,200 + $10,0002 - $40,000 = $59,200 - $40,000 = $19,200

EMV calculations for unfavorable survey results are done next.

We continue working backward to the origin, computing EMV values.

EVSI measures the value of sample information.

M03_REND3161_13_AIE_C03.indd 81 28/10/16 10:19 AM

82  CHAPTER 3 • DECision AnALysis

This means that John could have paid up to $19,200 for a market study and still come out ahead. Since it costs only $10,000, the survey is indeed worthwhile.

Efficiency of Sample Information There may be many types of sample information available to a decision maker. In developing a new product, information could be obtained from a survey, from a focus group, from other market research techniques, or from actual use of a test market to see how sales will be. While none of these sources of information are perfect, they can be evaluated by comparing the EVSI with the EVPI. If the sample information was perfect, then the efficiency would be 100%. The efficiency of sample information is

Efficiency of sample information = EVSI

EVPI 100% (3-5)

In the Thompson Lumber example,

Efficiency of sample information = 19,200

60,000 100% = 32%

Thus, the market survey is only 32% as efficient as perfect information.

Sensitivity Analysis As with payoff tables, sensitivity analysis can be applied to decision trees as well. The overall approach is the same. Consider the decision tree for the expanded Thompson Lumber problem shown in Figure 3.5. How sensitive is our decision (to conduct the marketing survey) to the probability of favorable survey results?

Let p be the probability of favorable survey results. Then 11 - p2 is the probability of nega- tive survey results. Given this information, we can develop an expression for the EMV of con- ducting the survey, which is node 1:

EMV1node 12 = 1$106,4002p + 1$2,400211 - p2 = $104,000p + $2,400

We are indifferent when the EMV of conducting the marketing survey, node 1, is the same as the EMV of not conducting the survey, which is $40,000. We can find the indifference point by equating EMV(node 1) to $40,000:

$104,000p + $2,400 = $40,000 $104,000p = $37,600

p = $37,600

$104,000 = 0.36

As long as the probability of favorable survey results, p, is greater than 0.36, our decision will stay the same. When p is less than 0.36, our decision will be not to conduct the survey.

We could also perform sensitivity analysis for other problem parameters. For example, we could find how sensitive our decision is to the probability of a favorable market given favorable survey results. At this time, this probability is 0.78. If this value goes up, the large plant becomes more attractive. In this case, our decision would not change. What happens when this probabil- ity goes down? The analysis becomes more complex. As the probability of a favorable market (given favorable survey) result goes down, the small plant becomes more attractive. At some point, the small plant will result in a higher EMV (given favorable survey results) than the large plant. This, however, does not conclude our analysis. As the probability of a favorable market (given favorable survey results) continues to fall, there will be a point where not conducting the survey, with an EMV of $40,000, will be more attractive than conducting the marketing survey. We leave the actual calculations to you. It is important to note that sensitivity analysis should consider all possible consequences.

M03_REND3161_13_AIE_C03.indd 82 28/10/16 10:19 AM

3.7 HoW PRoBABiLiTy VALUEs ARE EsTiMATED By BAyEsiAn AnALysis  83

3.7 How Probability Values Are Estimated by Bayesian Analysis

There are many ways of getting probability data for a problem such as Thompson’s. The num- bers (such as 0.78, 0.22, 0.27, and 0.73 in Figure 3.4) can be assessed by a manager based on experience and intuition. They can be derived from historical data, or they can be computed from other available data using Bayes’ Theorem. The advantage of Bayes’ Theorem is that it incorporates both our initial estimates of the probabilities and information about the accuracy of the information source (e.g., market research survey).

The Bayes’ Theorem approach recognizes that a decision maker does not know with cer- tainty what state of nature will occur. It allows the manager to revise his or her initial or prior probability assessments based on new information. The revised probabilities are called posterior probabilities. (Before continuing, you may wish to review Bayes’ Theorem in Chapter 2.)

Calculating Revised Probabilities In the Thompson Lumber case solved in Section 3.7, we made the assumption that the following four conditional probabilities were known:

P1favorable market1FM2 � survey results positive2 = 0.78 P1unfavorable market1UM2 � survey results positive2 = 0.22

P1favorable market1FM2 � survey results negative2 = 0.27 P1unfavorable market1UM2 � survey results negative2 = 0.73

We now show how John Thompson was able to derive these values with Bayes’ Theorem. From discussions with market research specialists at the local university, John knows that special surveys such as his can either be positive (i.e., predict a favorable market) or be negative (i.e., predict an unfavorable market). The experts have told John that, statistically, of all new products with a favorable market (FM), market surveys were positive and predicted success correctly 70% of the time. Thirty percent of the time the surveys falsely predicted negative results or an unfavorable market (UM). On the other hand, when there was actually an unfavorable market for a new product, 80% of the surveys correctly predicted negative results. The surveys incor- rectly predicted positive results the remaining 20% of the time. These conditional probabilities are summarized in Table 3.16. They are an indication of the accuracy of the survey that John is thinking of undertaking.

Recall that without any market survey information, John’s best estimates of a favorable and unfavorable market are

P1FM2 = 0.50 P1UM2 = 0.50

These are referred to as the prior probabilities. We are now ready to compute Thompson’s revised or posterior probabilities. These desired

probabilities are the reverse of the probabilities in Table 3.16. We need the probability of a favor- able or unfavorable market given a positive or negative result from the market study. The general form of Bayes’ Theorem presented in Chapter 2 is

P1A �B2 = P1B �A2P1A2 P1B �A2P1A2 + P1B �A′2P1A′2 (3-6)

Bayes’ Theorem allows decision makers to revise probability values.

TABLE 3.16 Market survey Reliability in Predicting states of nature

STATE OF NATURE

RESULT OF SURVEY FAVORABLE MARKET

(FM) UNFAVORABLE MARKET

(UM)

Positive (predicts favorable market for product)

P(survey positive �FM) = 0.70 P(survey positive �UM) = 0.20

Negative (predicts unfavor- able market for product)

P(survey negative �FM) = 0.30 P(survey negative �UM) = 0.80

M03_REND3161_13_AIE_C03.indd 83 28/10/16 10:19 AM

84  CHAPTER 3 • DECision AnALysis

success drop to 27% if the survey report is negative. This is valuable management information, as we saw in the earlier decision tree analysis.

Potential Problem in Using Survey Results In many decision-making problems, survey results or pilot studies are done before an actual decision (such as building a new plant or taking a particular course of action) is made. As dis- cussed earlier in this section, Bayes’ analysis is used to help determine the correct conditional probabilities that are needed to solve these types of decision theory problems. In computing these conditional probabilities, we need to have data about the surveys and their accuracies. If a decision to build a plant or to take another course of action is actually made, we can determine the accuracy of our surveys. Unfortunately, we cannot always get data about those situations in which the decision was not to build a plant or not to take some course of action. Thus, some- times when we use survey results, we are basing our probabilities only on those cases in which a decision to build a plant or take some course of action is actually made. This means that, in some situations, conditional probability information may not be not quite as accurate as we would like. Even so, calculating conditional probabilities helps to refine the decision-making process and, in general, to make better decisions.

New probabilities provide valuable information.

where

A, B = any two events A′ = complement of A

We can let A represent a favorable market and B represent a positive survey. Then, substitut- ing the appropriate numbers into this equation, we obtain the conditional probabilities given that the market survey is positive:

P1FM � survey positive2 = P1survey positive �FM2P1FM2 P1survey positive �FM2P1FM2 + P1survey positive �UM2P1UM2

= 10.70210.502

10.70210.502 + 10.20210.502 = 0.35

0.45 = 0.78

P1UM � survey positive2 = P1survey positive �UM2P1UM2 P1survey positive �UM2P1UM2 + P1survey positive �FM2P1FM2

= 10.20210.502

10.20210.502 + 10.70210.502 = 0.10

0.45 = 0.22

Note that the denominator (0.45) in these calculations is the probability of a positive survey. An alternative method for these calculations is to use a probability table as shown in Table 3.17.

The conditional probabilities, given that the market survey is negative, are

P1FM � survey negative2 = P1survey negative �FM2P1FM2 P1survey negative �FM2P1FM2 + P1survey negative �UM2P1UM2

= 10.30210.502

10.30210.502 + 10.80210.502 = 0.15

0.55 = 0.27

P1UM � survey negative2 = P1survey negative �UM2P1UM2 P1survey negative �UM2P1UM2 + P1survey negative �FM2P1FM2

= 10.80210.502

10.80210.502 + 10.30210.502 = 0.40

0.55 = 0.73

Note that the denominator (0.55) in these calculations is the probability of a negative survey. These computations could also have been performed in a table instead, as in Table 3.18.

The calculations shown in Tables 3.17 and 3.18 can easily be performed in Excel spread- sheets. Programs 3.3A and 3.3B show the final output for this example and the formulas.

The posterior probabilities now provide John Thompson with estimates for each state of nature if the survey results are positive or negative. As you know, John’s prior probability of success without a market survey was only 0.50. Now he is aware that the probability of success- fully marketing storage sheds will be 0.78 if his survey shows positive results. His chances of

TABLE 3.17 Probability Revisions Given a Positive survey

POSTERIOR PROBABILITY

STATE OF NATURE

CONDITIONAL PROBABILITY

P(SURVEY POSITIVE � STATE OF NATURE) PRIOR PROBABILITY

JOINT PROBABILITY

P(STATE OF NATURE � SURVEY

POSITIVE)

FM 0.70 * 0.50 = 0.35 0.35/0.45 = 0.78 UM 0.20 * 0.50 = 0.10 0.10/0.45 = 0.22

P(survey results positive) = 0.45 1.00

M03_REND3161_13_AIE_C03.indd 84 28/10/16 10:19 AM

3.7 HoW PRoBABiLiTy VALUEs ARE EsTiMATED By BAyEsiAn AnALysis  85

success drop to 27% if the survey report is negative. This is valuable management information, as we saw in the earlier decision tree analysis.

Potential Problem in Using Survey Results In many decision-making problems, survey results or pilot studies are done before an actual decision (such as building a new plant or taking a particular course of action) is made. As dis- cussed earlier in this section, Bayes’ analysis is used to help determine the correct conditional probabilities that are needed to solve these types of decision theory problems. In computing these conditional probabilities, we need to have data about the surveys and their accuracies. If a decision to build a plant or to take another course of action is actually made, we can determine the accuracy of our surveys. Unfortunately, we cannot always get data about those situations in which the decision was not to build a plant or not to take some course of action. Thus, some- times when we use survey results, we are basing our probabilities only on those cases in which a decision to build a plant or take some course of action is actually made. This means that, in some situations, conditional probability information may not be not quite as accurate as we would like. Even so, calculating conditional probabilities helps to refine the decision-making process and, in general, to make better decisions.

New probabilities provide valuable information.

PROGRAM 3.3A Results of Bayes’ Calculations in Excel 2016

PROGRAM 3.3B Formulas Used for Bayes’ Calculations in Excel 2016

TABLE 3.18 Probability Revisions Given a negative survey

POSTERIOR PROBABILITY

STATE OF NATURE

CONDITIONAL PROBABILITY

P(SURVEY NEGATIVE � STATE OF NATURE) PRIOR PROBABILITY

JOINT PROBABILITY

P(STATE OF NATURE � SURVEY

NEGATIVE)

FM 0.30 * 0.50 = 0.15 0.15/0.55 = 0.27 UM 0.80 * 0.50 = 0.40 0.40/0.55 = 0.73

P(survey results negative) = 0.55 1.00

M03_REND3161_13_AIE_C03.indd 85 28/10/16 10:19 AM

86  CHAPTER 3 • DECision AnALysis

for the best outcome is greater than the utility for the worst outcome, using 0 and 1 has some benefits. Because we have chosen to use 0 and 1, all other outcomes will have a utility value be- tween 0 and 1. In determining the utilities of all outcomes, other than the best or worst outcome, a standard gamble is considered. This gamble is shown in Figure 3.7.

In Figure 3.7, p is the probability of obtaining the best outcome, and 11 - p2 is the prob- ability of obtaining the worst outcome. Assessing the utility of any other outcome involves deter- mining the probability (p) that makes you indifferent between alternative 1, which is the gamble between the best and worst outcomes, and alternative 2, which is obtaining the other outcome for sure. When you are indifferent between alternatives 1 and 2, the expected utilities for these two alternatives must be equal. This relationship is shown as

Expected utility of alternative 2 = Expected utility of alternative 1 Utility of other outcome = 1p21Utility of best outcome, which is 12

+ 11 - p21Utility of the worst outcome, which is 02 Utility of other outcome = 1p2112 + 11 - p2102 = p (3-7)

Now all you have to do is to determine the value of the probability (p) that makes you indif- ferent between alternatives 1 and 2. In setting the probability, you should be aware that utility assessment is completely subjective. It’s a value set by the decision maker that can’t be mea- sured on an objective scale. Let’s take a look at an example.

Jane Dickson would like to construct a utility curve revealing her preference for money be- tween $0 and $10,000. A utility curve is a graph that plots utility value versus monetary value. She can invest her money either in a bank savings account or in a real estate deal.

If the money is invested in the bank, in 3 years Jane would have $5,000. If she invested in the real estate, after 3 years she could either have nothing or have $10,000. Jane, however, is very conservative. Unless there is an 80% chance of getting $10,000 from the real estate deal, Jane would prefer to have her money in the bank, where it is safe. What Jane has done here is to assess her utility for $5,000. When there is an 80% chance (this means that p is 0.8) of getting $10,000, Jane is indifferent between putting her money in real estate and putting it in the bank. Jane’s utility for $5,000 is thus equal to 0.8, which is the same as the value for p. This utility assessment is shown in Figure 3.8.

Other utility values can be assessed in the same way. For example, what is Jane’s utility for $7,000? What value of p would make Jane indifferent between $7,000 and the gamble that would result in either $10,000 or $0? For Jane, there must be a 90% chance of getting the $10,000. Otherwise, she would prefer the $7,000 for sure. Thus, her utility for $7,000 is 0.90. Jane’s utility for $3,000 can be determined in the same way. If there were a 50% chance of obtaining the $10,000, Jane would be indifferent between having $3,000 for sure and taking the gamble of either winning the $10,000 or getting nothing. Thus, the utility of $3,000 for Jane is 0.5. Of course, this process can be continued until Jane has assessed her utility for as many monetary values as she wants. These assessments, however, are enough to get an idea of Jane’s feelings toward risk. In fact, we can plot these points in a utility curve, as is done in Figure 3.9. In the figure, the assessed utility points of $3,000, $5,000, and $7,000 are shown by dots, and the rest of the curve is inferred from these.

Utility assessment assigns the worst outcome a utility of 0 and the best outcome a utility of 1.

When you are indifferent, the expected utilities are equal.

Once utility values have been determined, a utility curve can be constructed.

3.8 Utility Theory

We have focused on the EMV criterion for making decisions under risk. However, there are many occasions in which people make decisions that would appear to be inconsistent with the EMV criterion. When people buy insurance, the amount of the premium is greater than the ex- pected payout to them from the insurance company because the premium includes the expected payout, the overhead cost, and the profit for the insurance company. A person involved in a lawsuit may choose to settle out of court rather than go to trial even if the expected value of go- ing to trial is greater than the proposed settlement. A person buys a lottery ticket even though the expected return is negative. Casino games of all types have negative expected returns for the player, and yet millions of people play these games. A businessperson may rule out one potential decision because it could bankrupt the firm if things go bad, even though the expected return for this decision is better than that of all other alternatives.

Why do people make decisions that don’t maximize their EMV? They do this because the monetary value is not always a true indicator of the overall value of the result of the decision. The overall worth of a particular outcome is called utility, and rational people make decisions that maximize the expected utility. Although at times the monetary value is a good indicator of utility, there are other times when it is not. This is particularly true when some of the values involve an extremely large payoff or an extremely large loss. Suppose that you are the lucky holder of a lottery ticket. Five minutes from now a fair coin could be flipped, and if it comes up tails, you would win $5 million. If it comes up heads, you would win nothing. Just a moment ago a wealthy person offered you $2 million for your ticket. Let’s assume that you have no doubts about the validity of the offer. The person will give you a certified check for the full amount, and you are absolutely sure the check would be good.

A decision tree for this situation is shown in Figure 3.6. The EMV for rejecting the offer indicates that you should hold on to your ticket, but what would you do? Just think, $2 million for sure instead of a 50% chance at nothing. Suppose you were greedy enough to hold on to the ticket, and then lost. How would you explain that to your friends? Wouldn’t $2 million be enough to be comfortable for a while?

Most people would choose to sell the ticket for $2 million. Most of us, in fact, would proba- bly be willing to settle for a lot less. Just how low we would go is, of course, a matter of personal preference. People have different feelings about seeking or avoiding risk. Using the EMV alone is not always a good way to make these types of decisions.

One way to incorporate your own attitudes toward risk is through utility theory. In the next section, we explore first how to measure utility and then how to use utility measures in decision making.

Measuring Utility and Constructing a Utility Curve The first step in using utility theory is to assign utility values to each monetary value in a given situation. It is convenient to begin utility assessment by assigning the worst outcome a utility of 0 and the best outcome a utility of 1. Although any values may be used as long as the utility

The overall value of the result of a decision is called utility.

EMV is not always the best approach.

Accept O�er

Reject O�er

$2,000,000

$0

Heads (0.5)

Tails (0.5)

$5,000,000EMV = $2,500,000

FIGURE 3.6 your Decision Tree for the Lottery Ticket

M03_REND3161_13_AIE_C03.indd 86 28/10/16 10:19 AM

3.8 UTiLiTy THEoRy  87

for the best outcome is greater than the utility for the worst outcome, using 0 and 1 has some benefits. Because we have chosen to use 0 and 1, all other outcomes will have a utility value be- tween 0 and 1. In determining the utilities of all outcomes, other than the best or worst outcome, a standard gamble is considered. This gamble is shown in Figure 3.7.

In Figure 3.7, p is the probability of obtaining the best outcome, and 11 - p2 is the prob- ability of obtaining the worst outcome. Assessing the utility of any other outcome involves deter- mining the probability (p) that makes you indifferent between alternative 1, which is the gamble between the best and worst outcomes, and alternative 2, which is obtaining the other outcome for sure. When you are indifferent between alternatives 1 and 2, the expected utilities for these two alternatives must be equal. This relationship is shown as

Expected utility of alternative 2 = Expected utility of alternative 1 Utility of other outcome = 1p21Utility of best outcome, which is 12

+ 11 - p21Utility of the worst outcome, which is 02 Utility of other outcome = 1p2112 + 11 - p2102 = p (3-7)

Now all you have to do is to determine the value of the probability (p) that makes you indif- ferent between alternatives 1 and 2. In setting the probability, you should be aware that utility assessment is completely subjective. It’s a value set by the decision maker that can’t be mea- sured on an objective scale. Let’s take a look at an example.

Jane Dickson would like to construct a utility curve revealing her preference for money be- tween $0 and $10,000. A utility curve is a graph that plots utility value versus monetary value. She can invest her money either in a bank savings account or in a real estate deal.

If the money is invested in the bank, in 3 years Jane would have $5,000. If she invested in the real estate, after 3 years she could either have nothing or have $10,000. Jane, however, is very conservative. Unless there is an 80% chance of getting $10,000 from the real estate deal, Jane would prefer to have her money in the bank, where it is safe. What Jane has done here is to assess her utility for $5,000. When there is an 80% chance (this means that p is 0.8) of getting $10,000, Jane is indifferent between putting her money in real estate and putting it in the bank. Jane’s utility for $5,000 is thus equal to 0.8, which is the same as the value for p. This utility assessment is shown in Figure 3.8.

Other utility values can be assessed in the same way. For example, what is Jane’s utility for $7,000? What value of p would make Jane indifferent between $7,000 and the gamble that would result in either $10,000 or $0? For Jane, there must be a 90% chance of getting the $10,000. Otherwise, she would prefer the $7,000 for sure. Thus, her utility for $7,000 is 0.90. Jane’s utility for $3,000 can be determined in the same way. If there were a 50% chance of obtaining the $10,000, Jane would be indifferent between having $3,000 for sure and taking the gamble of either winning the $10,000 or getting nothing. Thus, the utility of $3,000 for Jane is 0.5. Of course, this process can be continued until Jane has assessed her utility for as many monetary values as she wants. These assessments, however, are enough to get an idea of Jane’s feelings toward risk. In fact, we can plot these points in a utility curve, as is done in Figure 3.9. In the figure, the assessed utility points of $3,000, $5,000, and $7,000 are shown by dots, and the rest of the curve is inferred from these.

Utility assessment assigns the worst outcome a utility of 0 and the best outcome a utility of 1.

When you are indifferent, the expected utilities are equal.

Once utility values have been determined, a utility curve can be constructed.

Other Outcome Utility = ?

(p)

Alte rna

tive 1

Alternative 2

(1 – p) Worst Outcome Utility = 0

Best Outcome Utility = 1

FIGURE 3.7 standard Gamble for Utility Assessment

M03_REND3161_13_AIE_C03.indd 87 28/10/16 10:19 AM

88  CHAPTER 3 • DECision AnALysis

computed instead of the EMV. Let’s take a look at an example in which a decision tree is used and expected utility values are computed in selecting the best alternative.

Mark Simkin loves to gamble. He decides to play a game that involves tossing thumbtacks in the air. If the point on the thumbtack is facing up after it lands, Mark wins $10,000. If the point on the thumbtack is down, Mark loses $10,000. Should Mark play the game (alternative 1), or should he not play the game (alternative 2)?

Alternatives 1 and 2 are displayed in the tree shown in Figure 3.11. As can be seen, alterna- tive 1 is to play the game. Mark believes that there is a 45% chance of winning $10,000 and a 55% chance of suffering the $10,000 loss. Alternative 2 is not to gamble. What should Mark do? Of course, this depends on Mark’s utility for money. As stated previously, he likes to gamble. Using the procedure just outlined, Mark was able to construct a utility curve showing his prefer- ence for money. Mark has a total of $20,000 to gamble, so he has constructed the utility curve based on a best payoff of $20,000 and a worst payoff of a $20,000 loss. This curve appears in Figure 3.12.

We see that Mark’s utility for –$10,000 is 0.05, his utility for not playing ($0) is 0.15, and his utility for $10,000 is 0.30. These values can now be used in the decision tree. Mark’s objec- tive is to maximize his expected utility, which can be done as follows:

Step 1. U1-$10,0002 = 0.05 U1$02 = 0.15

U1$10,0002 = 0.30

Utility values replace monetary values.

Mark’s objective is to maximize expected utility.

Jane’s utility curve is typical of a risk avoider. A risk avoider is a decision maker who gets less utility or pleasure from a greater risk and tends to avoid situations in which high losses might occur. As monetary value increases on her utility curve, the utility increases at a slower rate.

Figure 3.10 illustrates that a person who is a risk seeker has an opposite-shaped utility curve. This decision maker gets more utility from a greater risk and higher potential payoff. As monetary value increases on his or her utility curve, the utility increases at an increasing rate. A person who is indifferent to risk has a utility curve that is a straight line. The shape of a person’s utility curve depends on the specific decision being considered, the monetary values involved in the situation, the person’s psychological frame of mind, and how the person feels about the fu- ture. It may well be that you have one utility curve for some situations you face and completely different curves for others.

Utility as a Decision-Making Criterion After a utility curve has been determined, the utility values from the curve are used in mak- ing decisions. Monetary outcomes or values are replaced with the appropriate utility values, and then decision analysis is performed as usual. The expected utility for each alternative is

The shape of a person’s utility curve depends on many factors.

$5,000 U($5,000) = p = 0.80

p = 0.80

Inv est

in Rea

l Es tate

Invest in Bank

$0 U($0.00) = 0.0

$10,000 U($10,000) = 1.0

Utility for $5,000 = U($5,000) = pU($10,000) + (1 – p) U($0) = (0.8)(1) + (0.2)(0) = 0.8

(1 – p) = 0.20

FIGURE 3.8 Utility of $5,000

$0 $1,000 $3,000 $5,000 $7,000 $10,000

1.0

0.9

0.8

0.7

0.6

0.5

0.4

0.3

0.2

0.1

U til

ity

Monetary Value

U($10,000) = 1.0

U($7,000) = 0.90

U($5,000) = 0.80

U($3,000) = 0.50

U($0) = 0

FIGURE 3.9 Utility Curve for Jane Dickson

M03_REND3161_13_AIE_C03.indd 88 28/10/16 10:19 AM

3.8 UTiLiTy THEoRy  89

computed instead of the EMV. Let’s take a look at an example in which a decision tree is used and expected utility values are computed in selecting the best alternative.

Mark Simkin loves to gamble. He decides to play a game that involves tossing thumbtacks in the air. If the point on the thumbtack is facing up after it lands, Mark wins $10,000. If the point on the thumbtack is down, Mark loses $10,000. Should Mark play the game (alternative 1), or should he not play the game (alternative 2)?

Alternatives 1 and 2 are displayed in the tree shown in Figure 3.11. As can be seen, alterna- tive 1 is to play the game. Mark believes that there is a 45% chance of winning $10,000 and a 55% chance of suffering the $10,000 loss. Alternative 2 is not to gamble. What should Mark do? Of course, this depends on Mark’s utility for money. As stated previously, he likes to gamble. Using the procedure just outlined, Mark was able to construct a utility curve showing his prefer- ence for money. Mark has a total of $20,000 to gamble, so he has constructed the utility curve based on a best payoff of $20,000 and a worst payoff of a $20,000 loss. This curve appears in Figure 3.12.

We see that Mark’s utility for –$10,000 is 0.05, his utility for not playing ($0) is 0.15, and his utility for $10,000 is 0.30. These values can now be used in the decision tree. Mark’s objec- tive is to maximize his expected utility, which can be done as follows:

Step 1. U1-$10,0002 = 0.05 U1$02 = 0.15

U1$10,0002 = 0.30

Utility values replace monetary values.

Mark’s objective is to maximize expected utility.

U til

ity

Monetary Outcome

Risk Avoider

Risk Seeker

Ri sk

In di�

er en

ce

FIGURE 3.10 Preferences for Risk

$0

Tack Lands Point Up (0.45)

Alte rna

tive 1

Ma rk P

lay s th

e G am

e

Alternative 2

–$10,000

$10,000 Tack Lands Point Down (0.55)

Mark Does Not Play the Game

FIGURE 3.11 Decision Facing Mark simkin

M03_REND3161_13_AIE_C03.indd 89 28/10/16 10:19 AM

90  CHAPTER 3 • DECision AnALysis

–$20,000

U til

ity

Monetary Outcome

0.75

1.00

0.50

0.30 0.25

0.15

0.05 0

–$10,000 $0 $10,000 $20,000

FIGURE 3.12 Utility Curve for Mark simkin

Decision Analysis Helps American Airlines Assess Uncertainty of Bid Quotes

American Airlines, Inc. (AA), is the world’s largest airline in pas- senger miles transported with annual revenue of over $21 billion. Although its primary goal is to transport passengers, AA also has to manage ancillary functions such as full-truckload (FTL) freight shipment of maintenance equipment and in-flight service items. The inventory value of these goods as they move point to point worldwide can be over $1 billion at any given time.

Each year AA issues approximately 500 requests for quotes (RFQs) in the bid process for its FTL point-to-point freight ship- ment routes. AA needed a should-cost model to assess these quotes to ensure that it does not overpay its FTL suppliers.

Working with researchers at North Carolina State University, AA developed a decision tree-based analysis that estimates reason- able costs for these shipments. The fully expanded decision tree for this problem has nearly 60,000 end points.

AA has now used this decision tree model on more than 20 RFQs to prioritize its contractual opportunities and obtain accurate assessments of the FTL costs, thus minimizing the risk of overpaying its FTL suppliers.

Source: Based on M. J. Bailey et al., “American Airlines Uses Should-Cost Modeling to Assess the Uncertainty of Bids for Its Full-Truckload Shipment Routes,” Interfaces 41, 2 (March–April 2011): 194–196, © Trevor S. Hale.

IN ACTION

0.15

Tack Lands Point Up (0.45)

Alte rna

tive 1

Pla y th

e G am

e

Alternative 2

0.05

0.30 Tack Lands Point Down (0.55)

Don’t Play

Utility

FIGURE 3.13 Using Expected Utilities in Decision Making

Step 2. Replace monetary values with utility values. Refer to Figure 3.13. Here are the expected utilities for alternatives 1 and 2:

E1alternative 1: play the game2 = 10.45210.302 + 10.55210.052 = 0.135 + 0.027 = 0.162

E1alternative 2: don>t play the game2 = 0.15

M03_REND3161_13_AIE_C03.indd 90 28/10/16 10:19 AM

GLossARy  91

Therefore, alternative 1 is the best strategy using utility as the decision criterion. If EMV had been used, alternative 2 would have been the best strategy. The utility curve is a risk-seeker util- ity curve, and the choice of playing the game certainly reflects this preference for risk.

Decision theory is an analytic and systematic approach to studying decision making. Six steps are usually involved in making decisions in three environments: decision making un- der certainty, uncertainty, and risk. In decision making under uncertainty, decision tables are constructed to compute criteria such as maximax, maximin, criterion of realism, equally likely, and minimax regret. Methods such as determining expected monetary value (EMV), expected value of perfect information (EVPI), expected opportunity loss (EOL), and sensitivity anal- ysis are used in decision making under risk.

Decision trees are another option, particularly for larger decision problems, when one decision must be made before other decisions can be made. For example, a decision to take a sample or to perform market research is made before we decide to construct a large plant, a small one, or no plant. In this case, we can also compute the ex- pected value of sample information (EVSI) to determine the value of the market research. The efficiency of sample information compares the EVSI to the EVPI. Bayesian analysis can be used to revise or update probability values using both the prior probabilities and other probabilities related to the accuracy of the information source.

Summary

Glossary

Alternative A course of action or a strategy that may be chosen by a decision maker.

Coefficient of Realism (A) A number from 0 to 1. When the coefficient is close to 1, the decision criterion is opti- mistic. When the coefficient is close to 0, the decision crite- rion is pessimistic.

Conditional Probability A posterior probability. Conditional Value or Payoff A consequence, normally

expressed in a monetary value, that occurs as a result of a particular alternative and state of nature.

Criterion of Realism A decision-making criterion that uses a weighted average of the best and worst possible payoffs for each alternative.

Decision Making Under Certainty A decision-making environment in which the future outcomes or states of na- ture are known.

Decision Making Under Risk A decision-making environ- ment in which several outcomes or states of nature may occur as a result of a decision or alternative. The probabili- ties of the outcomes or states of nature are known.

Decision Making Under Uncertainty A decision-making environment in which several outcomes or states of nature may occur. The probabilities of these outcomes, however, are not known.

Decision Node (Point) In a decision tree, this is a point where the best of the available alternatives is chosen. The branches represent the alternatives.

Decision Table A payoff table. Decision Theory An analytic and systematic approach to

decision making. Decision Tree A graphical representation of a decision-

making situation. Efficiency of Sample Information A measure of how good

the sample information is relative to perfect information. Equally Likely A decision criterion that places an equal

weight on all states of nature.

Expected Monetary Value (EMV) The average value of a decision if it can be repeated many times. This is determined by multiplying the monetary values by their respective prob- abilities. The results are then added to arrive at the EMV.

Expected Value of Perfect Information (EVPI) The aver- age or expected value of information if it were completely accurate. The increase in EMV that results from having perfect information.

Expected Value of Sample Information (EVSI) The in- crease in EMV that results from having sample or imperfect information.

Expected Value with Perfect Information (EVwPI) The average or expected value of a decision if perfect knowl- edge of the future is available.

Hurwicz Criterion The criterion of realism. Laplace Criterion The equally likely criterion. Maximax An optimistic decision-making criterion. This

selects the alternative with the highest possible return. Maximin A pessimistic decision-making criterion. This

alternative maximizes the minimum payoff. It selects the alternative with the best of the worst possible payoffs.

Minimax Regret A criterion that minimizes the maximum opportunity loss.

Opportunity Loss The amount you would lose by not pick- ing the best alternative. For any state of nature, this is the difference between the consequences of any alternative and the best possible alternative.

Optimistic Criterion The maximax criterion. Payoff Table A table that lists the alternatives, states of

nature, and payoffs in a decision-making situation. Posterior Probability A conditional probability of a state of

nature that has been adjusted based on sample information. This is found using Bayes’ Theorem.

Prior Probability The initial probability of a state of nature before sample information is used with Bayes’ Theorem to obtain the posterior probability.

Regret Opportunity loss.

M03_REND3161_13_AIE_C03.indd 91 28/10/16 10:19 AM

92  CHAPTER 3 • DECision AnALysis

Risk Avoider A person who avoids risk. On the utility curve, as the monetary value increases, the utility increases at a decreasing rate. This decision maker gets less utility for a greater risk and higher potential returns.

Risk Seeker A person who seeks risk. On the utility curve, as the monetary value increases, the utility increases at an increasing rate. This decision maker gets more utility for a greater risk and higher potential returns.

Sequential Decisions Decisions in which the outcome of one decision influences other decisions.

Standard Gamble The process used to determine utility values.

State of Nature An outcome or occurrence over which the decision maker has little or no control.

State-of-Nature Node (Point) In a decision tree, a point where the EMV is computed. The branches coming from this node represent states of nature.

Utility The overall value or worth of a particular outcome. Utility Assessment The process of determining the utility of

various outcomes. This is normally done using a standard gamble between any outcome for sure and a gamble be- tween the worst and best outcomes.

Utility Curve A graph or curve that reveals the relationship between utility and monetary values. When this curve has been constructed, utility values from the curve can be used in the decision-making process.

Utility Theory A theory that allows decision makers to incorporate their risk preference and other factors into the decision-making process.

Weighted Average Criterion Another name for the criterion of realism.

Key Equations

(3-1) EMV1alternative i2 = gXiP1Xi2 An equation that computes expected monetary value.

(3-2) EVwPI = g1Best payoff in state of nature i2 * 1Probability of state of nature i2

An equation that computes the expected value with perfect information.

(3-3) EVPI = EVwPI - Best EMV

An equation that computes the expected value of perfect information.

(3-4) EVSI = 1EV with SI + cost2 - 1EV without SI2

An equation that computes the expected value (EV) of sample information (SI).

(3-5) Efficiency of sample information = EVSI

EVPI 100%

An equation that compares sample information to perfect information.

(3-6) P1A �B2 = P1B �A2P1A2 P1B �A2P1A2 + P1B �A′2P1A′2

Bayes’ Theorem—the conditional probability of event A given that event B has occurred.

(3-7) Utility of other outcome = 1p2112 + 11 - p2102 = p

An equation that determines the utility of an intermediate outcome.

Solved Problems

Solved Problem 3-1 Maria Rojas is considering the possibility of opening a small dress shop on Fairbanks Avenue, a few blocks from the university. She has located a good mall that attracts students. Her options are to open a small shop, a medium-sized shop, or no shop at all. The market for a dress shop can be good, aver- age, or bad. The probabilities for these three possibilities are 0.2 for a good market, 0.5 for an average market, and 0.3 for a bad market. The net profit or loss figures for the medium-sized and small shops for the various market conditions are given in the following table. Building no shop at all yields no loss and no gain.

a. What do you recommend? b. Calculate the EVPI. c. Develop the opportunity loss table for this situation. What decisions would be made using the

minimax regret criterion and the minimum EOL criterion?

M03_REND3161_13_AIE_C03.indd 92 28/10/16 10:19 AM

soLVED PRoBLEMs  93

ALTERNATIVE

GOOD MARKET

($)

AVERAGE MARKET

($)

BAD MARKET

($)

Small shop 75,000 25,000 –40,000

Medium-sized shop 100,000 35,000 –60,000

No shop 0 0 0

Solution

a. Since the decision-making environment is risk (probabilities are known), it is appropriate to use the EMV criterion. The problem can be solved by developing a payoff table that contains all alternatives, states of nature, and probability values. The EMV for each alternative is also com- puted, as in the following table:

STATE OF NATURE

ALTERNATIVE GOOD

MARKET ($) AVERAGE

MARKET ($) BAD

MARKET ($) EMV ($)

Small shop 75,000 25,000 –40,000 15,500

Medium-sized shop 100,000 35,000 –60,000 19,500

No shop 0 0 0 0

Probabilities 0.20 0.50 0.30

EMV1small shop2 = 10.221$75,0002 + 10.521$25,0002 + 10.321-$40,0002 = $15,500 EMV1medium shop2 = 10.221$100,0002 + 10.521$35,0002 + 10.321-$60,0002 = $19,500

EMV1no shop2 = 10.221$02 + 10.521$02 + 10.321$02 = $0 As can be seen, the best decision is to build the medium-sized shop. The EMV for this alternative is $19,500.

b. EVwPI = 10.22$100,000 + 10.52$35,000 + 10.32$0 = $37,500 EVPI = $37,500 - $19,500 = $18,000

c. The opportunity loss table is shown here.

STATE OF NATURE

ALTERNATIVE

GOOD MARKET

($)

AVERAGE MARKET

($)

BAD MARKET

($) MAXIMUM

($) EOL ($)

Small shop 25,000 10,000 40,000 40,000 22,000

Medium-sized shop 0 0 60,000 60,000 18,000

No shop 100,000 35,000 0 100,000 37,500

Probabilities 0.20 0.50 0.30

The best payoff in a good market is 100,000, so the opportunity losses in the first column indicate how much worse each payoff is than 100,000. The best payoff in an average market is 35,000, so the opportunity losses in the second column indicate how much worse each payoff is than 35,000. The best payoff in a bad market is 0, so the opportunity losses in the third column indicate how much worse each payoff is than 0.

The minimax regret criterion considers the maximum regret for each decision, and the decision corresponding to the minimum of these is selected. The decision would be to build a small shop, since

M03_REND3161_13_AIE_C03.indd 93 28/10/16 10:19 AM

94  CHAPTER 3 • DECision AnALysis

the maximum regret for this is 40,000, while the maximum regret for each of the other two alterna- tives is higher, as shown in the opportunity loss table.

The decision based on the EOL criterion would be to build the medium shop. Note that the mini- mum EOL ($18,000) is the same as the EVPI computed in part (b). The calculations are

EOL1small2 = 10.2225,000 + 10.5210,000 + 10.3240,000 = 22,000 EOL1medium2 = 10.220 + 10.520 + 10.3260,000 = 18,000 EOL1no shop2 = 10.22100,000 + 10.5235,000 + 10.320 = 37,500

Solved Problem 3-2 Cal Bender and Becky Addison have known each other since high school. Two years ago they entered the same university and today they are taking undergraduate courses in the business school. Both hope to graduate with degrees in finance. In an attempt to make extra money and to use some of the knowledge gained from their business courses, Cal and Becky have decided to look into the possibil- ity of starting a small company that would provide word processing services to students who needed term papers or other reports prepared in a professional manner. Using a systems approach, Cal and Becky have identified three strategies. Strategy 1 is to invest in a fairly expensive microcomputer sys- tem with a high-quality laser printer. In a favorable market, they should be able to obtain a net profit of $10,000 over the next 2 years. If the market is unfavorable, they can lose $8,000. Strategy 2 is to purchase a less expensive system. With a favorable market, they could get a return during the next 2 years of $8,000. With an unfavorable market, they would incur a loss of $4,000. Their final strategy, strategy 3, is to do nothing. Cal is basically a risk taker, whereas Becky tries to avoid risk.

a. What type of decision procedure should Cal use? What would Cal’s decision be? b. What type of decision maker is Becky? What decision would Becky make? c. If Cal and Becky were indifferent to risk, what type of decision approach should they use? What

would you recommend if this were the case?

Solution The problem is one of decision making under uncertainty. Before answering the specific ques- tions, a decision table should be developed showing the alternatives, states of nature, and related consequences.

ALTERNATIVE

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

Strategy 1 10,000 –8,000

Strategy 2 8,000 –4,000

Strategy 3 0 0

a. Since Cal is a risk taker, he should use the maximax decision criteria. This approach selects the row that has the highest or maximum value. The $10,000 value, which is the maximum value from the table, is in row 1. Thus, Cal’s decision is to select strategy 1, which is an optimistic decision approach.

b. Becky should use the maximin decision criteria because she wants to avoid risk. The minimum or worst outcome for each row, or strategy, is identified. These outcomes are -$8,000 for strategy 1, -$4,000 for strategy 2, and $0 for strategy 3. The maximum of these values is selected. Thus, Becky would select strategy 3, which reflects a pessimistic decision approach.

c. If Cal and Becky are indifferent to risk, they could use the equally likely approach. This approach selects the alternative that maximizes the row averages. The row average for strategy 1 is $1,000 3i.e., $1,000 = 1$10,000 - $8,0002>24. The row average for strategy 2 is $2,000, and the row average for strategy 3 is $0. Thus, using the equally likely approach, the decision is to select strategy 2, which maximizes the row averages.

M03_REND3161_13_AIE_C03.indd 94 28/10/16 10:19 AM

soLVED PRoBLEMs  95

Solved Problem 3-3 Monica Britt has enjoyed sailing small boats since she was 7 years old, when her mother started sail- ing with her. Today, Monica is considering the possibility of starting a company to produce small sail- boats for the recreational market. Unlike other mass-produced sailboats, however, these boats will be made specifically for children between the ages of 10 and 15. The boats will be of the highest quality and extremely stable, and the sail size will be reduced to prevent problems of capsizing.

Her basic decision is whether to build a large manufacturing facility, a small manufacturing facil- ity, or no facility at all. With a favorable market, Monica can expect to make $90,000 from the large facility or $60,000 from the smaller facility. If the market is unfavorable, however, Monica estimates that she would lose $30,000 with a large facility and she would lose only $20,000 with the small facility. Because of the expense involved in developing the initial molds and acquiring the neces- sary equipment to produce fiberglass sailboats for young children, Monica has decided to conduct a pilot study to make sure that the market for the sailboats will be adequate. She estimates that the pilot study will cost her $10,000. Furthermore, the pilot study can be either favorable or unfavorable. Monica estimates that the probability of a favorable market, given a favorable pilot study, is 0.8. The probability of an unfavorable market, given an unfavorable pilot study, is estimated to be 0.9. Monica feels that there is a 0.65 chance that the pilot study will be favorable. Of course, Monica could bypass the pilot study and simply make the decision as to whether to build a large plant, small plant, or no facility at all. Without doing any testing in a pilot study, she estimates that the probability of a favor- able market is 0.6. What do you recommend? Compute the EVSI.

Solution Before Monica starts to solve this problem, she should develop a decision tree that shows all alterna- tives, states of nature, probability values, and economic consequences. This decision tree is shown in Figure 3.14.

(0.6) Market Favorable

(0.6) Market Favorable

Do Not Conduct Study

Conduct Study

(0.35)

U nfavorable

Study

(0 .6

5) F

av or

ab le

St

ud y

(0.4) Market Unfavorable

(0.4) Market Unfavorable

$60,000

–$20,000

$90,000

–$30,000

No Facility

(0.8) Market Favorable

(0.8) Market Favorable

(0.2) Market Unfavorable

(0.2) Market Unfavorable

No Facility

(0.1) Market Favorable

(0.1) Market Favorable

(0.9) Market Unfavorable

(0.9) Market Unfavorable

No Facility

Sma ll Fa

cility

Large Facility

Sma ll Fa

cility

Large Facility

Sma ll Fa

cility

Large Facility

$0

2

3

$50,000

–$30,000

$80,000

–$40,000

–$10,000

4

5

$50,000

–$30,000

$80,000

–$40,000

–$10,000

6

1

7

A

B

C

D

FIGURE 3.14 Monica’s Decision Tree, Listing Alternatives, states of nature, Probability Values, and Financial outcomes for solved Problem 3-3

M03_REND3161_13_AIE_C03.indd 95 28/10/16 10:19 AM

96  CHAPTER 3 • DECision AnALysis

The EMV at each of the numbered nodes is calculated as follows:

EMV1node 22 = 60,00010.62 + 1-20,00020.4 = 28,000 EMV1node 32 = 90,00010.62 + 1-30,00020.4 = 42,000 EMV1node 42 = 50,00010.82 + 1-30,00020.2 = 34,000 EMV1node 52 = 80,00010.82 + 1-40,00020.2 = 56,000 EMV1node 62 = 50,00010.12 + 1-30,00020.9 = -22,000 EMV1node 72 = 80,00010.12 + 1-40,00020.9 = -28,000 EMV1node 12 = 56,00010.652 + 1-10,00020.35 = 32,900

At each of the square nodes with letters, the decisions would be:

Node B: Choose Large Facility, since the EMV = $42,000.

Node C: Choose Large Facility, since the EMV = $56,000.

Node D: Choose No Facility, since the EMV = -$10,000.

Node A: Choose Do Not Conduct Study, since the EMV 1$42,0002 for this is higher than the EMV ($32,000) for node 1.

Based on the EMV criterion, Monica would select Do Not Conduct Study and then select Large Facility. The EMV of this decision is $42,000. Choosing to conduct the study would result in an EMV of only $32,900. Thus, the expected value of sample information is

EVSI = $32,900 + $10,000 - $42,000 = $900

Solved Problem 3-4 Developing a small driving range for golfers of all abilities has long been a desire of John Jenkins. John, however, believes that the chance of a successful driving range is only about 40%. A friend of John’s has suggested that he conduct a survey in the community to get a better feeling of the demand for such a facility. There is a 0.9 probability that the research will be favorable if the driving range facility will be successful. Furthermore, it is estimated that there is a 0.8 probability that the market- ing research will be unfavorable if indeed the facility will be unsuccessful. John would like to deter- mine the chances of a successful driving range given a favorable result from the marketing survey.

Solution This problem requires the use of Bayes’ Theorem. Before we start to solve the problem, we will define the following terms:

P1SF2 = probability of successful driving range facility P1UF2 = probability of unsuccessful driving range facility

P1RF �SF2 = probability that the research will be favorable given a successful driving range facility P1RU �SF2 = probability that the research will be unfavorable given a successful driving range facility P1RU �UF2 = probability that the research will be unfavorable given an unsuccessful driving range facility P1RF �UF2 = probability that the research will be favorable given an unsuccessful driving range facility

Now, we can summarize what we know:

P1SF2 = 0.4 P1RF �SF2 = 0.9

P1RU �UF2 = 0.8

M03_REND3161_13_AIE_C03.indd 96 28/10/16 10:19 AM

From this information we can compute the three additional probabilities that we need to solve the problem:

P1UF2 = 1 - P1SF2 = 1 - 0.4 = 0.6 P1RU �SF2 = 1 - P1RF �SF2 = 1 - 0.9 = 0.1 P1RF �UF2 = 1 - P1RU �UF2 = 1 - 0.8 = 0.2

Now we can put these values into Bayes’ Theorem to compute the desired probability:

P1SF �RF2 = P1RF �SF2 * P1SF2 P1RF �SF2 * P1SF2 + P1RF �UF2 * P1UF2

= 10.9210.42

10.9210.42 + 10.2210.62

= 0.36

10.36 + 0.122 = 0.36

0.48 = 0.75

In addition to using formulas to solve John’s problem, it is possible to perform all calculations in a table:

Revised Probabilities Given a Favorable Research Result

STATE OF NATURE

CONDITIONAL PROBABILITY

PRIOR PROBABILITY

JOINT PROBABILITY

POSTERIOR PROBABILITY

Favorable market 0.9 * 0.4 = 0.36 0.36>0.48 = 0.75

Unfavorable market 0.2 * 0.6 = 0.12 0.12>0.48 = 0.25 0.48

As you can see from the table, the results are the same. The probability of a successful driving range, given a favorable research result, is 0.36>0.48, or 0.75.

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book (see Appendix H) to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. In decision theory terminology, a course of action or a strategy that may be chosen by a decision maker is called

a. a payoff. b. an alternative. c. a state of nature. d. none of the above. 2. In decision theory, probabilities are associated with a. payoffs. b. alternatives. c. states of nature. d. none of the above. 3. If probabilities are available to the decision maker, then

the decision-making environment is called a. certainty. b. uncertainty. c. risk. d. none of the above.

4. Which of the following is a decision-making criterion that is used for decision making under risk?

a. expected monetary value criterion b. Hurwicz criterion (criterion of realism) c. optimistic (maximax) criterion d. equally likely criterion 5. The minimum expected opportunity loss is a. equal to the highest expected payoff. b. greater than the expected value with perfect informa-

tion. c. equal to the expected value of perfect information. d. computed when finding the minimax regret decision. 6. In using the criterion of realism (Hurwicz criterion), the

coefficient of realism (a) a. is the probability of a good state of nature. b. describes the degree of optimism of the decision

maker.

sELF-TEsT  97

M03_REND3161_13_AIE_C03.indd 97 28/10/16 10:19 AM

98  CHAPTER 3 • DECision AnALysis

c. describes the degree of pessimism of the decision maker.

d. is usually less than zero. 7. The most that a person should pay for perfect information

is a. the EVPI. b. the maximum EMV minus the minimum EMV. c. the maximum EOL. d. the maximum EMV. 8. The minimum EOL criterion will always result in the

same decision as a. the maximax criterion. b. the minimax regret criterion. c. the maximum EMV criterion. d. the equally likely criterion. 9. A decision tree is preferable to a decision table when a. a number of sequential decisions are to be made. b. probabilities are available. c. the maximax criterion is used. d. the objective is to maximize regret. 10. Bayes’ Theorem is used to revise probabilities. The new

(revised) probabilities are called a. prior probabilities. b. sample probabilities. c. survey probabilities. d. posterior probabilities. 11. On a decision tree, at each state-of-nature node, a. the alternative with the greatest EMV is selected. b. an EMV is calculated. c. all probabilities are added together. d. the branch with the highest probability is selected. 12. The EVSI a. is found by subtracting the EMV without sample infor-

mation from the EMV with sample information.

b. is always equal to the expected value of perfect infor- mation.

c. equals the EMV with sample information assuming no cost for the information minus the EMV without sam- ple information.

d. is usually negative. 13. The efficiency of sample information a. is the EVSI/(maximum EMV without SI) expressed as

a percentage. b. is the EVPI/EVSI expressed as a percentage. c. would be 100% if the sample information were perfect. d. is computed using only the EVPI and the maximum

EMV. 14. On a decision tree, once the tree has been drawn and the

payoffs and probabilities have been placed on the tree, the analysis (computing EMVs and selecting the best alternative) is done by

a. working backward (starting on the right and moving to the left).

b. working forward (starting on the left and moving to the right).

c. starting at the top of the tree and moving down. d. starting at the bottom of the tree and moving up. 15. In assessing utility values, a. the worst outcome is given a utility of -1. b. the best outcome is given a utility of 0. c. the worst outcome is given a utility of 0. d. the best outcome is given a value of -1. 16. If a rational person selects an alternative that does not

maximize the EMV, we would expect that this alternative a. minimizes the EMV. b. maximizes the expected utility. c. minimizes the expected utility. d. has zero utility associated with each possible payoff.

Discussion Questions and Problems

Discussion Questions 3-1 Give an example of a good decision that you made

that resulted in a bad outcome. Also give an example of a bad decision that you made that had a good out- come. Why was each decision good or bad?

3-2 Describe what is involved in the decision process. 3-3 What is an alternative? What is a state of nature? 3-4 Discuss the differences among decision making

under certainty, decision making under risk, and de- cision making under uncertainty.

3-5 What techniques are used to solve decision-mak- ing problems under uncertainty? Which technique results in an optimistic decision? Which technique results in a pessimistic decision?

3-6 Define opportunity loss. What decision-making cri- teria are used with an opportunity loss table?

3-7 What information should be placed on a decision tree?

3-8 Describe how you would determine the best decision using the EMV criterion with a decision tree.

3-9 What is the difference between prior and posterior probabilities?

3-10 What is the purpose of Bayesian analysis? De- scribe how you would use Bayesian analysis in the decision-making process.

3-11 What is the EVSI? How is this computed? 3-12 How is the efficiency of sample information

computed? 3-13 What is the overall purpose of utility theory? 3-14 Brief ly discuss how a utility function can be

assessed. What is a standard gamble, and how is it used in determining utility values?

3-15 How is a utility curve used in selecting the best deci- sion for a particular problem?

3-16 What is a risk seeker? What is a risk avoider? How do the utility curves for these types of decision mak- ers differ?

M03_REND3161_13_AIE_C03.indd 98 28/10/16 10:19 AM

DisCUssion QUEsTions AnD PRoBLEMs  99

Problems 3-17 Kenneth Brown is the principal owner of Brown Oil,

Inc. After quitting his university teaching job, Ken has been able to increase his annual salary by a fac- tor of over 100. At the present time, Ken is forced to consider purchasing some more equipment for Brown Oil because of competition. His alternatives are shown in the following table:

EQUIPMENT

FAVORABLE MARKET

($)

UNFAVORABLE MARKET

($)

Sub 100 300,000 –200,000

Oiler J 250,000 –100,000

Texan 75,000 –18,000

For example, if Ken purchases a Sub 100 and if there is a favorable market, he will realize a profit of $300,000. On the other hand, if the market is unfa- vorable, Ken will suffer a loss of $200,000. But Ken has always been a very optimistic decision maker.

(a) What type of decision is Ken facing? (b) What decision criterion should he use? (c) What alternative is best?

3-18 Although Ken Brown (discussed in Problem 3-17) is the principal owner of Brown Oil, his brother Bob is credited with making the company a financial suc- cess. Bob is vice president of finance. Bob attributes his success to his pessimistic attitude about business and the oil industry. Given the information from Problem 3-17, it is likely that Bob will arrive at a dif- ferent decision. What decision criterion should Bob use, and what alternative will he select?

3-19 The Lubricant is an expensive oil newsletter to which many oil giants subscribe, including Ken Brown (see Problem 3-17 for details). In the last issue, the letter described how the demand for oil products would be extremely high. Apparently, the American consumer will continue to use oil products even if the price of these products doubles. Indeed, one of the articles in the Lubricant states that the chance of a favorable market for oil products was 70%, while the chance of an unfavorable market was only 30%. Ken would like to use these probabilities in determining the best decision.

(a) What decision model should be used? (b) What is the optimal decision? (c) Ken believes that the $300,000 figure for the Sub

100 with a favorable market is too high. How much lower would this figure have to be for Ken to change his decision made in part (b)?

3-20 Mickey Lawson is considering investing some money that he inherited. The following payoff ta- ble gives the profits that would be realized during the next year for each of three investment alterna- tives Mickey is considering:

STATE OF NATURE

DECISION ALTERNATIVE

GOOD ECONOMY

POOR ECONOMY

Stock market 80,000 –20,000

Bonds 30,000 20,000

CDs 23,000 23,000

Probability 0.5 0.5

(a) What decision would maximize expected profits?

(b) What is the maximum amount that should be paid for a perfect forecast of the economy?

3-21 Develop an opportunity loss table for the investment problem that Mickey Lawson faces in Problem 3-20. What decision would minimize the expected oppor- tunity loss? What is the minimum EOL?

3-22 Allen Young has always been proud of his personal investment strategies and has done very well over the past several years. He invests primarily in the stock market. Over the past several months, how- ever, Allen has become very concerned about the stock market as a good investment. In some cases, it would have been better for Allen to have his money in a bank than in the market. During the next year, Allen must decide whether to invest $10,000 in the stock market or in a certificate of deposit (CD) at an interest rate of 9%. If the market is good, Allen be- lieves that he could get a 14% return on his money. With a fair market, he expects to get an 8% return. If the market is bad, he will most likely get no re- turn at all—in other words, the return would be 0%. Allen estimates that the probability of a good market is 0.4, the probability of a fair market is 0.4, and the probability of a bad market is 0.2, and he wishes to maximize his long-run average return.

(a) Develop a decision table for this problem. (b) What is the best decision?

3-23 In Problem 3-22, you helped Allen Young determine the best investment strategy. Now, Allen is thinking about paying for a stock market newsletter. A friend of Allen said that these types of letters could predict very accurately whether the market would be good, fair, or poor. Then, based on these predictions, Allen could make better investment decisions.

Note: means the problem may be solved with QM for Windows; means

the problem may be solved with Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M03_REND3161_13_AIE_C03.indd 99 28/10/16 10:19 AM

100  CHAPTER 3 • DECision AnALysis

(a) What is the most that Allen would be willing to pay for a newsletter?

(b) Allen now believes that a good market will give a return of only 11% instead of 14%. Will this information change the amount that Allen would be willing to pay for the newsletter? If your an- swer is yes, determine the most that Allen would be willing to pay, given this new information.

3-24 Today’s Electronics specializes in manufacturing modern electronic components. It also builds the equipment that produces the components. Phyl- lis Weinberger, who is responsible for advising the president of Today’s Electronics on electronic manu- facturing equipment, has developed the following table concerning a proposed facility:

PROFIT ($)

STRONG MARKET

FAIR MARKET

POOR MARKET

Large facility 550,000 110,000 –310,000

Medium-sized facility

300,000 129,000 –100,000

Small facility 200,000 100,000 –32,000

No facility 0 0 0

(a) Develop an opportunity loss table. (b) What is the minimax regret decision?

3-25 Brilliant Color is a small supplier of chemicals and equipment that are used by some photographic stores to process 35mm film. One product that Bril- liant Color supplies is BC-6. John Kubick, president of Brilliant Color, normally stocks 11, 12, or 13 cases of BC-6 each week. For each case that John sells, he receives a profit of $35. Like many photo- graphic chemicals, BC-6 has a very short shelf life, so if a case is not sold by the end of the week, John must discard it. Since each case costs John $56, he loses $56 for every case that is not sold by the end of the week. There is a probability of 0.45 of selling 11 cases, a probability of 0.35 of selling 12 cases, and a probability of 0.2 of selling 13 cases.

(a) Construct a decision table for this problem. Include all conditional values and probabilities in the table.

(b) What is your recommended course of action? (c) If John is able to develop BC-6 with an ingredi-

ent that stabilizes it so that it no longer has to be discarded, how would this change your recom- mended course of action?

3-26 Megley Cheese Company is a small manufacturer of several different cheese products. One of the prod- ucts is a cheese spread that is sold to retail outlets. Jason Megley must decide how many cases of cheese

spread to manufacture each month. The probability that the demand will be six cases is 0.1, seven cases is 0.3, eight cases is 0.5, and nine cases is 0.1. The cost of every case is $45, and the price that Jason gets for each case is $95. Unfortunately, any cases not sold by the end of the month are of no value, due to spoilage. How many cases of cheese should Jason manufacture each month?

3-27 Farm Grown, Inc., produces cases of perishable food products. Each case contains an assortment of veg- etables and other farm products. Each case costs $5 and sells for $15. If there are any cases not sold by the end of the day, they are sold to a large food pro- cessing company for $3 a case. The probability that daily demand will be 100 cases is 0.3, the probabil- ity that daily demand will be 200 cases is 0.4, and the probability that daily demand will be 300 cases is 0.3. Farm Grown has a policy of always satisfying customer demands. If its own supply of cases is less than the demand, it buys the necessary vegetables from a competitor. The estimated cost of doing this is $16 per case.

(a) Draw a decision table for this problem. (b) What do you recommend?

3-28 In Problem 3-27, Farm Grown, Inc., has reason to believe the probabilities may not be reliable due to changing conditions. If these probabilities are ignored, what decision would be made using the op- timistic criterion? What decision would be made us- ing the pessimistic criterion?

3-29 Mick Karra is the manager of MCZ Drilling Prod- ucts, which produces a variety of specialty valves for oil field equipment. Recent activity in the oil fields has caused demand to increase drastically, and a decision has been made to open a new manufactur- ing facility. Three locations are being considered, and the size of the facility would not be the same in each location. Thus, overtime might be necessary at times. The following table gives the total monthly cost (in $1,000s) for each possible location under each demand possibility. The probabilities for the demand levels have been determined to be 20% for low demand, 30% for medium demand, and 50% for high demand.

DEMAND IS LOW

DEMAND IS MEDIUM

DEMAND IS HIGH

Ardmore, OK 85 110 150

Sweetwater, TX 90 100 140

Lake Charles, LA 110 120 130

(a) Which location would be selected based on the optimistic criterion?

(b) Which location would be selected based on the pessimistic criterion?

M03_REND3161_13_AIE_C03.indd 100 28/10/16 10:19 AM

DisCUssion QUEsTions AnD PRoBLEMs  101

(c) Which location would be selected based on the minimax regret criterion?

(d) Which location should be selected to minimize the expected cost of operation?

(e) How much is a perfect forecast of the demand worth?

(f) Which location would minimize the expected opportunity loss?

(g) What is the expected value of perfect informa- tion in this situation?

3-30 Even though independent gasoline stations have been having a difficult time, Susan Solomon has been thinking about starting her own independent gasoline station. Susan’s problem is to decide how large her station should be. The annual returns will depend on both the size of her station and a number of marketing factors related to the oil industry and demand for gasoline. After a careful analysis, Susan developed the following table:

SIZE OF FIRST STATION

GOOD MARKET

($)

FAIR MARKET

($)

POOR MARKET

($)

Small 50,000 20,000 –10,000

Medium 80,000 30,000 –20,000

Large 100,000 30,000 –40,000

Very large 300,000 25,000 –160,000

For example, if Susan constructs a small station and the market is good, she will realize a profit of $50,000.

(a) Develop a decision table for this decision. (b) What is the maximax decision? (c) What is the maximin decision? (d) What is the equally likely decision? (e) What is the criterion of realism decision? Use an

a value of 0.8. (f) Develop an opportunity loss table. (g) What is the minimax regret decision?

3-31 Beverly Mills has decided to lease a hybrid car to save on gasoline expenses and to do her part to help keep the environment clean. The car she selected is available from only one dealer in the local area, but that dealer has several leasing options to accom- modate a variety of driving patterns. All the leases are for 3 years and require no money at the time of signing the lease. The first option has a monthly cost of $330, a total mileage allowance of 36,000 miles (an average of 12,000 miles per year), and a cost of $0.35 per mile for any miles over 36,000. The fol- lowing table summarizes each of the three lease options:

3-YEAR LEASE

MONTHLY COST

MILEAGE ALLOWANCE

COST PER EXCESS MILE

Option 1 $330 36,000 $0.35

Option 2 $380 45,000 $0.25

Option 3 $430 54,000 $0.15

Beverly has estimated that, during the 3 years of the lease, there is a 40% chance she will drive an aver- age of 12,000 miles per year, a 30% chance she will drive an average of 15,000 miles per year, and a 30% chance that she will drive 18,000 miles per year. In evaluating these lease options, Beverly would like to keep her costs as low as possible.

(a) Develop a payoff (cost) table for this situation. (b) What decision would Beverly make if she were

optimistic? (c) What decision would Beverly make if she were

pessimistic? (d) What decision would Beverly make if she

wanted to minimize her expected cost (monetary value)?

(e) Calculate the expected value of perfect informa- tion for this problem.

3-32 Refer to the leasing decision facing Beverly Mills in Problem 3-31. Develop the opportunity loss table for this situation. Which option would be chosen based on the minimax regret criterion? Which alternative would result in the lowest expected opportunity loss?

3-33 The game of roulette is popular in many casinos around the world. In Las Vegas, a typical roulette wheel has the numbers 1–36 in slots on the wheel. Half of these slots are red, and the other half are black. In the United States, the roulette wheel typi- cally also has the numbers 0 (zero) and 00 (double zero), and both of these are on the wheel in green slots. Thus, there are 38 slots on the wheel. The dealer spins the wheel and sends a small ball in the opposite direction of the spinning wheel. As the wheel slows, the ball falls into one of the slots, and that is the winning number and color. One of the bets available is simply red or black, for which the odds are 1 to 1. If the player bets on either red or black and that happens to be the winning color, the player wins the amount of her bet. For example, if the player bets $5 on red and wins, she is paid $5 and she still has her original bet. On the other hand, if the winning color is black or green when the player bets red, the player loses the entire bet.

(a) What is the probability that a player who bets red will win the bet?

(b) If a player bets $10 on red every time the game is played, what is the expected monetary value (expected win)?

M03_REND3161_13_AIE_C03.indd 101 28/10/16 10:19 AM

102  CHAPTER 3 • DECision AnALysis

(c) In Europe, there is usually no 00 on the wheel, just the 0. With this type of game, what is the probability that a player who bets red will win the bet? If a player bets $10 on red every time in this game (with no 00), what is the expected monetary value?

(d) Since the expected profit (win) in a roulette game is negative, why would a rational person play the game?

3-34 Refer to Problem 3-33 for details about the game of roulette. Another bet in a roulette game is called a “straight up” bet, which means that the player is bet- ting that the winning number will be the number that she chose. In a game with 0 and 00, there is a total of 38 possible outcomes (the numbers 1 to 36 plus 0 and 00), and each of these has the same chance of occurring. The payout on this type of bet is 35 to 1, which means the player is paid 35 and gets to keep the original bet. If a player bets $10 on the number 7 (or any single number), what is the expected mon- etary value (expected win)?

3-35 The Technically Techno company has several pat- ents for a variety of different flash memory devices that are used in computers, cell phones, and a va- riety of other things. A competitor has recently in- troduced a product based on technology very similar to something patented by Technically Techno last year. Consequently, Technically Techno has sued the other company for patent infringement. Based on the facts in the case as well as the record of the lawyers involved, Technically Techno believes there is a 40% chance that it will be awarded $300,000 if the lawsuit goes to court. There is a 30% chance that Technically Techno will be awarded only $50,000 if it goes to court and wins, and there is a 30% chance that Technically Techno will lose the case and be awarded nothing. The estimated cost of legal fees if Technically Techno goes to court is $50,000. However, the other company has offered to pay Technically Techno $75,000 to settle the dispute without going to court. The estimated legal cost of this would be only $10,000. If Technically Techno wished to maximize the expected gain, should it ac- cept the settlement offer?

3-36 A group of medical professionals is considering the construction of a private clinic. If the medical de- mand is high (i.e., there is a favorable market for the clinic), the physicians could realize a net profit of $100,000. If the market is not favorable, they could lose $40,000. Of course, they don’t have to proceed at all, in which case there is no cost. In the absence of any market data, the physicians’ best guess is that there is a 50–50 chance the clinic will be successful. Construct a decision tree to help analyze this prob- lem. What should the medical professionals do?

3-37 The physicians in Problem 3-36 have been ap- proached by a market research firm that offers to perform a study of the market at a fee of $5,000. The market researchers claim their experience enables them to use Bayes’ Theorem to make the following statements of probability:

Probability of a favorable market given

a favorable study = 0.82 Probability of an unfavorable market given

a favorable study = 0.18 Probability of a favorable market given

an unfavorable study = 0.11 Probability of an unfavorable market given

an unfavorable study = 0.89 Probability of a favorable research study = 0.55

Probability of an unfavorable research study = 0.45

(a) Develop a new decision tree for the medical pro- fessionals to reflect the options now open with the market study.

(b) Use the EMV approach to recommend a strategy. (c) What is the expected value of sample informa-

tion? How much might the physicians be willing to pay for a market study?

(d) Calculate the efficiency of this sample information.

3-38 Jerry Smith is thinking about opening a bicycle shop in his hometown. Jerry loves to take his own bike on 50-mile trips with his friends, but he believes that any small business should be started only if there is a good chance of making a profit. Jerry can open a small shop, a large shop, or no shop at all. The prof- its will depend on the size of the shop and whether the market is favorable or unfavorable for his prod- ucts. Because there will be a 5-year lease on the building that Jerry is thinking about using, he wants to make sure that he makes the correct decision. Jerry is also thinking about hiring his old marketing professor to conduct a marketing research study. If the study is conducted, the study could be favorable (i.e., predicting a favorable market) or unfavorable (i.e., predicting an unfavorable market). Develop a decision tree for Jerry.

3-39 Jerry Smith (see Problem 3-38) has done some analysis about the profitability of the bicycle shop. If Jerry builds the large bicycle shop, he will earn $60,000 if the market is favorable, but he will lose $40,000 if the market is unfavorable. The small shop will return a $30,000 profit in a favorable market and a $10,000 loss in an unfavorable market. At the present time, he believes that there is a 50–50 chance that the market will be favorable. His old marketing professor will charge him $5,000 for the marketing research. It is estimated that there is a 0.6 probability that the survey will be favorable. Furthermore, there is a 0.9 probability that the market will be favorable

M03_REND3161_13_AIE_C03.indd 102 28/10/16 10:19 AM

DisCUssion QUEsTions AnD PRoBLEMs  103

given a favorable outcome from the study. However, the marketing professor has warned Jerry that there is only a probability of 0.12 of a favorable market if the marketing research results are not favorable. Jerry is confused.

(a) Should Jerry use the marketing research? (b) Jerry, however, is unsure the 0.6 probability of

a favorable marketing research study is correct. How sensitive is Jerry’s decision to this prob- ability value? How far can this probability value deviate from 0.6 without causing Jerry to change his decision?

3-40 Bill Holliday is not sure what he should do. He can build a quadplex (i.e., a building with four apart- ments), build a duplex, gather additional informa- tion, or simply do nothing. If he gathers additional information, the results could be either favorable or unfavorable, but it would cost him $3,000 to gather the information. Bill believes that there is a 50–50 chance that the information will be favorable. If the rental market is favorable, Bill will earn $15,000 with the quadplex or $5,000 with the duplex. Bill doesn’t have the financial resources to do both. With an unfavorable rental market, however, Bill could lose $20,000 with the quadplex or $10,000 with the duplex. Without gathering additional informa- tion, Bill estimates that the probability of a favor- able rental market is 0.7. A favorable report from the study would increase the probability of a favorable rental market to 0.9. Furthermore, an unfavorable re- port from the additional information would decrease the probability of a favorable rental market to 0.4. Of course, Bill could forget all of these numbers and do nothing. What is your advice to Bill?

3-41 Peter Martin is going to help his brother who wants to open a food store. Peter initially believes that there is a 50–50 chance that his brother’s food store would be a success. Peter is considering doing a market re- search study. Based on historical data, there is a 0.8 probability that the marketing research will be favor- able given a successful food store. Moreover, there is a 0.7 probability that the marketing research will be unfavorable given an unsuccessful food store.

(a) If the marketing research is favorable, what is Peter’s revised probability of a successful food store for his brother?

(b) If the marketing research is unfavorable, what is Peter’s revised probability of a successful food store for his brother?

(c) If the initial probability of a successful food store is 0.60 (instead of 0.50), find the probabilities in parts (a) and (b).

3-42 Mark Martinko has been a class A racquetball player for the past 5 years, and one of his biggest goals is to own and operate a racquetball facility. Unfortunately,

Mark thinks that the chance of a successful racquet- ball facility is only 30%. Mark’s lawyer has recom- mended that he employ one of the local marketing research groups to conduct a survey concerning the success or failure of a racquetball facility. There is a 0.8 probability that the research will be favorable given a successful racquetball facility. In addition, there is a 0.7 probability that the research will be unfavorable given an unsuccessful facility. Com- pute revised probabilities of a successful racquetball facility given a favorable and given an unfavorable survey.

3-43 A financial advisor has recommended two possible mutual funds for investment: Fund A and Fund B. The return that will be achieved by each of these de- pends on whether the economy is good, fair, or poor. A payoff table has been constructed to illustrate this situation:

STATE OF NATURE

INVESTMENT GOOD

ECONOMY FAIR

ECONOMY POOR

ECONOMY

Fund A $10,000 $2,000 –$5,000

Fund B $6,000 $4,000 0

Probability 0.2 0.3 0.5

(a) Draw the decision tree to represent this situation. (b) Perform the necessary calculations to determine

which of the two mutual funds is better. Which one should you choose to maximize the expected value?

(c) Suppose there is a question about the return of Fund A in a good economy. It could be higher or lower than $10,000. What value for this would cause a person to be indifferent between Fund A and Fund B (i.e., the EMVs would be the same)?

3-44 Jim Sellers is thinking about producing a new type of electric razor for men. If the market were favor- able, he would get a return of $100,000, but if the market for this new type of razor were unfavorable, he would lose $60,000. Since Ron Bush is a good friend of Jim Sellers, Jim is considering the possibil- ity of using Bush Marketing Research to gather ad- ditional information about the market for the razor. Ron has suggested that Jim use either a survey or a pilot study to test the market. The survey would be a sophisticated questionnaire administered to a test market. It will cost $5,000. Another alternative is to run a pilot study. This would involve producing a limited number of the new razors and trying to sell them in two cities that are typical of American cit- ies. The pilot study is more accurate but is also more expensive. It will cost $20,000. Ron Bush has sug- gested that it would be a good idea for Jim to con- duct either the survey or the pilot before Jim makes the decision concerning whether to produce the new

M03_REND3161_13_AIE_C03.indd 103 28/10/16 10:19 AM

104  CHAPTER 3 • DECision AnALysis

razor. But Jim is not sure if the value of the survey or the pilot is worth the cost.

Jim estimates that the probability of a successful market without performing a survey or pilot study is 0.5. Furthermore, the probability of a favorable sur- vey result given a favorable market for razors is 0.7, and the probability of a favorable survey result given an unsuccessful market for razors is 0.2. In addition, the probability of an unfavorable pilot study given an unfavorable market is 0.9, and the probability of an unsuccessful pilot study result given a favorable market for razors is 0.2.

(a) Draw the decision tree for this problem without the probability values.

(b) Compute the revised probabilities needed to complete the decision, and place these values in the decision tree.

(c) What is the best decision for Jim? Use EMV as the decision criterion.

3-45 Jim Sellers has been able to estimate his utility for a number of different values. He would like to use these utility values in making the decision in Prob- lem 3-44: U1-$80,0002 = 0, U1-$65,0002 = 0.5,

U1-$60,0002 = 0.55, U1-$20,0002 = 0.7, U1-$5,0002 = 0.8, U1$02 = 0.81, U1$80,0002 =

0.9, U1$95,0002 = 0.95, and U1$100,0002 = 1. Resolve Problem 3-44 using utility values. Is Jim a

risk avoider?

3-46 Two states of nature exist for a particular situation: a good economy and a poor economy. An economic study may be performed to obtain more informa- tion about which of these will actually occur in the coming year. The study may forecast either a good economy or a poor economy. Currently there is a 60% chance that the economy will be good and a 40% chance that it will be poor. In the past, when- ever the economy was good, the economic study predicted it would be good 80% of the time. (The other 20% of the time the prediction was wrong.) In the past, whenever the economy was poor, the eco- nomic study predicted it would be poor 90% of the time. (The other 10% of the time the prediction was wrong.)

(a) Use Bayes’ Theorem and find the following: P1good economy � prediction of good economy2 P1poor economy � prediction of good economy2 P1good economy � prediction of poor economy2 P1poor economy � prediction of poor economy2

(b) Suppose the initial (prior) probability of a good economy is 70% (instead of 60%) and the initial probability of a poor economy is 30% (instead of

40%). Find the posterior probabilities in part (a) based on these new values.

3-47 The Long Island Life Insurance Company sells a term life insurance policy. If the policy holder dies during the term of the policy, the company pays $100,000. If the person does not die, the company pays out nothing, and there is no further value to the policy. The company uses actuarial tables to de- termine the probability that a person with certain characteristics will die during the coming year. For a particular individual, it is determined that there is a 0.001 chance that the person will die in the next year and a 0.999 chance that the person will live and the company will pay out nothing. The cost of this policy is $200 per year. Based on the EMV criterion, should the individual buy this insurance policy? How would utility theory help explain why a person would buy this insurance policy?

3-48 In Problem 3-37, you helped the medical profession- als analyze their decision using expected monetary value as the decision criterion. This group has also assessed its utility for money: U1-$45,0002 = 0, U1-$40,0002 = 0.1, U1-$5,0002 = 0.7, U1$02= 0.9, U1$95,0002 = 0.99, a n d U1$100,0002 = 1. Use expected utility as the decision criterion, and determine the best decision for the medical profes- sionals. Are the medical professionals risk seekers or risk avoiders?

3-49 In this chapter, a decision tree was developed for John Thompson (see Figure 3.5 for the complete de- cision tree analysis). After completing the analysis, John was not completely sure that he is indifferent to risk. After going through a number of standard gam- bles, John was able to assess his utility for money. Here are some of the utility assessments: U1-$190,0002 = 0, U1-$180,0002 = 0.05, U1-$30,0002 = 0.10, U1-$20,0002 = 0.15, U1-$10,0002 = 0.2, U1$02 = 0.3, U1$90,0002 = 0.15, U1$100,0002 = 0.6, U1$190,0002 = 0.95,

and U1$200,0002 = 1.0. If John maximizes his expected utility, does his decision change?

3-50 In the past few years, the traffic problems in Lynn McKell’s hometown have gotten worse. Now, Broad Street is congested about half the time. The normal travel time to work for Lynn is only 15 minutes when Broad Street is used and there is no con- gestion. With congestion, however, it takes Lynn 40 minutes to get to work. If Lynn decides to take the expressway, it will take 30 minutes, regardless of the traffic conditions. Lynn’s utility for travel time is U115 minutes2 = 0.9, U130 minutes2 = 0.7, a n d U140 minutes2 = 0.2.

M03_REND3161_13_AIE_C03.indd 104 28/10/16 10:19 AM

DisCUssion QUEsTions AnD PRoBLEMs  105

(a) Which route will minimize Lynn’s expected travel time?

(b) Which route will maximize Lynn’s utility? (c) When it comes to travel time, is Lynn a risk

seeker or a risk avoider?

3-51 Coren Chemical, Inc., develops industrial chemicals that are used by other manufacturers to produce pho- tographic chemicals, preservatives, and lubricants. One of their products, K-1000, is used by several photographic companies to make a chemical that is used in the film-developing process. To produce K-1000 efficiently, Coren Chemical uses the batch approach, in which a certain number of gallons is produced at one time. This reduces setup costs and allows Coren Chemical to produce K-1000 at a competitive price. Unfortunately, K-1000 has a very short shelf life of about 1 month.

Coren Chemical produces K-1000 in batches of 500 gallons, 1,000 gallons, 1,500 gallons, and 2,000 gallons. Using historical data, David Coren was able to determine that the probability of selling 500 gal- lons of K-1000 is 0.2. The probabilities of selling 1,000, 1,500, and 2,000 gallons are 0.3, 0.4, and 0.1, respectively. The question facing David is how many gallons to produce of K-1000 in the next batch run. K-1000 sells for $20 per gallon. Manufacturing cost is $12 per gallon, and handling costs and warehous- ing costs are estimated to be $1 per gallon. In the past, David has allocated advertising costs to K-1000 at $3 per gallon. If K-1000 is not sold after the batch run, the chemical loses much of its important prop- erties as a developer. It can, however, be sold at a salvage value of $13 per gallon. Furthermore, David has guaranteed to his suppliers that there will always be an adequate supply of K-1000. If David does run out, he has agreed to purchase a comparable chemi- cal from a competitor at $25 per gallon. David sells all of the chemical at $20 per gallon, so his shortage means that David loses the $5 to buy the more ex- pensive chemical.

(a) Develop a decision tree of this problem. (b) What is the best solution? (c) Determine the expected value of perfect

information.

3-52 The Jamis Corporation is involved with waste man- agement. During the past 10 years, it has become one of the largest waste disposal companies in the Midwest, serving primarily Wisconsin, Illinois, and Michigan. Bob Jamis, president of the company, is considering the possibility of establishing a waste treatment plant in Mississippi. From past experience, Bob believes that a small plant in northern Missis- sippi would yield a $500,000 profit, regardless of the market for the facility. The success of a medium- sized waste treatment plant would depend on the market. With a low demand for waste treatment, Bob

expects a $200,000 return. A medium demand would yield a $700,000 return in Bob’s estimation, and a high demand would return $800,000. Although a large facility is much riskier, the potential return is much greater. With a high demand for waste treat- ment in Mississippi, the large facility should return a million dollars. With a medium demand, the large facility will return only $400,000. Bob estimates that the large facility would be a big loser if there were a low demand for waste treatment. He estimates that he would lose approximately $200,000 with a large treatment facility if demand were indeed low. Look- ing at the economic conditions for the upper part of the state of Mississippi and using his experience in the field, Bob estimates that the probability of a low demand for treatment plants is 0.15. The probability of a medium demand for a waste treatment facility is approximately 0.40, and the probability of a high demand for a waste treatment facility is 0.45.

Because of the large potential investment and the possibility of a loss, Bob has decided to hire a market research team that is based in Jackson, Mis- sissippi. This team will perform a survey to get a better feeling for the probability of a low, medium, or high demand for a waste treatment facility. The cost of the survey is $50,000. To help Bob determine whether to go ahead with the survey, the marketing research firm has provided Bob with the following information:

P(survey results ∣ possible outcomes)

SURVEY RESULTS

POSSIBLE OUTCOME

LOW SURVEY RESULTS

MEDIUM SURVEY RESULTS

HIGH SURVEY RESULTS

Low demand 0.7 0.2 0.1

Medium demand 0.4 0.5 0.1

High demand 0.1 0.3 0.6

As you see, the survey could result in three pos- sible outcomes. Low survey results would mean that a low demand is likely. In a similar fashion, medium survey results or high survey results would mean a medium or a high demand, respectively. What should Bob do?

3-53 Mary is considering opening a new grocery store in town. She is evaluating three sites: downtown, the mall, and out at the busy traffic circle. Mary cal- culated the value of successful stores at these loca- tions as follows: downtown, $250,000; the mall, $300,000; the circle, $400,000. Mary calculated the losses if unsuccessful to be $100,000 at either down- town or the mall and $200,000 at the circle. Mary figures her chance of success to be 50% downtown, 60% at the mall, and 75% at the traffic circle.

M03_REND3161_13_AIE_C03.indd 105 28/10/16 10:19 AM

106  CHAPTER 3 • DECision AnALysis

(a) Draw a decision tree for Mary and select her best alternative.

(b) Mary has been approached by a marketing re- search firm that offers to study the area to de- termine if another grocery store is needed. The cost of this study is $30,000. Mary believes there is a 60% chance that the survey results will be positive (show a need for another grocery store). SRP = survey results positive, SRN = sur- vey results negative, SD = success downtown, SM = success at mall, SC = success at circle, SD′ = don’t succeed downtown, and so on. For studies of this nature: P1SRP � success2 = 0.7, P1SRN � success2 = 0.3, P1SRP � not success2 = 0.2, and P1SRN � not success2 = 0.8.

Calculate the revised probabilities for success (and not success) for each location, depending on survey results. (c) How much is the marketing research worth to

Mary? Calculate the EVSI.

3-54 Sue Reynolds has to decide if she should get in- formation (at a cost of $20,000) to help her decide whether to invest in a retail store. If she gets the in- formation, there is a 0.6 probability that the infor- mation will be favorable and a 0.4 probability that the information will not be favorable. If the informa- tion is favorable, there is a 0.9 probability that the store will be a success. If the information is not fa- vorable, the probability of a successful store is only 0.2. Without any information, Sue estimates that the probability of a successful store will be 0.6. A suc- cessful store will give a return of $100,000. If the store is built but is not successful, Sue will see a loss of $80,000. Of course, she could always decide not to build the retail store.

(a) What do you recommend?

(b) What impact would a 0.7 probability of obtain- ing favorable information have on Sue’s deci- sion? The probability of obtaining unfavorable information would be 0.3.

(c) Sue believes that the probabilities of a successful and an unsuccessful retail store, given favorable information, might be 0.8 and 0.2, respectively, instead of 0.9 and 0.1, respectively. What im- pact, if any, would this have on Sue’s decision and the best EMV?

(d) Sue had to pay $20,000 to get information. Would her decision change if the cost of the in- formation increased to $30,000?

(e) Using the data in this problem and the following utility table, compute the expected utility. Is this the curve of a risk seeker or a risk avoider?

MONETARY VALUE UTILITY

$100,000 1

$80,000 0.4

$0 0.2

–$20,000 0.1

–$80,000 0.05

–$100,000 0

(f) Compute the expected utility given the follow- ing utility table. Does this utility table represent a risk seeker or a risk avoider?

MONETARY VALUE UTILITY

$100,000 1

$80,000 0.9

$0 0.8

–$20,000 0.6

–$80,000 0.4

–$100,000 0

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 3-55 to 3-60.

Internet Homework Problems

M03_REND3161_13_AIE_C03.indd 106 28/10/16 10:19 AM

CAsE sTUDy  107

After watching a movie about a young woman who quit a suc- cessful corporate career to start her own baby food company, Julia Day decided that she wanted to do the same. In the movie, the baby food company was very successful. Julia knew, how- ever, that it is much easier to make a movie about a successful woman starting her own company than to actually do it. The product had to be of the highest quality, and Julia had to get the best people involved to launch the new company. Julia resigned from her job and launched her new company–-Starting Right.

Julia decided to target the upper end of the baby food mar- ket by producing baby food that contained no preservatives but had a great taste. Although the price would be slightly higher than for existing baby food, Julia believed that parents would be willing to pay more for a high-quality baby food. Instead of putting baby food in jars, which would require preservatives to stabilize the food, Julia decided to try a new approach. The baby food would be frozen. This would allow for natural ingredients, no preservatives, and outstanding nutrition.

Getting good people to work for the new company was also important. Julia decided to find people with experience in fi- nance, marketing, and production to get involved with Starting Right. With her enthusiasm and charisma, Julia was able to find such a group. Their first step was to develop prototypes of the new frozen baby food and to perform a small pilot test of the new product. The pilot test received rave reviews.

The final key to getting the young company off to a good start was to raise funds. Three options were considered: corpo- rate bonds, preferred stock, and common stock. Julia decided that each investment should be in blocks of $30,000. Further- more, each investor should have an annual income of at least $40,000 and a net worth of $100,000 to be eligible to invest in Starting Right. Corporate bonds would return 13% per year for the next 5 years. Julia furthermore guaranteed that investors in the corporate bonds would get at least $20,000 back at the end

of 5 years. Investors in preferred stock should see their initial investment increase by a factor of 4 with a good market or see the investment worth only half of the initial investment with an unfavorable market. The common stock had the greatest poten- tial. The initial investment was expected to increase by a factor of 8 with a good market, but investors would lose everything if the market was unfavorable. During the next 5 years, it was expected that inflation would increase by a factor of 4.5% each year.

Discussion Question 1. Sue Pansky, a retired elementary school teacher, is con-

sidering investing in Starting Right. She is very conserva- tive and is a risk avoider. What do you recommend?

2. Ray Cahn, who is currently a commodities broker, is also considering an investment, although he believes that there is only an 11% chance of success. What do you recommend?

3. Lila Battle has decided to invest in Starting Right. While she believes that Julia has a good chance of being success- ful, Lila is a risk avoider and very conservative. What is your advice to Lila?

4. George Yates believes that there is an equally likely chance for success or failure. What is your recommendation?

5. Peter Metarko is extremely optimistic about the market for the new baby food. What is your advice for Pete?

6. Julia Day has been told that developing the legal docu- ments for each fund-raising alternative is expensive. Julia would like to offer alternatives for both risk-averse and risk-seeking investors. Can Julia delete one of the finan- cial alternatives and still offer investment choices for risk seekers and risk avoiders?

Case Study

Starting Right Corporation

The Toledo Leather Company has been producing leather goods for more than 30 years. It purchases prepared hides from tanners and produces leather clothing accessories such as wal- lets, belts, and handbags. The firm has just developed a new leather product and has prepared a 1-year production and sales plan for it. The new product is best described as a combination billfold, key case, and credit card carrier. As company presi- dent Peggy Lane has noted, “It is a super carryall for small this-and-that.” Lane has placed her administrative assistant, Harold Hamilton, in charge of the project.

Hamilton has established that material and variable over- head for the carryall should be about $1.50 per case over the next year given a 5-day week and no overtime. Unit labor and machining costs, however, depend on the choice of machine that will be used for production. Hamilton has narrowed the choice

down to two specialized pieces of equipment. Machine 1 is a semi-automated machine that will cut the material to the size needed for one unit and also will sew it, install the rings and snaps, and emboss it with two types of designs. This machine costs $250,000 and will add $2.50 per case to the average vari- able cost for labor and other machine-related costs. This piece of equipment has a production capacity of 640 units per day. However, estimated downtime for maintenance and repairs is 12.5% (1/8 of the total time).

Machine 2 is fully automated. It cuts, sews, and installs rings and snaps and is capable of embossing the case with three types of designs. This machine costs $350,000 and will add $1.75 per case to the average variable cost for labor and other machine-related costs. Machine 2 has a higher production ca- pacity (estimated at 800 units per day) than the semi-automated

Case Study

Toledo Leather Company

M03_REND3161_13_AIE_C03.indd 107 28/10/16 10:19 AM

108  CHAPTER 3 • DECision AnALysis

machine. However, estimated downtime is 25% (1/4 of the total time), consistent with its great complexity.

Marketing estimates for the next year have been more dif- ficult to project than production costs and capacity estimates. However, $6.00 seems the likeliest selling price for the carryall. The price brings it in line with somewhat comparable products on the market, but because the carryall offers more features than these other products, it has the potential to outsell them. Sales volume estimates center on 140,000 units for the year, but anal- ysis of the potential market has been difficult because this new product is so different from the products now being sold. Ham- ilton’s best estimates of sales at $6.00 per unit and the probabili- ties attached to these volumes are as follows:

SALES VOLUME PROBABILITY

120,000 units 0.15

130,000 units 0.25

140,000 units 0.40

150,000 units 0.15

160,000 units 0.05

Given these marketing estimates and the machine capaci- ties, the company will have to decide either to modify the ma- chines to increase capacity or to work overtime if demand is at the higher levels. Management can make this decision based on

the first week’s worth of sales, which are expected to be a good indicator of the annual sales level. Overtime premiums would raise the costs by $1.20 per case on the semi-automated ma- chine and by $0.90 on the fully automated machine. Modifica- tion of Machine 1, the semi-automated one, would cost $15,000 to meet the highest level of sales. Modification of Machine 2 would cost $20,000.

Lane has directed Hamilton to make a decision based on first-year sales, since demand for a product such as this is un- certain after its initial popularity passes. Toledo operates on a 50-week year because the company usually closes down for the winter holidays.

Discussion Questions 1. Using a decision tree based on maximizing expected

profit, decide which machine Toledo Leather should se- lect. Should overtime be scheduled? Or should a machine be modified and, if so, under what circumstances?

2. Set up a payoff matrix for the sales volumes given (as- sume the machines cannot be modified and overtime is used), and assume that the probabilities for the five lev- els of sales are not known. Then decide which machine should be purchased using the maximax criterion, the maximin criterion, and the equally likely criterion.

Source: Professor Emeritus Michael Ballot, ESB, University of the Pacific.

In 1979, Steve Blake founded Blake Electronics in Long Beach, California, to manufacture resistors, capacitors, inductors, and other electronic components. During the Vietnam War, Steve was a radio operator, and it was during this time that he became proficient at repairing radios and other communications equip- ment. Steve viewed his 4-year experience with the army with mixed feelings. He hated army life, but this experience gave him the confidence and the initiative to start his own electron- ics firm.

Over the years, Steve kept the business relatively un- changed. By 1992, total annual sales were in excess of $2 million. In 1996, Steve’s son, Jim, joined the company after finishing high school and 2 years of courses in electronics at Long Beach Community College. Jim was always aggressive in high school athletics, and he became even more aggressive as general sales manager of Blake Electronics. This aggressiveness bothered Steve, who was more conservative. Jim would make deals to supply companies with electronic components before he bothered to find out if Blake Electronics had the ability or capacity to produce the components. On several occasions, this behavior caused the company some embarrassing moments when Blake Electronics was unable to produce the electronic components for companies with which Jim had made deals.

In 2000, Jim started to go after government contracts for electronic components. By 2002, total annual sales had in- creased to more than $10 million, and the number of employees

exceeded 200. Many of these employees were electronic spe- cialists and graduates of electrical engineering programs from top colleges and universities. But Jim’s tendency to stretch Blake Electronics to take on additional contracts continued as well, and by 2007, Blake Electronics had a reputation with gov- ernment agencies as a company that could not deliver what it promised. Almost overnight, government contracts stopped, and Blake Electronics was left with an idle workforce and unused manufacturing equipment. This high overhead started to melt away profits, and in 2009, Blake Electronics was faced with the possibility of sustaining a loss for the first time in its history.

In 2010, Steve decided to look at the possibility of manu- facturing electronic components for home use. Although this was a totally new market for Blake Electronics, Steve was con- vinced that this was the only way to keep Blake Electronics from dipping into the red. The research team at Blake Electron- ics was given the task of developing new electronic devices for home use. The first idea from the research team was the Mas- ter Control Center. The basic components for this system are shown in Figure 3.15.

The heart of the system is the master control box. This unit, which would have a retail price of $250, has two rows of five buttons. Each button controls one light or appliance and can be set as either a switch or a rheostat. When set as a switch, a light finger touch on the button turns a light or appliance on or off. When set as a rheostat, a finger touching the button controls the

Case Study

Blake Electronics

M03_REND3161_13_AIE_C03.indd 108 28/10/16 10:19 AM

CAsE sTUDy  109

Master Control Box

Outlet Adapter

Light Switch Adapter

Lightbulb Disk

B LA

K E

TABLE 3.19 success Figures for MAi

SURVEY RESULTS

OUTCOME FAVORABLE UNFAVORABLE TOTAL

Successful venture

35 20 55

Unsuccessful venture

15 30 45

FIGURE 3.15 Master Control Center

intensity of the light. Leaving your finger on the button makes the light go through a complete cycle ranging from off to bright and back to off again.

To allow for maximum flexibility, each master control box is powered by two D-sized batteries that can last up to a year, depending on usage. In addition, the research team has devel- oped three versions of the master control box—versions A, B, and C. If a family wants to control more than 10 lights or appli- ances, another master control box can be purchased.

The lightbulb disk, which would have a retail price of $2.50, is controlled by the master control box and is used to control the intensity of any light. A different disk is available for each button position for all three master control boxes. By in- serting the lightbulb disk between the lightbulb and the socket, the appropriate button on the master control box can completely control the intensity of the light. If a standard light switch is used, it must be on at all times for the master control box to work.

One disadvantage of using a standard light switch is that only the master control box can be used to control the particular light. To avoid this problem, the research team developed a spe- cial light switch adapter that would sell for $15. When this de- vice is installed, either the master control box or the light switch adapter can be used to control the light.

When used to control appliances other than lights, the mas- ter control box must be used in conjunction with one or more outlet adapters. The adapters are plugged into a standard wall outlet, and the appliance is then plugged into the adapter. Each outlet adapter has a switch on top that allows the appliance to be controlled from the master control box or the outlet adapter. The price of each outlet adapter would be $25.

The research team estimated that it would cost $500,000 to develop the equipment and procedures needed to manufacture the master control box and accessories. If successful, this ven- ture could increase sales by approximately $2 million. But will the master control boxes be a successful venture? With a 60%

chance of success estimated by the research team, Steve had serious doubts about trying to market the master control boxes even though he liked the basic idea. Because of his reservations, Steve decided to send requests for proposals (RFPs) for addi- tional marketing research to 30 marketing research companies in southern California.

The first RFP to come back was from a small company called Marketing Associates, Inc. (MAI), which would charge $100,000 for the survey. According to its proposal, MAI has been in business for about 3 years and has conducted about 100 marketing research projects. MAI’s major strengths appeared to be individual attention to each account, experienced staff, and fast work. Steve was particularly interested in one part of the proposal, which revealed MAI’s success record with previous accounts. This is shown in Table 3.19.

The only other proposal to be returned was by a branch office of Iverstine and Walker, one of the largest marketing research firms in the country. The cost for a complete survey would be $300,000. While the proposal did not contain the same success record as MAI, the proposal from Iverstine and Walker did contain some interesting information. The chance of get- ting a favorable survey result, given a successful venture, was 90%. On the other hand, the chance of getting an unfavorable survey result, given an unsuccessful venture, was 80%. Thus, it appeared to Steve that Iverstine and Walker would be able to predict the success or failure of the master control boxes with a great amount of certainty.

Steve pondered the situation. Unfortunately, both market- ing research teams gave different types of information in their proposals. Steve concluded that there would be no way that the two proposals could be compared unless he got additional information from Iverstine and Walker. Furthermore, Steve wasn’t sure what he would do with the information and whether it would be worth the expense of hiring one of the marketing research firms.

Discussion Questions 1. Does Steve need additional information from Iverstine

and Walker? 2. What would you recommend?

M03_REND3161_13_AIE_C03.indd 109 28/10/16 10:19 AM

110  CHAPTER 3 • DECision AnALysis

See our Internet home page, at www.pearsonhighered.com/render, for these additional case studies: (1) Drink-At-Home, Inc.: This case involves the development and marketing of a new beverage. (2) Ruth Jones’ Heart Bypass Operation: This case deals with a medical decision regarding

surgery. (3) Ski Right: This case involves the development and marketing of a new ski helmet. (4) Study Time: This case is about a student who must budget time while studying for a final exam.

Internet Case Studies

Bibliography

Abbas, Ali E. “Invariant Utility Functions and Certain Equivalent Transforma- tions,” Decision Analysis 4, 1 (March 2007): 17–31.

Carassus, Laurence, and Miklós Rásonyi. “Optimal Strategies and Utility- Based Prices Converge When Agents’ Preferences Do,” Mathematics of Operations Research 32, 1 (February 2007): 102–117.

Congdon, Peter. Bayesian Statistical Modeling, 2nd ed., New York: John Wiley & Sons, Inc., 2007.

Ewing, Paul L., Jr. “Use of Decision Analysis in the Army Base Realignment and Closure (BRAC) 2005 Military Value Analysis,” Decision Analysis 3 (March 2006): 33–49.

Hammond, J. S., R. L. Keeney, and H. Raiffa. “The Hidden Traps in Decision Making,” Harvard Business Review (September–October 1998): 47–60.

Hurley, William J. “The 2002 Ryder Cup: Was Strange’s Decision to Put Tiger Woods in the Anchor Match a Good One?” Decision Analysis 4, 1 (March 2007): 41–45.

Kirkwood, C. W. “An Overview of Methods for Applied Decision Analysis,” Interfaces 22, 6 (November–December 1992): 28–39.

Kirkwood, C. W. “Approximating Risk Aversion in Decision Analysis Appli- cations,” Decision Analysis 1 (March 2004): 51–67.

Luce, R. and H. Raiffa. Games and Decisions: Introduction and Critical Survey. New York: Wiley, 1957 (Reprinted in 1989 by Dover Publications).

Maxwell, Daniel T. “Improving Hard Decisions,” OR/MS Today 33, 6 (December 2006): 51–61.

Patchak, William M. “Software Survey: Decision Analysis.” OR/MS Today 39, 5 (October 2012).

Paté-Cornell, M. Elisabeth, and Robin L. Dillon. “The Respective Roles of Risk and Decision Analyses in Decision Support,” Decision Analysis 3 (December 2006): 220–232.

Pennings, Joost M. E., and Ale Smidts. “The Shape of Utility Functions and Organizational Behavior,” Management Science 49, 9 (September 2003): 1251–1263.

Raiffa, Howard, John W. Pratt, and Robert Schlaifer. Introduction to Statistical Decision Theory. Boston: MIT Press, 1995.

Raiffa, Howard, and Robert Schlaifer. Applied Statistical Decision Theory. New York: John Wiley & Sons, Inc., 2000.

Render, B., and R. M. Stair. Cases and Readings in Management Science, 2nd ed. Boston: Allyn & Bacon, Inc., 1988.

Schlaifer, R. Analysis of Decisions Under Uncertainty. New York: McGraw- Hill Book Company, 1969.

Smith, James E., and Robert L. Winkler. “The Optimizer’s Curse: Skepticism and Postdecision Surprise in Decision Analysis,” Management Science 52 (March 2006): 311–322.

van Binsbergen, Jules H., and Leslie M. Marx. “Exploring Relations Between Decision Analysis and Game Theory,” Decision Analysis 4, 1 (March 2007): 32–40.

Wallace, Stein W. “Decision Making Under Uncertainty: Is Sensitivity Analy- sis of Any Use?” Operations Research 48, 1 (2000): 20–25.

M03_REND3161_13_AIE_C03.indd 110 28/10/16 10:19 AM

 111

4.6 Use computer software for regression analysis.

4.7 Develop a multiple regression model and use it for prediction purposes.

4.8 Use dummy variables to model categorical data.

4.9 Determine which variables should be included in a multiple regression model.

4.10 Transform a nonlinear function into a linear one for use in regression.

4.11 Understand and avoid mistakes commonly made in the use of regression analysis.

4.1 Identify variables, visualize them in a scatter diagram, and use them in a regression model.

4.2 Develop simple linear regression equations from sample data and interpret the slope and intercept.

4.3 Calculate the coefficient of determination and the coefficient of correlation and interpret their meanings.

4.4 List the assumptions used in regression and use residual plots to identify problems.

4.5 Interpret the F test in a linear regression model.

After completing this chapter, students will be able to:

LEARNING OBJECTIVES

Regression Models

4 CHAPTER

Regression analysis is a very valuable tool for today’s manager. Regression has been used to model things such as the relationship between level of education and income, the price of a house and the square footage, and the sales volume for a company relative to the dollars spent on advertising. When businesses are trying to decide which location is best for a new store or branch office, regression models are often used. Cost estimation models are often regression models. The applicability of regression analysis is virtually limitless.

There are generally two purposes for regression analysis. The first is to understand the relationship between variables such as advertising expenditures and sales. The second purpose is to predict the value of one variable based on the value of the other. Because of this, regression is a very important forecasting technique and will be addressed again in Chapter 5.

In this chapter, the simple linear regression model will first be developed, and then a more complex multiple regression model will be used to incorporate even more variables into our model. In any regression model, the variable to be predicted is called the depen- dent variable or response variable. The value of this is said to be dependent upon the value of an independent variable, which is sometimes called an explanatory variable or a predictor variable.

Two purposes of regression analysis are to understand the relationship between variables and to predict the value of one based on the other.

M04_REND3161_13_AIE_C04.indd 111 28/10/16 10:23 AM

112  CHAPTER 4 • REgREssIon MoDELs

4.1 Scatter Diagrams

To investigate the relationship between variables, it is helpful to look at a graph of the data. Such a graph is often called a scatter diagram or a scatter plot. Normally, the independent variable is plotted on the horizontal axis and the dependent variable is plotted on the vertical axis. The following example will illustrate this.

Triple A Construction Company renovates old homes in Albany. Over time, the company has found that its dollar volume of renovation work is dependent on the Albany area payroll. The figures for Triple A’s revenues and the amount of money earned by wage earners in Albany for the past 6 years are presented in Table 4.1. Economists have predicted the local area payroll to be $600 million next year, and Triple A wants to plan accordingly.

Figure 4.1 provides a scatter diagram for the Triple A Construction data given in Table 4.1. This graph indicates that higher values for the local payroll seem to result in higher sales for the company. There is not a perfect relationship because not all the points lie in a straight line, but there is a relationship. A line has been drawn through the data to help show the relationship that exists between the payroll and sales. The points do not all lie on the line, so there would be some error involved if we tried to predict sales based on payroll using this or any other line. Many lines could be drawn through these points, but which one best represents the true relationship? Regression analysis provides the answer to this question.

A scatter diagram is a graph of the data.

TRIPLE A'S SALES ($100,000s)

LOCAL PAYROLL

($100,000,000s)

6 3

8 4

9 6

5 4

4.5 2

9.5 5

TABLE 4.1 Triple A Construction Company sales and Local Payroll

FIGURE 4.1 scatter Diagram of Triple A Construction Company Data

0 1 2 0

2

4

6

8

10

12

3 4 5 6 7 8 Payroll ($100,000,000s)

S al

es ($

10 0,

00 0s

)

M04_REND3161_13_AIE_C04.indd 112 28/10/16 10:23 AM

4.2 sIMPLE LInEAR REgREssIon  113

4.2 Simple Linear Regression

In any regression model, there is an implicit assumption (which can be tested) that a relationship exists between the variables. There is also some random error that cannot be predicted. The un- derlying simple linear regression model is

Y = b0 + b1X + P (4-1)

where

Y = dependent variable (response variable)

X = independent variable (predictor variable or explanatory variable)

b0 = intercept (value of Y when X = 0)

b1 = slope of regression line

P = random error

The true values for the intercept and slope are not known, and therefore they are estimated using sample data. The regression equation based on sample data is given as

Yn = b0 + b1X (4-2)

where

Yn = predicted value of Y

b0 = estimate of b0, based on sample results

b1 = estimate of b1, based on sample results

In the Triple A Construction example, we are trying to predict the sales, so the dependent variable (Y) would be sales. The variable we use to help predict sales is the Albany area payroll, so this is the independent variable (X). Although any number of lines can be drawn through these points to show a relationship between X and Y in Figure 4.1, the line that will be chosen is the one that in some way minimizes the errors. Error is defined as

Error = 1Actual value2 - 1Predicted value2 e = Y - Yn (4-3)

Since errors may be positive or negative, the average error could be zero even though there are extremely large errors—both positive and negative. To eliminate the difficulty of negative errors canceling positive errors, the errors can be squared. The best regression line will be defined as the one with the minimum sum of the squared errors. For this reason, regression analysis is sometimes called least squares regression.

Statisticians have developed formulas that we can use to find the equation of a straight line that would minimize the sum of the squared errors. The simple linear regression equation is

Yn = b0 + b1X

The following formulas can be used to compute the slope and the intercept:

X = gX n

= Average 1mean2 of X values

Y = gY n

= Average 1mean2 of Y values

b1 = g1X - X21Y - Y2

g1X - X22 (4-4) b0 = Y - b1X (4-5)

The dependent variable is Y and the independent variable is X.

Estimates of the slope and intercept are found from sample data.

The regression line minimizes the sum of the squared errors.

M04_REND3161_13_AIE_C04.indd 113 28/10/16 10:23 AM

114  CHAPTER 4 • REgREssIon MoDELs

The preliminary calculations are shown in Table 4.2. There are other “shortcut” formulas that are helpful when doing the computations on a calculator, and these are presented in Appendix 4.1. They will not be shown here, as computer software will be used for most of the other examples in this chapter.

Computing the slope and the intercept of the regression equation for the Triple A Construc- tion Company example, we have

X = gX 6

= 24

6 = 4

Y = gX 6

= 42

6 = 7

b1 = g1X - X21Y - Y2

g1X - X22 = 12.5

10 = 1.25

b0 = Y - b1X = 7 - 11.252142 = 2 The estimated regression equation therefore is

Yn = 2 + 1.25X

or

Sales = 2 + 1.251Payroll2 If the payroll next year is $600 million 1X = 62, then the predicted value would be

Yn = 2 + 1.25162 = 9.5 or $950,000.

One of the purposes of regression is to understand the relationship among variables. This model tells us that each time the payroll increases by $100 million (represented by X), we would expect the sales to increase by $125,000, since b1 = 1.25 ($100,000). This model helps Triple A Construction see how the local economy and company sales are related.

4.3 Measuring the Fit of the Regression Model

A regression equation can be developed for any variables X and Y, even random numbers. We certainly would not have any confidence in the ability of one random number to predict the value of another random number. How do we know that the model is actually helpful in predicting Y based on X? Should we have confidence in this model? Does the model provide better predic- tions (smaller errors) than simply using the average of the Y values?

In the Triple A Construction example, sales figures (Y) varied from a low of 4.5 to a high of 9.5, and the mean was 7. If each sales value is compared with the mean, we see how far they deviate from the mean, and we could compute a measure of the total variability in sales. Because

Deviations (errors) may be positive or negative.

Y X 1X − X 22 1X − X 2 1Y − Y 2 6 3 13 - 422 = 1 13 - 4216 - 72 = 1 8 4 14 - 422 = 0 14 - 4218 - 72 = 0 9 6 16 - 422 = 4 16 - 4219 - 72 = 4 5 4 14 - 422 = 0 14 - 4215 - 72 = 0 4.5 2 12 - 422 = 4 12 - 4214.5 - 72 = 5 9.5 5 15 - 422 = 1 15 - 4219.5 - 72 = 2.5

gY = 42 Y = 42>6 = 7

gX = 24 X = 24>6 = 4

g1X - X22 = 10 g1X - X21Y - Y2 = 12.5

TABLE 4.2 Regression Calculations for Triple A Construction

M04_REND3161_13_AIE_C04.indd 114 28/10/16 10:23 AM

4.3 MEAsURIng THE FIT oF THE REgREssIon MoDEL  115

Y is sometimes higher and sometimes lower than the mean, there may be both positive and nega- tive deviations. Simply summing these values would be misleading because the negatives would cancel out the positives, making it appear that the numbers are closer to the mean than they ac- tually are. To prevent this problem, we will use the sum of squares total (SST) to measure the total variability in Y:

SST = g1Y - Y22 (4-6) If we did not use X to predict Y, we would simply use the mean of Y as the prediction, and

the SST would measure the accuracy of our predictions. However, a regression line may be used to predict the value of Y, and while there are still errors involved, the sum of these squared errors will be less than the total sum of squares just computed. The sum of squares error (SSE) is

SSE = ge2 = g1Y - Yn22 (4-7) Table 4.3 provides the calculations for the Triple A Construction example. The mean

1Y = 72 is compared to each value, and we get SST = 22.5

The prediction 1Yn2 for each observation is computed and compared to the actual value. This results in

SSE = 6.875

The SSE is much lower than the SST. Using the regression line has reduced the variability in the sum of squares by 22.5 - 6.875 = 15.625. This is called the sum of squares regression (SSR) and indicates how much of the total variability in Y is explained by the regression model. Mathematically, this can be calculated as

SSR = g1Yn - Y22 (4-8) Table 4.3 indicates

SSR = 15.625

There is a very important relationship among the sums of squares that we have computed:

1Sum of squares total2 = 1Sum of squares due to regression2 + 1Sum of squares error2 SST = SSR + SSE (4-9)

Figure 4.2 displays the data for Triple A Construction. The regression line is shown, as is a line representing the mean of the Y values. The errors used in computing the sums of squares are shown on this graph. Notice how the sample points are closer to the regression line than they are to the mean.

The SST measures the total variability in Y about the mean.

The SSE measures the variability in Y about the regression line.

TABLE 4.3 sum of squares for Triple A Construction

Y X 1Y − Y 22 Yn 1Y - Yn 22 1Yn - Y 22

6 3 16 - 722 = 1 2 + 1.25132 = 5.75 0.0625 1.563 8 4 18 - 722 = 1 2 + 1.25142 = 7.00 1 0 9 6 19 - 722 = 4 2 + 1.25162 = 9.50 0.25 6.25 5 4 15 - 722 = 4 2 + 1.25142 = 7.00 4 0

4.5 2 14.5 - 722 = 6.25 2 + 1.25122 = 4.50 0 6.25 9.5 5 19.5 - 722 = 6.25 2 + 1.25152 = 8.25 1.5625 1.563

Y = 7 g1Y - Y22 = 22.5 SST = 22.5

g1Y - Yn22 = 6.875 SSE = 6.875

g1Yn - Y22 = 15.625 SSR = 15.625

M04_REND3161_13_AIE_C04.indd 115 28/10/16 10:23 AM

116  CHAPTER 4 • REgREssIon MoDELs

Coefficient of Determination The SSR is sometimes called the explained variability in Y, while the SSE is the unexplained variability in Y. The proportion of the variability in Y that is explained by the regression equation is called the coefficient of determination and is denoted by r2. Thus,

r2 = SSR

SST = 1 -

SSE

SST (4-10)

Either the SSR or the SSE can be used to find r2. For Triple A Construction, we have

r2 = 15.625

22.5 = 0.6944

This means that about 69% of the variability in sales (Y) is explained by the regression equation based on payroll (X).

If every point in the sample were on the regression line (meaning all errors are 0), then 100% of the variability in Y could be explained by the regression equation, so r2 = 1 and SSE = 0. The lowest possible value of r2 is 0, indicating that X explains 0% of the variability in Y. Thus, r2 can range from a low of 0 to a high of 1. In developing regression equations, a good model will have an r2 value close to 1.

Correlation Coefficient Another measure related to the coefficient of determination is the coefficient of correla- tion. This measure also expresses the degree or strength of the linear relationship. It is usu- ally expressed as r and can be any number between and including +1 and -1. Figure 4.3 illustrates possible scatter diagrams for different values of r. The value of r is the square root of r2. It is negative if the slope is negative, and it is positive if the slope is positive. Thus,

r = ±2r2 (4-11) For the Triple A Construction example with r2 = 0.6944,

r = 10.6944 = 0.8333 We know it is positive because the slope is +1.25.

r2 is the proportion of variability in Y that is explained by the regression equation.

FIGURE 4.2 Deviations from the Regression Line and from the Mean

0 1 2 0

2

4

6

8

10

12

3 4 5 6 7 8 Payroll ($100,000,000s)

S al

es ($

10 0,

00 0s

)

Y – Y ^ Y

Y – Y Y – Y

^

Y = 2 1 1.25 X ^

Y

X

The correlation coefficient ranges from -1 to +1.

If every point lies on the regression line, r2 = 1 and SSE = 0.

M04_REND3161_13_AIE_C04.indd 116 28/10/16 10:23 AM

4.4 AssUMPTIons oF THE REgREssIon MoDEL  117

(a) Perfect Positive Correlation: r 5 11

Y

X (b) Positive Correlation: 0 , r ,1

Y

X

(c) No Correlation: r 5 0

Y

X (d ) Perfect Negative Correlation: r 5 21

Y

X

FIGURE 4.3 Four Values of the Correlation Coefficient

4.4 Assumptions of the Regression Model

If we can make certain assumptions about the errors in a regression model, we can perform statistical tests to determine if the model is useful. The following assumptions are made about the errors:

1. The errors are independent. 2. The errors are normally distributed. 3. The errors have a mean of zero. 4. The errors have a constant variance (regardless of the value of X).

Using Regression as Part of Improvement Initiative at Trane/Ingersoll Rand

Trane U.S. Inc. is a brand of Ingersoll Rand and is a leader in both home and commercial air conditioning. In an effort to im- prove quality and efficiency, the company consolidated its man- ufacturing of evaporator and condenser coils into one location in South Carolina. A key part of the coil unit is a header, which controls the flow of water or refrigerant through the coil. With about 120 unique headers produced on each shift, with increased demand for their air conditioners due to federal refrigerant stan- dards, and with growing pressure to reduce costs, Trane began an improvement initiative in 2010.

Value stream mapping, a lean manufacturing technique, was used to visualize the entire process and identify waste in the system. A new layout was suggested to improve processing and reduce the overall time of production. To predict how well the new layout would perform in the manufacture of the headers, data were collected about the time to move materials into posi- tion, time to set up a job, time to set up a machine, and time to process a job. Several regression models were developed to

determine which job characteristics were most significant in the various times involved in processing and to measure the variabil- ity in times. These were used in simulation models that were developed to determine the overall impact of the new layout and to determine where bottlenecks might occur. One of the bottle- necks, at a robotic machine for welding, was eliminated by re- tooling the robot to allow the machine operator to operate both sides of the robot. This enables the robot to process two headers simultaneously.

The improvement initiatives from this project are estimated to save over $700,000 per year. This project highlighted the im- portance of data-based analytics and lean manufacturing tools in identifying the improvement tactics for complex value streams. The company plans similar improvement initiatives for other value streams in the future.

Source: Based on John B. Jensen, Sanjay L. Ahire, and Manoj K. Malhotra, “Trane/Ingersoll Rand Combines Lean and Operations Research Tools to Redesign Feeder Manufacturing Operations,” Interfaces 43, 4 (July–August 2013): 325–340, © Trevor S. Hale.

IN ACTION

M04_REND3161_13_AIE_C04.indd 117 28/10/16 10:23 AM

118  CHAPTER 4 • REgREssIon MoDELs

It is possible to check the data to see if these assumptions are met. Often a plot of the residu- als will highlight any glaring violations of the assumptions. When the errors (residuals) are plot- ted against the independent variable, the pattern should appear random.

Figure 4.4 presents some typical error patterns, with Figure 4.4A displaying a pattern that is expected when the assumptions are met and the model is appropriate. The errors are random and no discernible pattern is present. Figure 4.4B demonstrates an error pattern in which the errors increase as X increases, violating the constant variance assumption. Figure 4.4C shows errors consistently increasing at first and then consistently decreasing. A pattern such as this would indicate that the model is not linear and some other form (perhaps quadratic) should be used. In general, patterns in the plot of the errors indicate problems with the assumptions or the model specification.

A plot of the errors may highlight problems with the model.

E rr

or

X

E rr

or

X

E rr

or

X

FIGURE 4.4A Pattern of Errors Indicating Randomness

FIGURE 4.4B nonconstant Error Variance

FIGURE 4.4C Pattern of Errors Indicating Relationship Is not Linear

M04_REND3161_13_AIE_C04.indd 118 28/10/16 10:23 AM

4.5 TEsTIng THE MoDEL FoR sIgnIFICAnCE  119

Estimating the Variance While the errors are assumed to have constant variance 1s22, this is usually not known. It can be estimated from the sample results. The estimate of s2 is the mean squared error (MSE) and is denoted by s2. The MSE is the sum of squares due to error divided by the degrees of freedom:1

s2 = MSE = SSE

n - k - 1 (4-12)

where

n = number of observations in the sample k = number of independent variables

In the Triple A Construction example, n = 6 and k = 1, so

s2 = MSE = SSE

n - k - 1 =

6.8750

6 - 1 - 1 =

6.8750

4 = 1.7188

From this, we can estimate the standard deviation as

s = 1MSE (4-13) This is called the standard error of the estimate or the standard deviation of the regres-

sion. In this example,

s = 1MSE = 11.7188 = 1.31 This is used in many of the statistical tests about the model. It is also used to find interval

estimates for both Y and regression coefficients.2

4.5 Testing the Model for Significance

Both the MSE and r2 provide a measure of accuracy in a regression model. However, when the sample size is too small, it is possible to get good values for both of these even if there is no re- lationship between the variables in the regression model. To determine whether these values are meaningful, it is necessary to test the model for significance.

To see if there is a linear relationship between X and Y, a statistical hypothesis test is per- formed. The underlying linear model was given in Equation 4-1 as

Y = b0 + b1X + P

If b1 = 0, then Y does not depend on X in any way. The null hypothesis says there is no linear relationship between the two variables (i.e., b1 = 0). The alternate hypothesis is that there is a linear relationship (i.e., b1 ≠ 0). If the null hypothesis can be rejected, then we have proven that a linear relationship does exist, so X is helpful in predicting Y. The F distribution is used for testing this hypothesis. Appendix D contains values for the F distribution that can be used when calculations are performed by hand. See Chapter 2 for a review of the F distribution. The results of the test can also be obtained from both Excel and QM for Windows.

The F statistic used in the hypothesis test is based on the MSE (seen in the previous section) and the mean squared regression (MSR). The MSR is calculated as

MSR = SSR

k (4-14)

The error variance is estimated by the MSE.

2The MSE is a common measure of accuracy in forecasting. When used with techniques besides regression, it is com- mon to divide the SSE by n rather than n - k - 1.

1See the bibliography at the end of this chapter for books with further details.

An F test is used to determine if there is a relationship between X and Y.

M04_REND3161_13_AIE_C04.indd 119 28/10/16 10:23 AM

120  CHAPTER 4 • REgREssIon MoDELs

where

k = number of independent variables in the model

The F statistic is

F = MSR

MSE (4-15)

Based on the assumptions regarding the errors in a regression model, this calculated F statistic is described by the F distribution with

Degrees of freedom for the numerator = df1 = k

Degrees of freedom for the denominator = df2 = n - k - 1

where

k = the number of independent 1X2 variables If there is very little error, the denominator (MSE) of the F statistic is very small relative

to the numerator (MSR), and the resulting F statistic will be large. This is an indication that the model is useful. A significance level related to the value of the F statistic is then found. When- ever the F value is large, the observed significance level (p-value) will be low, indicating that it is extremely unlikely that this could have occurred by chance. When the F value is large (with a resulting small significance level), we can reject the null hypothesis that there is no linear relationship. This means that there is a linear relationship and the values of MSE and r2 are meaningful.

The hypothesis test just described is summarized here:

Steps in Hypothesis Test for a Significant Regression Model

1. Specify null and alternative hypotheses:

H0:b1 = 0

H1:b1 ≠ 0

2. Select the level of significance 1a). Common values are 0.01 and 0.05. 3. Calculate the value of the test statistic using the formula

F = MSR

MSE

4. Make a decision using one of the following methods:

(a) Reject the null hypothesis if the test statistic is greater than the F value from the table in Appendix D. Otherwise, do not reject the null hypothesis:

Reject if Fcalculated 7 Fa, df1, df2 df1 = k

df2 = n - k - 1

(b) Reject the null hypothesis if the observed significance level, or p-value, is less than the level of significance (a). Otherwise, do not reject the null hypothesis:

p@value = P1F 7 calculated test statistic2 Reject if p@value 6 a

If the significance level for the F test is low, there is a relationship between X and Y.

M04_REND3161_13_AIE_C04.indd 120 28/10/16 10:23 AM

4.5 TEsTIng THE MoDEL FoR sIgnIFICAnCE  121

Triple A Construction Example To illustrate the process of testing the hypothesis about a significant relationship, consider the Triple A Construction example. Appendix D will be used to provide values for the F distribution.

STEP 1.

H0:b1 = 0 1no linear relationship between X and Y2 H1:b1 ≠ 0 1linear relationship exists between X and Y2

STEP 2.

Select a = 0.05

STEP 3. Calculate the value of the test statistic. The MSE was already calculated to be 1.7188. The MSR is then calculated so that F can be found:

MSR = SSR

k =

15.6250

1 = 15.6250

F = MSR

MSE =

15.6250

1.7188 = 9.09

STEP 4. (a) Reject the null hypothesis if the test statistic is greater than the F value from the table in Appendix D:

df1 = k = 1 df2 = n - k - 1 = 6 - 1 - 1 = 4

The value of F associated with a 5% level of significance and with degrees of freedom 1 and 4 is found in Appendix D. Figure 4.5 illustrates this:

F0.05, 1,4 = 7.71 Fcalculated = 9.09 Reject H0 because 9.09 7 7.71

Thus, there is sufficient data to conclude that there is a statistically significant relationship between X and Y, so the model is helpful. The strength of this relationship is measured by r2 = 0.69. Thus, we can conclude that about 69% of the variability in sales (Y) is explained by the regression model based on local payroll (X).

F 5 7.71 9.09

0.05

FIGURE 4.5 F Distribution for Triple A Construction Test for significance

M04_REND3161_13_AIE_C04.indd 121 28/10/16 10:23 AM

122  CHAPTER 4 • REgREssIon MoDELs

The Analysis of Variance (ANOVA) Table When software such as Excel or QM for Windows is used to develop regression models, the out- put provides the observed significance level, or p-value, for the calculated F value. This is then compared to the level of significance 1a) to make the decision.

Table 4.4 provides summary information about the ANOVA table. This shows how the num- bers in the last three columns of the table are computed. The last column of this table, labeled Significance F, is the p-value, or observed significance level, which can be used in the hypoth- esis test about the regression model.

Triple A Construction ANOVA Example The Excel output that includes the ANOVA table for the Triple A Construction data is shown in the next section. The observed significance level for F = 9.0909 is given to be 0.0394. This means

P1F 7 9.09092 = 0.0394 Because this probability is less than 0.05 (a), we would reject the hypothesis of no linear rela- tionship and conclude that there is a linear relationship between X and Y. Note in Figure 4.5 that the area under the curve to the right of 9.09 is clearly less than 0.05, which is the area to the right of the F value associated with a 0.05 level of significance.

4.6 Using Computer Software for Regression

Software such as Excel 2016, Excel QM, and QM for Windows is usually used for the regression calculations. All of these will be illustrated using the Triple A Construction example.

Excel 2016 To use Excel 2016 for regression, enter the data in columns. Click the Data tab to access the data ribbon. Then select Data Analysis, as shown in Program 4.1A. If Data Analysis does not appear on the Data ribbon, the Excel add-in for this has not yet been activated. See Appendix F at the end of the book for instructions on how to activate this. Once this add-in is activated, it will re- main on the Data ribbon for future use.

When the Data Analysis window opens, scroll down to and highlight Regression and click OK, as illustrated in Program 4.1A. The Regression window will open, as shown in Program 4.1B, and you can input the X and Y ranges. Check the Labels box because the cells in the first row of the X and Y ranges include the variable names. To have the output presented on this page rather than on a new worksheet, select Output Range and give a cell address for the start of the output. Click the OK button, and the output appears in the output range specified. Program 4.1C shows the intercept (2), slope (1.25), and other information that was previously calculated for the Triple A Construction example.

The sums of squares are shown in the column headed by SS. Another name for error is re- sidual. In Excel, the sum of squares error is shown as the sum of squares residual. The values in this output are the same values shown in Table 4.3:

Sum of squares regression = SSR = 15.625 Sum of squares error (residual) = 6.8750 Sum of squares total = SST = 22.5

The coefficient of determination 1r2) is shown to be 0.6944. The coefficient of correlation (r) is called Multiple R in the Excel output, and this is 0.8333.

DF SS MS F SIGNIFICANCE F

Regression k SSR MSR = SSR>k MSR>MSE P(F 7 MSR>MSE) Residual n - k - 1 SSE MSE = SSE>(n - k - 1) Total n - 1 SST

TABLE 4.4 Analysis of Variance Table for Regression

M04_REND3161_13_AIE_C04.indd 122 28/10/16 10:23 AM

4.6 UsIng CoMPUTER soFTwARE FoR REgREssIon  123

Go to the Data tab.Click OK.

Select Data Analysis.

When Data Analysis window opens, scroll down to highlight Regression.

Excel QM To use Excel QM for regression, from the Excel QM ribbon select the module by clicking Al- phabetical - Forecasting - Multiple Regression, as shown in Program 4.2A. A window will open to allow you to specify the size of the problem, as shown in Program 4.2B. Enter a name or title for the problem, the number of past observations, and the number of independent (X) variables. For the Triple A Construction example, there are 6 past periods of data and 1 independent vari- able. When you click OK, a spreadsheet will appear for you to enter the X and Y data in the shaded area. The calculations are automatically performed, so there is nothing to do after enter- ing the data. The results are seen in Program 4.2C.

Specify the X and Y ranges.

Click OK to have Excel develop the regression model.

Check the Labels box if the first row in the X and Y ranges includes the variable names.

Specify location for the output. To put this on the current worksheet, click Output Range and give a cell location for this to begin.

The regression coefficients are given here.

A high r2 (close to 1) is desirable.

A low (e.g., less than 0.05) Significance F (p-value for overall model) indicates a significant relationship between X and Y.The SSR (regression), SSE

(residual or error), and SST (total) are shown in the SS column of the ANOVA table.

PROGRAM 4.1A Accessing the Regression option in Excel 2016

PROGRAM 4.1B Data Input for Regression in Excel 2016

PROGRAM 4.1C Excel 2016 output for Triple A Construction Example

M04_REND3161_13_AIE_C04.indd 123 28/10/16 10:23 AM

124  CHAPTER 4 • REgREssIon MoDELs

PROGRAM 4.2A Using Excel QM for Regression

Go to the Excel QM tab in Excel 2016.

When options appear, click Multiple Regression.

Left-click on the Alphabetical menu.

Point the cursor at Forecasting.

PROGRAM 4.2B Initializing the spreadsheet in Excel QM Input a title.

Click OK.

Input the number of past observations.

Input the number of independent (X) variables.

PROGRAM 4.2C Input and Results for Regression in Excel QM

Enter the past observations of Y and X. Results appear automatically.

To forecast Y based on any value of X, simply input the value of X here.

Correlation coefficient is given here.

The intercept and slope are shown here.

M04_REND3161_13_AIE_C04.indd 124 28/10/16 10:23 AM

4.6 UsIng CoMPUTER soFTwARE FoR REgREssIon  125

QM for Windows To develop a regression equation using QM for Windows for the Triple A Construction Com- pany data, select the Forecasting module and select New. Then choose Least Squares—Simple and Multiple Regression, as illustrated in Program 4.3A. This opens the window shown in Program 4.3B. Enter the number of observations (6 in this example) and specify the number of independent variables (1 in this example). Left-click OK and a window opens allowing you to input the data, as shown in Program 4.3C. After entering the data, click Solve, and the forecasting results shown in Program 4.3D are displayed. The equation as well as other infor- mation is provided on this screen. Note the regression equation is displayed across two lines. Additional output, including the ANOVA table, is available by clicking the Window option on the toolbar.

After selecting the Forecasting module, click New and select Least Squares – Simple and Multiple Regression.

PROGRAM 4.3A QM for windows Regression option in Forecasting Module

PROGRAM 4.3B QM for windows screen to Initialize the Problem

PROGRAM 4.3C Data Input for Triple A Construction Example

Specify the number of observations.

Specify the number of variables.

Click OK.

M04_REND3161_13_AIE_C04.indd 125 28/10/16 10:23 AM

126  CHAPTER 4 • REgREssIon MoDELs

4.7 Multiple Regression Analysis

The multiple regression model is a practical extension of the model we just observed. It allows us to build a model with several independent variables. The underlying model is

Y = b0 + b1X1 + b2X2 + Á + bkXk + P (4-16)

where

Y = dependent variable (response variable)

Xi = ith independent variable (predictor variable or explanatory variable)

b0 = intercept (value of Y when all Xi = 0)

bi = coefficient of the ith independent variable

k = number of independent variables

P= random error

To estimate the values of these coefficients, a sample is taken and the following equation is developed:

Yn = b0 + b1X1 + b2X2 + Á + bkXk (4-17)

where

Yn = predicted value of Y

b0 = sample intercept (and is an estimate of b0)

bi = sample coefficient of ith variable (and is an estimate of bi)

Consider the case of Jenny Wilson Realty, a real estate company in Montgomery, Alabama. Jenny Wilson, owner and broker for this company, wants to develop a model to determine a suggested listing price for houses based on the size of the house and the age of the house. She selects a sample of houses that have sold recently in a particular area, and she records the sell- ing price, the square footage of the house, the age of the house, and also the condition (good, excellent, or mint) of each house, as shown in Table 4.5. Initially Jenny plans to use only the square footage and age to develop a model, although she wants to save the information on

Additional information is available by clicking the Window menu.

Regression equation is across two lines.

PROGRAM 4.3D QM for windows output for Triple A Construction Example

A multiple regression model has more than one independent variable.

M04_REND3161_13_AIE_C04.indd 126 28/10/16 10:23 AM

4.7 MULTIPLE REgREssIon AnALysIs  127

condition of the house to use later. She wants to find the coefficients for the following multiple regression model:

Yn = b0 + b1X1 + b2X2

where

Yn = predicted value of dependent variable (selling price)

b0 = Y intercept

X1 and X2 = value of the two independent variables (square footage and age), respectively

b1 and b2 = slopes for X1 and X2, respectively

The mathematics of multiple regression becomes quite complex, so we leave formulas for b0, b1, and b2 to regression textbooks.

3 Excel can be used to develop a multiple regression model just as it was used for a simple linear regression model. When entering the data in Excel, it is im- portant that all of the independent variables are in adjoining columns to facilitate the input. From the Data tab in Excel, select Data Analysis and then Regression, as shown earlier, in Program 4.1A. This opens the Regression window to allow the input, as shown in Program 4.4A. Note that the X Range includes the data in two columns (B and C) because there are two independent variables. The Excel output that Jenny Wilson obtains is shown in Program 4.4B, and it provides the following equation:

Yn = b0 + b1X1 + b2X2 = 146,630.89 + 43.82 X1 - 2898.69 X2

Evaluating the Multiple Regression Model A multiple regression model can be evaluated in a manner similar to the way a simple linear regression model is evaluated. Both the p-value for the F test and r2 can be interpreted the same

SELLING PRICE ($)

SQUARE FOOTAGE

AGE

CONDITION

95,000 1,926 30 Good

119,000 2,069 40 Excellent

124,800 1,720 30 Excellent

135,000 1,396 15 Good

142,800 1,706 32 Mint

145,000 1,847 38 Mint

159,000 1,950 27 Mint

165,000 2,323 30 Excellent

182,000 2,285 26 Mint

183,000 3,752 35 Good

200,000 2,300 18 Good

211,000 2,525 17 Good

215,000 3,800 40 Excellent

219,000 1,740 12 Mint

TABLE 4.5 Jenny wilson Real Estate Data

Excel can be used to develop multiple regression models.

3See, for example, Norman R. Draper and Harry Smith, Applied Regression Analysis, 3rd ed. (New York: John Wiley & Sons, Inc., 1998).

M04_REND3161_13_AIE_C04.indd 127 28/10/16 10:23 AM

128  CHAPTER 4 • REgREssIon MoDELs

with multiple regression models as they are with simple linear regression models. However, as there is more than one independent variable, the hypothesis that is being tested with the F test is that all the coefficients are equal to 0. If all these are 0, then none of the independent variables in the model is helpful in predicting the dependent variable.

To determine which of the independent variables in a multiple regression model is significant, a significance test on the coefficient for each variable is performed. While sta- tistics textbooks can provide the details of these tests, the results of these tests are au- tomatically displayed in the Excel output. The null hypothesis is that the coefficient is 0 1H0:bi = 02, and the alternate hypothesis is that it is not 0 1H1:bi ≠ 02. The test statistic is calculated in Excel, and the p-value is given. If the p-value is lower than the level of sig- nificance 1a), then the null hypothesis is rejected, and it can be concluded that the variable is significant.

Jenny Wilson Realty Example In the Jenny Wilson Realty example in Program 4.4B, the overall model is statistically significant and useful in predicting the selling price of the house because the p-value for the F test is 0.002. The r2 value is 0.6719, so 67% of the variability in selling price for these houses can be explained by the regression model. However, there were two inde- pendent variables in the model–-square footage and age. It is possible that one of these is significant and the other is not. The F test simply indicates that the model as a whole is significant.

PROGRAM 4.4A Input screen for Jenny wilson Realty Multiple Regression in Excel 2016

PROGRAM 4.4B Excel 2016 output screen for Jenny wilson Realty Multiple Regression Example

The columns containing data for the X variables should be adjoining.

The X range is from the start of the first column to the bottom of the second column.

The coefficients are here.

The coefficient of determination is 0.67.

A low Significance F value indicates that the model is statistically significant.

M04_REND3161_13_AIE_C04.indd 128 28/10/16 10:23 AM

4.8 BInARy oR DUMMy VARIABLEs  129

Two significance tests can be performed to determine if square footage or age (or both) is significant. In Program 4.4B, the results of two hypothesis tests are provided. The first test for variable X1 (square footage) is

H0:b1 = 0 H1:b1 ≠ 0

Using a 5% level of significance 1a = 0.052, the null hypothesis is rejected because the p-value for this is 0.0013. Thus, square footage is helpful in predicting the price of a house.

Similarly, the variable X2 (age) is tested using the Excel output, and the p-value is 0.0039. The null hypothesis is rejected because this is less than 0.05. Thus, age is also helpful in predict- ing the price of a house.

4.8 Binary or Dummy Variables

All of the variables we have used in regression examples have been quantitative variables such as sales figures, payroll numbers, square footage, and age. These have all been easily measurable and have had numbers associated with them. There are many times when we believe a qualitative variable rather than a quantitative variable would be helpful in predicting the dependent vari- able Y. For example, regression may be used to find a relationship between annual income and certain characteristics of the employees. Years of experience at a particular job would be a quan- titative variable. However, information regarding whether or not a person has a college degree might also be important. This would not be a measurable value or quantity, so a special variable called a dummy variable (or a binary variable or an indicator variable) would be used. A dummy variable is assigned a value of 1 if a particular condition is met (e.g., a person has a col- lege degree) and a value of 0 otherwise.

Return to the Jenny Wilson Realty example. Jenny believes that a better model can be de- veloped if the condition of the property is included. To incorporate the condition of the house into the model, Jenny looks at the information available (see Table 4.5) and sees that the three categories are good condition, excellent condition, and mint condition. Since these are not quan- titative variables, she must use dummy variables. These are defined as

X3 = 1 if house is in excellent condition = 0 otherwise

X4 = 1 if house is in mint condition = 0 otherwise

Notice there is no separate variable for “good” condition. If X3 and X4 are both 0, then the house cannot be in excellent or mint condition, so it must be in good condition. When using dummy variables, the number of variables must be 1 less than the number of categories. In this problem, there were three categories (good, excellent, and mint condition), so we must have two dummy variables. If we had mistakenly used too many variables and the number of dummy variables equaled the number of categories, then the mathematical computations could not be performed or would not give reliable values.

These dummy variables will be used with the two previous variables (X1 - square footage, and X2 - age) to try to predict the selling prices of houses for Jenny Wilson. Programs 4.5A and 4.5B provide the Excel input and output for these new data, and this shows how the dummy vari- ables were coded. The significance level for the F test is 0.00017, so this model is statistically significant. The coefficient of determination 1r22 is 0.898, so this is a much better model than the previous one. The regression equation is

Yn = 121,658 + 56.43X1 - 3,962X2 + 33,162X3 + 47,369X4

This indicates that a house in excellent condition 1X3 = 1, X4 = 02 would sell for about $33,162 more than a house in good condition 1X3 = 0, X4 = 02. A house in mint condition 1X3 = 0, X4 = 12 would sell for about $47,369 more than a house in good condition.

A dummy variable is also called an indicator variable or a binary variable.

The number of dummy variables must equal 1 less than the number of categories of a qualitative variable.

M04_REND3161_13_AIE_C04.indd 129 28/10/16 10:23 AM

130  CHAPTER 4 • REgREssIon MoDELs

4.9 Model Building

In developing a good regression model, possible independent variables are identified and the best ones are selected to be used in the model. The best model is a statistically significant model with a high r2 and few variables.

As more variables are added to a regression model, r2 will usually increase, and it cannot decrease. It is tempting to keep adding variables to a model to try to increase r2. However, if too many independent variables are included in the model, problems can arise. For this reason, the adjusted r2 value is often used (rather than r2) to determine if an ad- ditional independent variable is beneficial. The adjusted r2 takes into account the number of independent variables in the model, and it is possible for the adjusted r2 to decrease. The formula for r2 is

r2 = SSR

SST = 1 -

SSE

SST

The adjusted r2 is

Adjusted r2 = 1 - SSE>1n - k - 12

SST>1n - 12 (4-18)

Notice that as the number of variables (k) increases, n - k - 1 will decrease. This causes SSE>1n - k - 12 to increase, and consequently the adjusted r2 will decrease unless the extra

The X range includes columns B, C, D, and E but not F.

PROGRAM 4.5A Input screen for Jenny wilson Realty Example with Dummy Variables in Excel 2016

PROGRAM 4.5B output screen for Jenny wilson Realty Example with Dummy Variables in Excel 2016

The overall model is helpful, since the Significance F probability is low (much less than 5%).

Each of the variables individually is helpful, since the p-value for each of these is low (much less than 5%).

The coefficient of age is negative, indicating that the price decreases as the house gets older.

The adjusted r2 may decrease when more variables are added to the model.

The value of r2 can never decrease when more variables are added to the model.

M04_REND3161_13_AIE_C04.indd 130 28/10/16 10:23 AM

4.10 nonLInEAR REgREssIon  131

variable in the model causes a significant decrease in the SSE. Thus, the reduction in error (and SSE) must be sufficient to offset the change in k.

As a general rule of thumb, if the adjusted r2 increases when a new variable is added to the model, the variable should probably remain in the model. If the adjusted r2 decreases when a new variable is added, the variable should not remain in the model. Other factors should also be considered when trying to build the model, but they are beyond the introductory level of this chapter.

Stepwise Regression While the process of model building may be tedious, there are many statistical software pack- ages that include stepwise regression procedures to do this. Stepwise regression is an automated process to systematically add independent variables to or delete them from a regression model. A forward stepwise procedure puts the most significant variable in the model first and then adds the next variable that will improve the model the most given that the first variable is already in the model. Variables continue to be added in this fashion until all the variables are in the model or until any remaining variables do not significantly improve the model. A backward stepwise procedure begins with all independent variables in the model, and one by one the least helpful variables are deleted. This continues until only significant variables remain. Many variations of these stepwise models exist.

Multicollinearity In the Jenny Wilson Realty example illustrated in Program 4.5B, we saw an r2 of about 0.90 and an adjusted r2 of 0.85. While other variables such as the size of the lot, the number of bedrooms, and the number of bathrooms might be related to the selling price of a house, we may not want to include these in the model. It is likely that these variables would be correlated with the square footage of the house (e.g., more bedrooms usually means a larger house), which is already in- cluded in the model. Thus, the information provided by these additional variables might be du- plication of information already in the model.

When an independent variable is correlated with one other independent variable, the vari- ables are said to share collinearity. If an independent variable is correlated with a combination of other independent variables, the condition of multicollinearity exists. This can create prob- lems in interpreting the coefficients of the variables, as several variables are providing duplicate information. For example, if two independent variables were monthly salary expenses for a com- pany and annual salary expenses for a company, the information provided in one is also provided in the other. Several sets of regression coefficients for these two variables would yield exactly the same results. Thus, individual interpretation of these variables would be questionable, al- though the model itself is still good for prediction purposes. When multicollinearity exists, the overall F test is still valid, but the hypothesis tests related to the individual coefficients are not. A variable may appear to be significant when it is insignificant, or a variable may appear to be insignificant when it is significant.

4.10 Nonlinear Regression

The regression models we have seen are linear models. However, at times there exist nonlinear relationships between variables. Some simple variable transformations can be used to create an apparently linear model from a nonlinear relationship. This allows us to use Excel and other linear regression programs to perform the calculations. We will demonstrate this in the following example.

On every new automobile sold in the United States, the fuel efficiency (as measured by miles per gallon [MPG] of gasoline) of the automobile is prominently displayed on the window sticker. The MPG is related to several factors, one of which is the weight of the au- tomobile. Engineers at Colonel Motors, in an attempt to improve fuel efficiency, have been asked to study the impact of weight on MPG. They have decided that a regression model should be used to do this.

Multicollinearity exists when a variable is correlated to other variables.

A variable should not be added to the model if it causes the adjusted r2 to decrease.

Transformations may be used to turn a nonlinear model into a linear model.

M04_REND3161_13_AIE_C04.indd 131 28/10/16 10:23 AM

132  CHAPTER 4 • REgREssIon MoDELs

A sample of 12 new automobiles was selected, and the weight and MPG rating were re- corded. Table 4.6 provides these data. A scatter diagram of the data in Figure 4.6A shows the weight and MPG. A linear regression line is drawn through the points. Excel was used to de- velop a simple linear regression equation to relate the MPG (Y) to the weight in thousands of pounds 1X12 in the form

Yn = b0 + b1X1

The Excel output is shown in Program 4.6. From this, we get the equation

Yn = 47.6 - 8.2X1

or

MPG = 47.6 - 8.21Weight in thousands of pounds)

The model is useful since the significance level for the F test is small and r2 = 0.7446. However, further examination of the graph in Figure 4.6A brings into question the use of a linear model. Perhaps a nonlinear relationship exists, and maybe the model should be modi- fied to account for this. A quadratic model is illustrated in Figure 4.6B. This model would be of the form

MPG = b0 + b11Weight2 + b21Weight22

MPG

WEIGHT (1,000s LB.)

MPG

WEIGHT (1,000s LB.)

12 4.58 20 3.18

13 4.66 23 2.68

15 4.02 24 2.65

18 2.53 33 1.70

19 3.09 36 1.95

19 3.11 42 1.92

TABLE 4.6 Automobile weight Versus MPg

1.00 2.00 3.00 4.00 5.00 0

5

10

25

15

20

30

35

40

45

Weight (1,000s lb.)

M P

G

FIGURE 4.6A Linear Model for MPg Data

M04_REND3161_13_AIE_C04.indd 132 28/10/16 10:23 AM

4.10 nonLInEAR REgREssIon  133

The easiest way to develop this model is to define a new variable

X2 = 1Weight22

This gives us the model

Yn = b0 + b1X1 + b2X2

We can create another column in Excel and again run the regression tool. The output is shown in Program 4.7. The new equation is

Yn = 79.8 - 30.2X1 + 3.4X2

The significance level for F is low (0.0002), so the model is useful, and r2 = 0.8478. The adjusted r2 increased from 0.719 to 0.814, so this new variable definitely improved the model.

This model is good for prediction purposes. However, we should not try to interpret the coefficients of the variables due to the correlation between X1 (weight) and X2 (weight squared). Normally, we would interpret the coefficient for X1 as the change in Y that results from a 1-unit change in X1, while holding all other variables constant. Obviously, holding one

1.00 2.00 3.00 4.00 5.00 0

5

10

25

15

20

30

35

40

45

Weight (1,000s lb.)

M P

G

FIGURE 4.6B nonlinear Model for MPg Data

A low significance value for F and a high r2 are indications of a good model.

PROGRAM 4.6 Excel 2016 output with Linear Regression Model for MPg Data

M04_REND3161_13_AIE_C04.indd 133 28/10/16 10:23 AM

134  CHAPTER 4 • REgREssIon MoDELs

variable constant while changing the other is impossible in this example, since X2 = X21. If X1 changes, then X2 must change also. This is an example of a problem that exists when multicol- linearity is present.

Other types of nonlinearities can be handled using a similar approach. A number of transformations exist that may help to develop a linear model from variables with nonlinear relationships.

4.11 Cautions and Pitfalls in Regression Analysis

This chapter has provided a brief introduction to regression analysis, one of the most widely used quantitative techniques in business. However, some common errors are made with regres- sion models, so caution should be observed when using them.

If the assumptions are not met, the statistical tests may not be valid. Any interval estimates are also invalid, although the model can still be used for prediction purposes.

Correlation does not necessarily mean causation. Two variables (such as the price of auto- mobiles and your annual salary) may be highly correlated to one another, but one is not causing the other to change. They may both be changing due to other factors such as the economy in general or the inflation rate.

If multicollinearity is present in a multiple regression model, the model is still good for pre- diction, but interpretation of individual coefficients is questionable. The individual tests on the regression coefficients are not valid.

Using a regression equation beyond the range of X is very questionable. A linear relation- ship may exist within the range of values of X in the sample. What happens beyond this range is unknown; the linear relationship may become nonlinear at some point. For example, there is usually a linear relationship between advertising and sales within a limited range. As more money is spent on advertising, sales tend to increase even if everything else is held constant. However, at some point, increasing advertising expenditures will have less impact on sales un- less the company does other things to help, such as opening new markets or expanding the prod- uct offerings. If advertising is increased and nothing else changes, the sales will probably level off at some point.

Related to the limitation regarding the range of X is the interpretation of the intercept 1b02. Since the lowest value for X in a sample is often much greater than 0, the intercept is a point on the regression line beyond the range of X. Therefore, we should not be concerned if the t-test for this coefficient is not significant, as we should not be using the regression equation to predict a value of Y when X = 0. This intercept is merely used in defining the line that fits the sample points the best.

Using the F test and concluding a linear regression model is helpful in predicting Y does not mean that this is the best relationship. While this model may explain much of the variability in Y, it is possible that a nonlinear relationship might explain even more.

PROGRAM 4.7 Excel 2016 output with nonlinear Regression Model for MPg Data

A high correlation does not mean one variable is causing a change in the other.

The regression equation should not be used with values of X that are below the lowest value of X or above the highest value of X found in the sample.

M04_REND3161_13_AIE_C04.indd 134 28/10/16 10:23 AM

 135

Similarly, if it is concluded that no linear relationship exists, another type of relationship could exist.

A statistically significant relationship does not mean it has any practical value. With large enough samples, it is possible to have a statistically significant relationship, but r2 might be 0.01. This would normally be of little use to a manager. Similarly, a high r2 could be found due to random chance if the sample is small. The F test must also show significance to place any value in r2.

gLossARy  135

A significant F value may occur even when the relationship is not strong.

Regression analysis is an extremely valuable quantitative tool. Using scatter diagrams helps to see relationships between vari- ables. The F test is used to determine if the results can be con- sidered useful. The coefficient of determination 1r22 is used to measure the proportion of variability in Y that is explained by the regression model. The correlation coefficient measures the relationship between two variables.

Multiple regression involves the use of more than one in- dependent variable. Dummy variables (binary or indicator vari- ables) are used with qualitative or categorical data. Nonlinear models can be transformed into linear models.

We saw how to use Excel to develop regression models. Interpretation of computer output was presented, and several examples were provided.

Summary

Glossary

Adjusted r2 A measure of the explanatory power of a regression model that takes into consideration the number of independent variables in the model.

Binary Variable See Dummy Variable. Coefficient of Correlation 1r 2 A measure of the strength of

the relationship between two variables. Coefficient of Determination 1r2 2 The percent of the

variability in the dependent variable 1Y2 that is explained by the regression equation.

Collinearity A condition that exists when one independent variable is correlated with another independent variable.

Dependent Variable The Y variable in a regression model. This is what is being predicted.

Dummy Variable A variable used to represent a qualitative factor or condition. Dummy variables have values of 0 or 1. This is also called a binary variable or an indicator variable.

Error The difference between the actual value (Y) and the predicted value 1Yn2.

Explanatory Variable The independent variable in a regres- sion equation.

Independent Variable The X variable in a regression equation. This is used to help predict the dependent variable.

Indicator Variable (Binary Variable) A type of indepen- dent variable that is either zero or one to indicate the absence (zero) or presence (one) of some condition or force.

Least Squares A reference to the criterion used to select the regression line, to minimize the squared distances between the estimated straight line and the observed values.

Mean Squared Error (MSE) An estimate of the error variance.

Multicollinearity A condition that exists when one independent variable is correlated with other independent variables.

Multiple Regression Model A regression model that has more than one independent variable.

Observed Significance Level Another name for p-value. p-Value A probability value that is used when testing

a hypothesis. The hypothesis is rejected when this is low.

Predictor Variable Another name for explanatory variable. Regression Analysis A forecasting procedure that uses

the least-squares approach on one or more independent variables to develop a forecasting model.

Residual Another term for error. Response Variable The dependent variable in a regression

equation. Scatter Diagrams or Scatter Plots Diagrams of the variable

to be forecasted, plotted against another variable, such as time. Also called scatter plots.

Standard Error of the Estimate An estimate of the stan- dard deviation of the errors; sometimes called the standard deviation of the regression.

M04_REND3161_13_AIE_C04.indd 135 28/10/16 10:23 AM

136  CHAPTER 4 • REgREssIon MoDELs

Key Equations

(4-1) Y = b0 + b1X + P

Underlying linear model for simple linear regression.

(4-2) Yn = b0 + b1X

Simple linear regression model computed from a sample.

(4-3) e = Y - Yn

Error in regression model.

(4-4) b1 = g1X - X21Y - Y2

g1X - X22 Slope in the regression line.

(4-5) b0 = Y - b1X

Intercept in the regression line.

(4-6) SST = g1Y - Y22 Total sums of squares.

(4-7) SSE = ge2 = g1Y - Yn22 Sum of squares due to error.

(4-8) SSR = g1Yn - Y22 Sum of squares due to regression.

(4-9) SST = SSR + SSE

Relationship among sums of squares in regression.

(4-10) r2 = SSR

SST = 1 -

SSE

SST

Coefficient of determination.

(4-11) r = {2r2 Coefficient of correlation. This has the same sign as the slope.

(4-12) s2 = MSE = SSE

n - k - 1

An estimate of the variance of the errors in regression; n is the sample size and k is the number of independent variables.

(4-13) s = 1MSE An estimate of the standard deviation of the regres- sion. Also called the standard error of the estimate.

(4-14) MSR = SSR

k

Mean square regression. k is the number of independent variables.

(4-15) F = MSR

MSE

F statistic used to test significance of overall regression model.

(4-16) Y = b0 + b1X1 + b2X2 + Á + bkXk + P

Underlying model for multiple regression model.

(4-17) Yn = b0 + b1X1 + b2X2 + Á + bkXk

Multiple regression model computed from a sample.

(4-18) Adjusted r2 = 1 - SSE>1n - k - 12

SST>1n - 12 Adjusted r2 used in building multiple regression models.

Stepwise Regression An automated process to systemati- cally add or delete independent variables from a regression model.

Sum of Squares Error (SSE) The total sum of the squared differences between each observation (Y) and the predicted value 1Yn2.

Sum of Squares Regression (SSR) The total sum of the squared differences between each predicted value 1Yn2 and the mean 1Y2.

Sum of Squares Total (SST) The total sum of the squared differences between each observation (Y) and the mean 1Y2.

M04_REND3161_13_AIE_C04.indd 136 28/10/16 10:23 AM

soLVED PRoBLEMs  137

Solved Problems

Solved Problem 4-1 Judith Thompson runs a florist shop on the Gulf Coast of Texas, specializing in floral arrangements for weddings and other special events. She advertises weekly in the local newspapers and is consider- ing increasing her advertising budget. Before doing so, she decides to evaluate the past effectiveness of these ads. Five weeks are sampled, and the advertising dollars and sales volume for each of these are shown in the following table. Develop a regression equation that would help Judith evaluate her advertising. Find the coefficient of determination for this model.

SALES ($1,000) ADVERTISING ($100)

11 5

6 3

10 7

6 2

12 8

Solution

SALES Y ADVERTISING X 1X − X 22 1X − X 2 1Y − Y 2 11 5 15 - 522 = 0 15 - 52111 - 92 = 0 6 3 13 - 522 = 4 13 - 5216 - 92 = 6 10 7 17 - 522 = 4 17 - 52110 - 92 = 2 6 2 12 - 522 = 9 12 - 5216 - 92 = 9 12 8 18 - 522 = 9 18 - 52112 - 92 = 9

gY = 45 Y = 45>5

= 9

gX = 25 X = 25>5

= 5

g1X - X22 = 26 g1X - X21Y - Y2 = 26

b1 = g1X - X21Y - Y2

g1X - X22 = 26

26 = 1

b0 = Y - b1X = 9 - 112152 = 4 The regression equation is

Yn = 4 + 1X

M04_REND3161_13_AIE_C04.indd 137 28/10/16 10:23 AM

138  CHAPTER 4 • REgREssIon MoDELs

To compute r2, we use the following table:

Y X Yn = 4 + 1X 1Yn − Y 22 1Y − Y 22

11 5 9 111 - 922 = 4 111 - 922 = 4 6 3 7 16 - 722 = 1 16 - 922 = 9 10 7 11 110 - 1122 = 1 110 - 922 = 1 6 2 6 16 - 622 = 0 16 - 922 = 9 12 8 12 112 - 1222 = 0 112 - 922 = 9

gY = 45 gX = 25 g1Y - Yn22 = 6 g1Y - Y22 = 32 Y = 9 X = 5 SSE SST

The slope 1b1 = 12 tells us that for each 1-unit increase in X (or $100 in advertising), sales increase by 1 unit (or $1,000). Also, r2 = 0.8125, indicating that about 81% of the variability in sales can be explained by the regression model with advertising as the independent variable.

Solved Problem 4-2 Use Excel with the data in Solved Problem 4-1 to find the regression model. What does the F test say about this model?

Solution Program 4.8 provides the Excel output for this problem. We see the equation is

Yn = 4 + 1X

The coefficient of determination 1r22 is shown to be 0.8125. The significance level for the F test is 0.0366, which is less than 0.05. This indicates the model is statistically significant. Thus, there is suf- ficient evidence in the data to conclude that the model is useful and there is a relationship between X (advertising) and Y (sales).

PROGRAM 4.8 Excel 2016 output for solved Problem 4-2

M04_REND3161_13_AIE_C04.indd 138 28/10/16 10:24 AM

DIsCUssIon QUEsTIons AnD PRoBLEMs  139

Self-Test

●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the glossary at the end of the chapter.

●● Use the key at the back of the book (see Appendix H) to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. One of the assumptions in regression analysis is that a. the errors have a mean of 1. b. the errors have a mean of 0. c. the observations (Y) have a mean of 1. d. the observations (Y) have a mean of 0.

2. A graph of the sample points that will be used to develop a regression line is called a. a sample graph. b. a regression diagram. c. a scatter diagram. d. a regression plot.

3. When using regression, an error is also called a. an intercept. b. a prediction. c. a coefficient. d. a residual.

4. In a regression model, Y is called a. the independent variable. b. the dependent variable. c. the regression variable. d. the predictor variable.

5. A quantity that provides a measure of how far each sample point is from the regression line is a. the SSR. b. the SSE. c. the SST. d. the MSR.

6. The percentage of the variation in the dependent variable that is explained by a regression equation is measured by a. the coefficient of correlation. b. the MSE. c. the coefficient of determination. d. the slope.

7. In a regression model, if every sample point is on the regression line (all errors are 0), then a. the correlation coefficient would be 0. b. the correlation coefficient would be -1 or 1.

c. the coefficient of determination would be -1. d. the coefficient of determination would be 0.

8. When using dummy variables in a regression equation to model a qualitative or categorical variable, the number of dummy variables should equal a. the number of categories. b. 1 more than the number of categories. c. 1 less than the number of categories. d. the number of other independent variables in the

model. 9. A multiple regression model differs from a simple linear

regression model because the multiple regression model has more than one a. independent variable. b. dependent variable. c. intercept. d. error.

10. The overall significance of a regression model is tested using an F test. The model is significant if a. the F value is low. b. the significance level of the F value is low. c. the r2 value is low. d. the slope is lower than the intercept.

11. A new variable should not be added to a multiple regression model if that variable causes a. r2 to decrease. b. the adjusted r2 to decrease. c. the SST to decrease. d. the intercept to decrease.

12. A good regression model should have a. a low r2 and a low significance level for the F test. b. a high r2 and a high significance level for the F test. c. a high r2 and a low significance level for the F test. d. a low r2 and a high significance level for the F test.

Discussion Questions and Problems

Discussion Questions 4-1 What is the meaning of least squares in a regression

model? 4-2 Discuss the use of dummy variables in regression

analysis. 4-3 Discuss how the coefficient of determination and the

coefficient of correlation are related and how they are used in regression analysis.

4-4 Explain how a scatter diagram can be used to iden- tify the type of regression to use.

4-5 Explain how the adjusted r2 value is used in devel- oping a regression model.

4-6 Explain what information is provided by the F test. 4-7 What is the SSE? How is this related to the SST and

the SSR? 4-8 Explain how a plot of the residuals can be used in

developing a regression model.

M04_REND3161_13_AIE_C04.indd 139 28/10/16 10:24 AM

140  CHAPTER 4 • REgREssIon MoDELs

Problems 4-9 John Smith has developed the following forecasting

model: Yn = 36 + 4.3X1

where Yn = demand for K10 air conditioners X1 = the outside temperature 1°F2

(a) Forecast the demand for K10 when the tempera- ture is 70°F.

(b) What is the demand for a temperature of 80°F? (c) What is the demand for a temperature of 90°F?

4-10 The operations manager of a musical instrument distributor feels that demand for a particular type of guitar may be related to the number of YouTube views for a music video by the popular rock group Marble Pumpkins during the preceding month. The manager has collected the data shown in the follow- ing table:

YouTube VIEWS (1,000s)

GUITAR SALES

30 8

40 11

70 12

60 10

80 15

50 13

(a) Graph these data to see whether a linear equa- tion might describe the relationship between the views on YouTube and guitar sales.

(b) Using the equations presented in this chapter, compute the SST, SSE, and SSR. Find the least- squares regression line for these data.

(c) Using the regression equation, predict guitar sales if there were 40,000 views last month.

4-11 Using the data in Problem 4-10, test to see if there is a statistically significant relationship between sales and YouTube views at the 0.05 level of sig- nificance. Use the formulas in this chapter and Appendix D.

4-12 Using computer software, find the least-squares re- gression line for the data in Problem 4-10. Based on the F test, is there a statistically significant relation- ship between the demand for guitars and the number of YouTube views?

4-13 Students in a management science class have just re- ceived their grades on the first test. The instructor has provided information about the first test grades in some previous classes, as well as the final aver- ages for the same students. Some of these grades have been sampled and are as follows:

STUDENT 1 2 3 4 5 6 7 8 9

1st test grade 98 77 88 80 96 61 66 95 69

Final average 93 78 84 73 84 64 64 95 76

(a) Develop a regression model that could be used to predict the final average in the course based on the first test grade.

(b) Predict the final average of a student who made an 83 on the first test.

(c) Give the values of r and r2 for this model. Inter- pret the value of r2 in the context of this problem.

4-14 Using the data in Problem 4-13, test to see if there is a statistically significant relationship between the grade on the first test and the final average at the 0.05 level of significance. Use the formulas in this chapter and Appendix D.

4-15 Using computer software, find the least-squares re- gression line for the data in Problem 4-13. Based on the F test, is there a statistically significant relation- ship between the first test grade and the final average in the course?

4-16 Steve Caples, a real estate appraiser in Lake Charles, Louisiana, has developed a regression model to help appraise residential housing in the Lake Charles area. The model was developed using recently sold homes in a particular neighborhood. The price (Y) of the house is based on the square footage (X) of the house. The model is

Yn = 33,478 + 62.4X

The coefficient of correlation for the model is 0.63.

(a) Use the model to predict the selling price of a house that is 1,860 square feet.

(b) A house with 1,860 square feet recently sold for $165,000. Explain why this is not what the model predicted.

(c) If you were going to use multiple regression to develop an appraisal model, what other quantita- tive variables might be included in the model?

(d) What is the coefficient of determination for this model?

4-17 Accountants at the firm Walker and Walker be- lieved that several traveling executives submit unusually high travel vouchers when they return from business trips. The accountants took a sam- ple of 200 vouchers submitted from the past year; they then developed the following multiple regres- sion equation relating expected travel cost (Y) to number of days on the road 1X12 and distance traveled 1X22 in miles:

Yn = $90.00 + $48.50X1 + $0.40X2

Note: means the problem may be solved with QM for Windows; means the problem may be solved with

Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M04_REND3161_13_AIE_C04.indd 140 28/10/16 10:24 AM

DIsCUssIon QUEsTIons AnD PRoBLEMs  141

The coefficient of correlation computed was 0.68.

(a) If Thomas Williams returns from a 300-mile trip that took him out of town for 5 days, what is the expected amount that he should claim as expenses?

(b) Williams submitted a reimbursement request for $685; what should the accountant do?

(c) Comment on the validity of this model. Should any other variables be included? Which ones? Why?

4-18 Thirteen students entered the undergraduate busi- ness program at Rollins College 2 years ago. The following table indicates what their grade-point av- erages (GPAs) were after being in the program for 2 years and what each student scored on the SAT exam (maximum 2400) when he or she was in high school. Is there a meaningful relationship between grades and SAT scores? If a student scores a 1200 on the SAT, what do you think his or her GPA will be? What about a student who scores 2400?

STUDENT SAT SCORE GPA STUDENT SAT SCORE GPA

A 1263 2.90 H 1443 2.53

B 1131 2.93 I 2187 3.22

C 1755 3.00 J 1503 1.99

D 2070 3.45 K 1839 2.75

E 1824 3.66 L 2127 3.90

F 1170 2.88 M 1098 1.60

G 1245 2.15

4-19 Bus and subway ridership in Washington, D.C., dur- ing the summer months is believed to be heavily tied to the number of tourists visiting the city. During the past 12 years, the following data have been obtained:

YEAR

NUMBER OF TOURISTS (1,000,000s)

RIDERSHIP

(100,000s)

1 7 15

2 2 10

3 6 13

4 4 15

5 14 25

6 15 27

7 16 24

8 12 20

9 14 27

10 20 44

11 15 34

12 7 17

(a) Plot these data and determine whether a linear model is reasonable.

(b) Develop a regression model. (c) What is expected ridership if 10 million tourists

visit the city?

(d) If there are no tourists at all, explain the pre- dicted ridership.

4-20 Use computer software to develop a regression model for the data in Problem 4-19. Explain what this output indicates about the usefulness of this model.

4-21 The following data give the starting salary for stu- dents who recently graduated from a local university and accepted jobs soon after graduation. The starting salary, grade-point average (GPA), and major (busi- ness or other) are provided.

SALARY $29,500 $46,000 $39,800 $36,500

GPA 3.1 3.5 3.8 2.9

Major Other Business Business Other

SALARY $42,000 $31,500 $36,200

GPA 3.4 2.1 2.5 Major Business Other Business

(a) Using a computer, develop a regression model that could be used to predict starting salary based on GPA and major.

(b) Use this model to predict the starting salary for a business major with a GPA of 3.0.

(c) What does the model say about the starting sal- ary for a business major compared to a nonbusi- ness major?

(d) Do you believe this model is useful in predicting the starting salary? Justify your answer, using in- formation provided in the computer output.

4-22 The following data give the selling price, square footage, number of bedrooms, and age of houses that have sold in a neighborhood in the past 6 months. Develop three regression models to predict the sell- ing price based upon each of the other factors indi- vidually. Which of these is best?

SELLING PRICE ($)

SQUARE FOOTAGE

BEDROOMS

AGE (YEARS)

84,000 1,670 2 30

79,000 1,339 2 25

91,500 1,712 3 30

120,000 1,840 3 40

127,500 2,300 3 18

132,500 2,234 3 30

145,000 2,311 3 19

164,000 2,377 3 7

155,000 2,736 4 10

168,000 2,500 3 1

172,500 2,500 4 3

174,000 2,479 3 3

175,000 2,400 3 1

177,500 3,124 4 0

184,000 2,500 3 2

195,500 4,062 4 10

195,000 2,854 3 3

M04_REND3161_13_AIE_C04.indd 141 28/10/16 10:24 AM

142  CHAPTER 4 • REgREssIon MoDELs

4-23 Use the data in Problem 4-22 and develop a regres- sion model to predict selling price based on the square footage and number of bedrooms. Use this to predict the selling price of a 2,000-square-foot house with three bedrooms. Compare this model with the models in Problem 4-22. Should the num- ber of bedrooms be included in the model? Why or why not?

4-24 Use the data in Problem 4-22 and develop a regres- sion model to predict selling price based on the square footage, number of bedrooms, and age. Use this to predict the selling price of a 10-year-old, 2,000-square-foot house with three bedrooms.

4-25 The total expenses of a hospital are related to many factors. Two of these factors are the number of beds in the hospital and the number of admissions. Data were collected on 14 hospitals, as shown in the fol- lowing table:

HOSPITAL

NUMBER OF BEDS

ADMISSIONS (100s)

TOTAL EXPENSES ($1,000,000s)

1 215 77 57

2 336 160 127

3 520 230 157

4 135 43 24

5 35 9 14

6 210 155 93

7 140 53 45

8 90 6 6

9 410 159 99

10 50 18 12

11 65 16 11

12 42 29 15

13 110 28 21

14 305 98 63

Find the best regression model to predict the total expenses of a hospital. Discuss the accuracy of this model. Should both variables be included in the model? Why or why not?

4-26 A sample of 20 automobiles was taken, and the miles per gallon (MPG), horsepower, and total weight were recorded. Develop a linear regression model to predict MPG, using horsepower as the only indepen- dent variable. Develop another model with weight as the independent variable. Which of these two mod- els is better? Explain.

MPG HORSEPOWER WEIGHT

44 67 1,844

44 50 1,998

40 62 1,752

MPG HORSEPOWER WEIGHT

37 69 1,980

37 66 1,797

34 63 2,199

35 90 2,404

32 99 2,611

30 63 3,236

28 91 2,606

26 94 2,580

26 88 2,507

25 124 2,922

22 97 2,434

20 114 3,248

21 102 2,812

18 114 3,382

18 142 3,197

16 153 4,380

16 139 4,036

4-27 Use the data in Problem 4-26 to develop a multiple linear regression model. How does this compare with each of the models in Problem 4-26?

4-28 Use the data in Problem 4-26 to find the best qua- dratic regression model. (There is more than one to consider.) How does this compare to the models in Problems 4-26 and 4-27?

4-29 A sample of nine public universities and nine private universities was taken. The total cost for the year (including room and board) and the median SAT score (maximum total is 2400) at each school were recorded. It was felt that schools with higher median SAT scores would have a better reputation and would charge more tuition as a result of that. The data are in the following table. Use regression to help answer the following questions based on the sample data. Do schools with higher SAT scores charge more in tuition and fees? Are private schools more expensive than public schools when SAT scores are taken into consideration? Discuss how accurate you believe these results are, using information related to the re- gression models.

CATEGORY TOTAL COST ($) MEDIAN SAT

Public 21,700 1990

Public 15,600 1620

Public 16,900 1810

Public 15,400 1540

Public 23,100 1540

Public 21,400 1600

Public 16,500 1560

Public 23,500 1890

(Continued on next page)

M04_REND3161_13_AIE_C04.indd 142 28/10/16 10:24 AM

DIsCUssIon QUEsTIons AnD PRoBLEMs  143

CATEGORY TOTAL COST ($) MEDIAN SAT

Public 20,200 1620

Private 30,400 1630

Private 41,500 1840

Private 36,100 1980

Private 42,100 1930

Private 27,100 2130

Private 34,800 2010

Private 32,100 1590

Private 31,800 1720

Private 32,100 1770

4-30 In 2012, the total payroll for the New York Yankees was almost $200 million, while the total payroll for the Oakland Athletics (a team known for using baseball analytics or sabermetrics) was about $55 million, less than one-third of the Yankees’ payroll. In the following table, you will see the payrolls (in millions) and the total number of victories for the baseball teams in the American League in the 2012 season. Develop a regression model to predict the to- tal number of victories based on the payroll. Use the model to predict the number of victories for a team with a payroll of $79 million. Based on the results of the computer output, discuss the relationship be- tween payroll and victories.

TEAM

PAYROLL ($1,000,000s)

NUMBER OF VICTORIES

Baltimore Orioles 81.4 93

Boston Red Sox 173.2 69

Chicago White Sox 96.9 85

Cleveland Indians 78.4 68

Detroit Tigers 132.3 88

Kansas City Royals 60.9 72

Los Angeles Angels 154.5 89

Minnesota Twins 94.1 66

New York Yankees 198.0 95

Oakland Athletics 55.4 94

Seattle Mariners 82.0 75

Tampa Bay Rays 64.2 90

Texas Rangers 120.5 93

Toronto Blue Jays 75.5 73

4-31 The number of victories (W), earned run average (ERA), runs scored (R), batting average (AVG), and on-base percentage (OBP) for each team in the American League in the 2012 season are provided in the following table. The ERA is one measure of the effectiveness of the pitching staff, and a lower number is better. The other statistics are measures of the effectiveness of the hitters, and a higher number is better for each of these.

TEAM W ERA R AVG OBP

Baltimore Orioles 93 3.90 712 0.247 0.311

Boston Red Sox 69 4.70 734 0.260 0.315

Chicago White Sox 85 4.02 748 0.255 0.318

Cleveland Indians 68 4.78 667 0.251 0.324

Detroit Tigers 88 3.75 726 0.268 0.335

Kansas City Royals 72 4.30 676 0.265 0.317

Los Angeles Angels 89 4.02 767 0.274 0.332

Minnesota Twins 66 4.77 701 0.260 0.325

New York Yankees 95 3.85 804 0.265 0.337

Oakland Athletics 94 3.48 713 0.238 0.310

Seattle Mariners 75 3.76 619 0.234 0.296

Tampa Bay Rays 90 3.19 697 0.240 0.317

Texas Rangers 93 3.99 808 0.273 0.334

Toronto Blue Jays 73 4.64 716 0.245 0.309

(a) Develop a regression model that could be used to predict the number of victories based on the ERA.

(b) Develop a regression model that could be used to predict the number of victories based on the runs scored.

(c) Develop a regression model that could be used to predict the number of victories based on the batting average.

(d) Develop a regression model that could be used to predict the number of victories based on the on-base percentage.

(e) Which of the four models is better for predicting the number of victories?

(f) Find the best multiple regression model to pre- dict the number of wins. Use any combination of the variables to find the best model.

4-32 The closing stock price for each of two stocks was recorded over a 12-month period. The closing price for the Dow Jones Industrial Average (DJIA) was also recorded over this same time period. These val- ues are shown in the following table:

MONTH DJIA STOCK 1 STOCK 2

1 11,168 48.5 32.4

2 11,150 48.2 31.7

3 11,186 44.5 31.9

4 11,381 44.7 36.6

5 11,679 49.3 36.7

6 12,081 49.3 38.7

7 12,222 46.1 39.5

8 12,463 46.2 41.2

9 12,622 47.7 43.3

10 12,269 48.3 39.4

11 12,354 47.0 40.1

12 13,063 47.9 42.1

13 13,326 47.8 45.2

M04_REND3161_13_AIE_C04.indd 143 28/10/16 10:24 AM

144  CHAPTER 4 • REgREssIon MoDELs

(a) Develop a regression model to predict the price of stock 1 based on the Dow Jones Industrial Average.

(b) Develop a regression model to predict the price of stock 2 based on the Dow Jones Industrial Average.

(c) Which of the two stocks is most highly corre- lated to the Dow Jones Industrial Average over this time period?

4-33 Annual rainfall plays an important role in corn agri- culture. The drought of 2011 literally affected corn prices for years. Given the following data, build a

model and predict the harvest for 2016 given that the total rainfall was 6.45 inches. Critique your prediction.

YEAR RAIN (INCHES) REAP (TONS)

2011 2.06 325

2012 5.11 408

2013 7.43 609

2014 6.12 512

2015 7.14 544

In January 2012, Northern Airlines merged with Southeast Air- lines to create the fourth largest U.S. carrier. The new North– South Airline inherited both an aging fleet of Boeing 727-300 aircraft and Stephen Ruth. Stephen was a tough former Secre- tary of the Navy who stepped in as new president and chairman of the board.

Stephen’s first concern in creating a financially solid com- pany was maintenance costs. It was commonly surmised in the airline industry that maintenance costs rise with the age of the aircraft. He quickly noticed that historically there had been a significant difference in the reported B727-300 maintenance costs (from ATA Form 41s) in both the airframe and the engine areas between Northern Airlines and Southeast Airlines, with Southeast having the newer fleet.

On February 12, 2012, Peg Jones, vice president for op- erations and maintenance, was called into Stephen’s office and asked to study the issue. Specifically, Stephen wanted to know whether the average fleet age was correlated to direct airframe maintenance costs and whether there was a relationship be- tween average fleet age and direct engine maintenance costs. Peg was to report back by February 26 with the answer, along with quantitative and graphical descriptions of the relationship.

Peg’s first step was to have her staff construct the average age of the Northern and Southeast B727-300 fleets, by quarter,

since the introduction of that aircraft to service by each airline in late 1993 and early 1994. The average age of each fleet was calculated by first multiplying the total number of calendar days each aircraft had been in service at the pertinent point in time by the average daily utilization of the respective fleet to determine the total fleet hours flown. The total fleet hours flown was then divided by the number of aircraft in service at that time, giving the age of the “average” aircraft in the fleet.

The average utilization was found by taking the actual total fleet hours flown on September 30, 2011, from Northern and Southeast data, and dividing by the total days in service for all aircraft at that time. The average utilization for Southeast was 8.3 hours per day, and the average utilization for Northern was 8.7 hours per day. Because the available cost data were calcu- lated for each yearly period ending at the end of the first quarter, average fleet age was calculated at the same points in time. The fleet data are shown in the following table. Airframe cost data and engine cost data are both shown paired with fleet average age in that table.

Discussion Questions 1. Prepare Peg Jones’s response to Stephen Ruth.

Note: Dates and names of airlines and individuals have been changed in this case to maintain confidentiality. The data and issues described here are real.

Case Study

North–South Airline

north–south Airline Data for Boeing 727-300 Jets

NORTHERN AIRLINES DATA SOUTHEAST AIRLINES DATA

YEAR

AIRFRAME COST PER

AIRCRAFT ($)

ENGINE COST PER

AIRCRAFT ($)

AVERAGE

AGE (HOURS)

AIRFRAME COST PER

AIRCRAFT ($)

ENGINE COST PER

AIRCRAFT ($)

AVERAGE

AGE (HOURS)

2001 51.80 43.49 6,512 13.29 18.86 5,107

2002 54.92 38.58 8,404 25.15 31.55 8,145

2003 69.70 51.48 11,077 32.18 40.43 7,360

2004 68.90 58.72 11,717 31.78 22.10 5,773

2005 63.72 45.47 13,275 25.34 19.69 7,150

2006 84.73 50.26 15,215 32.78 32.58 9,364

2007 78.74 79.60 18,390 35.56 38.07 8,259

M04_REND3161_13_AIE_C04.indd 144 28/10/16 10:24 AM

APPEnDIx 4.1: FoRMULAs FoR REgREssIon CALCULATIons  145

Bibliography

Berenson, Mark L., David M. Levine, and Timothy C. Krehbiel. Basic Business Statistics, 12th ed. Upper Saddle River, NJ: Pearson, 2012.

Black, Ken. Business Statistics: For Contemporary Decision Making, 8th ed. John Wiley & Sons, Inc., 2014.

Draper, Norman R., and Harry Smith. Applied Regression Analysis, 3rd ed. New York: John Wiley & Sons, Inc., 1998.

Kuiper, S., and J. Sklar. Practicing Statistics: Guided Investigations for the Second Course. Upper Saddle River, NJ: Pearson, 2013.

Kutner, Michael, John Neter, and Chris J. Nachtsheim. Applied Linear Regres- sion Models, 4th ed. Boston; New York: McGraw-Hill/Irwin, 2004.

Mendenhall, William, and Terry L. Sincich. A Second Course in Statistics: Regression Analysis, 7th ed. Upper Saddle River, NJ: Pearson, 2012.

Y X Y2 X2 XY

6 3 62 = 36 32 = 9 3162 = 18 8 4 82 = 64 42 = 16 4182 = 32 9 6 92 = 81 62 = 36 6192 = 54 5 4 52 = 25 42 = 16 4152 = 20 4.5 2 4.52 = 20.25 22 = 4 214.52 = 9 9.5 5 9.52 = 90.25 52 = 25 519.52 = 47.5

gY = 42 gX = 24 gY2 = 316.5 gX2 = 106 gXY = 180.5 Y = 42>6 = 7 X = 24>6 = 4

TABLE 4.7 Preliminary Calculations for Triple A Construction

Appendix 4.1: Formulas for Regression Calculations

When performing regression calculations by hand, there are other formulas that can make the task easier and are math- ematically equivalent to the ones presented in the chapter. These, however, make it more difficult to see the logic be- hind the formulas and to understand what the results actu- ally mean.

When using these formulas, it helps to set up a table with the columns shown in Table 4.7, which has the Triple A Con- struction Company data that were used earlier in the chapter. The sample size (n) is 6. The totals for all columns are shown, and the averages for X and Y are calculated. Once this is done, we can use the following formulas for computations in a simple linear regression model (one independent variable). The simple linear regression equation is again given as

Yn = b0 + b1X

Slope of regression equation:

b1 = gXY - nXY gX2 - nX2

b1 = 180.5 - 6142172

106 - 61422 = 1.25

Intercept of regression equation:

b0 = Y - b1X b0 = 7 - 1.25142 = 2

Sum of squares of the error:

SSE = gY2 - b0gY - b1gXY SSE = 316.5 - 21422 - 1.251180.52 = 6.875

Estimate of the error variance:

s2 = MSE = SSE

n - 2

s2 = 6.875

6 - 2 = 1.71875

Estimate of the error standard deviation:

s = 1MSE s = 21.71875 = 1.311

M04_REND3161_13_AIE_C04.indd 145 28/10/16 10:24 AM

146  CHAPTER 4 • REgREssIon MoDELs

Coefficient of determination:

r2 = 1 - SSE

gY2 - nY 2 r2 = 1 -

6.875

316.5 - 61722 = 0.6944

This formula for the correlation coefficient automatically determines the sign of r. This could also be found by

taking the square root of r2 and giving it the same sign as the slope:

r = ngXY - gXgY23ngX2 - 1gX2243ngY2 - 1gY224

r = 61180.52 - 1242142223611062 - 2424361316.52 - 4224 = 0.833

M04_REND3161_13_AIE_C04.indd 146 28/10/16 10:24 AM

 147

5.5 Apply forecast models for trends and random variations.

5.6 Manipulate data to account for seasonal variations.

5.7 Apply forecast models for trends, seasonal variations, and random variations.

5.8 Explain how to monitor and control forecasts.

5.1 Understand and know when to use various families of forecasting models.

5.2 Compare moving averages, exponential smoothing, and other time-series models.

5.3 Calculate measures of forecast accuracy.

5.4 Apply forecast models for random variations.

After completing this chapter, students will be able to:

Forecasting

LEARNING OBJECTIVES

5 CHAPTER

Every day, managers make decisions without knowing what will happen in the future. In-ventory is ordered though no one knows what sales will be, new equipment is purchased though no one knows the demand for products, and investments are made though no one knows what profits will be. Managers are always trying to reduce this uncertainty and to make better estimates of what will happen in the future. Accomplishing this is the main purpose of forecasting.

There are many ways to forecast the future. In numerous firms (especially smaller ones), the entire process is subjective, involving seat-of-the-pants methods, intuition, and years of experience.

There are also more formal forecasting techniques, both quantitative and qualitative in na- ture. The primary focus of this chapter will be understanding time-series models and determin- ing which model works best with a particular set of data.

5.1 Types of Forecasting Models

Figure 5.1 lists some of the more common forecasting models, and these are categorized by the type of model. The first category involves qualitative models, while the others are quantitative in nature and use mathematical models to develop better forecasts.

Qualitative Models Qualitative models are forecasting techniques based on judgmental or subjective factors. When a totally new product such as the iPad is introduced, forecasting demand is very difficult due to

M05_REND3161_13_AIE_C05.indd 147 27/10/16 2:14 PM

148  CHAPTER 5 • FoRECAsTing

the lack of any historical sales data on that particular product or on similar products. The com- pany must rely on expert opinion, individual experiences and judgment, and other subjective factors.

Here is a brief overview of four different qualitative forecasting techniques:

1. Delphi method. This iterative group process allows experts, who may be located in differ- ent places, to make forecasts. There are three different types of participants in the Delphi process: decision makers, staff personnel, and respondents. The decision-making group usually consists of 5 to 10 experts who will be making the actual forecast. The staff person- nel assist the decision makers by preparing, distributing, collecting, and summarizing a series of questionnaires and survey results. The respondents are a group of people whose judgments are valued and are being sought. This group provides inputs to the decision makers before the forecast is made. In the Delphi method, when the results of the first questionnaire are obtained, the re- sults are summarized, and the questionnaire is modified. Both the summary of the results and the new questionnaire are then sent to the same respondents for a new round of re- sponses. The respondents, upon seeing the results from the first questionnaire, may view things differently and may modify their original responses. This process is repeated with the hope that a consensus is reached.

2. Jury of executive opinion. This method takes the opinions of a small group of high-level managers, often in combination with statistical models, and results in a group estimate of demand.

3. Sales force composite. In this approach, each salesperson estimates what sales will be in his or her region; these forecasts are reviewed to ensure that they are realistic and are then combined at the district and national levels to reach an overall forecast.

4. Consumer market survey. This method solicits input from customers or potential customers regarding their future purchasing plans. It can help not only in preparing a forecast but also in improving product design and planning for new products.

Causal Models A variety of quantitative forecasting models are available when past numerical data are available. Forecasting models are identified as causal models if the variable to be forecast is influenced by or correlated with other variables included in the model. For example, daily sales of bottled wa- ter might depend on the average temperature, the average humidity, and so on. A causal model would include factors such as these in the mathematical model. Regression models (see Chapter 4) and other more complex models would be classified as causal models.

Overview of four qualitative or judgmental approaches: Delphi method, jury of executive opinion, sales force composite, and consumer market survey.

Forecasting Techniques

Qualitative Models

Causal Methods

Delphi Method

Moving Averages

Regression Analysis

Exponential Smoothing

Multiple Regression

Trend Projections

Jury of Executive Opinion

Sales Force Composite

Consumer Market Survey

Decomposition

Time-Series Methods

FIGURE 5.1 Forecasting Models

M05_REND3161_13_AIE_C05.indd 148 27/10/16 2:14 PM

5.2 CoMPonEnTs oF A TiME-sERiEs  149

Time-Series Models Time series are also quantitative models, and many time-series methods are available. A time- series model is a forecasting technique that attempts to predict the future values of a variable by using only historical data on that one variable. These models are extrapolations of past values of that series. While other factors may have influenced these past values, the impact of those other factors is captured in the previous values of the variable being predicted. Thus, if we are fore- casting weekly sales for lawn mowers, we use the past weekly sales for lawn mowers in making the forecast for future sales, ignoring other factors such as the economy, competition, and even the selling price of the lawn mowers.

5.2 Components of a Time-Series

A time series is sequence of values recorded at successive intervals of time. The intervals can be days, weeks, months, years, or other time units. Examples include weekly sales of HP personal computers, quarterly earnings reports of Microsoft Corporation, daily shipments of Eveready batteries, and annual U.S. consumer price indices. A time series may consist of four possible components—trend, seasonal, cyclical, and random.

The trend (T) component is the general upward or downward movement of the data over a relatively long period of time. For example, total sales for a company may be increasing con- sistently over time. The consumer price index, one measure of inflation, is increasing over time. While consistent upward (or downward) movements are indicative of a trend, there may be a positive (or negative) trend present in a time series and yet the values do not increase (or de- crease) in every time period. There may be an occasional movement that seems inconsistent with the trend due to random or other fluctuations.

Figure 5.2 shows scatter diagrams for several time series. The data for all the series are quar- terly, and there are four years of data. Series 3 has both trend and random components present.

The seasonal (S) component is a pattern of fluctuations above or below an average value that repeats at regular intervals. For example, with monthly sales data on snowblowers, sales tend to be high in December and January and lower in summer months, and this pattern is expected to

Series 4: Trend, Seasonal, and Random Variations

Series 3: Trend and Random Variations

Series 2: Seasonal Variations Only

Series 1: Random Variations Only

1 2 3 4 5 6 7 8 Time Period (Quarters)

S al

es

9 10 11 12 13 14 15 16

FIGURE 5.2 scatter Diagram for Four Time series of Quarterly Data

M05_REND3161_13_AIE_C05.indd 149 27/10/16 2:14 PM

150  CHAPTER 5 • FoRECAsTing

repeat every year. Quarterly sales for a consumer electronics store may be higher in the fourth quarter of every year and lower in other quarters. Daily sales in a retail store may be higher on Saturdays than on other days of the week. Hourly sales in a fast-food restaurant are usually ex- pected to be higher around the lunch hour and the dinner hour, while other times are not as busy. Series 2 in Figure 5.2 illustrates seasonal variations for quarterly data.

If a seasonal component is present in a set of data, the number of seasons depends on the type of data. With quarterly data, there are four seasons because there are four quarters in a year. With monthly data, there would be 12 seasons because there are 12 months in a year. With daily sales data for a retail store that is open seven days a week, there would be seven seasons. With hourly data, there could be 24 seasons if the business is open 24 hours a day.

A cyclical (C) component of a time series is a pattern in annual data that tends to repeat ev- ery several years. The cyclical component of a time series is used only when making very long- range forecasts, and it is usually associated with the business cycle. Sales or economic activity might reach a peak and then begin to recede and contract, reaching a bottom or trough. At some point after the trough is reached, activity would pick up as recovery and expansion take place. A new peak would be reached, and the cycle would begin again. Figure 5.3 shows 16 years of annual data for a time series that has a cyclical as well as a random component.

While a time series with cyclical variations and a time series with seasonal variations may look similar on a graph, cyclical variations tend to be irregular in length (from a few years to 10 or more years) and magnitude, and they are very difficult to predict. Seasonal variations are very consistent in length and magnitude; are much shorter, as the seasons repeat in a year or less; and are much easier to predict. The forecasting models presented in this chapter will be for short- range or medium-range forecasts and the cyclical component will not be included in these models.

The random (R) component consists of irregular, unpredictable variations in a time series. Any variation in a times series that cannot be attributed to trend, seasonal, or cyclical variations would fall into this category. If data for a time series tend to be level with no discernible trend or seasonal pattern, random variations would be the cause for any changes from one time period to the next. Series 1 in Figure 5.2 is an example of a time series with only a random component.

There are two general forms of time-series models in statistics. The first is a multiplicative model, which assumes that demand is the product of the four components. It is stated as follows:

Demand = T * S * C * R

An additive model adds the components together to provide an estimate. Multiple regres- sion is often used to develop additive models. This additive relationship is stated as follows:

Demand = T + S + C + R

There are other models that may be a combination of these. For example, one of the com- ponents (such as trend) might be additive, while another (such as seasonality) could be multi- plicative. Understanding the components of a time series will help in selecting an appropriate forecasting technique to use. The methods presented in this chapter will be grouped according to the components considered when the forecast is developed.

0 2 4 6 8 10 Time Period (Years)

S al

es

12 14 16 18

FIGURE 5.3 scatter Diagram of a Time series with Cyclical and Random Components

M05_REND3161_13_AIE_C05.indd 150 27/10/16 2:14 PM

5.3 MEAsUREs oF FoRECAsT ACCURACy  151

5.3 Measures of Forecast Accuracy

We discuss several different forecasting models in this chapter. To see how well one model works or to compare that model with other models, the forecast values are compared with the actual or observed values. The forecast error (or deviation) is defined as follows:

Forecast error = Actual value - Forecast value

One measure of accuracy is the mean absolute deviation (MAD). This is computed by tak- ing the sum of the absolute values of the individual forecast errors and dividing by the number of errors (n):

MAD = g �Forecast error �

n (5-1)

To illustrate how to compute the measures of accuracy, the naïve model will be used to forecast one period into the future. The naïve model does not attempt to address any of the components of a time series, but it is very quick and easy to use. A naïve forecast for the next time period is the actual value that was observed in the current time period. For example, suppose someone asked you to forecast the high temperature in your city for tomorrow. If you forecast the tem- perature to be whatever the high temperature is today, your forecast would be a naïve forecast. This technique is often used if a forecast is needed quickly and accuracy is not a major concern.

Consider Walker Distributors’ sales of wireless speakers shown in Table 5.1. Suppose that in the past, Walker had forecast sales for each month to be the sales that were actually achieved in the previous month. Table 5.1 gives these forecasts as well as the absolute value of the errors. In forecasting for the next time period (month 11), the forecast would be 190. Notice that there is no error computed for month 1, since there was no forecast for this month, and there is no error for month 11, since the actual value of this is not yet known. Thus, the number of errors (n) is 9.

From this, we see the following:

MAD = g �Forecast error �

n =

160

9 = 17.8

This means that, on the average, each forecast missed the actual value by 17.8 units.

The naïve forecast for the next period is the actual value observed in the current period.

TABLE 5.1 Computing the Mean Absolute Deviation (MAD) MONTH

ACTUAL SALES OF WIRELESS

SPEAKERS FORECAST

SALES

ABSOLUTE VALUE OF ERRORS (DEVIATION). |ACTUAL–FORECAST|

1 110 — —

2 100 110 �100 - 110 � = 10 3 120 100 �120 - 100 � = 20 4 140 120 �140 - 120 � = 20 5 170 140 �170 - 140 � = 30 6 150 170 �150 - 170 � = 20 7 160 150 �160 - 150 � = 10 8 190 160 �190 - 160 � = 30 9 200 190 �200 - 190 � = 10

10 190 200 �190 - 200 � = 10 11 — 190 —

Sum of � errors � = 160

MAD = 160>9 = 17.8

M05_REND3161_13_AIE_C05.indd 151 27/10/16 2:14 PM

152  CHAPTER 5 • FoRECAsTing

Other measures of the accuracy of historical errors in forecasting are sometimes used besides the MAD. One of the most common is the mean squared error (MSE), which is the average of the squared errors:1

MSE = g1Error22

n (5-2)

1 In regression analysis, the MSE formula is usually adjusted to provide an unbiased estimator of the error variance. Throughout this chapter, we will use the formula provided here.

Hurricane Landfall Location Forecasts and the Mean Absolute Deviation

Scientists at the National Hurricane Center (NHC) of the National Weather Service have the very difficult job of pre- dicting where the eye of a hurricane will hit land. Accurate forecasts are extremely important to coastal businesses and resi- dents who need to prepare for a storm or perhaps even evacu- ate. They are also important to local government officials, law enforcement agencies, and other emergency responders who will provide help once a storm has passed. Over the years, the NHC has tremendously improved the forecast accuracy (mea- sured by the mean absolute deviation [MAD]) in predicting the actual landfall location for hurricanes that originate in the At- lantic Ocean.

The NHC provides forecasts and periodic updates of where the hurricane eye will hit land. Such landfall location predictions

are recorded when a hurricane is 72 hours, 48 hours, 36 hours, 24 hours, and 12 hours away from actually reaching land. Once the hurricane has come ashore, these forecasts are compared to the actual landfall location, and the error (in miles) is recorded. At the end of the hurricane season, the errors for all the hurri- canes in that year are used to calculate the MAD for each type of forecast (12 hours away, 24 hours away, etc.). The graph below shows how the landfall location forecast has improved since 1989. During the early 1990s, the landfall forecast when the hur- ricane was 48 hours away had an MAD close to 200 miles; in 2009, this number was down to about 75 miles. Clearly, there has been vast improvement in forecast accuracy, and this trend is continuing.

Source: Based on National Hurricane Center, © Trevor S. Hale.

IN ACTION

M05_REND3161_13_AIE_C05.indd 152 27/10/16 2:14 PM

5.3 MEAsUREs oF FoRECAsT ACCURACy  153

Besides the MAD and MSE, the mean absolute percent error (MAPE) is sometimes used. The MAPE is the average of the absolute values of the errors expressed as percentages of the actual values. This is computed as follows:

MAPE = g ` Error

Actual `

n 100% (5-3)

There is another common term associated with error in forecasting. Bias is the average error and tells whether the forecast tends to be too high or too low and by how much. Thus, bias may be negative or positive. It is not a good measure of the actual size of the errors because the nega- tive errors can cancel out the positive errors.

Three common measures of error are MAD, MSE, and MAPE. Bias gives the average error and may be positive or negative.

Defining the Problem To drive production at each of Tupperware’s 15 plants in the United States, Latin America, Africa, Europe, and Asia, the firm needs accurate forecasts of demand for its products.

Developing a Model A variety of statistical models are used, including moving averages, exponential smoothing, and regression analysis. Qualitative analysis is also employed in the process.

Acquiring Input Data At world headquarters in Orlando, Florida, huge databases are maintained that map the sales of each product, the test market results of each new product (since 20% of the firm’s sales come from products less than 2 years old), and where each product falls in its own life cycle.

Developing a Solution Each of Tupperware’s 50 profit centers worldwide develops computerized monthly, quarterly, and 12-month sales projections. These are aggregated by region and then globally.

Testing the Solution Reviews of these forecasts take place in the sales, marketing, finance, and production departments.

Analyzing the Results Participating managers analyze forecasts with Tupperware’s version of a “jury of executive opinion.”

Implementing the Results Forecasts are used to schedule materials, equipment, and personnel at each plant.

Source: Based on interviews by the authors with Tupperware executives, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Forecasting at Tupperware international

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M05_REND3161_13_AIE_C05.indd 153 27/10/16 2:14 PM

154  CHAPTER 5 • FoRECAsTing

5.4 Forecasting Models—Random Variations Only

If all variations in a time series are due to random variations, with no trend, seasonal, or cycli- cal component, some type of averaging or smoothing model would be appropriate. The averag- ing techniques in this chapter are moving average, weighted moving average, and exponential smoothing. These methods will smooth out the forecasts and not be too heavily influenced by random variations. However, if there is a trend or seasonal pattern present in the data, then a technique that incorporates that particular component into the forecast should be used.

Moving Averages Moving averages are useful if we can assume that market demands will stay fairly steady over time. For example, a 4-month moving average is found simply by summing the demand during the past 4 months and dividing by 4. With each passing month, the most recent month’s data are added to the sum of the previous 3 months’ data, and the earliest month is dropped. This tends to smooth out short-term irregularities in the data series.

An n-period moving average forecast, which serves as an estimate of the next period’s demand, is expressed as follows:

Moving average forecast = Sum of demands in previous n periods

n (5-4)

Mathematically, this is written as

Ft+ 1 = Yt + Yt- 1 + Á + Yt- n + 1

n (5-5)

where

Ft+ 1 = forecast for time period t + 1 Yt = actual value in time period t n = number of periods to average

A 4-month moving average has n = 4; a 5-month moving average has n = 5.

WALLACE GARDEN SUPPLY EXAMPLE Storage shed sales at Wallace Garden Supply are shown in the middle column of Table 5.2. A 3-month moving average is indicated on the right. The forecast for the next January, using this technique, is 16. Were we simply asked to find a forecast for next January, we would have to make only this one calculation. The other forecasts are necessary only if we wish to compute the MAD or another measure of accuracy.

Weighted Moving Averages A simple moving average gives the same weight 11>n2 to each of the past observations being used to develop the forecast. On the other hand, a weighted moving average allows different weights to be assigned to the previous observations. As the weighted moving average method typically assigns greater weight to more recent observations, this forecast is more responsive to changes in the pattern of the data that occur. However, this is also a potential drawback to this method because the heavier weight would also respond just as quickly to random fluctuations.

A weighted moving average may be expressed as

Ft+ 1 = g1Weight in period i21Actual value in period i2

g1Weights2 (5-6) Mathematically, this is

Ft+ 1 = w1Yt + w2Yt- 1 + Á + wnYt- n + 1

w1 + w2 + Á + wn (5-7)

where

wi = weight for ith observation

Moving averages smooth out variations when forecasting demands that are fairly steady.

Weights can be used to put more emphasis on recent periods.

M05_REND3161_13_AIE_C05.indd 154 27/10/16 2:14 PM

5.4 FoRECAsTing MoDELs—RAnDoM VARiATions onLy  155

Wallace Garden Supply decides to use a 3-month weighted moving average forecast with weights of 3 for the most recent observation, 2 for the next observation, and 1 for the most dis- tant observation. This would be implemented as follows:

WEIGHT APPLIED PERIOD

3 Last month

2 2 months ago

1 3 months ago

3 * Sales last month + 2 * Sales 2 months ago + 1 * Sales 3 months ago 6

Sum of the weights

The results of the Wallace Garden Supply weighted average forecast are shown in Table 5.3. In this particular forecasting situation, you can see that weighting the latest month more heavily provides a much more accurate projection, and calculating the MAD for each of these would verify this.

Choosing the weights obviously has an important impact on the forecasts. One way to choose weights is to try various combinations of weights, calculate the MAD for each, and select the set of weights that results in the lowest MAD. Some forecasting software has an option to search for the best set of weights, and forecasts using these weights are then provided. The best set of weights can also be found by using nonlinear programming, as will be seen in a later chapter.

Some software packages require that the weights add to 1, and this would simplify Equation 5-7 because the denominator would be 1. Forcing the weights to sum to 1 is easily achieved by di- viding each of the weights by the sum of the weights. In the Wallace Garden Supply example in Table 5.3, the weights are 3, 2, and 1, which add to 6. These weights could be revised to the new weights 3/6, 2/6, and 1/6, which add to 1. Using these weights gives the same forecasts shown in Table 5.3.

Both simple and weighted moving averages are effective in smoothing out sudden fluctua- tions in the demand pattern in order to provide stable estimates. Moving averages do, however, have two problems. First, increasing the size of n (the number of periods averaged) does smooth out fluctuations better, but it makes the method less sensitive to real changes in the data, should they occur. Second, moving averages cannot pick up trends very well. Because they are aver- ages, they will always stay within past levels and will not predict a change to either a higher or a lower level.

Moving averages have two problems: the larger number of periods may smooth out real changes, and they don’t pick up trends.

TABLE 5.2 Wallace garden supply shed sales

MONTH ACTUAL SHED SALES 3-MONTH MOVING AVERAGE

January 10

February 12

March 13

April 16 110 + 12 + 132>3 = 11.67 May 19 112 + 13 + 162>3 = 13.67 June 23 113 + 16 + 192>3 = 16.00 July 26 116 + 19 + 232>3 = 19.33 August 30 119 + 23 + 262>3 = 22.67 September 28 123 + 26 + 302>3 = 26.33 October 18 126 + 30 + 282>3 = 28.00 November 16 130 + 28 + 182>3 = 25.33 December 14 128 + 18 + 162>3 = 20.67 January — 118 + 16 + 142>3 = 16.00

M05_REND3161_13_AIE_C05.indd 155 27/10/16 2:14 PM

156  CHAPTER 5 • FoRECAsTing

Exponential Smoothing Exponential smoothing is a forecasting method that is easy to use and is handled efficiently by computers. Although it is a type of moving average technique, it involves little record keeping of past data. The basic exponential smoothing formula can be shown as follows:

New forecast = Last period’s forecast (5-8) + a1Last period’s actual demand - Last period>s forecast2

where a is a weight (or smoothing constant) that has a value between 0 and 1, inclusive. Equation 5-8 can also be written mathematically as

Ft+ 1 = Ft + a1Yt - Ft2 (5-9) where

Ft+ 1 = new forecast 1for time period t + 12 Ft = previous forecast (for time period t) a = smoothing constant 10 … a … 12 Yt = previous period’s actual demand

The concept here is not complex. The latest estimate of demand is equal to the old estimate adjusted by a fraction of the error (last period’s actual demand minus the old estimate).

The smoothing constant, a, can be changed to give more weight to recent data when the value is high or more weight to past data when it is low. For example, when a = 0.5, it can be shown mathematically that the new forecast is based almost entirely on demand in the past three periods. When a = 0.1, the forecast places little weight on any single period, even the most re- cent, and it takes many periods (about 19) of historical values into account.2

For example, in January, a demand for 142 of a certain car model for February was predicted by a dealer. Actual February demand was 153 autos, so the forecast error was 153 - 142 = 11. Using a smoothing constant a = 0.20, the exponential smoothing forecast for March demand would be found by adding 20% of this error to the previous forecast of 142. Substituting into the formula, we obtain

New forecast 1for March demand2 = 142 + 0.21153 - 1422 = 144.2

TABLE 5.3 Weighted Moving Average Forecast for Wallace garden supply

MONTH ACTUAL SHED SALES 3-MONTH WEIGHTED MOVING AVERAGE

January 10

February 12

March 13

April 16 313 * 132 + 12 * 122 + 11024>6 = 12.17 May 19 313 * 162 + 12 * 132 + 11224>6 = 14.33 June 23 313 * 192 + 12 * 162 + 11324>6 = 17.00 July 26 313 * 232 + 12 * 192 + 11624>6 = 20.5 August 30 313 * 262 + 12 * 232 + 11924>6 = 23.83 September 28 313 * 302 + 12 * 262 + 12324>6 = 27.5 October 18 313 * 282 + 12 * 302 + 12624>6 = 28.33 November 16 313 * 182 + 12 * 282 + 13024>6 = 23.33 December 14 313 * 162 + 12 * 182 + 12824>6 = 18.67 January — 313 * 142 + 12 * 162 + 11824>6 = 15.33

2 The term exponential smoothing is used because the weight of any one period’s demand in a forecast decreases expo- nentially over time. See an advanced forecasting book for algebraic proof.

The smoothing constant, A, allows managers to assign weight to recent data.

M05_REND3161_13_AIE_C05.indd 156 27/10/16 2:15 PM

5.4 FoRECAsTing MoDELs—RAnDoM VARiATions onLy  157

Thus, the forecast for the demand for cars in March would be 144 after being rounded by the dealer.

Suppose that actual demand for the cars in March was 136. A forecast for the demand in April, using the exponential smoothing model with a constant of a = 0.20, can be made:

New forecast 1for April demand2 = 144.2 + 0.21136 - 144.22 = 142.6, or 143 autos

GETTING STARTED The exponential smoothing approach is easy to use and has been applied suc- cessfully by banks, manufacturing companies, wholesalers, and other organizations. To develop a forecast with this method, a smoothing constant must be selected, and a previous forecast must be known or assumed. If a company has been routinely using this method, there is no problem. However, if a company is just beginning to use the method, these issues must be addressed.

The appropriate value of the smoothing constant, a, can make the difference between an accurate forecast and an inaccurate forecast. In picking a value for the smoothing constant, the objective is to obtain the most accurate forecast. Several values of the smoothing constant may be tried, and the one with the lowest MAD could be selected. This is analogous to how weights are selected for a weighted moving average forecast. Some forecasting software will automati- cally select the best smoothing constant. QM for Windows will display the MAD that would be obtained with values of a ranging from 0 to 1 in increments of 0.01.

When the exponential smoothing model is used for the first time, there is no prior forecast for the current time period to use in developing a forecast for the next time period. Therefore, a previous value for a forecast must be assumed. It is common practice to assume a forecast for time period 1 and to use this to develop a forecast for time period 2. The time period 2 forecast is then used to forecast time period 3, and this continues until the forecast for the current time period is found. Unless there is reason to assume another value, the forecast for time period 1 is assumed to be equal to the actual value in time period 1 (i.e., the error is zero). The value of the forecast for time period 1 usually has very little impact on the value of forecasts many time periods into the future.

PORT OF BALTIMORE EXAMPLE Let us apply this concept with a trial-and-error testing of two values of a in an example. The port of Baltimore has unloaded large quantities of grain from ships dur- ing the past eight quarters. The port’s operations manager wants to test the use of exponential smoothing to see how well the technique works in predicting tonnage unloaded. He assumes that the forecast of grain unloaded in the first quarter was 175 tons. Two values of a are examined: a = 0.10 and a = 0.50. Table 5.4 shows the detailed calculations for a = 0.10 only.

To evaluate the accuracy of each smoothing constant, we can compute the absolute devia- tions and MADs (see Table 5.5). Based on this analysis, a smoothing constant of a = 0.10 is preferred to a = 0.50 because its MAD is smaller.

TABLE 5.4 Port of Baltimore Exponen- tial smoothing Forecasts for a = 0.10 and a = 0.50

QUARTER

ACTUAL TONNAGE

UNLOADED FORECAST

USING A = 0.10 FORECAST

USING A = 0.50

1 180 175 175

2 168 175.5 = 175.00 + 0.101180 - 1752 177.5 3 159 174.75 = 175.50 + 0.101168 - 175.502 172.75 4 175 173.18 = 174.75 + 0.101159 - 174.752 165.88 5 190 173.36 = 173.18 + 0.101175 - 173.182 170.44 6 205 175.02 = 173.36 + 0.101190 - 173.362 180.22 7 180 178.02 = 175.02 + 0.101205 - 175.022 192.61 8 182 178.22 = 178.02 + 0.101180 - 178.022 186.30 9 ? 178.60 = 178.22 + 0.101182 - 178.222 184.15

M05_REND3161_13_AIE_C05.indd 157 27/10/16 2:15 PM

158  CHAPTER 5 • FoRECAsTing

Using Software for Forecasting Time Series The two software packages available with this book, Excel QM and QM for Windows, are very easy to use for forecasting. The previous examples will be solved using these.

In using Excel QM with Excel 2016 for forecasting, from the Excel QM ribbon, select Alphabetical as shown in Program 5.1A. Then simply select whichever method you wish to use, and an initialization window opens to allow you to set the size of the problem. Program 5.1B shows this window for the Wallace Garden Supply weighted moving average example with the number of past periods and the number of periods in the weighted average already entered. Clicking OK results in the screen shown in Program 5.1C, allowing you to enter the data and the weights. Once all numbers are entered, the calculations are automatically performed, as you see in Program 5.1C.

To use QM for Windows to forecast, under Modules select Forecasting. Then select New and Time Series Analysis, as shown in Program 5.2A. This would be the same for all of the models presented in this chapter. In the window that opens (Program 5.2B), specify the number

TABLE 5.5 Absolute Deviations and MADs for the Port of Baltimore Example

QUARTER

ACTUAL TONNAGE

UNLOADED

FORECAST WITH

A = 0.10

ABSOLUTE DEVIATIONS FOR A = 0.10

FORECAST WITH

A = 0.50

ABSOLUTE DEVIATIONS FOR A = 0.50

1 180 175 5 175 5

2 168 175.5 7.5 177.5 9.5

3 159 174.75 15.75 172.75 13.75

4 175 173.18 1.82 165.88 9.12

5 190 173.36 16.64 170.44 19.56

6 205 175.02 29.98 180.22 24.78

7 180 178.02 1.98 192.61 12.61

8 182 178.22 3.78 186.30 4.3

Sum of absolute deviations 82.45 98.63

MAD = g �Deviation �

n = 10.31

MAD = 12.33

Click the Excel QM tab.

With cursor on Forecasting, a menu appears to the right. Select the model you want and an initialization window will open.

Click Alphabetical and scroll down to Forecasting.

PROGRAM 5.1A selecting the Forecasting Model in Wallace garden supply Problem

M05_REND3161_13_AIE_C05.indd 158 27/10/16 2:15 PM

5.4 FoRECAsTing MoDELs—RAnDoM VARiATions onLy  159

Enter the number of periods to be averaged.

Click OK.

Enter a title. Enter the number of past periods of data. PROGRAM 5.1B initializing Excel QM spreadsheet for Wallace garden supply Problem

Enter the demand data and the weights. The calculations will automatically be performed.

The measures of accuracy are shown here.

The forecast for the next period is here.

PROGRAM 5.1C Excel QM output for Wallace garden supply Problem

In the Forecasting module, click New and Time-Series Analysis.

PROGRAM 5.2A selecting Time-series Analysis in QM for Windows in the Forecasting Module

Enter a title.

Enter the number of past periods of data.

Click OK.

PROGRAM 5.2B Entering Data for Port of Baltimore Example in QM for Windows

of past periods of data. For the Port of Baltimore example, this is 8. Click OK, and an input screen appears, allowing you to enter the data and select the forecasting technique, as shown in Program 5.2C. Based on the method you choose, other windows may open to allow you to specify the necessary parameters for that model. In this example, the exponential smoothing model is selected, so the smoothing constant must be specified. After entering the data, click Solve, and

M05_REND3161_13_AIE_C05.indd 159 27/10/16 2:15 PM

160  CHAPTER 5 • FoRECAsTing

the output shown in Program 5.2D appears. From this output screen, you can select Window to see additional information such as the details of the calculations and a graph of the time series and the forecasts.

5.5 Forecasting Models—Trend and Random Variations

If there is trend present in a time series, the forecasting model must account for this and cannot simply average past values. Two very common techniques will be presented here. The first is ex- ponential smoothing with trend, and the second is called trend projection or simply a trend line.

Exponential Smoothing with Trend An extension of the exponential smoothing model that will explicitly adjust for trend is called the exponential smoothing with trend model. The idea is to develop an exponential smooth- ing forecast and then adjust this for trend. Two smoothing constants, a and b, are used in this model, and both of these values must be between 0 and 1. The level of the forecast is adjusted by multiplying the first smoothing constant, a, by the most recent forecast error and adding it to the previous forecast. The trend is adjusted by multiplying the second smoothing constant, b, by the most recent error or excess amount in the trend. A higher value gives more weight to recent observations and thus responds more quickly to changes in the patterns.

As with simple exponential smoothing, the first time a forecast is developed, a previous forecast 1Ft2 must be given or estimated. If none is available, often the initial forecast is assumed to be perfect. In addition, a previous trend 1Tt2 must be given or estimated. This is often estimated by using other past data, if available; by using subjective means; or by calculating the increase (or decrease) observed during the first few time periods of the data available. Without such an estimate available, the trend is sometimes assumed to be 0 initially, although this may lead to poor forecasts if the trend is large and b is small. Once these initial conditions have been set, the exponential smoothing forecast including trend 1FITt2 is developed using three steps:

Two smoothing constants are used.

Estimate or assume initial values for Ft and Tt.

Enter the value for the smoothing constant.

Enter the data. Then click Solve at the top of the page.

Click here to see the models. Other input areas appear based on the model. Select Exponential Smoothing and a window opens for you to enter the smoothing constant.

PROGRAM 5.2C selecting the Model and Entering Data for Port of Baltimore Example in QM for Windows

Additional output is available under Window.

The measures of accuracy are shown here.

The forecast for next period is here.

PROGRAM 5.2D output for Port of Baltimore Example in QM for Windows

M05_REND3161_13_AIE_C05.indd 160 27/10/16 2:15 PM

5.5 FoRECAsTing MoDELs—TREnD AnD RAnDoM VARiATions  161

STEP1. Compute the smoothed forecast 1Ft+ 12 for time period t + 1 using the equation Smoothed forecast = Previous forecast including trend + a1Last error2

Ft+ 1 = FITt + a1Yt - FITt2 (5-10)

STEP 2. Update the trend 1Tt+ 12 using the equation Smoothed trend = Previous trend + b1Error or excess in trend2

Tt+ 1 = Tt + b1Ft+ 1 - FITt2 (5-11)

STEP 3. Calculate the trend-adjusted exponential smoothing forecast 1FITt+ 12 using the equation Forecast including trend 1FITt+ 12 = Smoothed forecast 1Ft+ 12 + Smoothed trend 1Tt+ 12

FITt+ 1 = Ft+ 1 + Tt+ 1 (5-12)

where

Tt = smoothed trend for time period t Ft = smoothed forecast for time period t

FITt = forecast including trend for time period t a = smoothing constant for forecasts b = smoothing constant for trend

Consider the case of Midwestern Manufacturing Company, which has a demand for electri- cal generators over the period 2007 to 2013 as shown in Table 5.6. To use the trend-adjusted ex- ponential smoothing method, first set initial conditions (previous values for F and T) and choose a and b. Assuming that F1 is perfect and T1 is 0 and picking 0.3 and 0.4 for the smoothing con- stants, we have

F1 = 74 T1 = 0 a = 0.3 b = 0.4

This results in

FIT1 = F1 + T1 = 74 + 0 = 74

Following the three steps to get the forecast for 2008 (time period 2), we have

STEP 1. Compute Ft+ 1 using the equation

Ft+ 1 = FITt + a1Yt - FITt2 F2 = FIT1 + 0.31Y1 - FIT12 = 74 + 0.3174 - 742 = 74

STEP 2. Update the trend 1Tt+ 12 using the equation Tt+ 1 = Tt + b1Ft+ 1 - FITt2

T2 = T1 + 0.41F2 - FIT12 = 0 + 0.4174 - 742 = 0

TABLE 5.6 Midwestern Manufacturing’s Demand

YEAR ELECTRICAL GENERATORS SOLD

2007 74

2008 79

2009 80

2010 90

2011 105

2012 142

2013 122

M05_REND3161_13_AIE_C05.indd 161 27/10/16 2:15 PM

162  CHAPTER 5 • FoRECAsTing

STEP 3. Calculate the trend-adjusted exponential smoothing forecast 1FITt+ 12 using the equation FIT2 = F2 + T2 = 74 + 0 = 74

For 2009 (time period 3), we have

STEP 1. F3 = FIT2 + 0.31Y2 - FIT22 = 74 + 0.3179 - 742 = 75.5

STEP 2. T3 = T2 + 0.41F3 - FIT22 = 0 + 0.4175.5 - 742 = 0.6

STEP 3. FIT3 = F3 + T3 = 75.5 + 0.6 = 76.1

The other results are shown in Table 5.7. The forecast for 2014 would be about 131.35. To have Excel QM perform the calculations in Excel 2016, from the Excel QM ribbon, select

the alphabetical list of techniques and choose Forecasting and then Trend Adjusted Exponential Smoothing. After specifying the number of past observations, enter the data and the values for a and b, as shown in Program 5.3.

TABLE 5.7 Midwestern Manufacturing Exponential smoothing with Trend Forecasts

TIME (t)

DEMAND (Yt) Ft+1 = FITt + 0.3 1Yt − FITt 2 Tt+1 = Tt + 0.4 1Ft+1 − FITt 2 FITt+1 = Ft+1 + Tt+1

1 74 74 0 74

2 79 74 = 74 + 0.3174 - 742 0 = 0 + 0.4174 - 742 74 = 74 + 0 3 80 75.5 = 74 + 0.3179 - 742 0.6 = 0 + 0.4175.5 - 742 76.1 = 75.5 + 0.6 4 90 77.270 1.068 78.338 = 77.270 + 1.068

= 76.1 + 0.3180 - 76.12 = 0.6 + 0.4177.27 - 76.12 5 105 81.837 2.468 84.305 = 81.837 + 2.468

= 78.338 + 0.3190 - 78.3382 = 1.068 + 0.4181.837 - 78.3382 6 142 90.514 4.952 95.466 = 90.514 + 4.952

= 84.305 + 0.31105 - 84.3052 = 2.468 + 0.4190.514 - 84.3052 7 122 109.426 10.536 119.962 = 109.426 + 10.536

= 95.466 + 0.31142 - 95.4662 = 4.952 + 0.41109.426 - 95.4662 8 120.573 10.780 131.353 = 120.573 + 10.780

= 119.962 + 0.31122 - 119.9622 = 10.536 + 0.41120.573 - 119.9622

The forecast for next period is here.

PROGRAM 5.3 output from Excel QM in Excel 2016 for Trend- Adjusted Exponential smoothing Example

M05_REND3161_13_AIE_C05.indd 162 27/10/16 2:15 PM

5.5 FoRECAsTing MoDELs—TREnD AnD RAnDoM VARiATions  163

Trend Projections Another method for forecasting time series with trend is called trend projection. This technique fits a trend line to a series of historical data points and then projects the line into the future for medium- to long-range forecasts. There are several mathematical trend equations that can be developed (e.g., exponential and quadratic), but in this section we look at linear (straight line) trends only. A trend line is simply a linear regression equation in which the independent variable (X) is the time period. The first time period will be time period 1. The second time period will be time period 2, and so forth. The last time period will be time period n. The form of this is

Yn = b0 + b1X

where

Yn = predicted value b0 = intercept b1 = slope of the line X = time period (i.e., X = 1, 2, 3, c, n)

The least squares regression method may be applied to find the coefficients that minimize the sum of the squared errors, thereby also minimizing the mean squared error (MSE). Chapter 4 provides a detailed explanation of least squares regression and the formulas to calculate the coef- ficients by hand. In this section, we use computer software to perform the calculations.

Let us consider the case of Midwestern Manufacturing’s demand for generators that was presented in Table 5.6. A trend line can be used to predict demand (Y) based on the time period using a regression equation. For the first time period, which was 2007, we let X = 1. For 2008, we let X = 2, and so forth. Using computer software to develop a regression equation as we did in Chapter 4, we get the following equation:

Yn = 56.71 + 10.54X

To project demand in 2014, we first denote the year 2014 in our new coding system as X = 8:

1Sales in 20142 = 56.71 + 10.54182 = 141.03, or 141 generators

We can estimate demand for 2015 by inserting X = 9 in the same equation:

1Sales in 20152 = 56.71 + 10.54192 = 151.57, or 152 generators

Program 5.4 provides output from Excel QM in Excel 2016. To run this model, from the Excel QM ribbon, select Alphabetical to see the techniques. Then select Forecasting and

A trend line is a regression equation with time as the independent variable.

To forecast other time periods, enter the time period here.

The forecast for next period is here.

PROGRAM 5.4 output from Excel QM in Excel 2016 for Trend Line Example

M05_REND3161_13_AIE_C05.indd 163 27/10/16 2:15 PM

164  CHAPTER 5 • FoRECAsTing

Regression / Trend Analysis. When the input window opens, enter the number of past observa- tions (7), and the spreadsheet is initialized, allowing you to input the seven Y values and the seven X values, as shown in Program 5.4.

This problem could also be solved using QM for Windows. To do this, select the Forecast- ing module, and then enter a new problem by selecting New – Time Series Analysis. When the next window opens, enter the number of observations (7) and press OK. Enter the values (Y) for the seven past observations when the input window opens. It is not necessary to enter the values for X (1, 2, 3, . . . , 7) because QM for Windows will automatically use these numbers. Then click Solve to see the results shown in Program 5.5.

Figure 5.4 provides a scatter diagram and a trend line for these data. The projected demand in each of the next three years is also shown on the trend line.

5.6 Adjusting for Seasonal Variations

Time-series forecasting such as that in the example of Midwestern Manufacturing involves looking at the trend of data over a series of time observations. Sometimes, however, recurring variations at certain seasons of the year make a seasonal adjustment in the trend line forecast necessary. Demand for coal and fuel oil, for example, usually peaks during cold winter months. Demand for golf clubs or suntan lotion may be highest in summer. Analyzing data in monthly or quarterly terms usually makes it easy to spot seasonal patterns. A seasonal index is often used

Forecasts for future time periods are shown here.

The trend line is shown over two lines.

PROGRAM 5.5 output from QM for Windows for Trend Line Example

0 0

20

40

60

80

100

120

140

160

180

1 2 3 4 5 6 7 8 9 10 11 Time Period

G en

er at

or D

em an

d

Trend Line Y 5 56.71 1 10.54X ^

Projected demand for next 3 years is shown on the trend line.

FIGURE 5.4 generator Demand and Projections for next Three years Based on Trend Line

M05_REND3161_13_AIE_C05.indd 164 27/10/16 2:15 PM

5.6 ADjUsTing FoR sEAsonAL VARiATions  165

in multiplicative time-series forecasting models to make an adjustment in the forecast when a seasonal component exists. An alternative is to use an additive model such as a regression model that will be introduced in a later section.

Seasonal Indices A seasonal index indicates how a particular season (e.g., month or quarter) compares with an average season. An index of 1 for a season would indicate that the season is average. If the index is higher than 1, the values of the time series in that season tend to be higher than average. If the index is lower than 1, the values of the time series in that season tend to be lower than average.

Seasonal indices are used with multiplicative forecasting models in two ways. First, each observation in a time series is divided by the appropriate seasonal index to remove the impact of seasonality. The resulting values are called deseasonalized data. Using these deseasonalized values, forecasts for future values can be developed using a variety of forecasting techniques. Once the forecasts of future deseasonalized values have been developed, they are multi- plied by the seasonal indices to develop the final forecasts, which now include variations due to seasonality.

There are two ways to compute seasonal indices. The first method, based on an overall average, is easy and may be used when there is no trend present in the data. The second method, based on a centered-moving-average approach, is more difficult, but it must be used when there is trend present.

Calculating Seasonal Indices with No Trend When no trend is present, the index can be found by dividing the average value for a particular season by the average of all the data. Thus, an index of 1 means the season is average. For ex- ample, if the average sales in January were 120 and the average sales in all months were 200, the seasonal index for January would be 120>200 = 0.60, so January is below average. The next example illustrates how to compute seasonal indices from historical data and to use these in forecasting future values.

Monthly sales of one brand of telephone answering machine at Eichler Supplies are shown in Table 5.8 for the two most recent years. The average demand in each month is computed, and these values are divided by the overall average (94) to find the seasonal index for each month. We then use the seasonal indices from Table 5.8 to adjust future forecasts. For example, suppose we expected the third year’s annual demand for answering machines to be 1,200 units, which is

An average season has an index of 1.

TABLE 5.8 Answering Machine sales and seasonal indices

MONTH

SALES DEMAND AVERAGE 2-YEAR

DEMAND MONTHLY DEMANDa

AVERAGE SEASONAL

INDEXbYEAR 1 YEAR 2

January 80 100 90 94 0.957

February 85 75 80 94 0.851

March 80 90 85 94 0.904

April 110 90 100 94 1.064

May 115 131 123 94 1.309

June 120 110 115 94 1.223

July 100 110 105 94 1.117

August 110 90 100 94 1.064

September 85 95 90 94 0.957

October 75 85 80 94 0.851

November 85 75 80 94 0.851

December 80 80 80 94 0.851

Total average demand = 1,128

a Average monthly demand = 1,128

12 months = 94 b Seasonal index =

Average 2@year demand

Average monthly demand

M05_REND3161_13_AIE_C05.indd 165 27/10/16 2:15 PM

166  CHAPTER 5 • FoRECAsTing

100 per month. We would not forecast each month to have a demand of 100, but we would adjust these based on the seasonal indices as follows:

Jan. 1,200

12 * 0.957 = 96 July

1,200

12 * 1.117 = 112

Feb. 1,200

12 * 0.851 = 85 Aug.

1,200

12 * 1.064 = 106

Mar. 1,200

12 * 0.904 = 90 Sept.

1,200

12 * 0.957 = 96

Apr. 1,200

12 * 1.064 = 106 Oct.

1,200

12 * 0.851 = 85

May 1,200

12 * 1.309 = 131 Nov.

1,200

12 * 0.851 = 85

June 1,200

12 * 1.223 = 122 Dec.

1,200

12 * 0.851 = 85

Calculating Seasonal Indices with Trend When both trend and seasonal components are present in a time series, a change from one month to the next could be due to a trend, to a seasonal variation, or simply to random fluctuations. To help with this problem, the seasonal indices should be computed using a centered moving aver- age (CMA) approach whenever trend is present. Using this approach prevents a variation due to trend from being incorrectly interpreted as a variation due to the season. Consider the following example.

Quarterly sales figures for Turner Industries are shown in Table 5.9. Notice that there is a definite trend, as the total is increasing each year, and there is an increase for each quarter from one year to the next as well. The seasonal component is obvious, as there is a definite drop from the fourth quarter of one year to the first quarter of the next. A similar pattern is observed in comparing the third quarters to the fourth quarters immediately following.

If a seasonal index for quarter 1 were computed using the overall average, the index would be too low and misleading, since this quarter has less trend than any of the others in the sample. If the first quarter of year 1 were omitted and replaced by the first quarter of year 4 (if it were available), the average for quarter 1 (and consequently the seasonal index for quarter 1) would be considerably higher. To derive an accurate seasonal index, we should use a CMA.

Consider quarter 3 of year 1 for the Turner Industries example. The actual sales in that quar- ter were 150. To determine the magnitude of the seasonal variation, we should compare this with an average quarter centered at that time period. Thus, we should have a total of four quarters (1 year of data) with an equal number of quarters before and after quarter 3 so the trend is av- eraged out. Thus, we need 1.5 quarters before quarter 3 and 1.5 quarters after it. To obtain the CMA, we take quarters 2, 3, and 4 of year 1, plus one-half of quarter 1 for year 1 and one-half of quarter 1 for year 2. The average will be

CMA 1quarter 3 of year 12 = 0.511082 + 125 + 150 + 141 + 0.511162 4

= 132.00

We compare the actual sales in this quarter to the CMA, and we have the following seasonal ratio:

Seasonal ratio = Sales in quarter 3

CMA =

150

132.00 = 1.136

Centered moving averages are used to compute seasonal indices when there is trend.

TABLE 5.9 Quarterly sales ($1,000,000s) for Turner industries

QUARTER YEAR 1 YEAR 2 YEAR 3 AVERAGE

1 108 116 123 115.67

2 125 134 142 133.67

3 150 159 168 159.00

4 141 152 165 152.67

Average 131.00 140.25 149.50 140.25

M05_REND3161_13_AIE_C05.indd 166 27/10/16 2:15 PM

5.7 FoRECAsTing MoDELs—TREnD, sEAsonAL, AnD RAnDoM VARiATions  167

Thus, sales in quarter 3 of year 1 are about 13.6% higher than an average quarter at this time. All of the CMAs and the seasonal ratios are shown in Table 5.10.

Since there are two seasonal ratios for each quarter, we average these to get the seasonal index. Thus,

Index for quarter 1 = I1 = 10.851 + 0.8482>2 = 0.85 Index for quarter 2 = I2 = 10.965 + 0.9602>2 = 0.96 Index for quarter 3 = I3 = 11.136 + 1.1272>2 = 1.13 Index for quarter 4 = I4 = 11.051 + 1.0632>2 = 1.06

The sum of these indices should be the number of seasons (4), since an average season should have an index of 1. In this example, the sum is 4. If the sum were not 4, an adjustment would be made. We would multiply each index by 4 and divide this by the sum of the indices.

Steps Used to Compute Seasonal Indices Based on CMAs

1. Compute a CMA for each observation (where possible). 2. Compute Seasonal ratio = Observation/CMA for that observation. 3. Average seasonal ratios to get seasonal indices. 4. If seasonal indices do not add to the number of seasons, multiply each index by (Number

of seasons)/(Sum of the indices).

The seasonal indices found using the CMAs will be used to remove the impact of seasons so that the trend is easier to identify. Later, the seasonal indices will be used again to adjust the trend forecast based on the seasonal variations.

5.7 Forecasting Models—Trend, Seasonal, and Random Variations

When both trend and seasonal components are present in a time series, the forecasting model selected must address these. The decomposition method, which uses seasonal indices, is a very common approach. Multiple regression models are also common, with dummy variables used to adjust for seasonal variations in an additive time-series model.

The Decomposition Method The process of isolating linear trend and seasonal factors to develop more accurate forecasts is called decomposition. The first step is to compute seasonal indices for each season as we have done with the Turner Industries data. Then, the data are deseasonalized by dividing each number

TABLE 5.10 Centered Moving Averages and seasonal Ratios for Turner industries

YEAR QUARTER SALES

($1,000,000s) CMA SEASONAL

RATIO

1 1 108

2 125

3 150 132.000 1.136

4 141 134.125 1.051

2 1 116 136.375 0.851

2 134 138.875 0.965

3 159 141.125 1.127

4 152 143.000 1.063

3 1 123 145.125 0.848

2 142 147.875 0.960

3 168

4 165

M05_REND3161_13_AIE_C05.indd 167 27/10/16 2:15 PM

168  CHAPTER 5 • FoRECAsTing

by its seasonal index, as shown in Table 5.11. Figure 5.5 provides a graph of the original data, as well as a graph of the deseasonalized data. Notice how smooth the deseasonalized data are.

A trend line is then found using the deseasonalized data. Using computer software with these data, we have3

b1 = 2.34 b0 = 124.78

The trend equation is

Yn = 124.78 + 2.34X

where

X = time

This equation is used to develop the forecast based on trend, and the result is multiplied by the appropriate seasonal index to make a seasonal adjustment. For the Turner Industries data, the

TABLE 5.11 Deseasonalized Data for Turner industries

SALES ($1,000,000s) SEASONAL INDEX DESEASONALIZED SALES

($1,000,000s)

108 0.85 127.059

125 0.96 130.208

150 1.13 132.743

141 1.06 133.019

116 0.85 136.471

134 0.96 139.583

159 1.13 140.708

152 1.06 143.396

123 0.85 144.706

142 0.96 147.917

168 1.13 148.673

165 1.06 155.660

3 If you do the calculations by hand, the numbers may differ slightly from these due to rounding.

0 1 2 3 4 5 6 7 8 9 10 11 12 13 0

50

100

150

200

Time Period (Quarters)

S al

es ($

1, 00

0, 00

0s )

Sales Data

Deseasonalized Sales Data

FIGURE 5.5 scatterplot of Turner industries original sales Data and Deseasonalized Data

M05_REND3161_13_AIE_C05.indd 168 27/10/16 2:15 PM

5.7 FoRECAsTing MoDELs—TREnD, sEAsonAL, AnD RAnDoM VARiATions  169

forecast for the first quarter of year 4 (time period X = 13 and seasonal index I1 = 0.85) would be found as follows:

Yn = 124.78 + 2.34X = 124.78 + 2.341132 = 155.2 1forecast before adjustment for seasonality2

We multiply this by the seasonal index for quarter 1, and we get

Yn * I1 = 155.2 * 0.85 = 131.92

Using the same procedure, we find the forecasts for quarters 2, 3, and 4 of the next year. Table 5.12 shows the unadjusted forecast based on the trend line for each of the four quarters of year 4. The last column of this table gives the final forecasts that were found by multiplying each trend forecast by the appropriate seasonal index. A scatter diagram showing the original data and the deseasonalized data, as well as the unadjusted forecast and the final forecast, for these next four quarters is provided in Figure 5.6.

TABLE 5.12 Turner industry Forecasts for Four Quarters of year 4

YEAR QUARTER TIME PERIOD (X) TREND FORECAST Yn = 124.78 + 2.34X

SEASONAL INDEX

FINAL (ADJUSTED) FORECAST

4 1 13 155.20 0.85 131.92

2 14 157.54 0.96 151.24

3 15 159.88 1.13 180.66

4 16 162.22 1.06 171.95

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 0

50

100

150

200

Time Period (Quarters)

S al

es ($

1, 00

0, 00

0)

Sales Data Deseasonalized Sales Data Unadjusted Trend Forecast Forecast Adjusted for Season

FIGURE 5.6 scatterplot of Turner industries’ original sales Data and Deseasonalized Data with Unadjusted and Adjusted Forecasts

Steps to Develop a Forecast Using the Decomposition Method

1. Compute seasonal indices using CMAs. 2. Deseasonalize the data by dividing each number by its seasonal index. 3. Find the equation of a trend line using the deseasonalized data. 4. Forecast for future periods using the trend line. 5. Multiply the trend line forecast by the appropriate seasonal index.

M05_REND3161_13_AIE_C05.indd 169 27/10/16 2:15 PM

170  CHAPTER 5 • FoRECAsTing

Most forecasting software, including Excel QM and QM for Windows, includes the decompo- sition method as one of the available techniques. This will automatically compute the CMAs, deseasonalize the data, develop the trend line, make the forecast using the trend equation, and adjust the final forecast for seasonality.

Software for Decomposition Program 5.6A shows the QM for Windows input screen that appears after selecting the Forecast- ing module, selecting New-Time Series, and specifying 12 past observations. The multiplicative decomposition method is selected, and you can see the inputs that are used for this problem. When this is solved, the output screen in Program 5.6B appears. Additional output is available by selecting details or graph from the Windows drop-down menu (not shown in Program 5.6B) that appears after the problem is solved. The forecasts are slightly different from the ones shown in Table 5.12 due to round-off error.

Excel QM can be used in Excel 2016 for this problem also. From the QM Ribbon, select the menus By Chapter and select Chapter 5-Forecasting-Decomposition. Specify there are 12 past observations and 4 seasons, and use a centered moving average.

Using Regression with Trend and Seasonal Components Multiple regression may be used to forecast with both trend and seasonal components present in a time series. One independent variable is time, and other independent variables are dummy variables to indicate the season. If we forecast quarterly data, there are four categories (quarters),

Multiple regression can be used to develop an additive decomposition model.

Select Rescale: set average to 1.

Specify Centered Moving Average approach.

Specify the number of seasons (4 for quarterly data).

Select Multiplicative Decomposition from the drop-down menu.

Input the data.

PROGRAM 5.6A QM for Windows input screen for Turner industries Example

The final forecast is obtained by multiplying the trend (unadjusted) forecast by the seasonal indices (factors).

The seasonal indices (factors) are shown here.

The trend line is shown here over two lines.

PROGRAM 5.6B QM for Windows output screen for Turner industries Example

M05_REND3161_13_AIE_C05.indd 170 27/10/16 2:15 PM

5.7 FoRECAsTing MoDELs—TREnD, sEAsonAL, AnD RAnDoM VARiATions  171

so we would use three dummy variables. The basic model is an additive decomposition model and is expressed as follows:

Yn = a + b1X1 + b2X2 + b3X3 + b4X4

where

X1 = time period X2 = 1 if quarter 2

= 0 otherwise X3 = 1 if quarter 3

= 0 otherwise X4 = 1 if quarter 4

= 0 otherwise

If X2 = X3 = X4 = 0, then the quarter would be quarter 1. It is an arbitrary choice as to which of the quarters would not have a specific dummy variable associated with it. The forecasts will be the same, regardless of which quarter does not have a specific dummy variable.

Using Excel QM in Excel 2016 to develop the regression model, from the Excel QM rib- bon, we select the menu for Chapter 5—Forecasting, and then choose the Multiple Regression method. The input screen in Program 5.7A appears, and the number of observations (12) and the number of independent variables (4) are entered. An initialized spreadsheet appears, and the values for all the variables are entered in columns B through F, as shown in Program 5.7B. Once

Enter the number of past periods of data.

Enter the number of independent variables.

PROGRAM 5.7A Excel QM Multiple Regression initialization screen for Turner industries

Enter the values of Y and X1–X4 as shown.

The regression coefficients are shown here.

Enter the values of the variables to obtain any forecast.

PROGRAM 5.7B Excel QM Multiple Regression output screen for Turner industries

M05_REND3161_13_AIE_C05.indd 171 27/10/16 2:15 PM

172  CHAPTER 5 • FoRECAsTing

this has been done, the regression coefficients appear. The regression equation (with rounded coefficients) is

Yn = 104.1 + 2.3X1 + 15.7X2 + 38.7X3 + 30.1X4

If this is used to forecast sales in the first quarter of the next year, we get

Yn = 104.1 + 2.31132 + 15.7102 + 38.7102 + 30.1102 = 134 For quarter 2 of the next year, we get

Yn = 104.1 + 2.31142 + 15.7112 + 38.7102 + 30.1102 = 152 Notice these are not the same values we obtained using the multiplicative decomposition method. We could compare the MAD or MSE for each method and choose the one that is better.

5.8 Monitoring and Controlling Forecasts

After a forecast has been completed, it is important that it not be forgotten. No manager wants to be reminded when his or her forecast is horribly inaccurate, but a firm needs to determine why the actual demand (or whatever variable is being examined) differed significantly from that projected.4

One way to monitor forecasts to ensure that they are performing well is to employ a track- ing signal. A tracking signal is a measurement of how well the forecast is predicting actual values. As forecasts are updated every week, month, or quarter, the newly available demand data are compared to the forecast values.

The tracking signal is computed as the running sum of the forecast errors (RSFE) divided by the mean absolute deviation:

Tracking signal = RSFE

MAD (5-13)

= g1Forecast error2

MAD

A tracking signal measures how well predictions fit actual data.

Forecasting at nBC Universal

NBC Universal (NBCU), a world leader in the production, distri- bution, and marketing of entertainment, news, and information, had revenues of over $14 billion in 2005. NBCU owns a television network and several stations in the United States, an impressive portfolio of cable networks, a major motion picture company, and very popular theme parks. Over 60 percent of NBCU’s rev- enues are from the sales of on-air advertising time on its television networks and stations.

Each year, the up-front market is a brief period in late May when the television networks sell a majority of their on-air ad- vertising inventory, right after announcing their program sched- ules for the upcoming broadcast year. To address the challenging problem of forecasting up-front market demand, NBCU initially relied primarily on judgment models and then tried time-series

forecasting models. These models proved, however, to be rather unsatisfactory due to the unique nature of the demand popu- lation. NBCU now estimates up-front demand using a novel procedure that combines the Delphi forecasting method with grassroots forecasting.

The system, which has been in place since 2004, has been used to support sales decisions each year worth over $4.5 bil- lion. The system enables NBCU to easily analyze pricing scenarios across all of its television properties, while predicting demand with a high level of accuracy. NBCU’s sales leaders have credited the forecast system with giving the company a unique competi- tive advantage over its competitors.

Source: Based on S. Bollapragada, S. Gupta, B. Hurwitz, P. Miles, and R. Tyagi, “NBC-Universal Uses a Novel Qualitative Forecasting Technique to Predict Advertising Demand,” Interfaces 38, 2 (2008): 103–111, © Trevor S. Hale.

IN ACTION

4 If the forecaster is accurate, he or she usually makes sure that everyone is aware of his or her talents. Very seldom does one read articles in Fortune, Forbes, or the Wall Street Journal, however, about money managers who are consis- tently off by 25% in their stock market forecasts.

M05_REND3161_13_AIE_C05.indd 172 27/10/16 2:15 PM

5.8 MoniToRing AnD ConTRoLLing FoRECAsTs  173

where

MAD = g (Forecast error)

n

as seen earlier in Equation 5-1. Positive tracking signals indicate that demand is greater than the forecast. Negative signals

mean that demand is less than the forecast. A good tracking signal—that is, one with a low RSFE—has about as much positive error as it has negative error. In other words, small devia- tions are okay, but the positive and negative deviations should balance so that the tracking signal centers closely around zero.

When tracking signals are calculated, they are compared with predetermined control limits. When a tracking signal exceeds an upper or lower limit, a signal is tripped. This means that there is a problem with the forecasting method, and management may want to reevaluate the way it forecasts demand. Figure 5.7 shows the graph of a tracking signal that is exceeding the range of acceptable variation. If the model being used is exponential smoothing, perhaps the smoothing constant needs to be readjusted.

How do firms decide what the upper and lower tracking limits should be? There is no single answer, but they try to find reasonable values—in other words, limits not so low as to be triggered with every small forecast error and not so high as to allow bad forecasts to be regu- larly overlooked. George Plossl and Oliver Wight, two inventory control experts, suggested using maximums of {4 MADs for high-volume stock items and {8 MADs for lower-volume items.5

Other forecasters suggest slightly lower ranges. One MAD is equivalent to approximately 0.8 standard deviation, so that {2 MADs = 1.6 standard deviations, {3 MADs = 2.4 stan- dard deviations, and {4 MADs = 3.2 standard deviations. This suggests that for a fore- cast to be “in control,” 89% of the errors are expected to fall within {2 MADs, 98, within {3 MADs, or 99.9% within {4 MADs whenever the errors are approximately normally distributed.6

Here is an example that shows how the tracking signal and RSFE can be computed. Kim- ball’s Bakery’s quarterly sales of croissants (in thousands), as well as forecast demand and error computations, are in the following table. The objective is to compute the tracking signal and determine whether forecasts are performing adequately.

Setting tracking limits is a matter of setting reasonable values for upper and lower limits.

1

2

0 MADs

Upper Control Limit

Lower Control Limit

Signal Tripped

Tracking Signal

Acceptable Range

Time

FIGURE 5.7 Plot of Tracking signals

6 To prove these three percentages to yourself, just set up a normal curve for standard deviations (Z values). Using the normal table in Appendix D, you find that the area under the curve is 0.89. This represents MADs. Similarly, standard deviations encompasses 98% of the area, and so on for MADs.

5 See G. W. Plossl and O. W. Wight, Production and Inventory Control (Upper Saddle River, NJ: Prentice Hall, 1967).

M05_REND3161_13_AIE_C05.indd 173 27/10/16 2:15 PM

174  CHAPTER 5 • FoRECAsTing

TIME PERIOD

FORECAST DEMAND

ACTUAL DEMAND ERROR RSFE `

FORECAST ` ERROR CUMULATIVE

ERROR MAD TRACKING

SIGNAL

1 100 90 -10 -10 10 10 10.0 -1 2 100 95 -5 -15 5 15 7.5 -2 3 100 115 +15 0 15 30 10.0 0 4 110 100 -10 -10 10 40 10.0 -1 5 110 125 +15 +5 15 55 11.0 +0.5 6 110 140 +30 +35 30 85 14.2 +2.5

In period 6, the calculations are

MAD = g �Forecast error �

n =

85

6

= 14.2

Tracking signal = RSFE

MAD =

35

14.2

= 2.5 MADs

This tracking signal is within acceptable limits. We see that it drifted from -2.0 MADs to +2.5 MADs.

Adaptive Smoothing A lot of research has been published on the subject of adaptive forecasting. This refers to com- puter monitoring of tracking signals and self-adjustment if a signal passes its preset limit. In exponential smoothing, the a and b coefficients are first selected based on values that minimize error forecasts and are then adjusted accordingly whenever the computer notes an errant tracking signal. This is called adaptive smoothing.

Forecasts are a critical part of a manager’s function. Demand forecasts drive the production, capacity, and scheduling sys- tems in a firm and affect the financial, marketing, and person- nel planning functions.

In this chapter, we introduced three types of forecasting models: time series, causal, and qualitative. Moving averages, exponential smoothing, trend projection, and decomposition time-series models were developed. Regression and multiple regression models were recognized as causal models. Four qualitative models were brief ly discussed. In addition, we

explained the use of scatter diagrams and measures of fore- casting accuracy. In future chapters, you will see the useful- ness of these techniques in determining values for the various decision-making models.

As we learned in this chapter, no forecasting method is perfect under all conditions. Even when management has found a satisfactory approach, it must still monitor and control its forecasts to make sure that errors do not get out of hand. Forecasting can often be a very challenging but rewarding part of managing.

Summary

Glossary

Adaptive Smoothing The process of automatically monitor- ing and adjusting the smoothing constants in an exponential smoothing model.

Bias A technique for determining the accuracy of a forecast- ing model by measuring the average error and its direction.

Causal Models Models that forecast using variables and fac- tors in addition to time.

Centered Moving Average An average of the values cen- tered at a particular point in time. This is used to compute seasonal indices when trend is present.

Cyclical Component A pattern in which the annual data in a time series tend to repeat every several years.

Decision-Making Group A group of experts in a Delphi technique that has the responsibility of making the forecast.

Decomposition A forecasting model that decomposes a time series into its seasonal and trend components.

Delphi A judgmental forecasting technique that uses deci- sion makers, staff personnel, and respondents to determine a forecast.

M05_REND3161_13_AIE_C05.indd 174 27/10/16 2:15 PM

KEy EQUATions  175

Deseasonalized Data Time-series data in which each value has been divided by its seasonal index to remove the effect of the seasonal component.

Deviation A term used in forecasting for error. Error The difference between the actual value and the fore-

cast value. Exponential Smoothing A forecasting method that is a

combination of the last forecast and the last observed value. Least Squares A procedure used in trend projection and

regression analysis to minimize the squared distances be- tween the estimated straight line and the observed values.

Mean Absolute Deviation (MAD) A technique for deter- mining the accuracy of a forecasting model by taking the average of the absolute deviations.

Mean Absolute Percent Error (MAPE) A technique for determining the accuracy of a forecasting model by taking the average of the absolute errors as a percentage of the observed values.

Mean Squared Error (MSE) A technique for determining the accuracy of a forecasting model by taking the average of the squared error terms for a forecasting model.

Moving Average A forecasting technique that averages past values in computing the forecast.

Naïve Model A time-series forecasting model in which the forecast for next period is the actual value for the current period.

Qualitative Models Models that forecast using judgments, experience, and qualitative and subjective data.

Random Component The irregular, unpredictable variations in a time series.

Running Sum of the Forecast Errors (RSFE) Used to de- velop a tracking signal for time-series forecasting models, this is a running total of the errors and may be positive or negative.

Seasonal Component A pattern of fluctuations in a time se- ries above or below an average value that repeats at regular intervals.

Seasonal Index An index number that indicates how a par- ticular season compares with an average time period (with an index of 1 indicating an average season).

Smoothing Constant A value between 0 and 1 that is used in an exponential smoothing forecast.

Time-series Model A forecasting technique that predicts the future values of a variable by using only historical data on that one variable.

Tracking Signal A measure of how well the forecast is pre- dicting actual values.

Trend Component The general upward or downward move- ment of the data in a time series over a relatively long pe- riod of time.

Trend Projection The use of a trend line to forecast a time series with trend present. A linear trend line is a regression line with time as the independent variable.

Weighted Moving Average A moving average forecasting method that places different weights on past values.

Key Equations

(5-1) MAD = g �Forecast error �

n

A measure of overall forecast error called mean absolute deviation.

(5-2) MSE = g1Error22

n

A measure of forecast accuracy called mean squared error.

(5-3) MAPE = g ` Error

Actual `

n 100%

A measure of forecast accuracy called mean absolute percent error.

(5-4) Moving average forcast

= Sum of demands in previous n periods

n

An equation for computing a moving average forecast.

(5-5) Ft+ 1 = Yt + Yt- 1 + Á + Yt- n + 1

n

A mathematical expression for a moving average forecast.

(5-6) Ft+ 1= g1Weight in period i21Actual value in period i2

g1Weights2 An equation for computing a weighted moving average forecast.

(5-7) Ft+ 1 = w1Yt + w2Yt- 1 + Á + wnYt- n + 1

w1 + w2 + Á + wn A mathematical expression for a weighted moving aver- age forecast.

(5-8) New forecast = Last period’s forecast + a(Last period’s actual demand - Last period’s forecast)

An equation for computing an exponential smoothing forecast.

(5-9) Ft+ 1 = Ft + a1Yt - Ft2 Equation 5-8 rewritten mathematically.

(5-10) Ft+ 1 = FITt + a1Yt - FITt2 Equation to update the smoothed forecast 1Ft+ 12 used in the trend-adjusted exponential smoothing model.

(5-11) Tt+ 1 = Tt + b1Ft+ 1 - FITt2 Equation to update the smoothed trend value 1Tt+ 12 used in the trend-adjusted exponential smoothing model.

M05_REND3161_13_AIE_C05.indd 175 27/10/16 2:15 PM

176  CHAPTER 5 • FoRECAsTing

(5-12) FITt+ 1 = Ft+ 1 + Tt+ 1 Equation to develop forecast including trend (FIT) in the trend-adjusted exponential smoothing model.

(5-13) Tracking signal = RSFE

MAD

= g1Forecast error2

MAD

An equation for monitoring forecasts with a tracking signal.

Solved Problems

Solved Problem 5-1 Demand for patient surgery at Washington General Hospital has increased steadily in the past few years, as seen in the following table:

YEAR OUTPATIENT SURGERIES PERFORMED

1 45

2 50

3 52

4 56

5 58

6 —

The director of medical services predicted 6 years ago that demand in year 1 would be 42 surger- ies. Using exponential smoothing with a weight of a = 0.20, develop forecasts for years 2 through 6. What is the MAD?

Solution

YEAR ACTUAL FORECAST (SMOOTHED) ERROR �ERROR �

1 45 42 +3 3 2 50 42.6 = 42 + 0.2145 - 422 +7.4 7.4 3 52 44.1 = 42.6 + 0.2150 - 42.62 +7.9 7.9 4 56 45.7 = 44.1 + 0.2152 - 44.12 +10.3 10.3 5 58 47.7 = 45.7 + 0.2156 - 45.72 +10.3 10.3 6 — 49.8 = 47.7 + 0.2158 - 47.72 — —

MAD = g �Errors �

n =

38.9

5 = 7.78

38.9

Solved Problem 5-2 Quarterly demand for the Jaguar XJ8 at a New York auto dealership is forecast with the equation

Yn = 10 + 3X

where

X = time period (quarter): quarter 1 of last year = 0 quarter 2 of last year = 1 quarter 3 of last year = 2 quarter 4 of last year = 3 quarter 1 of this year = 4, and so on

M05_REND3161_13_AIE_C05.indd 176 27/10/16 2:15 PM

and

Yn = predicted quarterly demand

The demand for luxury sedans is seasonal, and the indices for quarters 1, 2, 3, and 4 are 0.80, 1.00, 1.30, and 0.90, respectively. Using the trend equation, forecast the demand for each quarter of next year. Then adjust each forecast for seasonal (quarterly) variations.

Solution Quarter 2 of this year is coded X = 5; quarter 3 of this year, X = 6; and quarter 4 of this year, X = 7. Hence, quarter 1 of next year is coded X = 8; quarter 2, X = 9; and so on.

Yn 1next year quarter 12 = 10 + 132182 = 34 Adjusted forecast = 10.8021342 = 27.2 Yn 1next year quarter 22 = 10 + 132192 = 37 Adjusted forecast = 11.0021372 = 37 Yn 1next year quarter 32 = 10 + 1321102 = 40 Adjusted forecast = 11.3021402 = 52 Yn 1next year quarter 42 = 10 + 1321112 = 43 Adjusted forecast = 10.9021432 = 38.7

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book (see Appendix H) to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Qualitative forecasting models include a. regression analysis. b. Delphi. c. time-series models. d. trend lines. 2. A forecasting model that uses only historical data for the

variable being forecast is called a a. time-series model. b. causal model. c. Delphi model. d. variable model. 3. One example of a causal model is a. exponential smoothing. b. trend projections. c. moving averages. d. regression analysis. 4. Which of the following is a time-series model? a. the Delphi model b. regression analysis c. exponential smoothing d. multiple regression 5. Which of the following is not a component of a time

series? a. seasonality b. causal variations c. trend d. random variations 6. Which of the following may be negative? a. MAD b. bias c. MAPE d. MSE

7. When comparing several forecasting models to determine which one best fits a particular set of data, the model that should be selected is the one

a. with the highest MSE. b. with the MAD closest to 1. c. with a bias of 0. d. with the lowest MAD. 8. In exponential smoothing, if you wish to give a

significant weight to the most recent observations, then the smoothing constant should be

a. close to 0. b. close to 1. c. close to 0.5. d. less than the error. 9. A trend equation is a regression equation in which a. there are multiple independent variables. b. the intercept and the slope are the same. c. the dependent variable is time. d. the independent variable is time. 10. Sales for a company are typically higher in the summer

months than in the winter months. This variation would be called a

a. trend. b. seasonal factor. c. random factor. d. cyclical factor. 11. An exponential smoothing forecast with a smoothing

constant of 1 would result in the same forecast as a. a trend line forecast. b. an exponential smoothing forecast with a smoothing

constant of 0. c. a naïve forecast. d. a 2-period moving average forecast.

sELF-TEsT  177

M05_REND3161_13_AIE_C05.indd 177 27/10/16 2:15 PM

178  CHAPTER 5 • FoRECAsTing

12. If the seasonal index for January is 0.80, then a. January sales tend to be 80% higher than an average

month. b. January sales tend to be 20% higher than an average

month. c. January sales tend to be 80% lower than an average

month. d. January sales tend to be 20% lower than an average

month. 13. If both trend and seasonal components are present in a

time series, then the seasonal indices a. should be computed based on an overall average. b. should be computed based on CMAs. c. will all be greater than 1. d. should be ignored in developing the forecast.

14. Which of the following is used to alert the user of a forecasting model that a significant error occurred in one of the periods?

a. a seasonal index b. a smoothing constant c. a tracking signal d. a regression coefficient 15. If the multiplicative decomposition model is used to

forecast daily sales for a retail store, how many seasons will there be?

a. 4 b. 7 c. 12 d. 365

Discussion Questions and Problems

Discussion Questions 5-1 Describe briefly the steps used to develop a forecast-

ing system. 5-2 What is a time-series forecasting model? 5-3 What is the difference between a causal model and a

time-series model? 5-4 What is a qualitative forecasting model, and when is

it appropriate? 5-5 What are some of the problems and drawbacks of

the moving average forecasting model? 5-6 What effect does the value of the smoothing con-

stant have on the weight given to the past forecast and the past observed value?

5-7 Describe briefly the Delphi technique. 5-8 What is MAD, and why is it important in the selec-

tion and use of forecasting models? 5-9 Explain how the number of seasons is determined

when forecasting with a seasonal component. 5-10 A seasonal index may be less than one, equal to one,

or greater than one. Explain what each of these val- ues would mean.

5-11 How is the impact of seasonality removed from a time series?

5-12 In using the decomposition method, the forecast based on trend is found using the trend line. How is the seasonal index used to adjust this forecast based on trend?

5-13 Explain what would happen if the smoothing con- stant in an exponential smoothing model was equal to zero. Explain what would happen if the smooth- ing constant was equal to one.

5-14 Explain when a CMA (rather than an overall aver- age) should be used in computing a seasonal index. Explain why this is necessary.

Problems 5-15 Develop a 4-month moving average forecast for

Wallace Garden Supply, and compute the MAD. A 3-month moving average forecast was developed in the section on moving averages in Table 5.2.

5-16 Using MAD, determine whether the forecast in Problem 5-15 or the forecast in the section concern- ing Wallace Garden Supply is more accurate.

5-17 Data collected on the yearly demand for 50-pound bags of fertilizer at Wallace Garden Supply are shown in the following table. Develop a 3-year mov- ing average to forecast sales. Then estimate demand again with a weighted moving average in which sales in the most recent year are given a weight of 2 and sales in the other 2 years are each given a weight of 1. Which method do you think is better?

YEAR DEMAND FOR FERTILIZER

(1,000s OF BAGS)

1 4

2 6

3 4

4 5

5 10

6 8

7 7

Note: means the problem may be solved with QM for Windows; means the problem may

be solved with Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

(Continued on next page)

M05_REND3161_13_AIE_C05.indd 178 27/10/16 2:15 PM

DisCUssion QUEsTions AnD PRoBLEMs  179

YEAR DEMAND FOR FERTILIZER

(1,000s OF BAGS)

8 9

9 12

10 14

11 15

5-18 Develop a trend line for the demand for fertilizer in Problem 5-17, using any computer software.

5-19 In Problems 5-17 and 5-18, three different fore- casts were developed for the demand for fertilizer. These three forecasts are a 3-year moving average, a weighted moving average, and a trend line. Which one would you use? Explain your answer.

5-20 Use exponential smoothing with a smoothing con- stant of 0.3 to forecast the demand for fertilizer given in Problem 5-17. Assume that last period’s forecast for year 1 is 5,000 bags to begin the procedure. Would you prefer to use the exponential smoothing model or the weighted average model developed in Problem 5-17? Explain your answer.

5-21 A college student has just completed her junior year. The following table summarizes her grade-point av- erage (GPA) for each of the past nine quarters:

YEAR SEMESTER GPA

Freshman Fall 2.4

Winter 2.9

Spring 3.1

Sophomore Fall 3.2

Winter 3.0

Spring 2.9

Junior Fall 2.8

Winter 3.6

Spring 3.2

(a) Forecast the student’s GPA for the fall semester of her senior year by using a three-period moving average.

(b) Forecast the student’s GPA for the fall semester of her senior year by using exponential smooth- ing with a = 0.2.

(c) Which of the two methods provides a more ac- curate forecast? Justify your answer.

5-22 Sales of Cool-Man air conditioners have grown steadily during the past 5 years:

The sales manager had predicted, before the business started, that year 1’s sales would be 410 air condi- tioners. Using exponential smoothing with a weight of a = 0.30, develop forecasts for years 2 through 6.

5-23 Using smoothing constants of 0.6 and 0.9, develop forecasts for the sales of Cool-Man air conditioners (see Problem 5-22).

5-24 What effect did the smoothing constant have on the forecast for Cool-Man air conditioners? (See Prob- lems 5-22 and 5-23.) Which smoothing constant gives the more accurate forecast?

5-25 Use a 3-year moving average forecasting model to forecast the sales of Cool-Man air conditioners (see Problem 5-22).

5-26 Using the trend projection method, develop a fore- casting model for the sales of Cool-Man air condi- tioners (see Problem 5-22).

5-27 Would you use exponential smoothing with a smooth- ing constant of 0.3, a 3-year moving average, or a trend line to predict the sales of Cool-Man air condi- tioners? Refer to Problems 5-22, 5-25, and 5-26.

5-28 Sales of industrial vacuum cleaners at R. Lowenthal Supply Co. over the past 13 months are as follows:

SALES ($1,000s) MONTH

SALES ($1,000s) MONTH

11 January 14 August

14 February 17 September

16 March 12 October

10 April 14 November

15 May 16 December

17 June 11 January

11 July

(a) Using a moving average with three periods, de- termine the demand for vacuum cleaners for next February.

(b) Using a weighted moving average with three pe- riods, determine the demand for vacuum cleaners for February. Use 3, 2, and 1 for the weights of the most recent, second most recent, and third most recent periods, respectively. For example, if you were forecasting the demand for February, November would have a weight of 1, December would have a weight of 2, and January would have a weight of 3.

(c) Evaluate the accuracy of each of these methods. (d) What other factors might R. Lowenthal consider

in forecasting sales?

5-29 Passenger miles flown on Northeast Airlines, a com- muter firm serving the Boston hub, are as follows for the past 12 weeks:

YEAR SALES

1 450

2 495

3 518

YEAR SALES

4 563

5 584

6 ?

M05_REND3161_13_AIE_C05.indd 179 27/10/16 2:15 PM

180  CHAPTER 5 • FoRECAsTing

ACTUAL PASSENGER

ACTUAL PASSENGER

WEEK MILES (1,000s) WEEK

MILES (1,000s)

1 17 7 20

2 21 8 18

3 19 9 22

4 23 10 20

5 18 11 15

6 16 12 22

(a) Assuming an initial forecast for week 1 of 17,000 miles, use exponential smoothing to compute miles for weeks 2 through 12. Use a = 0.2.

(b) What is the MAD for this model? (c) Compute the RSFE and tracking signals. Are they

within acceptable limits?

5-30 Emergency calls to Winter Park, Florida’s 911 sys- tem for the past 24 weeks are as follows:

WEEK CALLS WEEK CALLS WEEK CALLS

1 50 9 35 17 55

2 35 10 20 18 40

3 25 11 15 19 35

4 40 12 40 20 60

5 45 13 55 21 75

6 35 14 35 22 50

7 20 15 25 23 40

8 30 16 55 24 65

(a) Compute the exponentially smoothed forecast of calls for each week. Assume an initial forecast of 50 calls in the first week, and use a = 0.1. What is the forecast for week 25?

(b) Reforecast each period using a = 0.6. (c) Actual calls during week 25 were 85. Which

smoothing constant provides a superior forecast?

5-31 How would the forecast for week 25 of the previous problem change if the initial forecast was 40 instead of 50? How would the forecast for week 25 change if the forecast for week 1 was assumed to be 60?

5-32 Sales of vacuum cleaners over the past 13 months were as follows:

MONTH SALES MONTH SALES

January 9 July 9

February 12 August 12

March 14 September 15

April 8 October 10

May 13 November 12

June 15 December 14

(a) Using a moving average with three periods, pre- dict the demand for vacuum cleaners for next February.

(b) Using a three-period weighted moving average with weights 3, 2, and 1, predict the demand for vacuum cleaners for February.

(c) Evaluate and comment on the accuracy of each of these models.

5-33 Consulting income at Kate Walsh Associates for the period February–July has been as follows:

MONTH INCOME ($1,000s)

February 70.0

March 68.5

April 64.8

May 71.7

June 71.3

July 72.8

Use exponential smoothing to forecast August’s in- come. Assume that the initial forecast for Febru- ary is $65,000. The smoothing constant selected is a = 0.1.

5-34 Resolve Problem 5-33 with a = 0.3. Using MAD, which smoothing constant provides a better forecast?

5-35 A major source of revenue in Texas is a state sales tax on certain types of goods and services. Data are com- piled, and the state comptroller uses them to project future revenues for the state budget. One particular category of goods is classified as Retail Trade. Four years of quarterly data (in $1,000,000s) for one par- ticular area of southeast Texas follow:

QUARTER YEAR 1 YEAR 2 YEAR 3 YEAR 4

1 218 225 234 250

2 247 254 265 283

3 243 255 264 289

4 292 299 327 356

(a) Compute a seasonal index for each quarter based on a CMA.

(b) Deseasonalize the data, and develop a trend line on the deseasonalized data.

(c) Use the trend line to forecast the sales for each quarter of year 5.

(d) Use the seasonal indices to adjust the forecasts found in part (c) to obtain the final forecasts.

5-36 Using the data in Problem 5-35, develop a multiple regression model to predict sales (with both trend and seasonal components), using dummy variables to incorporate the seasonal factor into the model. Use this model to predict sales for each quarter of the next year. Comment on the accuracy of this model.

5-37 Trevor Harty, an avid mountain biker, always wanted to start a business selling top-of-the-line mountain

M05_REND3161_13_AIE_C05.indd 180 27/10/16 2:15 PM

DisCUssion QUEsTions AnD PRoBLEMs  181

bikes and other outdoor supplies. A little over 6 years ago, he and a silent partner opened a store called Hale and Harty Trail Bikes and Supplies. Growth was rapid in the first 2 years, but since that time, growth in sales has slowed a bit, as expected. The quarterly sales (in $1,000s) for the past 4 years are shown in the table below:

QUARTER YEAR 1 YEAR 2 YEAR 3 YEAR 4

1 274 282 282 296

2 172 178 182 210

3 130 136 134 158

4 162 168 170 182

(a) Develop a trend line using the data in the table. Use this to forecast sales for each quarter of year 5. What does the slope of this line indicate?

(b) Use the multiplicative decomposition model to incorporate both trend and seasonal components into the forecast. What does the slope of this line indicate?

(c) Compare the slope of the trend line in part (a) to the slope in the trend line for the decomposi- tion model that was based on the deseasonalized sales figures. Discuss why these are so different and explain which is the better one to use.

5-38 The unemployment rates in the United States dur- ing a 10-year period are given in the following table. Use exponential smoothing to find the best forecast for next year. Use smoothing constants of 0.2, 0.4, 0.6, and 0.8. Which one had the lowest MAD?

YEAR 1 2 3 4 5 6 7 8 9 10

Unemployment rate (%)

7.2 7.0 6.2 5.5 5.3 5.5 6.7 7.4 6.8 6.1

5-39 Management of Davis’s Department Store has used time-series extrapolation to forecast retail sales for the next four quarters. The sales estimates are $100,000, $120,000, $140,000, and $160,000 for the respective quarters before adjusting for seasonal- ity. Seasonal indices for the four quarters have been found to be 1.30, 0.90, 0.70, and 1.10, respectively. Compute a seasonalized or adjusted sales forecast.

5-40 In the past, Judy Holmes’s tire dealership sold an av- erage of 1,000 radials each year. In the past 2 years, 200 and 250, respectively, were sold in fall, 350 and 300 in winter, 150 and 165 in spring, and 300 and 285 in summer. With a major expansion planned, Judy projects sales next year to increase to 1,200 ra- dials. What will the demand be each season?

5-41 The following table provides the Dow Jones Industrial Average (DJIA) opening index value on the first work- ing day of 1994–2013. Develop a trend line and use it to predict the opening DJIA index value for years 2014, 2015, and 2016. Find the MSE for this model.

YEAR DJIA YEAR DJIA

2013 13,104 2003 8,342

2012 12,392 2002 10,022

2011 11,577 2001 10,791

2010 10,431 2000 11,502

2009 8,772 1999 9,213

2008 13,262 1998 7,908

2007 12,460 1997 6,448

2006 10,718 1996 5,117

2005 10,784 1995 3,834

2004 10,453 1994 3,754

5-42 Using the DJIA data in Problem 5-41 and expo- nential smoothing with trend adjustment, forecast the opening DJIA value for 2014. Use a = 0.8 and b = 0.2. Compare the MSE for this technique with the MSE for the trend line.

5-43 Refer to the DJIA data in Problem 5-41.

(a) Use an exponential smoothing model with a smoothing constant of 0.4 to predict the open- ing DJIA index value for 2014. Find the MSE for this.

(b) Use QM for Windows or Excel to find the smoothing constant that would provide the low- est MSE.

5-44 The following table gives the average monthly ex- change rate between the U.S. dollar and the euro for 2009. It shows that 1 euro was equivalent to 1.289 U.S. dollars in January 2009. Develop a trend line that could be used to predict the exchange rate for 2010. Use this model to predict the exchange rate for January 2010 and February 2010.

MONTH EXCHANGE RATE

January 1.289

February 1.324

March 1.321

April 1.317

May 1.280

June 1.254

July 1.230

August 1.240

September 1.287

October 1.298

November 1.283

December 1.311

5-45 For the data in Problem 5-44, develop an exponen- tial smoothing model with a smoothing constant of 0.3. Using the MSE, compare this with the model in Problem 5-44.

M05_REND3161_13_AIE_C05.indd 181 27/10/16 2:15 PM

182  CHAPTER 5 • FoRECAsTing

Southwestern University Football Game Attendance, 2008–2013

2008 2009 2010

GAME ATTENDEES OPPONENT ATTENDEES OPPONENT ATTENDEES OPPONENT

1 34,200 Baylor 36,100 Oklahoma 35,900 TCU

2a 39,800 Texas 40,200 Nebraska 46,500 Texas Tech

3 38,200 LSU 39,100 UCLA 43,100 Alaska

4b 26,900 Arkansas 25,300 Nevada 27,900 Arizona

5 35,100 USC 36,200 Ohio State 39,200 Rice

2011 2012 2013

GAME ATTENDEES OPPONENT ATTENDEES OPPONENT ATTENDEES OPPONENT

1 41,900 Arkansas 42,500 Indiana 46,900 LSU

2a 46,100 Missouri 48,200 North Texas 50,100 Texas

3 43,900 Florida 44,200 Texas A&M 45,900 Prairie View A&M

4b 30,100 Miami 33,900 Southern 36,300 Montana

5 40,500 Duke 47,800 Oklahoma 49,900 Arizona State

aHomecoming games. bDuring the fourth week of each season, Stephenville hosted a hugely popular southwestern crafts festival. This event brought tens of thousands of tourists to the town, especially on weekends, and had an obvious negative impact on game attendance.

Source: J. Heizer and B. Render, Operations Management, 11th ed., © 2014. Reprinted and electronically reproduced by permission of Pearson Education, Inc., New York, NY.

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 5-46 to 5-54.

Internet Homework Problems

Southwestern University (SWU), a large state college in Ste- phenville, Texas, 30 miles southwest of the Dallas/Fort Worth metroplex, enrolls close to 20,000 students. In a typical town– gown relationship, the school is a dominant force in the small city, with more students during fall and spring than permanent residents.

A longtime football powerhouse, SWU is a member of the Big Eleven conference and is usually in the top 20 in col- lege football rankings. To bolster its chances of reaching the elu- sive and long-desired number-one ranking, in 2008 SWU hired the legendary Billy Bob Taylor as its head coach. Although the number-one ranking remained out of reach, attendance at the five Saturday home games each year increased. Prior to Tay- lor’s arrival, attendance generally averaged 25,000 to 29,000 per game. Season ticket sales bumped up by 10,000 just with the announcement of the new coach’s arrival. Stephenville and SWU were ready to move to the big time!

The immediate issue facing SWU, however, was not NCAA ranking. It was capacity. The existing SWU stadium,

built in 1953, has seating for 54,000 fans. The following table indicates attendance at each game for the past 6 years.

One of Taylor’s demands upon joining SWU had been a stadium expansion, or possibly even a new stadium. With atten- dance increasing, SWU administrators began to face the issue head-on. Taylor had wanted dormitories solely for his athletes in the stadium as an additional feature of any expansion.

SWU’s president, Dr. Marty Starr, decided it was time for his vice president of development to forecast when the existing stadium would “max out.” He also sought a revenue projection, assuming an average ticket price of $20 in 2014 and a 5% in- crease each year in future prices.

Discussion Questions 1. Develop a forecasting model, justify its selection over

other techniques, and project attendance through 2015. 2. What revenues are to be expected in 2014 and 2015? 3. Discuss the school’s options.

Case Study

Forecasting Attendance at SWU Football Games

M05_REND3161_13_AIE_C05.indd 182 27/10/16 2:15 PM

 183 CAsE sTUDy  183

For years The Glass Slipper restaurant has operated in a resort community near a popular ski area of New Mexico. The restau- rant is busiest during the first 3 months of the year, when the ski slopes are crowded and tourists flock to the area.

When James and Deena Weltee built The Glass Slipper, they had a vision of the ultimate dining experience. As the view of surrounding mountains was breathtaking, a high priority was placed on having large windows and providing a spectacular view from anywhere inside the restaurant. Special attention was also given to the lighting, colors, and overall ambiance, result- ing in a truly magnificent experience for all who came to enjoy gourmet dining. Since its opening, The Glass Slipper has de- veloped and maintained a reputation as one of the “must visit” places in that region of New Mexico.

While James loves to ski and truly appreciates the moun- tains and all that they have to offer, he also shares Deena’s dream of retiring to a tropical paradise and enjoying a more re- laxed lifestyle on the beach. After some careful analysis of their financial condition, they knew that retirement was many years away. Nevertheless, they were hatching a plan to bring them closer to their dream. They decided to sell The Glass Slipper and open a bed and breakfast on a beautiful beach in

TABLE 5.13 Monthly Revenue ($1,000s)

MONTH 2011 2012 2013

January 438 444 450

February 420 425 438

March 414 423 434

April 318 331 338

May 306 318 331

June 240 245 254

July 240 255 264

August 216 223 231

September 198 210 224

October 225 233 243

November 270 278 289

December 315 322 335

Mexico. While this would mean that work was still in their future, they could wake up in the morning to the sight of the palm trees blowing in the wind and the waves lapping at the shore. They also knew that hiring the right manager would al- low James and Deena the time to begin a semi-retirement in a corner of paradise.

To make this happen, James and Deena would have to sell The Glass Slipper for the right price. The price of the business would be based on the value of the property and equipment as well as projections of future income. A forecast of sales for the next year is needed to help in the determination of the value of the restaurant. Monthly sales for each of the past 3 years are provided in Table 5.13.

Discussion Questions 1. Prepare a graph of the data. On this same graph, plot a

12-month moving average forecast. Discuss any apparent trend and seasonal patterns.

2. Use regression to develop a trend line that could be used to forecast monthly sales for the next year. Is the slope of this line consistent with what you observed in question 1? If not, discuss a possible explanation.

3. Use the multiplicative decomposition model and these data to forecast sales for each month of the next year. Dis- cuss why the slope of the trend equation with this model is so different from that of the trend equation in question 2.

Case Study

Forecasting Monthly Sales

See our Internet home page, at www.pearsonhighered.com/render, for the additional case study on Akron Zoological Park. This case involves forecasting attendance at Akron’s zoo.

Internet Case Study

M05_REND3161_13_AIE_C05.indd 183 27/10/16 2:15 PM

184  CHAPTER 5 • FoRECAsTing

Bibliography

Billah, Baki, Maxwell L. King, Ralph D. Snyder, and Anne B. Koehler. “Ex- ponential Smoothing Model Selection for Forecasting,” International Journal of Forecasting 22, 2 (April–June 2006): 239–247.

Black, Ken. Business Statistics: For Contemporary Decision Making, 8th ed. New York: John Wiley & Sons, Inc., 2014.

Diebold, F. X. Elements of Forecasting, 4th ed. Cincinnati: Cengage College Publishing, 2007.

Gardner, Everette, Jr. “Exponential Smoothing: The State of the Art—Part II,” International Journal of Forecasting 22, 4 (October 2006): 637–666.

Granger, Clive W., and J. M. Hashem Pesaran. “Economic and Statisti- cal Measures of Forecast Accuracy,” Journal of Forecasting 19, 7 (December 2000): 537–560.

Hanke, J. E., and D. W. Wichern. Business Forecasting, 9th ed. Upper Saddle River, NJ: Pearson, 2009.

Heizer, J., B. Render, and C. Munson. Operations Management: Sustainability and Supply Chain Management, 12th ed. Upper Saddle River, NJ: Pearson, 2017.

Hyndman, Rob J. “The Interaction Between Trend and Seasonality,” In- ternational Journal of Forecasting 20, 4 (October–December 2004): 561–563.

Hyndman, Rob J., and Anne B. Koehler. “Another Look at Measures of Fore- cast Accuracy,” International Journal of Forecasting 22, 4 (October 2006): 679–688.

Levine, David M., David F. Stephan, and Kathryn A. Szabat. Statistics for Managers Using Microsoft Excel, 7th ed. Upper Saddle River, NJ: Pearson, 2014.

Meade, Nigel. “Evidence for the Selection of Forecasting Methods,” Journal of Forecasting 19, 6 (November 2000): 515–535.

Snyder, Ralph D., and Roland G. Shami. “Exponential Smoothing of Sea- sonal Data: A Comparison,” Journal of Forecasting 20, 3 (April 2001): 197–202.

Yurkiewicz, J. “Forecasting Software Survey,” OR/MS Today 39, 3 (June 2012): 52–61.

M05_REND3161_13_AIE_C05.indd 184 27/10/16 2:15 PM

 185

6.7 Understand the use of safety stock.

6.8 Compute single period inventory quantities using marginal analysis.

6.9 Understand the importance of ABC analysis.

6.10 Describe the use of material requirements planning in solving dependent-demand inventory problems.

6.11 Discuss just-in-time inventory concepts to reduce inventory levels and costs.

6.12 Discuss enterprise resource planning systems.

6.1 Understand the importance of inventory control.

6.2 Understand the various types of inventory related decisions.

6.3 Use the economic order quantity (EOQ) to determine how much to order.

6.4 Compute the reorder point (ROP) in determining when to order more inventory.

6.5 Handle inventory problems that allow noninstantaneous receipt.

6.6 Handle inventory problems that allow quantity discounts.

After completing this chapter, students will be able to:

Inventory Control Models

LEARNING OBJECTIVES

6 CHAPTER

Inventory is one of the most expensive and important assets to many companies, representing as much as 50% of total invested capital. Managers have long recognized that good inventory control is crucial. On one hand, a firm can try to reduce costs by reducing on-hand inventory levels. On the other hand, customers become dissatisfied when frequent inventory outages, called stockouts, occur. Thus, companies must find the balance between low and high inventory levels. As you would expect, cost minimization is the major factor in achieving this delicate balance.

Inventory is any stored resource that is used to satisfy a current or a future need. Raw ma- terials, work in process, and finished goods are examples of inventory. Inventory levels for fin- ished goods are a direct function of demand. When we determine the demand for completed clothes dryers, for example, it is possible to use this information to determine the amounts of sheet metal, paint, electric motors, switches, and other raw materials and work in process that are needed to produce the finished product.

All organizations have some type of inventory planning and control system. A bank has methods to control its inventory of cash. A hospital has methods to control blood supplies and other important items. State and federal governments, schools, and virtually every manufac- turing and production organization are concerned with inventory planning and control. Study- ing how organizations control their inventory is equivalent to studying how they achieve their

Inventory is any stored resource that is used to satisfy a current or future need.

M06_REND3161_13_AIE_C06.indd 185 27/10/16 2:17 PM

186  CHAPTER 6 • InvEnTORy COnTROl MODEls

objectives by supplying goods and services to their customers. Inventory is the common thread that ties all the functions and departments of the organization together.

Figure 6.1 illustrates the basic components of an inventory planning and control sys- tem. The planning phase is concerned primarily with what inventory is to be stocked and how it is to be acquired (whether it is to be manufactured or purchased). This information is then used in forecasting demand for the inventory and in controlling inventory levels. The feedback loop in Figure 6.1 provides a way of revising the plan and forecast based on expe- riences and observation.

Through inventory planning, an organization determines what goods and/or services are to be produced. In cases of physical products, the organization must also determine whether to produce these goods or to purchase them from another manufacturer. When this has been determined, the next step is to forecast the demand. As discussed in Chapter 5, there are many mathematical techniques that can be used in forecasting demand for a particular product. The emphasis in this chapter is on inventory control—that is, how to maintain adequate inventory levels within an organization.

6.1 Importance of Inventory Control

Inventory control serves several important functions and adds a great deal of flexibility to the operation of the firm. Consider the following five uses of inventory:

1. The decoupling function 2. Storing resources 3. Irregular supply and demand 4. Quantity discounts 5. Avoiding stockouts and shortages

Decoupling Function One of the major functions of inventory is to decouple manufacturing processes within the or- ganization. If you did not store inventory, there could be many delays and inefficiencies. For example, when one manufacturing activity has to be completed before a second activity can be started, it could stop the entire process. If, however, you have some stored inventory between processes, it could act as a buffer.

FIGURE 6.1 Inventory Planning and Control

Planning on what to stock and how to

get it

Forecasting parts/product

demand

Controlling inventory

levels

Feedback metrics to

revise plans and forecasts

Inventory can act as a buffer.

M06_REND3161_13_AIE_C06.indd 186 27/10/16 2:17 PM

6.2 InvEnTORy DECIsIOns  187

Storing Resources Agricultural and seafood products often have definite seasons over which they can be harvested or caught, but the demand for these products is somewhat constant during the year. In these and similar cases, inventory can be used to store these resources.

In a manufacturing process, raw materials can be stored by themselves, in work in process, or in the finished product. Thus, if your company makes lawn mowers, you might obtain lawn mower tires from another manufacturer. If you have 400 finished lawn mowers and 300 tires in inventory, you actually have 1,900 tires stored in inventory. Three hundred tires are stored by themselves, and 1,600 (1,600 = 4 tires per lawn mower * 400 lawn mowers) tires are stored in the finished lawn mowers. In the same sense, labor can be stored in inventory. If you have 500 subassemblies and it takes 50 hours of labor to produce each assembly, you actually have 25,000 labor hours stored in inventory in the subassemblies. In general, any resource, physical or other- wise, can be stored in inventory.

Irregular Supply and Demand When the supply of or demand for an item is irregular, storing certain amounts in inventory can be important. If the greatest demand for Diet-Delight beverage is during the summer, you will have to make sure that there is enough supply to meet this irregular demand. This might require that you produce more of the soft drink in the winter than is actually needed to meet the winter demand. The inventory levels of Diet-Delight will gradually build up over the winter, but this inventory will be needed in the summer. The same is true for ir- regular supplies.

Quantity Discounts Another use of inventory is to take advantage of quantity discounts. Many suppliers offer dis- counts for large orders. For example, an electric jigsaw might normally cost $20 per unit. If you order 300 or more saws in one order, your supplier may lower the cost to $18.75. Purchas- ing in larger quantities can substantially reduce the cost of products. There are, however, some disadvantages of buying in larger quantities. You will have higher storage costs and higher costs due to spoilage, damaged stock, theft, insurance, and so on. Furthermore, by investing in more inventory, you will have less cash to invest elsewhere.

Avoiding Stockouts and Shortages Another important function of inventory is to avoid shortages or stockouts. If you are repeatedly out of stock, customers are likely to go elsewhere to satisfy their needs. Lost goodwill can be an expensive price to pay for not having the right item at the right time.

6.2 Inventory Decisions

Even though there are literally millions of different types of products produced in our society, there are only two fundamental decisions that you have to make when controlling inventory:

1. How much to order 2. When to order

The purpose of all inventory models and techniques is to determine rationally how much to order and when to order. As you know, inventory fulfills many important functions within an organization. But as the inventory levels go up to provide these functions, the cost of storing and holding inventory also increases. Thus, you must reach a fine balance in establishing inventory levels. A major objective in controlling inventory is to minimize total inventory costs. Some of the most significant inventory costs follow:

1. Cost of the items (purchase cost or material cost) 2. Cost of ordering 3. Cost of carrying, or holding, inventory 4. Cost of stockouts

A major objective of all inventory models is to minimize inventory costs.

Resources can be stored in work in process.

Inventory can alleviate irregular demand and supply patterns.

Buying in bulk can be an economic advantage.

Carrying safety stock can increase customer satisfaction.

M06_REND3161_13_AIE_C06.indd 187 27/10/16 2:17 PM

188  CHAPTER 6 • InvEnTORy COnTROl MODEls

Defining the Problem Managing today’s energy supply chain is an ever-increasing complex problem. Yet, to survive in today’s marketplace, oil and gas companies must optimize their supply chains.

Developing a Model Researchers from Portugal developed a unidirectional model of oil and gas products from refineries to dis- tribution center. The model incorporated many different parameters, including number of products, maxi- mum storage capacities for each product, and pipeline capacities, as well as the demand for each product.

Acquiring the Input Data The input data consisted of the current inventory levels of specific oil and gas products at different points along the supply chain.

Developing a Solution A large mixed-integer linear program (see Chapter 10 in this book) was developed as part of the solution procedure to optimize the supply chain.

Testing the Solution All the problems that were solved by the Portuguese researchers were based on real data from Companhia Logistica Combustiveis, a large Portuguese oil and gas distribution company. Testing was done, and the results were compared to real-world scenarios.

Analyzing the Results Results obtained from the model were compared to the real-world operation. The results identified oppor- tunities for marked improvements in flow rates and reductions in pumping costs.

Implementing the Results As a result, oil and gas companies can better plan and manage their supply chains with fewer disruptions and lower overall costs.

Source: Based on S. Relvas, S. N. B. Magatão, A. P. F. D. Barbosa-Póvoa, and F. Neves, “Integrated Scheduling and Inventory Management of an Oil Products Distribution System,” Omega 41 (2013): 955–968, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Managing Today’s Energy supply Chain

ORDERING COST FACTORS CARRYING COST FACTORS

Developing and sending purchase orders Cost of capital

Processing and inspecting incoming inventory Taxes

Bill paying Insurance

Inventory inquiries Spoilage

Utilities, phone bills, and so on for the purchasing department Theft

Salaries and wages for purchasing department employees Obsolescence

Supplies such as forms and paper for the purchasing department Salaries and wages for warehouse employees

Utilities and building costs for the warehouse

Supplies such as forms and paper for the warehouse

TABLE 6.1 Inventory Cost Factors

The most common factors associated with ordering cost and holding cost are shown in Ta- ble 6.1. Notice that the ordering cost is generally independent of the size of the order and often involves personnel time. An ordering cost is incurred each time an order is placed, whether the order is for 1 unit or 1,000 units. The time to process the paperwork, pay the bill, and so forth does not depend on the number of units ordered.

Defining the Problem

Developing a Model

Acquiring the Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring the Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring the Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring the Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring the Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring the Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring the Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M06_REND3161_13_AIE_C06.indd 188 27/10/16 2:17 PM

6.3 ECOnOMIC ORDER QUAnTITy: DETERMInIng HOw MUCH TO ORDER  189

On the other hand, the holding cost varies as the size of the inventory varies. If 1,000 units are placed into inventory, the taxes, insurance, cost of capital, and other factors in the holding cost will be higher than if only 1 unit was put into inventory. Similarly, if the inventory level is low, there is little chance of spoilage and obsolescence.

The cost of the items, or the purchase cost, is what is paid to acquire the inventory. The stockout cost indicates the lost sales and goodwill (future sales) that result from not having the items available for the customers. This is discussed later in the chapter.

6.3 Economic Order Quantity: Determining How Much to Order

The economic order quantity (EOQ) is one of the oldest and most widely known inventory control techniques. Research on its use dates back to a 1915 publication by Ford W. Harris. This technique is still used by a large number of organizations today. It is relatively easy to use, but it does make a number of assumptions. Some of the most important assumptions follow:

1. Demand is known and constant over time. 2. The lead time—that is, the time between the placement of the order and the receipt of the

order—is known and constant. 3. The receipt of inventory is instantaneous. In other words, the inventory from an order

arrives in one batch, at one point in time. 4. The purchase cost per unit is constant throughout the year. Quantity discounts are not

possible. 5. The only variable costs are the cost of placing an order, ordering cost, and the cost of hold-

ing or storing inventory over time, holding or carrying cost. The holding cost per unit per year and the ordering cost per order are constant throughout the year.

6. Orders are placed so that stockouts or shortages are avoided completely.

When these assumptions are not met, adjustments must be made to the EOQ model. These are discussed later in this chapter.

With these assumptions, inventory usage has a sawtooth shape, as in Figure 6.2. In Figure 6.2, Q represents the amount that is ordered. If this amount is 500 dresses, all 500 dresses arrive at one time when an order is received. Thus, the inventory level jumps from 0 to 500 dresses. In general, an inventory level increases from 0 to Q units when an order arrives.

Because demand is constant over time, inventory drops at a uniform rate over time. (Refer to the sloped lines in Figure 6.2.) Another order is placed such that when the inventory level reaches 0, the new order is received, and the inventory level again jumps to Q units, represented by the vertical lines. This process continues indefinitely over time.

Inventory Costs in the EOQ Situation The objective of most inventory models is to minimize the total costs. With the assumptions just given, the relevant costs are the ordering cost and the carrying or holding cost. All other costs,

The inventory usage curve has a sawtooth shape.

0

Inventory Level

Minimum Inventory

Time

Order Quantity = Q = Maximum Inventory Level

FIGURE 6.2 Inventory Usage over Time

M06_REND3161_13_AIE_C06.indd 189 27/10/16 2:17 PM

190  CHAPTER 6 • InvEnTORy COnTROl MODEls

such as the cost of the inventory itself (the purchase cost), are constant. Thus, if we minimize the sum of the ordering and carrying costs, we are also minimizing the total costs.

The annual ordering cost is simply the number of orders per year times the cost of plac- ing each order. Since the inventory level changes daily, it is appropriate to use the average inventory level to determine annual holding or carrying cost. The annual carrying cost will equal the average inventory times the inventory carrying cost per unit per year. Again looking at Figure 6.2, we see that the maximum inventory is the order quantity (Q), and the average inventory will be one-half of that. Table 6.2 provides a numerical example to illustrate this. Notice that for this situation, if the order quantity is 10, the average inventory will be 5, or one- half of Q. Thus:

Average inventory level = Q

2 (6-1)

Using the following variables, we can develop mathematical expressions for the annual ordering and carrying costs:

Q = number of units in an order EOQ = Q* = optimal number of units to order

D = annual demand in units for the inventory item Co = ordering cost of each order Ch = holding or carrying cost per unit per year

Annual ordering cost = 1Number of orders placed per year2 * 1Ordering cost per order2

= Annual demand

Number of units in each order * 1Ordering cost per order2

= D

Q Co

Annual holding or carrying cost = 1Average inventory2 * 1Carrying cost per unit per year2

= Order quantity

2 * 1Carrying cost per unit per year2

= Q

2 Ch

A graph of the holding cost, the ordering cost, and the total of these two is shown in Figure 6.3. The lowest point on the total cost curves occurs where the ordering cost is equal to the carrying cost. Thus, to minimize total costs, given this situation, the order quantity should occur where these two costs are equal.

The objective of the simple EOQ model is to minimize total inventory cost. The relevant costs are the ordering and holding costs.

The average inventory level is one-half the maximum level.

INVENTORY LEVEL

DAY BEGINNING ENDING AVERAGE

April 1 (order received) 10 8 9

April 2 8 6 7

April 3 6 4 5

April 4 4 2 3

April 5 2 0 1

Maximum level April 1 = 10 units Total of daily averages = 9 + 7 + 5 + 3 + 1 = 25 Number of days = 5 Average inventory level = 25>5 = 5 units

TABLE 6.2 Computing Average Inventory

M06_REND3161_13_AIE_C06.indd 190 27/10/16 2:17 PM

6.3 ECOnOMIC ORDER QUAnTITy: DETERMInIng HOw MUCH TO ORDER  191

Finding the EOQ When the EOQ assumptions are met, total cost is minimized when:

Annual holding cost = Annual ordering cost

Q

2 Ch =

D

Q Co

Solving this for Q gives the optimal order quantity:

Q2 Ch = 2DCo

Q2 = 2DCo

Ch

Q = A2DCoCh

We derive the EOQ equation by setting ordering cost equal to carrying cost.

global Fashion Firm Fashions Inventory Management system

Founded in 1975, the Spanish retailer Zara currently has more than 1,600 stores worldwide, launches more than 10,000 new designs each year, and is recognized as one of the world’s princi- pal fashion retailers. Goods were shipped from two central ware- houses to each of the stores, based on requests from individual store managers. These local decisions inevitably led to inefficient warehouse, shipping, and logistics operations when assessed on a global scale. Recent production overruns, inefficient sup- ply chains, and an ever-changing marketplace (to say the least) caused Zara to tackle this problem.

A variety of operations research models were used in rede- signing and implementing an entirely new inventory management

system. The new centralized decision-making system replaced all store-level inventory decisions, thus providing results that were more globally optimal. Having the right products in the right places at the right time for customers has increased sales from 3% to 4% since implementation. This translated into an increase in revenue of over $230 million in 2007 and over $350 million in 2008. Talk about fashionistas!

Source: Based on F. Caro, J. Gallien, M. Díaz, J. García, J. M. Corredoira, M. Montes, J.A. Ramos, and J. Correa, “Zara Uses Operations Research to Re- engineer Its Global Distribution Process,” Interfaces 40, 1 (January–February 2010): 71–84, © Trevor S. Hale.

IN ACTION

Cost

Minimum Total Cost

Curve for Total Cost of Carrying and Ordering

Carrying Cost Curve

Ordering Cost Curve

Order QuantityOptimal Order Quantity

FIGURE 6.3 Total Cost as a Function of Order Quantity

M06_REND3161_13_AIE_C06.indd 191 27/10/16 2:17 PM

192  CHAPTER 6 • InvEnTORy COnTROl MODEls

This optimal order quantity is often denoted by Q*. Thus, the economic order quantity is given by the following formula:

EOQ = Q* = A2DCoCh This EOQ formula is the basis for many more advanced models, and some of these are discussed later in this chapter.

Economic Order Quantity (EOQ) Model

Annual ordering cost = D

Q Co (6-2)

Annual holding cost = Q

2 Ch (6-3)

EOQ = Q* = A2DCoCh (6-4) Sumco Pump Company Example Sumco, a company that sells pump housings to other manufacturers, would like to reduce its inventory cost by determining the optimal number of pump housings to obtain per order. The an- nual demand is 1,000 units, the ordering cost is $10 per order, and the average carrying cost per unit per year is $0.50. Using these figures, if the EOQ assumptions are met, we can calculate the optimal number of units per order:

Q* = A2DCoCh = B 211,000211020.50 = 140,000 = 200 units

The relevant total annual inventory cost is the sum of the ordering cost and the carrying cost:

Total annual cost = Ordering cost + Holding cost

In terms of the variables in the model, the total cost (TC) can now be expressed as

TC = D

Q Co +

Q

2 Ch (6-5)

The total annual inventory cost for Sumco is computed as follows:

TC = D

Q Co +

Q

2 Ch

= 1,000

200 1102 + 200

2 10.52

= $50 + $50 = $100

The number of orders per year 1D>Q2 is 5, and the average inventory 1Q>22 is 100. As you might expect, the ordering cost is equal to the carrying cost. You may wish to try dif-

ferent values for Q, such as 100 or 300 pumps. You will find that the minimum total cost occurs when Q is 200 units. The EOQ, Q*, is 200 pumps.

The total annual inventory cost is equal to ordering cost plus the holding cost for the simple EOQ model.

M06_REND3161_13_AIE_C06.indd 192 27/10/16 2:17 PM

6.3 ECOnOMIC ORDER QUAnTITy: DETERMInIng HOw MUCH TO ORDER  193

USING EXCEL QM FOR BASIC EOQ INVENTORY PROBLEMS The Sumco Pump Company example, and a variety of other inventory problems we address in this chapter, can be easily solved using Excel QM. Program 6.1A shows the input data for Sumco and the Excel formulas needed for the EOQ model. Program 6.1B contains the solution for this example, including the op- timal order quantity, maximum inventory level, average inventory level, and the number of orders.

Purchase Cost of Inventory Items Sometimes the total inventory cost expression is written to include the actual cost of the mate- rial purchased. With the EOQ assumptions, the purchase cost does not depend on the particular order policy found to be optimal because, regardless of how many orders are placed each year, we still incur the same annual purchase cost of D * C, where C is the purchase cost per unit and D is the annual demand in units.1

It is useful to know how to calculate the average inventory level in dollar terms when the price per unit is given. This can be done as follows. Using the variable Q to represent the

1Later in this chapter, we discuss the case in which price can affect order policy—that is, when quantity discounts are offered.

Enter the demand rate, the ordering cost, the holding cost, and, if it is available, the unit price here.

Total unit cost is given here.

PROGRAM 6.1B Excel QM solution for the sumco Pump Company Example

Total cost—including holding, ordering, and, if it is given, unit cost—is computed here.

PROGRAM 6.1A Input Data and Excel QM Formulas for the sumco Pump Company Example

M06_REND3161_13_AIE_C06.indd 193 27/10/16 2:17 PM

194  CHAPTER 6 • InvEnTORy COnTROl MODEls

quantity of units ordered and assuming a unit cost of C, we can determine the average dollar value of inventory:

Average dollar level = 1CQ2

2 (6-6)

This formula is analogous to Equation 6-1. Many businesses and industries often express the inventory carrying cost as an annual

percentage of the unit cost or price. When this is the case, a new variable is introduced. Let I be the annual inventory holding charge as a percent of unit price or cost. Then the cost of storing one unit of inventory for the year, Ch, is given by Ch = IC, where C is the unit price or cost of an inventory item. Q* can be expressed, in this case, as

Q* = B 2DCoIC (6-7) Sensitivity Analysis with the EOQ Model The EOQ model assumes that all input values are fixed and known with certainty. However, since these values are often estimated or may change over time, it is important to understand how the order quantity might change if different input values are used. Determining the effects of these changes is called sensitivity analysis.

The EOQ formula is given as follows:

EOQ = B 2DCoCh Because of the square root in the formula, any changes in the inputs 1D, Co, Ch2 will result in relatively minor changes in the optimal order quantity. For example, if Co were to increase by a factor of 4, the EOQ would increase by only a factor of 2. Consider the Sumco example just presented. The EOQ for this company is as follows:

EOQ = B 211,000211020.50 = 200 If we increased Co from $10 to $40,

EOQ = B 211,000214020.50 = 400 In general, the EOQ changes by the square root of a change in any of the inputs.

6.4 Reorder Point: Determining When to Order

Now that we have decided how much to order, we look at the second inventory question: when to order. The time between placing and receiving an order, called the lead time or delivery time, is often a few days or even a few weeks. Inventory must be available to meet the demand during this time, and this inventory can either be on hand now or on order but not yet received. The total of these is called the inventory position. Thus, the when to order decision is usually expressed in terms of a reorder point (ROP), the inventory position at which an order should be placed. The ROP is given as

ROP = 1Demand per day2 * 1Lead time for a new order in days2 = d * L (6-8)

Figure 6.4 has two graphs showing the ROP. One of these has a relatively small lead time, while the other has a relatively large lead time. When the inventory position reaches the ROP, a new order should be placed. While waiting for that order to arrive, the demand will be met either with

I is the annual carrying cost as a percentage of the cost per unit.

The reorder point (ROP) determines when to order inventory. It is found by multiplying the daily demand times the lead time in days.

M06_REND3161_13_AIE_C06.indd 194 27/10/16 2:17 PM

6.4 REORDER POInT: DETERMInIng wHEn TO ORDER  195

inventory currently on hand or with inventory that already has been ordered but will arrive when the on-hand inventory falls to zero. Let’s look at an example.

PROCOMP’S COMPUTER CHIP EXAMPLE Procomp’s demand for computer chips is 8,000 per year. The firm has a daily demand of 40 units, and the order quantity is 400 units. Delivery of an order takes three working days. The reorder point for chips is calculated as follows:

ROP = d * L = 40 units per day * 3 days = 120 units

Hence, when the inventory stock of chips drops to 120, an order should be placed. The order will arrive three days later, just as the firm’s stock is depleted to 0. Since the order quantity is 400 units, the ROP is simply the on-hand inventory. This is the situation in the first graph in Figure 6.4.

Suppose the lead time for Procomp Computer Chips was 12 days instead of 3 days. The reorder point would be

ROP = 40 units per day * 12 days = 480 units

Since the maximum on-hand inventory level is the order quantity of 400, an inventory position of 480 would be

Inventory position = 1Inventory on hand2 + 1Inventory on order2 480 = 80 + 400

FIGURE 6.4 Reorder Point graphs

0

Inventory Level

ROP

Lead time = L ROP < Q

Q

Time

0

Inventory Level

On hand

Lead time = L ROP > Q

Q

Time

On Order

M06_REND3161_13_AIE_C06.indd 195 27/10/16 2:17 PM

196  CHAPTER 6 • InvEnTORy COnTROl MODEls

Thus, a new order would have to be placed when the on-hand inventory fell to 80 while there was one other order in-transit. The second graph in Figure 6.4 illustrates this type of situation.

6.5 EOQ Without the Instantaneous Receipt Assumption

When a firm receives its inventory over a period of time, a new model is needed that does not require the instantaneous inventory receipt assumption. This new model is applicable when inventory continuously flows or builds up over a period of time after an order has been placed or when units are produced and sold simultaneously. Under these circumstances, the daily demand rate must be taken into account. Figure 6.5 shows inventory levels as a function of time. Because this model is especially suited to the production environment, it is commonly called the produc- tion run model.

In this model, instead of having an ordering cost, there will be a setup cost. This is the cost of setting up the production facility to manufacture the desired product. It nor- mally includes the salaries and wages of employees who are responsible for setting up the equipment, engineering and design costs of making the setup, paperwork, supplies, utilities, and so on. The carrying cost per unit is composed of the same factors as in the traditional EOQ model, although the annual carrying cost equation changes due to a change in average inventory.

The optimal production quantity can be derived by setting the setup cost equal to the holding or carrying cost and solving for the order quantity. Let’s start by developing the ex- pression for carrying cost. You should note, however, that making setup cost equal to carrying cost does not always guarantee optimal solutions for models more complex than the produc- tion run model.

Annual Carrying Cost for Production Run Model As with the EOQ model, the carrying cost of the production run model is based on the average inventory, and the average inventory is one-half the maximum inventory level. However, since the replenishment of inventory occurs over a period of time and demand continues during this time, the maximum inventory will be less than the order quantity Q. We can develop the annual carrying, or holding, cost expression using the following variables:

Q = number of units per order, or production run Cs = setup cost Ch = holding or carrying cost per unit per year p = daily production rate d = daily demand rate t = length of production run in days

The production run model eliminates the instantaneous receipt assumption.

Solving the production run model involves setting the setup cost equal to the holding cost and solving for Q.

Inventory Level

Time

Maximum Inventory

t

Part of Inventory Cycle During Which Production Is Taking Place

There Is No Production During This Part of the Inventory Cycle

FIGURE 6.5 Inventory Control and the Production Process

M06_REND3161_13_AIE_C06.indd 196 27/10/16 2:17 PM

6.5 EOQ wITHOUT THE InsTAnTAnEOUs RECEIPT AssUMPTIOn  197

The maximum inventory level is as follows:

1Total produced during the production run2 - 1Total used during production run2 = 1Daily production rate21Number of days of production2 - 1Daily demand21Number of days of production2 = 1pt2 - 1dt2

Since

Total produced = Q = pt,

we know that

t = Q p

Maximum inventory level = pt - dt = p Q p

- d Q p

= Q a1 - d p b

Since the average inventory is one-half of the maximum, we have

Average inventory = Q

2 a1 - d

p b (6-9)

and

Annual holding cost = Q

2 a1 - d

p bCh (6-10)

Annual Setup Cost or Annual Ordering Cost When a product is produced over time, setup cost replaces ordering cost. Both of these are inde- pendent of the size of the order and the size of the production run. This cost is simply the num- ber of orders (or production runs) times the ordering cost (setup cost). Thus,

Annual setup cost = D

Q Cs (6-11)

and

Annual ordering cost = D

Q Co (6-12)

Determining the Optimal Production Quantity When the assumptions of the production run model are met, costs are minimized if the setup cost equals the holding cost. We can find the optimal quantity by setting these costs to be equal and solving for Q. Thus,

Annual holding cost = Annual setup cost

Q

2 a1 - d

p bCh = DQ Cs

Solving this for Q, we get the optimal production quantity 1Q*2:

Q* = H 2DCsCh a1 - dp b (6-13) It should be noted that if the situation does not involve production but rather involves the receipt of inventory gradually over a period of time, this same model is appropriate, but Co replaces Cs in the formula.

The maximum inventory level in the production model is less than Q.

Here is the formula for the optimal production quantity. Notice the similarity to the basic EOQ model.

M06_REND3161_13_AIE_C06.indd 197 27/10/16 2:17 PM

198  CHAPTER 6 • InvEnTORy COnTROl MODEls

Production Run Model

Annual holding cost = Q

2 a1 - d

p bCh

Annual setup cost = D

Q Cs

Optimal production quantity Q* = H 2DCsCh a1 - dp b Brown Manufacturing Example Brown Manufacturing produces commercial refrigeration units in batches. The firm’s estimated demand for the year is 10,000 units. It costs about $100 to set up the manufacturing process, and the carrying cost is about 50 cents per unit per year. When the production process has been set up, 80 refrigeration units can be manufactured daily. The demand during the production period has traditionally been 60 units each day. Brown operates its refrigeration unit production area 167 days per year. How many refrigeration units should Brown Manufacturing produce in each batch? How long should the production part of the cycle shown in Figure 6.5 last? Here is the solution:

Annual demand = D = 10,000 units

Setup cost = Cs = $100

Carrying cost = Ch = $0.50 per unit per year

Daily production rate = p = 80 units daily

Daily demand rate = d = 60 units daily

Q* = R 2DCsCh a1 - dp b = R2 * 10,000 * 1000.5 a1 - 6080 b = B 2,000,0000.511>42 = 116,000,000 = 4,000 units

If Q* = 4,000 units and we know that 80 units can be produced daily, the length of each produc- tion cycle will be Q>p = 4,000>80 = 50 days. Thus, when Brown decides to produce refrig- eration units, the equipment will be set up to manufacture the units for a 50-day time span. The number of production runs per year will be D>Q = 10,000>4,000 = 2.5. This means that the average number of production runs per year is 2.5. There will be three production runs in one year with some inventory carried to the next year, so only two production runs are needed in the second year.

USING EXCEL QM FOR PRODUCTION RUN MODELS The Brown Manufacturing production run model can also be solved using Excel QM. Program 6.2A contains the input data and the Excel formulas for this problem. Program 6.2B provides the solution results, including the optimal production quantity, maximum inventory level, average inventory level, and number of setups.

M06_REND3161_13_AIE_C06.indd 198 27/10/16 2:17 PM

6.5 EOQ wITHOUT THE InsTAnTAnEOUs RECEIPT AssUMPTIOn  199

Enter the demand rate, setup cost, and holding cost. Notice that the holding cost is a fixed dollar amount rather than a percentage of the unit price.

Enter the daily production rate and the daily demand rate.

Calculates the optimal production quantity.

Calculates the maximum inventory level. Calculates the average number of setups.

Calculates the annual holding cost and setup cost.

PROGRAM 6.2A Excel QM Formulas and Input Data for the Brown Manufacturing Problem

PROGRAM 6.2B Excel QM solutions for the Brown Manufacturing Problem

U.s. Defense logistics Agency saves on Inventory Costs Through Risk Management system

The U.S. Defense Logistics Agency (DLA; www.dla.mil) had cost overruns in its inventory supply chain. Some items had stable but infrequent demand, while others had highly variable demand pat- terns. The Logistics Management Institute (LMI; www.lmi.org) de- veloped an inventory control solution named PNG that contained two modules: Peak Policy and Next Gen. The system utilized a risk management approach to control inventory.

Since the DLA implemented the two modules in January 2013, customer service metrics have improved, buyer workload has decreased, and inventory cost savings have totaled nearly $400 million per year.

Source: Based on Tovey C. Bachman, Pamela J. Williams, Kristen M. Cheman, Jeffrey Curtis, and Robert Carroll, “PNG: Effective Inventory Control for Items with Highly Variable Demand,” Interfaces 46, 1 (January–February 2016): 18–32, © Trevor S. Hale.

IN ACTION

M06_REND3161_13_AIE_C06.indd 199 27/10/16 2:17 PM

200  CHAPTER 6 • InvEnTORy COnTROl MODEls

6.6 Quantity Discount Models

In developing the EOQ model, we assumed that quantity discounts were not available. However, many companies do offer quantity discounts. If such a discount is possible, and all of the other EOQ assumptions are met, it is possible to find the quantity that minimizes the total inventory cost by using the EOQ model and making some adjustments.

When quantity discounts are available, the purchase cost or material cost becomes a rel- evant cost, as it changes based on the order quantity. The total relevant costs are as follows:

Total cost = Material cost + Ordering cost + Carrying cost

Total cost = DC + D

Q Co +

Q

2 Ch (6-14)

where

D = annual demand in units Co = ordering cost of each order C = cost per unit

Ch = holding or carrying cost per unit per year

Since the holding cost per unit per year is based on the cost of the item, it is convenient to ex- press this as

Ch = IC

where

I = holding cost as a percentage of the unit cost 1C2 For a specific purchase cost (C), given the assumptions we have made, ordering the EOQ will minimize total inventory costs. However, in the discount situation, this quantity may not be large enough to qualify for the discount, so we must also consider ordering this minimum quantity for the discount. A typical quantity discount schedule is shown in Table 6.3.

As can be seen in the table, the normal cost for the item is $5. When 1,000 to 1,999 units are ordered at one time, the cost per unit drops to $4.80, and when the quantity ordered at one time is 2,000 or more units, the cost is $4.75 per unit. As always, management must decide when and how much to order. But with quantity discounts, how does the manager make these decisions?

As with other inventory models discussed so far, the overall objective will be to mini- mize the total cost. Because the unit cost for the third discount in Table 6.3 is lowest, you might be tempted to order 2,000 units or more to take advantage of the lower material cost. Placing an order for that quantity with the greatest discount cost, however, might not mini- mize the total inventory cost. As the discount quantity goes up, the material cost goes down, but the carrying cost increases because the orders are large. Thus, the major trade-off when considering quantity discounts is between the reduced material cost and the increased car- rying cost.

Figure 6.6 provides a graphical representation of the total cost for this situation. Notice the cost curve drops considerably when the order quantity reaches the minimum for each dis- count. With the specific costs in this example, we see that the EOQ for the second price category

The overall objective of the quantity discount model is to minimize total inventory costs, which now include actual material costs.

DISCOUNT NUMBER

DISCOUNT QUANTITY

DISCOUNT (%)

DISCOUNT COST ($)

1 0 to 999 0 5.00

2 1,000 to 1,999 4 4.80

3 2,000 and over 5 4.75

TABLE 6.3 Quantity Discount schedule

M06_REND3161_13_AIE_C06.indd 200 27/10/16 2:17 PM

6.6 QUAnTITy DIsCOUnT MODEls  201

11,000 … Q … 1,9992 is less than 1,000 units. Although the total cost for this EOQ is less than the total cost for the EOQ with the cost in category 1, the EOQ is not large enough to obtain this discount. Therefore, the lowest possible total cost for this discount price occurs at the minimum quantity required to obtain the discount 1Q = 1,0002. The process for determining the mini- mum cost quantity in this situation is summarized in the following box.

Quantity Discount Model

1. For each discount price (C), compute EOQ = B 2DCoIC . 2. If EOQ 6 Minimum for discount, adjust the quantity to Q = Minimum for discount.

3. For each EOQ or adjusted Q, compute Total cost = DC + D

Q Co +

Q

2 Ch.

4. Choose the lowest-cost quantity.

Total Cost

$ TC Curve for Discount 1

TC Curve for Discount 2

EOQ for Discount 2

TC Curve for Discount 3

0 1,000 2,000

Order Quantity

FIGURE 6.6 Total Cost (TC) Curve for the Quantity Discount Model

Intel Improves Inventory Operations

Faced with skyrocketing distribution costs, Intel turned to quantitative analysis to design, construct, and implement a multi–echelon inventory optimization (MEIO) system. The system spanned all of Intel’s global supply chain and included suppliers, third-party logistics providers, dealers, and retailers, among oth- ers. Because of the inherent complexities, designing and con- structing the system took several years by itself.

However, as a result, Intel was able to optimize inventory levels worldwide. After one year of operation, the MEIO system

reduced global inventory levels by approximately 11 percent without sacrificing delivery schedules, service levels improved by 8 per- centage points, and an order of magnitude reduction in the number of costly expedites was realized.

Source: Based on B. Wieland, P. Mastrantonio, S. Willems, and K.G. Kempf, “Optimizing Inventory Levels Within Intel ’s Channel Supply Demand Operations,” Interfaces 42, 6 (November–December 2012): 517–527, © Trevor S. Hale.

IN ACTION

M06_REND3161_13_AIE_C06.indd 201 27/10/16 2:17 PM

202  CHAPTER 6 • InvEnTORy COnTROl MODEls

Brass Department Store Example Let’s see how this procedure can be applied by showing an example. Brass Department Store stocks toy race cars. Recently, the store was given a quantity discount schedule for the cars; this quantity discount schedule is shown in Table 6.3. Thus, the normal cost for the toy race cars is $5. For orders between 1,000 and 1,999 units, the unit cost is $4.80, and for orders of 2,000 or more units, the unit cost is $4.75. Furthermore, the ordering cost is $49 per order, the annual demand is 5,000 race cars, and the inventory carrying charge as a percentage of cost, I, is 20% or 0.2. What order quantity will minimize the total inventory cost?

The first step is to compute EOQ for every discount in Table 6.3. This is done as follows:

EOQ1 = B 12215,0002149210.2215.002 = 700 cars per order EOQ2 = B 12215,0002149210.2214.802 = 714 cars per order EOQ3 = B 12215,0002149210.2214.752 = 718 cars per order

The second step is to adjust those quantities that are below the allowable discount range. Since EOQ1 is between 0 and 999, it does not have to be adjusted. EOQ2 is below the allowable range of 1,000 to 1,999, and therefore it must be adjusted to 1,000 units. The same is true for EOQ3; it must be adjusted to 2,000 units. After this step, the following order quantities must be tested in the total cost equation:

Q1 = 700 Q2 = 1,000 Q3 = 2,000

The third step is to use Equation 6-14 to compute a total cost for each of the order quantities. This is accomplished with the aid of Table 6.4.

The fourth step is to select the order quantity with the lowest total cost. Looking at Table 6.4, you can see that an order quantity of 1,000 toy race cars minimizes the total cost. It should be recognized, however, that the total cost for ordering 2,000 cars is only slightly greater than the total cost for ordering 1,000 cars. Thus, if the third discount cost is lowered to $4.65, for example, this order quantity might be the one that minimizes the total inven- tory cost.

USING EXCEL QM FOR QUANTITY DISCOUNT PROBLEMS As seen in the previous analysis, the quantity discount model is more complex than the inventory models discussed so far in this chapter. For- tunately, we can use the computer to simplify the calculations. Program 6.3A shows the Excel formulas and input data needed for Excel QM for the Brass Department Store problem. Program 6.3B provides the solution to this problem, including adjusted order quantity and total cost for each price break.

EOQ values are adjusted.

EOQ values are computed.

The total cost is computed.

Q* is selected.

DISCOUNT NUMBER

UNIT PRICE (C)

ORDER

QUANTITY (Q)

ANNUAL

MATERIAL COST 1$ 2 = DC

ANNUAL ORDERING

COST 1$ 2 = D Q

Co

ANNUAL CARRYING

COST 1$ 2 = Q 2

Ch

TOTAL ($)

1 $5.00 700 25,000 350.00 350.00 25,700.00

2 4.80 1,000 24,000 245.00 480.00 24,725.00

3 4.75 2,000 23,750 122.50 950.00 24,822.50

TABLE 6.4 Total Cost Computations for Brass Department store

M06_REND3161_13_AIE_C06.indd 202 27/10/16 2:17 PM

6.7 UsE OF sAFETy sTOCk  203

6.7 Use of Safety Stock

When the EOQ assumptions are met, it is possible to schedule orders to arrive so that stock- outs are completely avoided. However, if the demand or the lead time is uncertain, the exact demand during the lead time (which is the ROP in the EOQ situation) will not be known with certainty. Therefore, to prevent stockouts, it is necessary to carry additional inventory called safety stock.

When demand is unusually high during the lead time, you dip into the safety stock in- stead of encountering a stockout. Thus, the main purpose of safety stock is to avoid stockouts when the demand is higher than expected. Its use is shown in Figure 6.7. Note that although stockouts can often be avoided by using safety stock, there is still a chance that they may occur. The demand may be so high that all the safety stock is used up, and thus there is still a stockout.

One of the best ways to implement a safety stock policy is to adjust the reorder point. In the EOQ situation where the demand and lead time are constant, the reorder point is simply

Enter the quantity discount schedule with the quantity and unit price for each price break.

Computes the order quantity for each price break and adjusts it upward if necessary.

Enter the demand rate, setup cost, and holding cost.

Computes the holding and setup costs.

Computes the total cost of each price break.

Determines the optimal order quantity, Q*.

PROGRAM 6.3A Excel QM Formulas and Input Data for the Brass Department store Quantity Discount Problem

PROGRAM 6.3B Excel QM solutions for the Brass Department store Quantity Discount Problem

Safety stock is extra stock kept on hand. It helps in avoiding stockouts.

M06_REND3161_13_AIE_C06.indd 203 27/10/16 2:17 PM

204  CHAPTER 6 • InvEnTORy COnTROl MODEls

the amount of inventory that would be used during the lead time (i.e., the daily demand times the lead time in days). This is assumed to be known with certainty, so there is no need to place an order when the inventory position is more than this. However, when the daily demand or the lead time fluctuates and is uncertain, the exact amount of inventory that will be used during the lead time is uncertain. The average inventory usage during the lead time should be computed, and some safety stock should be added to this to avoid stockouts. The reorder point becomes

ROP = 1Average demand during lead time2 + 1Safety stock2 ROP = 1Average demand during lead time2 + SS (6-15) where

SS = safety stock

How to determine the correct amount of safety stock is the only remaining question. Two important factors in this decision are the stockout cost and the holding cost. The stockout cost usually involves lost sales and lost goodwill, which result in loss of future sales. If the holding cost is low but the stockout cost is high, a large amount of safety stock should be carried to avoid stockouts because it costs little to carry this and stockouts are expensive. On the other hand, if the stockout cost is low but the holding cost is high, a lower amount of safety stock would be preferred because having a stockout would cost very little but having too much safety stock would result in a much higher annual holding cost.

Inventory on Hand

Time

Inventory on Hand

Time

Safety Stock, SS

0 Units

0 Units

Stockout Is Avoided

Stockout

FIGURE 6.7 Use of safety stock

Safety stock is included in the ROP.

M06_REND3161_13_AIE_C06.indd 204 27/10/16 2:18 PM

6.7 UsE OF sAFETy sTOCk  205

How is the optimum stock level determined? If demand f luctuates, the lead time is constant, and both the stockout cost per unit and the holding cost per unit are known, the use of a payoff/cost table might be considered. With only a small number of possible de- mand values during the lead time, a cost table could be constructed in which the different possible demand levels would be the states of nature and the different amounts of safety stock would be the alternatives. Using the techniques discussed in Chapter 3, the expected cost could be calculated for each safety stock level, and the minimum cost solution could be found.

However, a more general approach is to determine what service level is desired and then find the safety stock level that would accomplish this. A prudent manager will look at the hold- ing cost and the stockout cost to help determine an appropriate service level. A service level indicates what percentage of the time customer demand is met. In other words, the service level is the percentage of time that stockouts are avoided. Thus,

Service level = 1 - Probability of a stockout

or

Probability of a stockout = 1 - Service level

Once the desired service level is established, the amount of safety stock to carry can be found using the probability distribution of demand during the lead time.

SAFETY STOCK WITH THE NORMAL DISTRIBUTION Equation 6-15 provides the general formula for de- termining the reorder point. When demand during the lead time is normally distributed, the reor- der point becomes

ROP = 1Average demand during lead time2 + Zsd LT (6-16) where

Z = number of standard deviations for a given service level sd LT = standard deviation of demand during the lead time

Thus, the amount of safety stock is simply Zsd LT. The following example looks at how to deter- mine the appropriate safety stock level when demand during the lead time is normally distrib- uted and the mean and standard deviation are known.

HINSDALE COMPANY EXAMPLE The Hinsdale Company carries a variety of electronic inventory items, and these are typically identified by SKU. One particular item, SKU A3378, has a de- mand that is normally distributed during the lead time, with a mean of 350 units and a standard deviation of 10. Hinsdale wants to follow a policy that results in stockouts occurring only 5% of the time on any order. How much safety stock should be maintained, and what is the reorder point? Figure 6.8 helps visualize this example.

From the normal distribution table (Appendix A), we have Z = 1.65:

ROP = 1Average demand during lead time2 + ZsdLT = 350 + 1.651102 = 350 + 16.5 = 366.5 units 1or about 367 units2

So the reorder point is 366.5, and the safety stock is 16.5 units.

CALCULATING LEAD TIME DEMAND AND STANDARD DEVIATION If the mean and standard deviation of demand during the lead time are not known, they must be calculated from historical demand and lead time data. Once these are found, Equation 6-16 can be used to find the safety stock and reorder point. Throughout this section, we assume that lead time is in days, although the same procedure can be applied to weeks, months, or any other time period. We will also assume that if demand fluctuates, the distribution of demand each day is identical to and independent of de- mand on other days. If both daily demand and lead time fluctuate, they are also assumed to be independent.

M06_REND3161_13_AIE_C06.indd 205 27/10/16 2:18 PM

206  CHAPTER 6 • InvEnTORy COnTROl MODEls

There are three situations to consider. In each of the following ROP formulas, the average demand during the lead time is the first term and the safety stock 1ZsdLT2 is the second term.

1. Demand is variable but lead time is constant:

ROP = dL + Z1sd2L2 (6-17) where

d = average daily demand

sd = standard deviation of daily demand

L = lead time in days

2. Demand is constant, but lead time is variable:

ROP = dL + Z1dsL2 (6-18) where

L = average lead time

sL = standard deviation of lead time

d = daily demand

3. Both demand and lead time are variable:

ROP = d L + Z12Ls2d + d2s2L2 (6-19) Notice that the third situation is the most general case and the others can be derived from that. If either demand or lead time is constant, the standard deviation and variance for that would be 0, and the average would just equal the constant amount. Thus, the formula for ROP in situation 3 can be simplified to the ROP formula given for that situation.

HINSDALE COMPANY EXAMPLE, CONTINUED Hinsdale has decided to determine the safety stock and ROP for three other items: SKU F5402, SKU B7319, and SKU F9004.

For SKU F5402, the daily demand is normally distributed, with a mean of 15 units and a standard deviation of 3. Lead time is exactly 4 days. Hinsdale wants to maintain a 97% service level. What is the reorder point, and how much safety stock should be carried?

SS

5% Area of Normal Curve

m = 350 X = ?

m = Mean demand = 350

s = Standard deviation = 10

= Mean demand + Safety stockX

SS = Safety stock = X – m 5 Zs

X – m Z =

s

FIGURE 6.8 safety stock and the normal Distribution

M06_REND3161_13_AIE_C06.indd 206 27/10/16 2:18 PM

6.7 UsE OF sAFETy sTOCk  207

From Appendix A, for a 97% service level Z = 1.88. Since demand is variable but lead time is constant, we find

ROP = dL + Z1sd1L2 = 15142 + 1.8813142 = 15142 + 1.88162 = 60 + 11.28 = 71.28

So the average demand during the lead time is 60, and the safety stock is 11.28 units. For SKU B7319, the daily demand is constant at 25 units per day, and the lead time is nor-

mally distributed, with a mean of 6 days and a standard deviation of 3. Hinsdale wants to main- tain a 98% service level on this particular product. What is the reorder point?

From Appendix A, for a 98% service level Z = 2.05. Since demand is constant but lead time is variable, we find

ROP = dL + Z1dsL2 = 25162 + 2.051252132 = 150 + 2.051752 = 150 + 153.75 = 303.75

So the average demand during the lead time is 150, and the safety stock is 154.03 units. For SKU F9004, the daily demand is normally distributed, with a mean of 20 units and a

standard deviation of 4, and the lead time is normally distributed, with a mean of 5 days and a standard deviation of 2. Hinsdale wants to maintain a 94% service level on this particular prod- uct. What is the reorder point?

From Appendix A, for a 94% service level Z = 1.55. Since both demand and lead time are variable, we find

ROP = d L + Z12Ls2d + d2s2L2 = 1202152 + 1.551251422 + 1202212222 = 100 + 1.5511680 = 100 + 1.55140.992 = 100 + 63.53 = 163.53

So the average demand during the lead time is 100, and the safety stock is 63.53 units. As the service level increases, the safety stock increases at an increasing rate. Table 6.5

illustrates how the safety stock level would change in the Hinsdale Company (SKU A3378) example for changes in the service level. As the amount of safety stock increases, the annual holding cost increases as well.

CALCULATING ANNUAL HOLDING COST WITH SAFETY STOCK When the EOQ assumptions of constant demand and constant lead time are met, the average inventory is Q>2, and the annual hold- ing cost is 1Q>22Ch. When safety stock is carried because demand fluctuates, the holding cost

A safety stock level is determined for each service level.

SERVICE LEVEL (%)

Z VALUE FROM NORMAL CURVE TABLE

SAFETY STOCK (UNITS)

90 1.28 12.8

91 1.34 13.4

92 1.41 14.1

93 1.48 14.8

94 1.55 15.5

95 1.65 16.5

96 1.75 17.5

97 1.88 18.8

98 2.05 20.5

99 2.33 23.3

99.99 3.72 37.2

TABLE 6.5 safety stock for skU A3378 at Different service levels

M06_REND3161_13_AIE_C06.indd 207 27/10/16 2:18 PM

208  CHAPTER 6 • InvEnTORy COnTROl MODEls

for this safety stock is added to the holding cost of the regular inventory to get the total annual holding cost. If demand during the lead time is normally distributed and safety stock is used, the average inventory on the order quantity (Q) is still Q>2, but the average amount of safety stock carried is simply the amount of the safety stock (SS) and not one-half this amount. Since demand during the lead time is normally distributed, there would be times when inventory usage during the lead time exceeded the expected amount and some safety stock would be used. But it is just as likely that the inventory usage during the lead time would be less than the expected amount and the order would arrive while some regular inventory remained in addition to all the safety stock. Thus, on the average, the company would always have this full amount of safety stock in inventory, and a holding cost would apply to all of this. From this, we have

Total annual holding cost = Holding cost of regular inventory + Holding cost of safety stock

THC = Q

2 Ch + 1SS2Ch (6-20)

where

THC = total annual holding cost Q = order quantity

Ch = holding cost per unit per year SS = safety stock

In the Hinsdale example for SKU A3378, let’s assume that the holding cost is $2 per unit per year. The amount of safety stock needed to achieve various service levels is shown in Table 6.5. The holding cost for the safety stock would be these amounts times $2 per unit. As illustrated in Figure 6.9, this holding cost would increase extremely rapidly once the service level reached 98%.

USING EXCEL QM FOR SAFETY STOCK PROBLEMS To use Excel QM to determine the safety stock and reorder point, select Excel QM from the Add-Ins tab, and select Inventory—Reorder Point/Safety Stock (normal distribution). Enter a title when the input window appears, and click OK. Program 6.4A shows the input screen and formulas for the first three Hinsdale Company examples. Pro- gram 6.4B shows the solution.

FIGURE 6.9 service level versus Annual Carrying Costs

Carrying cost increases at an increasing rate as the service level increases.

($) 80

70

60

50

40

30

20

90 91 92 93 94 95 96

Service Level (%)

In ve

nt or

y C

ar ry

in g

C os

ts ($

)

97 98 99 99.99 (%)

M06_REND3161_13_AIE_C06.indd 208 27/10/16 2:18 PM

6.8 sInglE-PERIOD InvEnTORy MODEls  209

6.8 Single-Period Inventory Models

So far, we have considered inventory decisions in which demand continues in the future and future orders will be placed for the same product. There are some products for which a decision to meet the demand for a single time period is made, and items that do not sell during this time period are of no value or have a greatly reduced value in the future. For example, a daily news- paper is worthless after the next paper is available. Other examples include weekly magazines, programs printed for athletic events, certain prepared foods that have a short life, and some sea- sonal clothes that have greatly reduced value at the end of the season. This type of problem is often called the news vendor problem or a single-period inventory model.

For example, a large restaurant might be able to stock from 20 to 100 cartons of doughnuts to meet a demand that ranges from 20 to 100 cartons per day. While this could be modeled us- ing a payoff table (see Chapter 3), we would have to analyze 101 possible alternatives and states of nature, which would be quite tedious. A simpler approach for this type of decision is to use marginal, or incremental, analysis.

The standard deviation of demand during the lead time is calculated here.

The standard deviation of demand during the lead time is calculated here.

The average demand and standard deviation during the lead time are entered here, if available.

If daily demand is normally distributed but lead time is constant, the data are entered here.

If daily demand and/or lead time is normally distributed, the data are entered here. If one or the other is constant, enter zero for the standard deviation of that quantity.

Solution to the first Hinsdale example where standard deviation of demand during lead time was given.

Solution to second Hinsdale example where daily demand was normally distributed.

Solution to third Hinsdale example where daily demand was constant but lead time was normally distributed.

PROGRAM 6.4A Excel QM Formulas and Input Data for the Hinsdale safety stock Problem

PROGRAM 6.4B Excel QM solutions for the Hinsdale safety stock Problem

M06_REND3161_13_AIE_C06.indd 209 27/10/16 2:18 PM

210  CHAPTER 6 • InvEnTORy COnTROl MODEls

A decision-making approach using marginal profit and marginal loss is called marginal analysis. Marginal profit (MP) is the additional profit achieved if one additional unit is stocked and sold. Marginal loss (ML) is the loss that occurs when an additional unit is stocked but can- not be sold.

When there are a manageable number of alternatives and states of nature and we know the probabilities for each state of nature, marginal analysis with discrete distributions can be used. When there are a very large number of possible alternatives and states of nature and the prob- ability distribution of the states of nature can be described with a normal distribution, marginal analysis with the normal distribution is appropriate.

Marginal Analysis with Discrete Distributions Finding the inventory level with the lowest cost is not difficult when we follow the marginal analysis procedure. This approach says that we would stock an additional unit only if the ex- pected marginal profit for that unit equals or exceeds the expected marginal loss. This relation- ship is expressed symbolically as follows:

P = probability that demand will be greater than or equal to a given supply (or the probability of selling at least one additional unit)

1 - P = probability that demand will be less than a given supply (or the probability that one additional unit will not sell)

The expected marginal profit is found by multiplying the probability that a given unit will be sold by the marginal profit, P1MP2. Similarly, the expected marginal loss is the probability of not selling the unit multiplied by the marginal loss, or 11 - P21ML2.

The optimal decision rule is to stock the additional unit if

P1MP2 Ú 11 - P2ML With some basic mathematical manipulations, we can determine the level of P for which

this relationship holds:

P1MP2 Ú ML - P1ML2 P1MP2 + P1ML2 Ú ML P1MP + ML2 Ú ML

or

P Ú ML

ML + MP (6-21)

In other words, as long as the probability of selling one more unit (P) is greater than or equal to ML>1MP + ML2, we would stock the additional unit.

Steps of Marginal Analysis with Discrete Distributions

1. Determine the value of ML

ML + MP for the problem.

2. Construct a probability table, and add a cumulative probability column. 3. Keep ordering inventory as long as the probability (P) of selling at least one additional unit

is greater than ML

ML + MP .

Café du Donut Example Café du Donut is a popular New Orleans dining spot on the edge of the French Quarter. Its spe- cialty is coffee and doughnuts; it buys the doughnuts fresh daily from a large industrial bakery. The café pays $4 for each carton (containing two dozen doughnuts) delivered each morning. Any cartons not sold at the end of the day are thrown away, for they would not be fresh enough

M06_REND3161_13_AIE_C06.indd 210 27/10/16 2:18 PM

6.8 sInglE-PERIOD InvEnTORy MODEls  211

to meet the café’s standards. If a carton of doughnuts is sold, the total revenue is $6. Hence, the marginal profit per carton of doughnuts is

MP = Marginal profit = $6 - $4 = $2

The marginal loss is ML = $4, since the doughnuts cannot be returned or salvaged at day’s end. From past sales, the café’s manager estimates that the daily demand will follow the prob-

ability distribution shown in Table 6.6. The manager then follows the three steps to find the opti- mal number of cartons of doughnuts to order each day.

Step 1. Determine the value of ML

ML + MP for the decision rule

P Ú ML

ML + MP =

$4

$4 + $2 =

4

6 = 0.67

P Ú 0.67

So the inventory stocking decision rule is to stock an additional unit if P Ú 0.67.

Step 2. Add a new column to the table to reflect the probability that doughnut sales will be at each level or greater. This is shown in the right-hand column of Table 6.7. For example, the probability that demand will be 4 cartons or greater is 1.00 1= 0.05 + 0.15 + 0.15 + 0.20 + 0.25 + 0.10 + 0.102. Similarly, the probability that sales will be 8 cartons or greater is 0.45 1= 0.25 + 0.10 + 0.102—that is, the sum of the probabilities for sales of 8, 9, and 10 cartons.

Step 3. Keep ordering additional cartons as long as the probability of selling at least one ad- ditional carton is greater than P, which is the indifference probability. If Café du Donut orders 6 cartons, marginal profits will still be greater than marginal loss, since

P at 6 cartons = 0.80 7 0.67

DAILY SALES (CARTONS OF DOUGHNUTS)

PROBABILITY (P) THAT DEMAND WILL BE AT THIS LEVEL

4 0.05

5 0.15

6 0.15

7 0.20

8 0.25

9 0.10

10 0.10

Total 1.00

TABLE 6.6 Café du Donut’s Probability Distribution

DAILY SALES (CARTONS OF DOUGHNUTS)

PROBABILITY (P) THAT DEMAND WILL BE AT

THIS LEVEL

PROBABILITY (P) THAT DEMAND WILL BE AT THIS

LEVEL OR GREATER

4 0.05 1.00 Ú 0.66 5 0.15 0.95 Ú 0.66 6 0.15 0.80 Ú 0.66 7 0.20 0.65

8 0.25 0.45

9 0.10 0.20

10 0.10 0.10

Total 1.00

TABLE 6.7 Marginal Analysis for Café du Donut

M06_REND3161_13_AIE_C06.indd 211 27/10/16 2:18 PM

212  CHAPTER 6 • InvEnTORy COnTROl MODEls

Marginal Analysis with the Normal Distribution When product demand or sales follow a normal distribution, which is a common business situ- ation, marginal analysis with the normal distribution can be applied. First, we need to find four values:

1. The average or mean sales for the product, m 2. The standard deviation of sales, s 3. The marginal profit for the product, MP 4. The marginal loss for the product, ML

Once these quantities are known, the process of finding the best stocking policy is somewhat similar to marginal analysis with discrete distributions. We let X* = optimal stocking level.

Steps of Marginal Analysis with the Normal Distribution

1. Determine the value of ML

ML + MP for the problem.

2. Locate P on the normal distribution (Appendix A), and find the associated Z value. 3. Find X* using the relationship

Z = X* - m

s

to solve for the resulting stocking policy:

X* = m + Zs

Newspaper Example Demand for copies of the Chicago Tribune newspaper at Joe’s Newsstand is normally distrib- uted and has averaged 60 papers per day, with a standard deviation of 10 papers. With a marginal loss of 20 cents and a marginal profit of 30 cents, what daily stocking policy should Joe follow?

Step 1. Joe should stock the Chicago Tribune as long as the probability of selling the last unit is at least ML>1ML + MP2:

ML

ML + MP =

20 cents

20 cents + 30 cents =

20

50 = 0.40

Let P = 0.40.

Step 2. Figure 6.10 shows the normal distribution. Since the normal table has cumulative areas under the curve between the left side and any point, we look for 0.60 1= 1.0 - 0.402 in order to get the corresponding Z value:

Z = 0.25 standard deviations from the mean

Step 3. In this problem, m = 60 and s = 10, so

0.25 = X* - 60

10

or

X* = 60 + 0.251102 = 62.5, or 62 newspapers.

Thus, Joe should order 62 copies of the Chicago Tribune daily, since the probability of selling 63 is slightly less than 0.40.

M06_REND3161_13_AIE_C06.indd 212 27/10/16 2:18 PM

6.8 sInglE-PERIOD InvEnTORy MODEls  213

When P is greater than 0.50, the same basic procedure is used, although caution should be used when looking up the Z value. Let’s say that Joe’s Newsstand also stocks the Chicago Sun- Times, which has a marginal loss of 40 cents and a marginal profit of 10 cents. The daily sales have averaged 100 copies of the Chicago Sun-Times, with a standard deviation of 10 papers. The optimal stocking policy is as follows:

ML

ML + MP =

40 cents

40 cents + 10 cents =

40

50 = 0.80

The normal curve is shown in Figure 6.11. Since the normal curve is symmetrical, we find Z for an area under the curve of 0.80 and multiply this number by -1 because all values below the mean are associated with a negative Z value:

Z = -0.84 standard deviations from the mean for an area of 0.80

With m = 100 and s = 10,

-0.84 = X* - 100

10

or

X* = 100 - 0.841102 = 91.6, or 91 newspapers.

So Joe should order 91 copies of the Chicago Sun-Times every day.

FIGURE 6.10 Joe’s stocking Decision for the Chicago Tribune Mean Daily Sales

Area Under the Curve Is 0.40

Area Under the Curve Is 1 – 0.40 = 0.60 (Z = 0.25)

X *

Optimal Stocking Policy (62 Newspapers)

m 5 60 X = Demand

Area Under the Curve Is 0.80 (Z = –0.84)

X *

Optimal Stocking Policy (91 Newspapers)

m 5 100 X = Demand

FIGURE 6.11 Joe’s stocking Decision for the Chicago Sun-Times

M06_REND3161_13_AIE_C06.indd 213 27/10/16 2:18 PM

214  CHAPTER 6 • InvEnTORy COnTROl MODEls

The optimal stocking policies in these two examples are intuitively consistent. When mar- ginal profit is greater than marginal loss, we would expect X* to be greater than the average demand, m, and when marginal profit is less than marginal loss, we would expect the optimal stocking policy, X*, to be less than m.

6.9 ABC Analysis

Earlier, we showed how to develop inventory policies using quantitative techniques. There are also some very practical considerations that should be incorporated into the implementation of inventory decisions, such as ABC analysis.

The purpose of ABC analysis is to divide all of a company’s inventory items into three groups (group A, group B, and group C) based on the overall inventory value of the items. A prudent manager should spend more time managing those items representing the greatest dol- lar inventory cost because this is where the greatest potential savings are. A brief description of each group follows, with general guidelines as to how to categorize items.

The inventory items in the A group account for a major portion of the inventory costs of the organization. As a result, their inventory levels must be monitored carefully. These items typically make up more than 70% of the company’s business in dollars but may consist of only 10% of all inventory items. In other words, a few inventory items are very costly to the com- pany. Thus, great care should be taken in forecasting the demand and developing good inventory management policies for this group of items (refer to Table 6.8). Since there are relatively few of these, the time involved would not be excessive.

The items in the B group are typically moderately priced items and represent much less in- vestment than the A items. It may not be appropriate to spend as much time developing optimal inventory policies for this group as with the A group, since these inventory costs are much lower. Typically, the group B items represent about 20% of the company’s business in dollars and about 20% of the items in inventory.

The items in the C group are the very low-cost items that represent very little in terms of the total dollars invested in inventory. These items may constitute only 10% of the company’s busi- ness in dollars, but they may consist of 70% of the items in inventory. From a cost–benefit per- spective, it would not be good to spend as much time managing these items as the A and B items.

For the group C items, the company should develop a very simple inventory policy, and this may include a relatively large safety stock. Since the items cost very little, the holding cost as- sociated with a large safety stock will also be very low. More care should be taken in determin- ing the safety stock with the higher priced group B items. For the very expensive group A items, the cost of carrying the inventory is so high that it is beneficial to carefully analyze the demand for these and set the safety stock at an appropriate level. Otherwise, the company may have an exceedingly high holding cost for the group A items.

6.10 Dependent Demand: The Case for Material Requirements Planning

In all the inventory models discussed earlier, we assume that the demand for one item is inde- pendent of the demand for other items. For example, the demand for refrigerators is usually in- dependent of the demand for toaster ovens. Many inventory problems, however, are interrelated; the demand for one item is dependent on the demand for another item. Consider a manufacturer of small power lawn mowers. The demand for lawn mower wheels and spark plugs is depen- dent on the demand for lawn mowers. Four wheels and one spark plug are needed for each fin- ished lawn mower. Usually, when the demand for different items is dependent, the relationship

INVENTORY GROUP

DOLLAR USAGE (%)

INVENTORY ITEMS (%)

ARE QUANTITATIVE CONTROL TECHNIQUES USED?

A 70 10 Yes

B 20 20 In some cases

C 10 70 No

TABLE 6.8 summary of ABC Analysis

M06_REND3161_13_AIE_C06.indd 214 27/10/16 2:18 PM

6.10 DEPEnDEnT DEMAnD: THE CAsE FOR MATERIAl REQUIREMEnTs PlAnnIng  215

between the items is known and constant. Thus, you should forecast the demand for the final products and compute the requirements for component parts.

As with the inventory models discussed previously, the major questions that must be an- swered are how much to order and when to order. But with dependent demand, inventory sched- uling and planning can be very complex indeed. In these situations, material requirements planning (MRP) can be employed effectively. Some of the benefits of MRP follow:

1. Increased customer service and satisfaction 2. Reduced inventory costs 3. Better inventory planning and scheduling 4. Higher total sales 5. Faster response to market changes and shifts 6. Reduced inventory levels without reduced customer service

Although most MRP systems are computerized, the analysis is straightforward and similar from one computerized system to the next. Here is the typical procedure.

Material Structure Tree We begin by developing a bill of materials (BOM). The BOM identifies the components, de- scribes them, and indicates the number required in the production of one unit of the final product. From the BOM, we develop a material structure tree. Let’s say that demand for product A is 50 units. Each unit of A requires 2 units of B and 3 units of C. Now, each unit of B requires 2 units of D and 3 units of E. Furthermore, each unit of C requires 1 unit of E and 2 units of F. Thus, the de- mand for B, C, D, E, and F is completely dependent on the demand for A. Given this information, a material structure tree can be developed for the related inventory items (see Figure 6.12).

The structure tree has three levels: 0, 1, and 2. Items above any level are called parents, and items below any level are called components. There are three parents: A, B, and C. Each parent item has at least one level below it. Items B, C, D, E, and F are components because each item has at least one level above it. In this structure tree, B and C are both parents and components.

Note that the number in the parentheses in Figure 6.12 indicates how many units of that par- ticular item are needed to make the item immediately above it. Thus, B(2) means that it takes 2 units of B for every unit of A, and F(2) means that it takes 2 units of F for every unit of C.

After the material structure tree has been developed, the number of units of each item re- quired to satisfy demand can be determined. This information can be displayed as follows:

Part B: 2 * number of A>s = 2 * 50 = 100 Part C: 3 * number of A>s = 3 * 50 = 150 Part D: 2 * number of B>s = 2 * 100 = 200 Part E: 3 * number of B>s + 1 * number of C>s = 3 * 100 + 1 * 150 = 450 Part F: 2 * number of C>s = 2 * 150 = 300

Parents and components are identified in the material structure tree.

The material structure tree shows how many units are needed at every level of production.

B(2) C(3)

Material Structure Tree for Item A

D(2) E(3) E(1) F(2)

Level 0

1

2

A

FIGURE 6.12 Material structure Tree for Item A

M06_REND3161_13_AIE_C06.indd 215 27/10/16 2:18 PM

216  CHAPTER 6 • InvEnTORy COnTROl MODEls

Thus, for 50 units of A we need 100 units of B, 150 units of C, 200 units of D, 450 units of E, and 300 units of F. Of course, the numbers in this table could have been determined directly from the material structure tree by multiplying the numbers along the branches times the de- mand for A, which is 50 units for this problem. For example, the number of units of D needed is simply 2 * 2 * 50 = 200 units.

Gross and Net Material Requirements Plans Once the materials structure tree has been developed, we construct a gross material require- ments plan. This is a time schedule that shows when an item must be ordered from suppliers when there is no inventory on hand or when the production of an item must be started in order to satisfy the demand for the finished product at a particular date. Let’s assume that all of the items are produced or manufactured by the same company. It takes one week to make A, two weeks to make B, one week to make C, one week to make D, two weeks to make E, and three weeks to make F. With this information, the gross material requirements plan can be constructed to reveal the production schedule needed to satisfy the demand of 50 units of A at a future date. (Refer to Figure 6.13.)

The interpretation of the material in Figure 6.13 is as follows: If you want 50 units of A at week 6, you must start the manufacturing process in week 5. Thus, in week 5 you need 100 units of B and 150 units of C. These two items take 2 weeks and 1 week to produce. (See the lead times.) Production of B should be started in week 3, and production of C should be started in week 4. (See the order release for these items.) Working backward, the same compu- tations can be made for all the other items. The material requirements plan graphically reveals when each item should be started and completed in order to have 50 units of A at week 6. Now, a net requirements plan can be developed given the on-hand inventory in Table 6.9; here is how it is done.

Using these data, we can develop a net material requirements plan that includes the gross requirements, on-hand inventory, net requirements, planned order receipts, and planned order release for each item. It is developed by beginning with A and working backward through the other items. Figure 6.14 shows a net material requirements plan for product A.

Use on-hand inventory to compute net requirements.

FIGURE 6.13 gross Material Requirements Plan for 50 Units of A Lead Time 5 1 Week

Lead Time 5 2 Weeks

Lead Time 5 1 Week

Lead Time 5 1 Week

Lead Time 5 2 Weeks

Lead Time 5 3 Weeks

50

50

100

100

150

150

200

200

300 150

300 150

300

300

A

B

C

D

E

F

Week

1 2 4 5 6

Required Date

Order Release

Every part A requires 2 part B’s in week 5

Required Date

Order Release

Required Date

Order Release

Required Date

Order Release

Required Date

Order Release

Required Date

Order Release

3

M06_REND3161_13_AIE_C06.indd 216 27/10/16 2:18 PM

6.10 DEPEnDEnT DEMAnD: THE CAsE FOR MATERIAl REQUIREMEnTs PlAnnIng  217

The net requirements plan is constructed like the gross requirements plan. Starting with item A, we work backward determining net requirements for all items. These computations are done by referring constantly to the structure tree and lead times. The gross requirements for A are 50 units in week 6. Ten items are on hand, and thus the net requirements and planned-order receipt are both 40 items in week 6. Because of the one-week lead time, the planned order re- lease is 40 items in week 5. (See the arrow connecting the order receipt and order release.) Look down column 5 and refer to the structure tree in Figure 6.13. Eighty 12 * 402 items of B and 120 = 3 * 40 items of C are required in week 5 in order to have a total of 50 items of A in

ITEM ON-HAND INVENTORY

A 10

B 15

C 20

D 10

E 10

F 5

TABLE 6.9 On-Hand Inventory

Item 1 2 3 4 5 6 Lead Time

Week

A

B

C

D

E

F

Gross On-Hand 10 Net Order Receipt Order Release

Gross On-Hand 15 Net Order Receipt Order Release

Gross On-Hand 20 Net Order Receipt Order Release

Gross On-Hand 10 Net Order Receipt Order Release

Gross On-Hand 10 Net Order Receipt Order Release

Gross On-Hand 5 Net Order Receipt Order Release

1 Week

2 Weeks

1 Week

1 Week

2 Weeks

3 Weeks

50 10 40 40

40

80 15 65 65

65

100

120

100185

195

120 20

100 100

195 10

185 185

100 0

100 100

200 5

195 195

A

A

B C

C

130 10

120 120

B

FIGURE 6.14 net Material Requirements Plan for 50 Units of A

M06_REND3161_13_AIE_C06.indd 217 27/10/16 2:18 PM

218  CHAPTER 6 • InvEnTORy COnTROl MODEls

week 6. The letter A in the upper-right corner for items B and C means that this demand for B and C was generated as a result of the demand for the parent, A. Now the same type of analysis is done for B and C to determine the net requirements for D, E, and F.

Two or More End Products So far, we have considered only one end product. For most manufacturing companies, there are normally two or more end products that use some of the same parts or compo- nents. All of the end products must be incorporated into a single net material requirements plan.

In the MRP example just discussed, we developed a net material requirements plan for product A. Now, we show how to modify the net material requirements plan when a second end product is introduced. Let’s call the second end product AA. The material structure tree for prod- uct AA is as follows:

AA

D(3) F(2)

Let’s assume that we need 10 units of AA. With this information, we can compute the gross re- quirements for AA:

Part D: 3 * number of AA>s = 3 * 10 = 30 Part F: 2 * number of AA>s = 2 * 10 = 20

To develop a net material requirements plan, we need to know the lead time for AA. Let’s assume that it is one week. We also assume that we need 10 units of AA in week 6 and that we have no units of AA on hand.

Now, we are in a position to modify the net material requirements plan for product A to in- clude AA. This is done in Figure 6.15.

Look at the top row of the figure. As you can see, we have a gross requirement of 10 units of AA in week 6. We don’t have any units of AA on hand, so the net requirement is also 10 units of AA. Because it takes one week to make AA, the order release of 10 units of AA is in week 5. This means that we start making AA in week 5 and have the finished units in week 6.

Because we start making AA in week 5, we must have 30 units of D and 20 units of F in week 5. See the rows for D and F in Figure 6.15. The lead time for D is one week. Thus, we must give the order release in week 4 to have the finished units of D in week 5. Note that there was no inventory on hand for D in week 5. The original 10 units of inventory of D were used in week 5 to make B, which was subsequently used to make A. We also need to have 20 units of F in week 5 to produce 10 units of AA by week 6. Again, we have no on-hand inventory of F in week 5. The original 5 units were used in week 4 to make C, which was subsequently used to make A. The lead time for F is three weeks. Thus, the order release for 20 units of F must be in week 2. (See the F row in Figure 6.15.)

This example shows how the inventory requirements of two products can be reflected in the same net material requirements plan. Some manufacturing companies can have more than 100 end products that must be coordinated in the same net material requirements plan. Although such a situation can be very complicated, the same principles we used in this example are em- ployed. Remember that computer programs have been developed to handle large and complex manufacturing operations.

In addition to using MRP to handle end products and finished goods, MRP can be used to handle spare parts and components. This is important because most manufacturing companies sell spare parts and components for maintenance. A net material requirements plan should also reflect these spare parts and components.

M06_REND3161_13_AIE_C06.indd 218 27/10/16 2:18 PM

6.11 JUsT-In-TIME InvEnTORy COnTROl  219

6.11 Just-In-Time Inventory Control

During the past several decades, there has been a trend to make the manufacturing process more efficient. One objective is to have less in-process inventory on hand. This is known as just-in- time (JIT) inventory. With this approach, inventory arrives just in time to be used during the manufacturing process to produce subparts, assemblies, or finished goods. One technique of im- plementing JIT is a manual procedure called kanban. Kanban in Japanese means “card.” With a dual-card kanban system, there is a conveyance kanban, or C-kanban, and a production kanban, or P-kanban. The kanban system is very simple. Here is how it works:

Four Steps of Kanban

Arrow 1: As shown in Figure 6.16, full containers along with their C-kanban card are taken from the storage area to a user area, typically on a manufacturing line (see arrow 1).

Arrow 2: During the manufacturing process, parts in the container are used up by the user. When the container is empty, the empty container along with the same C-kanban card is taken back to the storage area (depicted by arrow number 2). Here the user picks up a new full container, detaches the P-kanban card from it, attaches his or her C-kanban card to it, and returns with it to the user area (depicted by arrow number 1 again).

Item 1 2 3 4 5 6 Lead Time

Week

AA

A

C

D

E

F

Gross On-Hand: 0 Net Order Receipt Order Release

Gross On-Hand: 10 Net Order Receipt Order Release

Gross On-Hand: 20 Net Order Receipt Order Release

Gross On-Hand: 10 Net Order Receipt Order Release

Gross On-Hand: 10 Net Order Receipt Order Release

Gross On-Hand: 5 Net Order Receipt Order Release

B Gross On-Hand: 15 Net Order Receipt Order Release

Inventory

10 0

10 10

1 Week

1 Week

1 Week

1 Week

2 Weeks

3 Weeks

10

50 10 40 40

40

100

120

100185

195

120 20

100 100

130 10

120 120

195 10

185 185

100 0

100 100

200 5

195 195

2 Weeks

65

80 15 65 65

30

30 0

30 30

20

20 0

20 20

C AA

AA

A

A

B

B C

FIGURE 6.15 net Material Requirements Plan, Including AA

With JIT, inventory arrives just before it is needed.

M06_REND3161_13_AIE_C06.indd 219 27/10/16 2:18 PM

220  CHAPTER 6 • InvEnTORy COnTROl MODEls

Arrow 3: This detached P-kanban card is attached to an empty container in the storage area and then—and only then—is the empty container taken back to the upstream pro- ducer area (depicted by arrow number 3).

Arrow 4: This empty container is then refilled with parts and taken with its P-kanban card back to the storage area (depicted by arrow number 4). This kanban process con- tinuously cycles throughout the day. Kanban is sometimes known as a “pull” pro- duction system.

At a minimum, two containers are required using the kanban system. One container is used at the user area, and another container is being refilled for future use. In reality, there are usually more than two containers. This is how inventory control is accomplished. Inventory managers can introduce additional containers and their associated P-kanbans into the system. In a similar fashion, the inventory manager can remove containers and their P-kanbans to have tighter con- trol over inventory buildups.

In addition to being a simple, easy-to-implement system, the kanban system can be very effective in controlling inventory costs and in uncovering production bottlenecks. Inventory ar- rives at the user area or on the manufacturing line just before it is needed. Inventory does not build up unnecessarily, cluttering the production line or adding to unnecessary inventory ex- pense. The kanban system reduces inventory levels and makes for a more effective operation. It is like putting the production line on an inventory diet. Like any diet, the inventory diet imposed by the kanban system makes the production operation more streamlined. Furthermore, produc- tion bottlenecks and problems can be uncovered. Many production managers remove containers and their associated P-kanbans from the kanban system in order to “starve” the production line to uncover bottlenecks and potential problems.

In implementing a kanban system, a number of work rules or kanban rules are normally implemented. One typical kanban rule is that no containers are filled without the appropriate P-kanban. Another rule is that each container must hold exactly the specified number of parts or inventory items. These and similar rules make the production process more efficient. Only those parts that are actually needed are produced. The production department does not produce inven- tory just to keep busy. It produces inventory or parts only when they are needed in the user area or on an actual manufacturing line.

6.12 Enterprise Resource Planning

Over the years, MRP has evolved to include not only the materials required in production but also the labor hours, material cost, and other resources related to production. When approached in this fashion, the term MRP II is often used, and the word resource replaces the word require- ments. As this concept evolved and sophisticated computer software programs were developed, these systems were called enterprise resource planning (ERP) systems.

The objective of an ERP system is to reduce costs by integrating all of the operations of a firm. This starts with the supplier of the materials needed and flows through the organization to include invoicing the customer for the final product. Data are entered once into a database, and then these data can be quickly and easily accessed by anyone in the organization. This benefits

P-kanban and

Container

C-kanban and

Container

Producer Area

Storage Area

User Area

4 1

23

FIGURE 6.16 The kanban system

M06_REND3161_13_AIE_C06.indd 220 27/10/16 2:18 PM

glOssARy  221

not only the functions related to planning and managing inventory but also other business pro- cesses such as accounting, finance, and human resources.

The benefits of a well-developed ERP system are reduced transaction costs and increased speed and accuracy of information. However, there are drawbacks as well. The software is ex- pensive to buy and costly to customize. The implementation of an ERP system may require a company to change its normal operations, and employees are often resistant to change. Also, training employees on the use of the new software can be expensive.

There are many ERP systems available. The most common ones include SAP, Oracle, and PeopleSoft. Even small systems can cost hundreds of thousands of dollars. The larger systems can cost hundreds of millions of dollars.

This chapter introduces the fundamentals of inventory control theory. We showed that the two most important problems are (1) how much to order and (2) when to order.

We investigated the economic order quantity, which deter- mines how much to order, and the reorder point, which determines when to order. In addition, we explored the use of sensitivity analysis to determine what happens to computations when one or more of the values used in one of the equations change.

The basic EOQ inventory model presented in this chap- ter makes a number of assumptions: (1) known and constant demand and lead times, (2) instantaneous receipt of inventory, (3) no quantity discounts, (4) no stockouts or shortage, and (5) the only variable costs are ordering cost and carrying cost. If these assumptions are valid, the EOQ inventory model pro- vides optimal solutions. On the other hand, if these assump- tions do not hold, the basic EOQ model does not apply. In these cases, more complex models are needed, including the

production run, quantity discount, and safety stock models. When the inventory item is for use in a single time period, the marginal analysis approach is used. ABC analysis is used to determine which items represent the greatest potential inven- tory cost so these items can be more carefully managed.

When the demand for inventory is not independent of the demand for another product, a technique such as MRP is needed. MRP can be used to determine the gross and net ma- terial requirements for products. Computer software is neces- sary to implement major inventory systems, including MRP systems, successfully. Today many companies are using ERP software to integrate all of the operations within a firm, includ- ing inventory, accounting, finance, and human resources.

JIT can lower inventory levels, reduce costs, and make a manufacturing process more efficient. Kanban, a Japa- nese word meaning “card,” is one way to implement the JIT approach.

Summary

Glossary

ABC Analysis An analysis that divides inventory into three groups. Group A is more important than group B, which is more important than group C.

Average Inventory The average inventory on hand. In this chapter, the average inventory is Q>2 for the EOQ model.

Bill of Materials (BOM) A material structure tree of the components in a product, with a description and the quantity required to make one unit of that product.

Carrying Cost The cost of holding inventory over time. Economic Order Quantity (EOQ) The amount of inventory

ordered that will minimize the total inventory cost. It is also called the optimal order quantity, or Q*.

Enterprise Resource Planning (ERP) A computerized information system that integrates and coordinates the operations of a firm.

Instantaneous Inventory Receipt A system in which inventory is received or obtained at one point in time and not over a period of time.

Inventory Position The amount of inventory on hand plus the amount in any orders that have been placed but not yet received.

Just-in-Time (JIT) Inventory An approach whereby inven- tory arrives just in time to be used in the manufacturing process.

Kanban A manual JIT system developed by the Japanese. Kanban means “card” in Japanese.

Lead Time The time it takes to receive an order after it is placed (called L in the chapter).

Marginal Analysis A decision-making technique that uses marginal profit and marginal loss in determining optimal decision policies. Marginal analysis is used when the num- ber of alternatives and states of nature is large.

Marginal Loss (ML) The loss that would be incurred by stocking and not selling an additional unit.

Marginal Profit (MP) The additional profit that would be realized by stocking and selling one more unit.

Material Requirements Planning (MRP) An inventory model that can handle dependent demand.

Production Run Model An inventory model in which inven- tory is produced or manufactured over time instead of being ordered or purchased. This model eliminates the instanta- neous receipt assumption.

Ordering Cost The cost of placing an order with a supplier.

M06_REND3161_13_AIE_C06.indd 221 27/10/16 2:18 PM

222  CHAPTER 6 • InvEnTORy COnTROl MODEls

Quantity Discount The cost per unit when large orders of an inventory item are placed.

Reorder Point (ROP) The number of units on hand when an order for more inventory is placed.

Safety Stock Extra inventory that is used to help avoid stockouts.

Setup Cost The cost to set up the manufacturing or produc- tion process for the production run model.

Sensitivity Analysis The process of determining how sensi- tive the optimal solution is to changes in the values used in the equations.

Service Level The chance, expressed as a percent, that there will not be a stockout. Service level = 1 - Probability of a stockout.

Stockout A situation that occurs when there is no inventory on hand.

Key Equations

Equations 6-1 through 6-8 are associated with the economic order quantity (EOQ).

(6-1) Average inventory level = Q

2

(6-2) Annual ordering cost = D

Q Co

(6-3) Annual holding cost = Q

2 Ch

(6-4) EOQ = Q* = A2DCoCh (6-5) TC =

D

Q Co +

Q

2 Ch

Total relevant inventory cost.

(6-6) Average dollar level = 1CQ2

2

(6-7) Q* = B 2DCoIC EOQ with Ch expressed as percentage of unit cost.

(6-8) ROP = d * L Reorder point: d is the daily demand and L is the lead time in days.

Equations 6-9 through 6-13 are associated with the production run model.

(6-9) Average inventory = Q

2 a1 - d

p b

(6-10) Annual holding cost = Q

2 a1 - d

p bCh

(6-11) Annual setup cost = D

Q Cs

(6-12) Annual ordering cost = D

Q Co

(6-13) Q* = H 2DCsCh a1 - dp b Optimal production quantity.

Equation 6-14 is used for the quantity discount model.

(6-14) Total cost = DC + D

Q Co +

Q

2 Ch

Total inventory cost (including purchase cost).

Equations 6-15 to 6-20 are used when safety stock is required.

(6-15) ROP = 1Average demand during lead time2 + SS General formula for determining the reorder point when safety stock (SS) is carried.

(6-16) ROP = 1Average demand during lead time2 + Zsd LT Reorder point formula when demand during lead time is normally distributed with a standard deviation of sdLT.

(6-17) ROP = dL + Z1sd2L2 Formula for determining the reorder point when daily demand is normally distributed but lead time is constant, where d is the average daily demand, L is the constant lead time in days, and sd is the standard deviation of daily demand.

(6-18) ROP = dL + Z1dsL2 Formula for determining the reorder point when daily demand is constant but lead time is normally distributed, where L is the average lead time in days, d is the constant daily demand, and sL is the standard deviation of lead time.

(6-19) ROP = d L + Z12Ls2d + d2s2L2 Formula for determining the reorder point when both daily demand and lead time are normally distributed, where d is the average daily demand, L is the average lead time in days, sL is the standard deviation of lead time, and sd is the standard deviation of daily demand.

(6-20) THC = Q

2 Ch + 1SS2Ch

Total annual holding cost formula when safety stock is carried.

Equation 6-21 is used for marginal analysis.

(6-21) P Ú ML

ML + MP Decision rule in marginal analysis for stocking ad- ditional units.

M06_REND3161_13_AIE_C06.indd 222 27/10/16 2:18 PM

sOlvED PROBlEMs  223

Solved Problems

Solved Problem 6-1 Patterson Electronics supplies microcomputer circuitry to a company that incorporates microproces- sors into refrigerators and other home appliances. One of the components has an annual demand of 250 units, and this is constant throughout the year. The carrying cost is estimated to be $1 per unit per year, and the ordering cost is $20 per order.

a. To minimize cost, how many units should be ordered each time an order is placed? b. How many orders per year are needed with the optimal policy? c. What is the average inventory if costs are minimized? d. Suppose the ordering cost is not $20 and Patterson has been ordering 150 units each time an or-

der is placed. For this order policy to be optimal, what would the ordering cost have to be?

Solution a. The EOQ assumptions are met, so the optimal order quantity is

EOQ = Q* = B 2DCoCh = B 212502201 = 100 units b. Number of orders per year =

D

Q =

250

100 = 2.5 orders per year

Note that this would mean that in one year the company places three orders and in the next year it needs to place only two orders, since some inventory would be carried over from the previous year. It averages 2.5 orders per year.

c. Average inventory = Q

2 =

100

2 = 50 units

d. Given an annual demand of 250, a carrying cost of $1, and an order quantity of 150, Patterson Electronics must determine what the ordering cost would have to be for the order policy of 150 units to be optimal. To find the answer to this problem, we must solve the traditional EOQ equa- tion for the ordering cost. As you can see in the calculations that follow, an ordering cost of $45 is needed for the order quantity of 150 units to be optimal.

Q = A2DCoCh Co = Q2

Ch 2D

= 115022112

212502

= 22,500

500 = $45

Solved Problem 6-2 Flemming Accessories produces paper slicers used in offices and in art stores. The minislicer has been one of its most popular items: annual demand is 6,750 units and is constant throughout the year. Kristen Flemming, owner of the firm, produces the minislicers in batches. On average, Kristen can manufacture 125 minislicers per day. Demand for these slicers during the production process is 30 per day. The setup cost for the equipment necessary to produce the minislicers is $150. The carrying cost is $1 per minislicer per year. How many minislicers should Kristen manufacture in each batch?

M06_REND3161_13_AIE_C06.indd 223 27/10/16 2:18 PM

224  CHAPTER 6 • InvEnTORy COnTROl MODEls

Solution The data for Flemming Accessories are summarized as follows:

D = 6,750 units

Cs = $150

Ch = $1

d = 30 units p = 125 units

This is a production run problem that involves a daily production rate and a daily demand rate. The appropriate calculations are shown here:

Q* = B 2DCsCh11 - d>p2 = B 216,750211502111 - 30>1252 = 1,632

Solved Problem 6-3 Dorsey Distributors has an annual demand for 1400 units of a metal detector. The cost of a typical detector to Dorsey is $400. The carrying cost is estimated to be 20% of the unit cost, and the order- ing cost is $25 per order. If Dorsey orders in quantities of 300 or more, it can get a 5% discount on the cost of the detectors. Should Dorsey take the quantity discount? Assume the demand is constant.

Solution The solution to any quantity discount model involves determining the total cost of each alternative af- ter quantities have been computed and adjusted for the original problem and every discount. We start the analysis with no discount:

EOQ 1no discount2 = B 211,400212520.214002 = 29.6 units

Total cost 1no discount2 = Material cost + Ordering cost + Carrying cost

= $40011,4002 + 1,4001$252 29.6

+ 29.61$400210.22

2

= $560,000 + $1,183 + $1,183 = $562,366

The next step is to compute the total cost for the discount:

EOQ 1with discount2 = B 211,400212520.21$3802 = 30.3 units

Q1adjusted2 = 300 units Because this last economic order quantity is below the discounted price, we must adjust the order quantity to 300 units. The next step is to compute total cost:

Total cost 1with discount2 = Material cost + Ordering cost + Carrying cost

= $38011,4002 + 1,4001252 300

+ 3001$380210.22

2

= $532,000 + $117 + $11,400 = $543,517

The optimal strategy is to order 300 units at a total cost of $543,517.

M06_REND3161_13_AIE_C06.indd 224 27/10/16 2:18 PM

Solved Problem 6-4 The F. W. Harris Company sells an industrial cleaner to a large number of manufacturing plants in the Houston area. An analysis of the demand and costs has resulted in a policy of ordering 300 units of this product every time an order is placed. The demand is constant, at 25 units per day. In an agreement with the supplier, F. W. Harris is willing to accept a lead time of 20 days, since the supplier has provided an excellent price. What is the reorder point? How many units are actually in inventory when an order should be placed?

Solution The reorder point is

ROP = d * L = 251202 = 500 units This means that an order should be placed when the inventory position is 500. Since the ROP is greater than the order quantity, Q = 300, an order must have been placed already but not yet deliv- ered. So the inventory position must be

Inventory position = 1Inventory on hand2 + 1Inventory on order2 500 = 200 + 300

There would be 200 units on hand and an order of 300 units in transit.

Solved Problem 6-5 The B. N. Thayer and D. N. Thaht Computer Company sells a desktop computer that is popular among gaming enthusiasts. In the past few months, demand has been relatively consistent, although it does fluctu- ate from day to day. The company orders the computer cases from a supplier. It places an order for 5,000 cases at the appropriate time to avoid stockouts. The demand during the lead time is normally distributed, with a mean of 1,000 units and a standard deviation of 200 units. The holding cost per unit per year is esti- mated to be $4. How much safety stock should the company carry to maintain a 96% service level? What is the reorder point? What will the total annual holding cost be if this policy is followed?

Solution Using the table for the normal distribution, the Z value for a 96% service level is about 1.75. The stan- dard deviation is 200. The safety stock is calculated as

SS = ZsdLT = 1.7512002 = 375 units For a normal distribution with a mean of 1,000, the reorder point is

ROP = 1Average demand during lead time2 + SS = 1,000 + 350 = 1,350 units

The total annual holding cost is

THC = Q

2 Ch + 1SS2Ch = 5,0002 4 + 137524 = $11,500

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Which of the following is a basic component of an inventory control system? a. planning what inventory to stock and how to acquire it b. forecasting the demand for parts and products c. controlling inventory levels d. developing and implementing feedback measurements

for revising plans and forecasts e. all of the above are components of an inventory control

system

2. Which of the following is a valid use of inventory? a. the decoupling function b. to take advantage of quantity discounts c. to avoid shortages and stockouts d. to smooth out irregular supply and demand e. all of the above are valid uses of inventory

sElF-TEsT  225

M06_REND3161_13_AIE_C06.indd 225 27/10/16 2:18 PM

226  CHAPTER 6 • InvEnTORy COnTROl MODEls

3. One assumption necessary for the EOQ model is instantaneous replenishment. This means a. the lead time is zero. b. the production time is assumed to be zero. c. the entire order is delivered at one time. d. replenishment cannot occur until the on-hand inven-

tory is zero. 4. If the EOQ assumptions are met and a company orders

the EOQ each time an order is placed, then the a. total annual holding cost is minimized. b. total annual ordering cost is minimized. c. total of all inventory cost is minimized. d. order quantity will always be less than the average

inventory. 5. If the EOQ assumptions are met and a company orders

more than the EOQ, then the a. total annual holding cost will be greater than the total

annual ordering cost. b. total annual holding cost will be less than the total an-

nual ordering cost. c. total annual holding cost will be equal to the total an-

nual ordering cost. d. total annual holding cost will be equal to the total an-

nual purchase cost. 6. The reorder point is

a. the quantity that is reordered each time an order is placed.

b. the amount of inventory that would be needed to meet demand during the lead time.

c. equal to the average inventory when the EOQ assump- tions are met.

d. assumed to be zero if there is instantaneous replenishment. 7. If the EOQ assumptions are met, then

a. the annual stockout cost will be zero. b. the total annual holding cost will equal the total annual

ordering cost. c. the average inventory will be one-half the order quantity. d. all of the above are true.

8. In the production run model, the maximum inventory level will be a. greater than the production quantity. b. equal to the production quantity. c. less than the production quantity. d. equal to the daily production rate plus the daily demand.

9. Why is the annual purchase (material) cost not considered to be a relevant inventory cost if the EOQ assumptions are met? a. This cost will be zero. b. This cost is constant and not affected by the order

quantity. c. This cost is insignificant compared with the other in-

ventory costs. d. This cost is never considered to be an inventory cost.

10. A JIT system will usually result in a. a low annual holding cost. b. very few orders per year. c. frequent shutdowns in an assembly line. d. high levels of safety stock.

11. Manufacturers use MRP when a. the demand for one product is dependent on the de-

mand for other products. b. the demand for each product is independent of the de-

mand for other products. c. the demand is totally unpredictable. d. the purchase cost is extremely high.

12. In using marginal analysis, an additional unit should be stocked if a. MP = ML. b. the probability of selling that unit is greater than or

equal to MP>1MP + ML2. c. the probability of selling that unit is less than or equal

to ML>1MP + ML2. d. the probability of selling that unit is greater than or

equal to ML>1MP + ML2. 13. In using marginal analysis with the normal distribution, if

marginal profit is less than marginal loss, we expect the optimal stocking quantity to be a. greater than the standard deviation. b. less than the standard deviation. c. greater than the mean. d. less than the mean.

14. The inventory position is defined as a. the amount of inventory needed to meet the demand

during the lead time. b. the amount of inventory on hand. c. the amount of inventory on order. d. the total of the on-hand inventory plus the on-order

inventory.

Discussion Questions and Problems

Discussion Questions 6-1 Why is inventory an important consideration for

managers? 6-2 What is the purpose of inventory control? 6-3 Under what circumstances can inventory be used as

a hedge against inflation? 6-4 Why wouldn’t a company always store large quanti-

ties of inventory to eliminate shortages and stock outs?

6-5 What are some of the assumptions made in using the EOQ?

6-6 Discuss the major inventory costs that are used in determining the EOQ.

6-7 What is the ROP? How is it determined? 6-8 If the ROP is greater than the order quantity, explain

how the ROP is implemented. Can the ROP be more than twice the order quantity, and, if so, how is such a situation handled?

M06_REND3161_13_AIE_C06.indd 226 27/10/16 2:18 PM

DIsCUssIOn QUEsTIOns AnD PROBlEMs  227

6-9 Let the annual demand for an arbitrary commodity be 1,000 units per year and the associated EOQ be 400 units per order. Under this circumstance, the number of orders per year would be 1D>Q2 = 2.5 orders per year. How can this be so?

6-10 What is the purpose of sensitivity analysis? 6-11 What assumptions are made in the production run

model? 6-12 What happens to the production run model when the

daily production rate becomes very large? 6-13 Briefly describe what is involved in solving a quan-

tity discount model. 6-14 When using safety stock, how is the standard devia-

tion of demand during the lead time calculated if daily demand is normally distributed but lead time is constant? How is it calculated if daily demand is constant but lead time is normally distributed? How is it calculated if both daily demand and lead time are normally distributed?

6-15 Briefly explain the marginal analysis approach to the single-period inventory problem.

6-16 Briefly describe what is meant by ABC analysis. What is the purpose of this inventory technique?

6-17 What is the overall purpose of MRP? 6-18 What is the difference between the gross and the net

material requirements plans? 6-19 What is the objective of JIT?

Problems 6-20 Lila Battle has determined that the annual demand

for number 6 screws is 100,000 screws. Lila, who works in her brother’s hardware store, is in charge of purchasing. She estimates that it costs $10 ev- ery time an order is placed. This cost includes her wages, the cost of the forms used in placing the or- der, and so on. Furthermore, she estimates that the cost of carrying one screw in inventory for a year is one-half of 1 cent. Assume that the demand is con- stant throughout the year.

(a) How many number 6 screws should Lila order at a time if she wishes to minimize total inventory cost?

(b) How many orders per year would be placed? What would the annual ordering cost be?

(c) What would the average inventory be? What would the annual holding cost be?

6-21 It takes approximately eight working days for an or- der of number 6 screws to arrive once the order has been placed. (Refer to Problem 6-20.) The demand for number 6 screws is fairly constant, and on aver- age, Lila has observed that her brother’s hardware

store sells 500 of these screws each day. Because the demand is fairly constant, Lila believes that she can avoid stockouts completely if she orders the number 6 screws only at the correct time. What is the ROP?

6-22 Lila’s brother believes that she places too many or- ders for screws per year. He believes that an order should be placed only twice per year. If Lila follows her brother’s policy, how much more would this cost every year over the ordering policy that she de- veloped in Problem 6-20? If only two orders were placed each year, what effect would this have on the ROP?

6-23 Barbara Bright is the purchasing agent for West Valve Company. West Valve sells industrial valves and fluid control devices. One of the most popular valves is the Western, which has an annual demand of 4,000 units. The cost of each valve is $90, and the inventory carrying cost is estimated to be 10% of the cost of each valve. Barbara has made a study of the costs involved in placing an order for any of the valves that West Valve stocks, and she has concluded that the average ordering cost is $25 per order. Fur- thermore, it takes about two weeks for an order to arrive from the supplier, and during this time, the de- mand per week for West valves is approximately 80.

(a) What is the EOQ? (b) What is the ROP? (c) Is the ROP greater than the EOQ? If so, how is

this situation handled? (d) What is the average inventory? What is the an-

nual holding cost? (e) How many orders per year would be placed?

What is the annual ordering cost?

6-24 Ken Ramsing has been in the lumber business for most of his life. Ken’s biggest competitor is Pacific Woods. Through many years of experience, Ken knows that the ordering cost for an order of ply- wood is $25 and that the carrying cost is 25% of the unit cost. Both Ken and Pacific Woods receive plywood in loads that cost $100 per load. Further- more, Ken and Pacific Woods use the same supplier of plywood, and Ken was able to find out that Pacific Woods orders in quantities of 4,000 loads at a time. Ken also knows that 4,000 loads is the EOQ for Pa- cific Woods. What is the annual demand in loads of plywood for Pacific Woods?

6-25 Shoe Shine is a local retail shoe store located on the north side of Centerville. Annual demand for a pop- ular sandal is 500 pairs, and John Dirk, the owner of Shoe Shine, has been in the habit of ordering 100 pairs at a time. John estimates that the ordering cost is $10 per order. The cost of the sandal is $5 per pair. For John’s ordering policy to be correct, what would

Note: means the problem may be solved with QM for Windows; means the problem may be solved with

Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M06_REND3161_13_AIE_C06.indd 227 27/10/16 2:18 PM

228  CHAPTER 6 • InvEnTORy COnTROl MODEls

the carrying cost as a percentage of the unit cost have to be? If the carrying cost was 10% of the cost, what would the optimal order quantity be?

6-26 In Problem 6-20, you helped Lila Battle determine the optimal order quantity for number 6 screws. She had estimated that the ordering cost was $10 per order. At this time, though, she believes that this estimate was too low. Although she does not know the exact order- ing cost, she believes that it could be as high as $40 per order. How would the optimal order quantity change if the ordering cost were $20, $30, and $40?

6-27 Ross White’s machine shop uses 2,500 brackets dur- ing the course of a year, and this usage is relatively constant throughout the year. These brackets are pur- chased from a supplier 100 miles away for $15 each, and the lead time is 2 days. The holding cost per bracket per year is $1.50 (or 10% of the unit cost), and the ordering cost per order is $18.75. There are 250 working days per year.

(a) What is the EOQ? (b) Given the EOQ, what is the average inventory?

What is the annual inventory holding cost? (c) In minimizing cost, how many orders would be

placed each year? What would be the annual ordering cost?

(d) Given the EOQ, what is the total annual inven- tory cost (including purchase cost)?

(e) What is the time between orders? (f) What is the ROP?

6-28 Ross White (see Problem 6-27) wants to reconsider his decision of buying the brackets and is consider- ing making the brackets in-house. He has determined that setup cost would be $25 in machinist time and lost production time and that 50 brackets could be produced in a day once the machine has been set up. Ross estimates that the cost (including labor time and materials) of producing one bracket would be $14.80. The holding cost would be 10% of this cost.

(a) What is the daily demand rate? (b) What is the optimal production quantity? (c) How long will it take to produce the optimal

quantity? How much inventory is sold during this time?

(d) If Ross uses the optimal production quantity, what would be the maximum inventory level? What would be the average inventory level? What is the annual holding cost?

(e) How many production runs would there be each year? What would be the annual setup cost?

(f) Given the optimal production run size, what is the total annual inventory cost?

(g) If the lead time is one-half day, what is the ROP?

6-29 Upon hearing that Ross White (see Problems 6-27 and 6-28) is considering producing the brackets in- house, the vendor has notified Ross that the purchase

price would drop from $15 per bracket to $14.50 per bracket if Ross would purchase the brackets in lots of 1,000. Lead times, however, would increase to 3 days for this larger quantity.

(a) What is the total annual inventory cost plus pur- chase cost if Ross buys the brackets in lots of 1,000 at $14.50 each?

(b) If Ross does buy in lots of 1,000 brackets, what is the new ROP?

(c) Given the options of purchasing the brackets at $15 each, producing them in-house at $14.80, and taking advantage of the discount, what is your recommendation to Ross White?

6-30 After analyzing the costs of various options for ob- taining brackets, Ross White (see Problems 6-27 through 6-29) recognizes that although he knows that the lead time is 2 days and the demand per day averages 10 units, the demand during the lead time often varies. Ross has kept very careful records and has determined that lead time demand is normally distributed with a standard deviation of 1.5 units.

(a) What Z value would be appropriate for a 98% service level?

(b) What safety stock should Ross maintain if he wants a 98% service level?

(c) What is the adjusted ROP for the brackets? (d) What is the annual holding cost for the safety

stock if the annual holding cost per unit is $1.50?

6-31 Annual demand for the Dobbs model airplane kit is 80,000 units. Albert Dobbs, president of Dobbs’ Ter- rific Toys, controls one of the largest toy companies in Nevada. He estimates that the ordering cost is $40 per order. The carrying cost is $7 per unit per year. It is 25 days from the time that Albert places an order for the model airplane kits until they are received at his warehouse. During this time, the daily demand is estimated to be 450 units.

(a) Compute the EOQ, ROP, and optimal number of orders per year.

(b) Albert now believes that the carrying cost may be as high as $14 per unit per year. Furthermore, he estimates that the lead time may be 35 days instead of 25 days. Redo part (a), using these re- vised estimates.

6-32 Morgan Arthur has spent the past few weeks deter- mining inventory costs for Armstrong, a toy manu- facturer located near Cincinnati, Ohio. She knows that annual demand will be 30,000 units per year and that the carrying cost will be $1.50 per unit per year. The ordering cost, on the other hand, can vary from $45 per order to $50 per order. During the past 450 working days, Morgan has observed the following frequency distribution for the ordering cost:

M06_REND3161_13_AIE_C06.indd 228 27/10/16 2:18 PM

DIsCUssIOn QUEsTIOns AnD PROBlEMs  229

ORDERING COST FREQUENCY

$45 85

$46 95

$47 90

$48 80

$49 55

$50 45

Morgan’s boss would like Morgan to determine an EOQ value for each possible ordering cost and to determine an EOQ value for the expected ordering cost.

6-33 Douglas Boats is a supplier of boating equipment for the states of Oregon and Washington. It sells 5,000 White Marine WM-4 diesel engines every year. These engines are shipped to Douglas in a ship- ping container of 100 cubic feet, and Douglas Boats keeps the warehouse full of these WM-4 motors. The warehouse can hold 5,000 cubic feet of boating supplies. Douglas estimates that the ordering cost is $10 per order, and the carrying cost is estimated to be $10 per motor per year. Douglas Boats is consid- ering the possibility of expanding the warehouse for the WM-4 motors. How much should Douglas Boats expand, and how much would it be worth for the company to make the expansion? Assume demand is constant throughout the year.

6-34 Northern Distributors is a wholesale organization that supplies retail stores with lawn care and house- hold products. One building is used to store Neverfail lawn mowers. The building is 25 feet wide by 40 feet deep by 8 feet high. Anna Oldham, manager of the warehouse, estimates that about 60% of the ware- house can be used to store the Neverfail lawn mow- ers. The remaining 40% is used for walkways and a small office. Each Neverfail lawn mower comes in a box that is 5 feet by 4 feet by 2 feet high. The annual demand for these lawn mowers is 12,000, and the ordering cost for Northern Distributors is $30 per or- der. It is estimated that it costs Northern $2 per lawn mower per year for storage. Northern Distributors is thinking about increasing the size of the warehouse. The company can do this only by making the ware- house deeper. At the present time, the warehouse is 40 feet deep. How many feet of depth should be added onto the warehouse to minimize the annual inventory costs? How much should the company be willing to pay for this addition? Remember that only 60% of the total area can be used to store Neverfail lawn mowers. Assume all EOQ conditions are met.

6-35 Lisa Surowsky was asked to help in determining the best ordering policy for a new product. Currently, the demand for the new product has been projected to be about 1,000 units annually. To get a handle on the carrying and ordering costs, Lisa prepared a

series of average inventory costs. Lisa thought that these costs would be appropriate for the new prod- uct. The results are summarized in the following ta- ble. These data were compiled for 10,000 inventory items that were carried or held during the year and were ordered 100 times during the past year. Help Lisa determine the EOQ.

COST FACTOR COST ($)

Taxes 2,000

Processing and inspection 1,500

New product development 2,500

Bill paying 500

Ordering supplies 50

Inventory insurance 600

Product advertising 800

Spoilage 750

Sending purchasing orders 800

Inventory inquiries 450

Warehouse supplies 280

Research and development 2,750

Purchasing salaries 3,000

Warehouse salaries 2,800

Inventory theft 800

Purchase order supplies 500

Inventory obsolescence 300

6-36 Jan Gentry is the owner of a small company that produces electric scissors used to cut fabric. The annual demand is 8,000 scissors, and Jan produces the scissors in batches. On average, Jan can produce 150 scissors per day, and during the production pro- cess, demand for scissors has been about 40 scissors per day. The cost to set up the production process is $100, and it costs Jan 30 cents to carry one pair of scissors for one year. How many scissors should Jan produce in each batch?

6-37 Jim Overstreet, inventory control manager for Itex, receives wheel bearings from Wheel-Rite, a small producer of metal parts. Unfortunately, Wheel-Rite can produce only 500 wheel bearings per day. Itex receives 10,000 wheel bearings from Wheel-Rite each year. Since Itex operates 200 working days each year, its average daily demand for wheel bear- ings is 50. The ordering cost for Itex is $40 per order, and the carrying cost is 60 cents per wheel bearing per year. How many wheel bearings should Itex order from Wheel-Rite at one time? Wheel-Rite has agreed to ship the maximum number of wheel bearings that it produces each day to Itex when an order has been received.

M06_REND3161_13_AIE_C06.indd 229 27/10/16 2:18 PM

230  CHAPTER 6 • InvEnTORy COnTROl MODEls

6-38 North Manufacturing has a demand for 1,000 pumps each year. The cost of a pump is $50. It costs North Manufacturing $40 to place an order, and the carry- ing cost is 25% of the unit cost. If pumps are ordered in quantities of 200, North Manufacturing can get a 3% discount on the cost of the pumps. Should North Manufacturing order 200 pumps at a time and take the 3% discount?

6-39 Linda Lechner is in charge of maintaining hospital supplies at General Hospital. During the past year, the mean lead time demand for bandage BX-5 was 60. Furthermore, the standard deviation for BX-5 was 7. Linda would like to maintain a 90% service level. What safety stock level do you recommend for BX-5?

6-40 Linda Lechner has just been severely chastised for her inventory policy. (See Problem 6-39.) Sue Sur- rowski, her boss, believes that the service level should be either 95% or 98%. Compute the safety stock levels for a 95% and a 98% service level. Linda knows that the carrying cost of BX-5 is 50 cents per unit per year. Compute the carrying cost that is associated with a 90%, a 95%, and a 98% ser- vice level.

6-41 Ralph Janaro simply does not have time to ana- lyze all of the items in his company’s inventory. As a young manager, he has more important things to do. The following is a table of six items in inventory along with the unit cost and the demand in units.

(a) Find the total amount spent on each item during the year. What is the total investment for all of these?

(b) Find the percentage of the total investment in in- ventory that is spent on each item.

IDENTIFICATION CODE

UNIT COST ($)

DEMAND IN UNITS

XX1 5.84 1,200

B66 5.40 1,110

3CPO 1.12 896

33CP 74.54 1,104

R2D2 2.00 1,110

RMS 2.08 961

(c) Based on the percentages in part (b), which item(s) would be classified in categories A, B, and C using ABC analysis?

(d) Which item(s) should Ralph most carefully con- trol using quantitative techniques?

6-42 Thaarugo, Inc., produces a GPS device that is be- coming popular in parts of Scandinavia. When Thaarugo produces one of these, a printed circuit board (PCB) is used, and it is populated with several electronic components. Thaarugo determines that it

needs about 16,000 of this type of PCB each year. Demand is relatively constant throughout the year, and the ordering cost is about $25 per order; the holding cost is 20% of the price of each PCB. Two companies are competing to become the dominant supplier of the PCBs, and both have now offered discounts, as shown in the following table. Which of the two suppliers should be selected if Thaarugo wishes to minimize total annual inventory cost? What would be the annual inventory cost?

SUPPLIER A SUPPLIER B

QUANTITY PRICE QUANTITY PRICE

1–199 38.40 1–299 39.50

200–499 35.80 300–999 35.40

500 or more 34.70 1,000 or more 34.60

6-43 Dillard Travey receives 5,000 tripods annually from Quality Suppliers to meet his annual demand. Dil- lard runs a large photographic outlet, and the tripods are used primarily with 35-mm cameras. The order- ing cost is $15 per order, and the carrying cost is 50 cents per unit per year. Quality is starting a new option for its customers. When an order is placed, Quality will ship one-third of the order every week for three weeks instead of shipping the entire order at one time. Weekly demand over the lead time is 100 tripods.

(a) What is the order quantity if Dillard has the en- tire order shipped at one time?

(b) What is the order quantity if Dillard has the or- der shipped over three weeks using the new op- tion from Quality Suppliers, Inc.? To simplify your calculations, assume that the average inven- tory is equal to one-half of the maximum inven- tory level for Quality’s new option.

(c) Calculate the total cost for each option. What do you recommend?

6-44 Quality Suppliers, Inc., has decided to extend its shipping option. (Refer to Problem 6-43 for de- tails.) Now, Quality Suppliers is offering to ship the amount ordered in five equal shipments, one each week. It will take five weeks for this entire order to be received. What are the order quantity and total cost for this new shipping option?

6-45 The Hardware Warehouse is evaluating the safety stock policy for all its items, as identified by the SKU code. For SKU M4389, the company always orders 80 units each time an order is placed. The daily demand is constant, at 5 units per day; the lead time is normally distributed, with a mean of three days and a standard deviation of two days. Holding cost is $3 per unit per year. A 95% service level is to be maintained.

M06_REND3161_13_AIE_C06.indd 230 27/10/16 2:18 PM

DIsCUssIOn QUEsTIOns AnD PROBlEMs  231

(a) What is the standard deviation of demand during the lead time?

(b) How much safety stock should be carried, and what should be the reorder point?

(c) What is the total annual holding cost?

6-46 For SKU A3510 at the Hardware Warehouse, the order quantity has been set at 150 units each time an order is placed. The daily demand is normally distributed, with a mean of 12 units and a standard deviation of 4. It always takes exactly five days for an order of this item to arrive. The holding cost has been determined to be $10 per unit per year. Due to the large sale volume of this item, management wants to maintain a 99% service level.

(a) What is the standard deviation of demand during the lead time?

(b) How much safety stock should be carried, and what should be the reorder point?

(c) What is the total annual holding cost?

6-47 H & K Electronic Warehouse sells a 12-pack of AAA batteries, and this is a very popular item. De- mand for this is normally distributed, with an aver- age of 50 packs per day and a standard deviation of 16. The average delivery time is five days, with a standard deviation of two days. Delivery time has been found to be normally distributed. A 96% ser- vice level is desired.

(a) What is the standard deviation of demand during the lead time?

(b) How much safety stock should be carried, and what should be the reorder point?

6-48 Xemex has collected the following inventory data for the six items that it stocks:

ITEM CODE

UNIT COST

($)

ANNUAL DEMAND (UNITS)

ORDERING COST ($)

CARRYING COST AS A

PERCENTAGE OF UNIT COST

1 10.60 600 40 20

2 11.00 450 30 25

3 2.25 500 50 15

4 150.00 560 40 15

5 4.00 540 35 16

6 4.10 490 40 17

Lynn Robinson, Xemex’s inventory manager, does not feel that all of the items can be controlled. What order quantities do you recommend for which inven- tory product(s)?

6-49 Georgia Products offers the following discount schedule for its 4- by 8-foot sheets of good-quality plywood:

ORDER UNIT COST ($)

9 sheets or less 18.00

10 to 50 sheets 17.50

More than 50 sheets 17.25

Home Sweet Home Company orders plywood from Georgia Products. Home Sweet Home has an or- dering cost of $45. The carrying cost is 20%, and the annual demand is 100 sheets. What do you recommend?

6-50 Sunbright Citrus Products produces orange juice, grapefruit juice, and other citrus-related items. Sun- bright obtains fruit concentrate from a cooperative in Orlando consisting of approximately 50 citrus grow- ers. The cooperative will sell a minimum of 100 cans of fruit concentrate to citrus processors such as Sun- bright. The cost per can is $9.90.

Last year, the cooperative developed the Incen- tive Bonus Program to give an incentive to their large customers to buy in quantity. It works like this: if 200 cans of concentrate are purchased, 10 cans of free concentrate are included in the deal. In addition, the names of the companies purchasing the concen- trate are added to a drawing for a new personal com- puter. The personal computer has a value of about $3,000, and currently about 1,000 companies are eligible for this drawing. At 300 cans of concentrate, the cooperative will give away 30 free cans and will also place the company name in the drawing for the personal computer. When the quantity goes up to 400 cans of concentrate, 40 cans of concentrate will be given away free with the order. In addition, the company is also placed in a drawing for the per- sonal computer and a free trip for two. The value of the trip for two is approximately $5,000. About 800 companies are expected to qualify and to be in the running for this trip.

Sunbright estimates that its annual demand for fruit concentrate is 1,000 cans. In addition, the or- dering cost is estimated to be $10, while the carrying cost is estimated to be 10%, or about $1 per unit. The firm is intrigued with the Incentive Bonus Pro- gram. If the company decides that it will keep the free cans, the trip, or the computer if they are won, what should it do?

6-51 John Lindsay sells CDs that contain 25 software packages that perform a variety of financial func- tions, including net present value, internal rate of re- turn, and other financial programs typically used by business students majoring in finance. Depending on the quantity ordered, John offers the following price discounts. The annual demand is 2,000 units on av- erage. His setup cost to produce the CDs is $250. He estimates the holding cost to be 10% of the price, or about $1 per unit per year.

M06_REND3161_13_AIE_C06.indd 231 27/10/16 2:18 PM

232  CHAPTER 6 • InvEnTORy COnTROl MODEls

QUANTITY ORDERED

FROM TO PRICE

1 500 $10.00

501 1,000 9.95

1,001 1,500 9.90

1,501 2,000 9.85

(a) What is the optimal number of CDs to produce at a time?

(b) What is the impact of the following quantity– price schedule on the optimal order quantity?

QUANTITY ORDERED

FROM TO PRICE

1 500 $10.00

501 1,000 9.99

1,001 1,500 9.98

1,501 2,000 9.97

6-52 Teresa Granger is the manager of Chicago Cheese, which produces cheese spreads and other cheese-re- lated products. E-Z Spread Cheese is a product that has always been popular. The probability of sales, in cases, is as follows:

DEMAND (CASES) PROBABILITY

10 0.2

11 0.3

12 0.2

13 0.2

14 0.1

A case of E-Z Spread Cheese sells for $100 and has a cost of $75. Any cheese that is not sold by the end of the week is sold to a local food processor for $50. Teresa never sells cheese that is more than a week old. Use marginal analysis to determine how many cases of E-Z Spread Cheese to produce each week to maximize average profit.

6-53 Harry’s Hardware does a brisk business during the year. During Christmas, Harry’s Hardware sells Christmas trees for a substantial profit. Unfortu- nately, any trees not sold at the end of the season are totally worthless. Thus, the number of trees to stock for a given season is a very important decision. The following table reveals the demand for Christmas trees:

DEMAND FOR CHRISTMAS TREES

PROBABILITY

50 0.05

75 0.1

100 0.2

125 0.3

150 0.2

175 0.1

200 0.05

Harry sells trees for $80 each, but his cost is only $20.

(a) Use marginal analysis to determine how many trees Harry should stock at his hardware store.

(b) If the cost increases to $35 per tree and Harry continues to sell trees for $80 each, how many trees should Harry stock?

(c) Harry is thinking about increasing the price to $100 per tree. Assume that the cost per tree is $20. With the new price, it is expected that the probability of selling 50, 75, 100, or 125 trees will be 0.25 each. Harry does not expect to sell more than 125 trees with this price increase. What do you recommend?

6-54 In addition to selling Christmas trees during the Christmas holidays, Harry’s Hardware sells all the ordinary hardware items (see Problem 6-53). One of the most popular items is Great Glue HH, a glue that is made just for Harry’s Hardware. The selling price is $4 per bottle, but unfortunately, the glue gets hard and unusable after one month. The cost of the glue is $1.20. During the past several months, the mean sales of glue have been 60 units, and the standard deviation is 7. How many bottles of glue should Harry’s Hardware stock? Assume that sales follow a normal distribution.

6-55 The marginal loss on Washington Reds, a brand of apples from the state of Washington, is $35 per case. The marginal profit is $15 per case. During the past year, the mean sales of Washington Reds in cases was 45,000 cases, and the standard deviation was 4,450. How many cases of Washington Reds should be brought to market? Assume that sales follow a normal distribution.

6-56 Linda Stanyon has been the production manager for Plano Produce for over eight years. Plano Produce is a small company located near Plano, Illinois. One produce item, tomatoes, is sold in cases, with daily sales averaging 400 cases. Daily sales are assumed to be normally distributed. In addition, 85% of the time the sales are between 350 and 450 cases. Each case costs $10 and sells for $15. All cases that are not sold must be discarded.

M06_REND3161_13_AIE_C06.indd 232 27/10/16 2:18 PM

DIsCUssIOn QUEsTIOns AnD PROBlEMs  233

(a) Using the information provided, estimate the standard deviation of sales.

(b) Using the standard deviation in part (a), deter- mine how many cases of tomatoes Linda should stock.

6-57 Paula Shoemaker produces a weekly stock market report for an exclusive readership. She normally sells 3,000 reports per week, and 70% of the time her sales range from 2,900 to 3,100. The report costs Paula $15 to produce, but Paula is able to sell reports for $350 each. Of course, any reports not sold by the end of the week have no value. How many reports should Paula produce each week?

6-58 Emarpy Appliance produces all kinds of major ap- pliances. Richard Feehan, the president of Emarpy, is concerned about the production policy for the company’s best-selling refrigerator. The demand for this has been relatively constant at about 8,000 units each year. The production capacity for this product is 200 units per day. Each time production starts, it costs the company $120 to move materials into place, reset the assembly line, and clean the equip- ment. The holding cost of a refrigerator is $50 per year. The current production plan calls for 400 re- frigerators to be produced in each production run. Assume there are 250 working days per year.

(a) What is the daily demand of this product? (b) If the company were to continue to produce 400

units each time production starts, how many days would production continue?

(c) Under the current policy, how many production runs per year would be required? What would the annual setup cost be?

(d) If the current policy continues, how many refrig- erators would be in inventory when production stops? What would the average inventory level be?

(e) If the company produces 400 refrigerators at a time, what would the total annual setup cost and holding cost be?

6-59 Consider the Emarpy Appliance situation in Prob- lem 6-58. If Richard Feehan wants to minimize the total annual inventory cost, how many refrigerators should be produced in each production run? How much would this save the company in inventory costs compared with the current policy of producing 400 in each production run?

6-60 This chapter presents a material structure tree for item A in Figure 6.12. Assume that it now takes 1 unit of item B to make every unit of item A. What impact does this have on the material structure tree and the number of items D and E that are needed?

6-61 Given the information in Problem 6-60, develop a gross material requirements plan for 50 units of item A.

6-62 Using the data from Figures 6.12–6.14, develop a net material requirements plan for 50 units of item A assuming that it takes only 1 unit of item B for each unit of item A.

6-63 The demand for product S is 100 units. Each unit of S requires 1 unit of T and 0.5 ounce of U. Each unit of T requires 1 unit of V, 2 units of W, and 1 unit of X. Finally, each unit of U requires 0.5 ounce of Y and 3 units of Z. All items are manufactured by the same firm. It takes two weeks to make S, one week to make T, two weeks to make U, two weeks to make V, three weeks to make W, one week to make X, two weeks to make Y, and one week to make Z.

(a) Construct a material structure tree and a gross material requirements plan for the dependent in- ventory items.

(b) Identify all levels, parents, and components. (a) Construct a net material requirements plan using

the following on-hand inventory data:

ITEM S T U V W X Y Z

On-Hand Inventory

20

20

10

30

30

25

15

10

6-64 The Webster Manufacturing Company produces a popular type of serving cart. This product, the SL72, is made from the following parts: 1 unit of part A, 1 unit of part B, and 1 unit of subassembly C. Each subassembly C is made up of 2 units of part D, 4 units of part E, and 2 units of part F. Develop a material structure tree for this.

6-65 Blair H. Dodds III runs a medium- to large-sized home eBay business dealing in vintage photographs. The annual demand for his photos is approximately 50,000. The annual overhead cost (excluding the purchase price) to buy the photographs is $4,000 per year. Given that this cost represents the optimal an- nual ordering cost and the optimal ordering quantity is 400 photographs at a time, determine the ordering cost and the average inventory level.

6-66 The lead time for each of the parts in the SL72 (Prob- lem 6-64) is one week, except for part B, which has a lead time of two weeks. Develop a net material re- quirements plan for an order of 800 SL72s. Assume that currently there are no parts in inventory.

6-67 Refer to Problem 6-66. Develop a net material re- quirements plan assuming that there are cur- rently 150 units of part A, 40 units of part B, 50 units of subassembly C, and 100 units of part F in inventory.

M06_REND3161_13_AIE_C06.indd 233 27/10/16 2:18 PM

234  CHAPTER 6 • InvEnTORy COnTROl MODEls

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 6-68 to 6-75.

Internet Homework Problems

Martin-Pullin Bicycle Corp. (MPBC), located in Dallas, is a wholesale distributor of bicycles and bicycle parts. Formed in 1981 by cousins Ray Martin and Jim Pullin, the firm’s primary retail outlets are located within a 400-mile radius of the dis- tribution center. These retail outlets receive their orders from Martin-Pullin within two days after notifying the distribution center, provided that the stock is available. However, if an or- der is not fulfilled by the company, no backorder is placed; the retailers arrange to get their shipment from other distributors, and MPBC loses that amount of business.

Demands for AirWing Model

MONTH 2014 2015 FORECAST FOR 2016

January 6 7 8

February 12 14 15

March 24 27 31

April 46 53 59

May 75 86 97

June 47 54 60

July 30 34 39

August 18 21 24

September 13 15 16

October 12 13 15

November 22 25 28

December 38 42 47

Total 343 391 439

The company distributes a wide variety of bicycles. The most popular model, and the major source of revenue for the company, is the AirWing. MPBC receives all the models from a single manufacturer overseas, and shipment takes as long as four weeks from the time an order is placed. With the cost of communication, paperwork, and customs clearance included, MPBC estimates that each time an order is placed, it incurs a cost of $65. The purchase price paid by MPBC, per bicycle, is roughly 60% of the suggested retail price for all the styles available, and the inventory carrying cost is 1% per month (12% per year) of the purchase price paid by MPBC. The retail price (paid by the customers) for the AirWing is $170 per bicycle.

MPBC is interested in making an inventory plan for 2016. The firm wants to maintain a 95% service level with its cus- tomers to minimize the losses on the lost orders. The data collected for the past two years are summarized in the accom- panying table. A forecast for AirWing model sales in 2016 has been developed and will be used to make an inventory plan for MPBC.

Discussion Questions 1. Develop an inventory plan to help MPBC. 2. Discuss ROPs and total costs. 3. How can you address demand that is not at the level of the

planning horizon?

Source: Professor Kala Chand Seal, Loyola Marymount University.

Case Study

Martin-Pullin Bicycle Corporation

See our Internet home page, at www.pearsonhighered.com/render, for these additional case studies: (1) LaPlace Power and Light: This case involves a public utility in Louisiana and its use of elec- tric cables for connecting houses to power lines. (2) Western Ranchman Outfitters: This case involves managing the inventory of a popular style of jeans when the delivery date is sometimes unpredictable. (3) Professional Video Management: This case involves a video system in which discounts from suppliers are possible. (4) Drake Radio: This case involves ordering FM tuners.

Internet Case Studies

M06_REND3161_13_AIE_C06.indd 234 27/10/16 2:18 PM

APPEnDIx 6.1: InvEnTORy COnTROl wITH QM FOR wInDOws  235

Bibliography

Anderson, Eric T., Gavan J. Fitzsimons, and Duncan Simester. “Measuring and Mitigating the Costs of Stockouts,” Management Science 52, 11 (November 2006): 1751–1763.

Bradley, James R., and Richard W. Conway. “Managing Cyclic Inventories,” Production and Operations Management 12, 4 (Winter 2003): 464–479.

Chan, Lap Mui Ann, David Simchi-Levi, and Julie Swann. “Pricing, Produc- tion, and Inventory Policies for Manufacturing with Stochastic Demand and Discretionary Sales,” Manufacturing & Service Operations Manage- ment 8, 2 (Spring 2006): 149–168.

Chickering, David Maxwell, and David Heckerman. “Targeted Advertising on the Web with Inventory Management,” Interfaces 33, 5 (September– October 2003): 71–77.

Chopra, Sunil, Gilles Reinhardt, and Maqbool Dada. “The Effect of Lead Time Uncertainty on Safety Stocks,” Decision Sciences 35, 1 (Winter 2004): 1–24.

Desai, Preyas S., and Oded Koenigsberg. “The Role of Production Lead Time and Demand Uncertainty in Marketing Durable Goods,” Management Science 53, 1 (January 2007): 150–158.

Jayaraman, Vaidyanathan, Cindy Burnett, and Derek Frank. “Separating In- ventory Flows in the Materials Management Department of Hancock Medical Center,” Interfaces 30, 4 (July–August 2000): 56–64.

Kapuscinski, Roman, Rachel Q. Zhang, Paul Carbonneau, Robert Moore, and Bill Reeves. “Inventory Decisions in Dell’s Supply Chain,” Interfaces 34, 3 (May–June 2004): 191–205.

Karabakal, Nejat, Ali Gunal, and Warren Witchie. “Supply-Chain Analysis at Volkswagen of America,” Interfaces 30, 4 (July–August 2000): 46–55.

Kök, A. Gürhan, and Kevin H. Shang. “Inspection and Replenishment Policies for Systems with Inventory Record Inaccuracy,” Manufacturing & Ser- vice Operations Management 9, 2 (Spring 2007): 185–205.

Ramasesh, Ranga V., and Ram Rachmadugu. “Lot-Sizing Decision Under Limited-Time Price Reduction,” Decision Sciences 32, 1 (Winter 2001): 125–143.

Ramdas, Kamalini, and Robert E. Spekman. “Chain or Shackles: Understanding What Drives Supply-Chain Performance,” Interfaces 30, 4 (July– August 2000): 3–21.

Rubin, Paul A., and W. C. Benton. “A Generalized Framework for Quantity Discount Pricing Schedules,” Decision Sciences 34, 1 (Winter 2003): 173–188.

Shin, Hojung, and W. C. Benton. “Quantity Discount-Based Inventory Coor- dination: Effectiveness and Critical Environmental Factors,” Production and Operations Management 13, 1 (Spring 2004): 63–76.

Appendix 6.1: Inventory Control with QM for Windows

A variety of inventory control models are covered in this chapter. Each model makes different assumptions and uses slightly differ- ent approaches. The use of QM for Windows is similar for these different types of inventory problems. As you can see in the Inven- tory menu for QM for Windows, most of the inventory problems discussed in this chapter can be solved using your computer.

To demonstrate QM for Windows, we start with the basic EOQ model. Sumco, a manufacturing company discussed in the chapter, has an annual demand of 1,000 units, an ordering cost of $10 per order, and a carrying cost of $0.50 per unit per year. With these data, we can use QM for Windows to determine the economic order quantity. The results are shown in Program 6.5.

The production run inventory problem—which requires the daily production and demand rates in addition to the an- nual demand, the ordering cost per order, and the carrying cost per unit per year—is also covered in this chapter. The Brown Manufacturing example is used in this chapter to show how the

calculations can be made manually. We can use QM for Win- dows on these data. Program 6.6 shows the results.

The quantity discount model allows the material cost to vary with the quantity ordered. In this case, the model must consider and minimize material, ordering, and carrying costs by examining each price discount. Program 6.7 shows how QM for Windows can be used to solve the quantity discount model dis- cussed in the chapter. Note that the program output shows the input data in addition to the results.

When an organization has a large number of inventory items, ABC analysis is often used. As discussed in this chapter, total dollar volume for an inventory item is one way to deter- mine if quantitative control techniques should be used. Perform- ing the necessary calculations is done in Program 6.8, which shows how QM for Windows can be used to compute dollar vol- ume and determine if quantitative control techniques are justi- fied for each inventory item with this new example.

PROGRAM 6.5 QM for windows Results for the EOQ Model

M06_REND3161_13_AIE_C06.indd 235 27/10/16 2:18 PM

236  CHAPTER 6 • InvEnTORy COnTROl MODEls

PROGRAM 6.6 QM for windows Results for the Production Run Model

PROGRAM 6.7 QM for windows Results for the Quantity Discount Model

PROGRAM 6.8 QM for windows Results for ABC Analysis

M06_REND3161_13_AIE_C06.indd 236 27/10/16 2:18 PM

 237

Linear Programming Models: Graphical and Computer Methods

7 CHAPTER

Many management decisions involve trying to make the most effective use of an organi-zation’s resources. Resources typically include machinery, labor, money, time, ware-house space, and raw materials. These resources may be used to make products (such as machinery, furniture, food, or clothing) or services (such as schedules for airlines or produc- tion, advertising policies, or investment decisions). Linear programming (LP) is a widely used mathematical modeling technique designed to help managers in planning and decision making relative to resource allocation. We devote this and the next chapter to illustrating how and why linear programming works.

Despite its name, LP and the more general category of techniques called mathematical programming have very little to do with computer programming. In the world of management science, programming refers to modeling and solving a problem mathematically. Computer pro- gramming has, of course, played an important role in the advancement and use of LP. Real- life LP problems are too cumbersome to solve by hand or with a calculator. So throughout the chapters on LP, we give examples of how valuable a computer program can be in solving an LP problem.

Linear programming is a technique that helps in resource allocation decisions.

7.4 Use Excel spreadsheets to solve LP problems. 7.5 Understand the difference between minimization

and maximization objective functions. 7.6 Understand special issues in LP such as

infeasibility, unboundedness, redundancy, and alternative optimal solutions.

7.7 Understand the role of sensitivity analysis.

7.1 Identify the basic assumptions and properties of linear programming (LP).

7.2 Formulate a linear programming problem algebraically.

7.3 Graphically solve any LP problem that has only two variables by both the corner point and the isoprofit line methods.

After completing this chapter, students will be able to:

LEARNING OBJECTIVES

M07_REND3161_13_AIE_C07.indd 237 27/10/16 2:16 PM

238  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

7.1 Requirements of a Linear Programming Problem

Over the past 70 years, LP has been applied extensively to military, industrial, financial, market- ing, accounting, and agricultural problems. Even though these applications are diverse, all LP problems have several properties and assumptions in common.

All problems seek to maximize or minimize some quantity, usually profit or cost. We refer to this property as the objective function of an LP problem. The major objective of a typical man- ufacturer is to maximize dollar profits. In the case of a trucking or railroad distribution system, the objective might be to minimize shipping costs. In any event, this objective must be stated clearly and defined mathematically. It does not matter, by the way, whether profits and costs are measured in cents, dollars, or millions of dollars.

The second property that LP problems have in common is the presence of restrictions, or constraints, that limit the degree to which we can pursue our objective. For example, the deci- sion on how many units of each product in a firm’s product line to manufacture is restricted by available personnel and machinery. Selection of an advertising policy or a financial port- folio is limited by the amount of money available to be spent or invested. We want there- fore to maximize or minimize a quantity (the objective function) subject to limited resources (the constraints).

There must be alternative courses of action to choose from. For example, if a company produces three different products, management may use LP to decide how to allocate among them its limited production resources (of personnel, machinery, and so on). Should it devote all manufacturing capacity to make only the first product, should it produce equal amounts of each product, or should it allocate the resources in some other ratio? If there were no alternatives to select from, we would not need LP.

The objective and constraints in LP problems must be expressed in terms of linear equa- tions or inequalities. Linear mathematical relationships just mean that all terms used in the objective function and constraints are of the first degree (i.e., not squared, or to the third or higher power, or appearing more than once). Hence, the equation 2A + 5B = 10 is an ac- ceptable linear function, while the equation 2A2 + 5B3 + 3AB = 10 is not linear because the variable A is squared, the variable B is cubed, and the two variables appear again as a product of each other.

The term linear implies both proportionality and additivity. Proportionality means that if production of 1 unit of a product uses 3 hours, production of 10 units would use 30 hours. Additivity means that the total of all activities equals the sum of the individual ac- tivities. If the production of one product generated $3 profit and the production of another product generated $8 profit, the total profit would be the sum of these two, which would be $11.

We assume that conditions of certainty exist: that is, numbers in the objective and con- straints are known with certainty and do not change during the period being studied.

We make the divisibility assumption that solutions need not be in whole numbers (integers). Instead, they are divisible and may take any fractional value. In production problems, we often define variables as the number of units produced per week or per month, and a fractional value (e.g., 0.3 chair) would simply mean that there is work in process. Something that was started in one week can be finished in the next. However, in other types of problems, fractional values do not make sense. If a fraction of a product cannot be purchased (for example, one-third of a submarine), an integer programming problem exists. Integer programming is discussed in more detail in Chapter 10.

Finally, we assume that all answers or variables are nonnegative. Negative values of physical quantities are impossible; you simply cannot produce a negative number of chairs, shirts, smart phones, or computers. However, there are some variables that can have negative values, such as profit, where a negative value indicates a loss. A simple mathematical opera- tion can transform such a variable into two nonnegative variables, and that process can be found in books on linear programming. However, when working with linear programming in this book, we will work with only nonnegative variables. Table 7.1 summarizes these properties and assumptions.

Problems seek to maximize or minimize an objective.

Constraints limit the degree to which the objective can be obtained.

There must be alternatives available.

Mathematical relationships are linear.

M07_REND3161_13_AIE_C07.indd 238 27/10/16 2:16 PM

7.2 FoRMULATInG LP PRobLEMs  239

7.2 Formulating LP Problems

Formulating a linear program involves developing a mathematical model to represent the mana- gerial problem. Thus, in order to formulate a linear program, it is necessary to completely under- stand the managerial problem being faced. Once this is understood, we can begin to develop the mathematical statement of the problem. The steps in formulating a linear program follow:

1. Completely understand the managerial problem being faced. 2. Identify the objective and the constraints. 3. Define the decision variables. 4. Use the decision variables to write mathematical expressions for the objective function and

the constraints.

One of the most common LP applications is the product mix problem. Two or more prod- ucts are usually produced using limited resources such as personnel, machines, raw materials, and so on. The profit that the firm seeks to maximize is based on the profit contribution per unit of each product. (Profit contribution, you may recall, is just the selling price per unit minus the variable cost per unit.1) The company would like to determine how many units of each product it should produce so as to maximize overall profit given its limited resources. A problem of this type is formulated in the following example.

TABLE 7.1 LP Properties and Assumptions

PROPERTIES OF LINEAR PROGRAMS

1. One objective function

2. One or more constraints

3. Alternative courses of action

4. Objective function and constraints are linear—proportionality and divisibility

5. Certainty

6. Divisibility

7. Nonnegative variables

Product mix problems use LP to decide how much of each product to make given a series of resource restrictions.

1Technically, we maximize the total contribution margin, which is the difference between unit selling price and costs that vary in proportion to the quantity of the item produced. Depreciation, fixed general expense, and advertising are excluded from calculations.

Prior to 1945, some conceptual problems regarding the al- location of scarce resources had been suggested by economists and others. Two of these people, Leonid Kantorovich and Tjalling Koopmans, shared the 1975 Nobel Prize in Economics for advanc- ing the concepts of optimal planning in their work that began during the 1940s. In 1945, George Stigler proposed the “diet problem,” which is now the name given to a major category of linear programming applications. However, Stigler relied on heu- ristic techniques to find a good solution to this problem, as there was no method available to find the optimal solution.

Major progress in the field, however, took place in 1947, when George D. Dantzig, often called the “Father of Linear Programming,” published his work on the solution procedure known as the simplex algorithm. Dantzig had been an Air Force mathematician during World War II and was assigned to work

on logistics problems. He saw that many problems involving limited resources and more than one demand could be set up in terms of a series of equations and inequalities, and he subsequently developed the simplex algorithm for solving these problems.

Although early applications of linear programming were military in nature, industrial applications rapidly became apparent with the widespread use of business computers. As problems became larger, research continued to find even better ways to solve linear programs. The work of Leonid Khachiyan in 1979 and Narendra Karmarkar in 1984 spurred others to study the use of interior point methods for solving linear programs, some of which are used today. However, the simplex algorithm developed by Dantzig is still the basis for much of the software used for solving linear programs today.

Source: Trevor S. Hale.

The beginning of Linear ProgrammingHISTORY

M07_REND3161_13_AIE_C07.indd 239 27/10/16 2:16 PM

240  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Flair Furniture Company The Flair Furniture Company produces inexpensive tables and chairs. The production process for each is similar in that both require a certain number of hours of carpentry work and a certain number of labor hours in the painting and varnishing department. Each table takes 4 hours of carpentry and 2 hours in the painting and varnishing shop. Each chair requires 3 hours in car- pentry and 1 hour in painting and varnishing. During the current production period, 240 hours of carpentry time are available, and 100 hours in painting and varnishing time are available. Each table sold yields a profit of $70; each chair produced is sold for a $50 profit.

Flair Furniture’s problem is to determine the best possible combination of tables and chairs to manufacture in order to reach the maximum profit. The firm would like this production mix situation formulated as an LP problem.

We begin by summarizing the information needed to formulate and solve this problem (see Table 7.2). This helps us understand the problem being faced. Next, we identify the objective and the constraints. The objective is

Maximize profit

The constraints are

1. The hours of carpentry time used cannot exceed 240 hours per week. 2. The hours of painting and varnishing time used cannot exceed 100 hours per week.

The decision variables that represent the actual decisions we will make are defined as

T = number of tables to be produced per week C = number of chairs to be produced per week

Now we can create the LP objective function in terms of T and C. The objective function is Maximize profit = $70T + $50C.

Our next step is to develop mathematical relationships to describe the two constraints in this problem. One general relationship is that the amount of a resource used is to be less than or equal to 1…2 the amount of the resource available.

In the case of the carpentry department, the total time used is

14 hours per table21Number of tables produced2 + 13 hours per chair21Number of chairs produced2

So the first constraint may be stated as follows: Carpentry time used … Carpentry time available

4T + 3C … 240 1hours of carpentry time2 Similarly, the second constraint is as follows:

Painting and varnishing time used … Painting and varnishing time available

○2 T + 1C … 100 1hours of painting and varnishing time2 (This means that each table produced takes two hours of the painting and varnishing

resource.) Both of these constraints represent production capacity restrictions and, of course, affect the

total profit. For example, Flair Furniture cannot produce 80 tables during the production period because if T = 80, both constraints will be violated. It also cannot make T = 50 tables and

The resource constraints put limits on the carpentry labor resource and the painting labor resource mathematically.

HOURS REQUIRED TO PRODUCE 1 UNIT

DEPARTMENT

TABLES (T)

CHAIRS (C)

AVAILABLE HOURS THIS WEEK

Carpentry 4 3 240

Painting and varnishing 2 1 100

Profit per unit $70 $50

TABLE 7.2 Flair Furniture Company data

M07_REND3161_13_AIE_C07.indd 240 27/10/16 2:16 PM

7.3 GRAPHICAL soLUTIon To An LP PRobLEM  241

C = 10 chairs. Why? Because this would violate the second constraint: that no more than 100 hours of painting and varnishing time can be allocated.

To obtain meaningful solutions, the values for T and C must be nonnegative numbers. That is, all potential solutions must represent real tables and real chairs. Mathematically, this means that

T Ú 0 1number of tables produced is greater than or equal to 02 C Ú 0 1number of chairs produced is greater than or equal to 02

The complete problem may now be restated mathematically as

Maximize profit = $70T + $50C subject to the constraints

4T + 3C … 240 1carpentry constraint2 2T + 1C … 100 1painting and varnishing constraint2

T Ú 0 1first nonnegativity constraint2 C Ú 0 1second nonnegativity constraint2

While the nonnegativity constraints are technically separate constraints, they are often written on a single line with the variables separated by commas. In this example, this would be written as

T, C Ú 0

7.3 Graphical Solution to an LP Problem

The easiest way to solve a small LP problem such as that of the Flair Furniture Company is with the graphical solution approach. The graphical procedure is useful only when there are two decision variables (such as number of tables to produce, T, and number of chairs to produce, C) in the problem. When there are more than two variables, it is not possible to plot the solution on a two-dimensional graph, and we must turn to more complex approaches. But the graphical method is invaluable in providing us with insights into how other approaches work. For that reason alone, it is worthwhile to spend the rest of this chapter exploring graphical solutions as an intuitive basis for the chapters on mathematical programming that follow.

Graphical Representation of Constraints To find the optimal solution to an LP problem, we must first identify a set, or region, of feasible solutions. The first step in doing so is to plot each of the problem’s constraints on a graph. The variable T (tables) is plotted as the horizontal axis of the graph, and the variable C (chairs) is plotted as the vertical axis. The notation 1T, C2 is used to identify the points on the graph. The nonnegativity constraints mean that we are always working in the first (or northeast) quadrant of a graph (see Figure 7.1).

To represent the first constraint graphically, 4T + 3C … 240, we must first graph the equal- ity portion of this, which is

4T + 3C = 240

As you may recall from elementary algebra, a linear equation in two variables is a straight line. The easiest way to plot the line is to find any two points that satisfy the equation and then draw a straight line through them.

The two easiest points to find are generally the points at which the line intersects the T and C axes.

When Flair Furniture produces no tables—namely, T = 0—it implies that

4102 + 3C = 240 or

3C = 240

or

C = 80

The graphical method works only when there are two decision variables, but it provides valuable insight into how larger problems are structured.

Nonnegativity constraints mean T # 0 and C # 0.

Plotting the first constraint involves finding points at which the line intersects the T and C axes.

Here is a complete mathematical statement of the LP problem.

M07_REND3161_13_AIE_C07.indd 241 27/10/16 2:16 PM

242  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

In other words, if all of the carpentry time available is used to produce chairs, 80 chairs could be made. Thus, this constraint equation crosses the vertical axis at 80.

To find the point at which the line crosses the horizontal axis, we assume that the firm makes no chairs; that is, C = 0. Then

4T + 3102 = 240 or

4T = 240

or

T = 60

Hence, when C = 0, we see that 4T = 240 and that T = 60. The carpentry constraint is illustrated in Figure 7.2. It is bounded by the line running from

point 1T = 0, C = 802 to point 1T = 60, C = 02. Recall, however, that the actual carpentry constraint was the inequality 4T + 3C … 240.

How can we identify all of the solution points that satisfy this constraint? It turns out that there are three possibilities. First, we know that any point that lies on the line 4T + 3C = 240 satis- fies the constraint. Any combination of tables and chairs on the line will use up all 240 hours of carpentry time.2 Now we must find the set of solution points that would use less than the 240 hours. The points that satisfy the 6 portion of the constraint (i.e., 4T + 3C 6 240) will be all the points on one side of the line, while all the points on the other side of the line will not satisfy this condition. To determine which side of the line this is, simply choose any point on either side of the constraint line shown in Figure 7.2 and check to see if it satisfies this condition. For ex- ample, choose the point (30, 20), as illustrated in Figure 7.3:

41302 + 31202 = 180 Since 180 6 240, this point satisfies the constraint, and all points on this side of the line will also satisfy the constraint. This set of points is indicated by the shaded region in Figure 7.3.

To see what would happen if the point did not satisfy the constraint, select a point on the other side of the line, such as (70, 40). This constraint would not be met at this point as

41702 + 31402 = 400

200 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

This Axis Represents the Constraint T Ú 0

This Axis Represents the Constraint C Ú 0

FIGURE 7.1 Quadrant Containing All Positive Values

2Thus, what we have done is to plot the constraint equation in its most binding position—that is, using all of the carpen- try resource.

M07_REND3161_13_AIE_C07.indd 242 27/10/16 2:16 PM

7.3 GRAPHICAL soLUTIon To An LP PRobLEM  243

Since 400 7 240, this point and every other point on that side of the line would not satisfy this constraint. Thus, the solution represented by the point 170, 402 would require more than the 240 hours that are available. There are not enough carpentry hours to produce 70 tables and 40 chairs.

Next, let us identify the solution corresponding to the second constraint, which limits the time available in the painting and varnishing department. That constraint was given as 2T + 1C … 100. As before, we start by graphing the equality portion of this constraint, which is

2T + 1C = 100

To find two points on the line, select T = 0 and solve for C:

2102 + 1C = 100 C = 100

200 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

( T C

( =60, =0)T C

=0, =80)

FIGURE 7.2 Graph of Carpentry Constraint Equation 4T + 3C = 240

200 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

(70, 40)

(30, 20)

FIGURE 7.3 Region That satisfies the Carpentry Constraint

M07_REND3161_13_AIE_C07.indd 243 27/10/16 2:16 PM

244  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

So one point on the line is 10, 1002. To find the second point, select C = 0 and solve for T: 2T + 1102 = 100

T = 50

The second point used to graph the line is (50, 0). Plotting this point, (50, 0), and the other point, (0, 100), results in the line representing all the solutions in which exactly 100 hours of painting and varnishing time are used, as shown in Figure 7.4.

To find the points that require less than 100 hours, select a point on either side of this line to see if the inequality portion of the constraint is satisfied. Selecting (0, 0) gives us

2102 + 1102 = 0 6 100 This indicates that this and all the points below the line satisfy the constraint, and this region is shaded in Figure 7.4.

Now that each individual constraint has been plotted on a graph, it is time to move on to the next step. We recognize that to produce a chair or a table, both the carpentry and the painting and varnishing departments must be used. In an LP problem, we need to find that set of solu- tion points that satisfies all of the constraints simultaneously. Hence, the constraints should be redrawn on one graph (or superimposed one upon the other). This is shown in Figure 7.5.

The shaded region now represents the area of solutions that do not exceed either of the two Flair Furniture constraints. It is known by the term area of feasible solutions or, more sim- ply, the feasible region. The feasible region in an LP problem must satisfy all conditions speci- fied by the problem’s constraints, and is thus the region where all constraints overlap. Any point in the region would be a feasible solution to the Flair Furniture problem; any point outside the shaded area would represent an infeasible solution. Hence, it would be feasible to manufacture 30 tables and 20 chairs 1T = 30, C = 202 during a production period because both constraints are observed:

Carpentry constraint 4T + 3C … 240 hours available 1421302 + 1321202 = 180 hours used ✓

Painting constraint 2T + 1C … 100 hours available 1221302 + 1121202 = 80 hours used ✓ But it would violate both of the constraints to produce 70 tables and 40 chairs, as we see here mathematically:

In LP problems, we are interested in satisfying all constraints at the same time.

The feasible region is the set of points that satisfy all the constraints.

20 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

( =0, =100)CT

( =50, =0)CT

0

FIGURE 7.4 Region That satisfies the Painting and Varnishing Constraint

M07_REND3161_13_AIE_C07.indd 244 27/10/16 2:17 PM

7.3 GRAPHICAL soLUTIon To An LP PRobLEM  245

Carpentry constraint 4T + 3C … 240 hours available

1421702 + 1321402 = 400 hours used ⊗

Painting constraint 2T + 1C … 100 hours available 1221702 + 1121402 = 180 hours used ⊗ Furthermore, it would be infeasible to manufacture 50 tables and 5 chairs 1T = 50, C = 52. Can you see why?

Carpentry constraint 4T + 3C … 240 hours available 1421502 + 132152 = 215 hours used ✓

Painting constraint 2T + 1C … 100 hours available 1221502 + 112152 = 105 hours used ⊗ This possible solution falls within the time available in carpentry but exceeds the time available in painting and varnishing and thus falls outside the feasible region.

Isoprofit Line Solution Method Now that the feasible region has been graphed, we may proceed to find the optimal solution to the problem. The optimal solution is the point lying in the feasible region that produces the high- est profit. Yet there are many, many possible solution points in the region. How do we go about selecting the best one, the one yielding the highest profit?

There are a few different approaches that can be taken in solving for the optimal solution when the feasible region has been established graphically. The speediest one to apply is called the isoprofit line method.

We start the technique by letting profits equal some arbitrary but small dollar amount. For the Flair Furniture problem, we may choose a profit of $2,100. This is a profit level that can be obtained easily without violating either of the two constraints. The objective function can be written as $2,100 = 70T + 50C.

This expression is just the equation of a line; we call it an isoprofit line. It represents all combinations of 1T, C2 that would yield a total profit of $2,100. To plot the profit line, we pro- ceed exactly as we did to plot a constraint line. First, let T = 0 and solve for the point at which the line crosses the C axis:

The isoprofit method is the first method we introduce for finding the optimal solution.

20 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

Feasible Region

Painting/Varnishing Constraint

Carpentry Constraint

0

FIGURE 7.5 Feasible solution Region for the Flair Furniture Company Problem

M07_REND3161_13_AIE_C07.indd 245 27/10/16 2:17 PM

246  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

$2,100 = $70102 = $50C C = 42 chairs

Then, let C = 0 and solve for T:

$2,100 = $70T + 50102 T = 30 tables

Defining the Problem Hewlett Packard (HP) launched HPDirect.com in the late 1990s and opened online sales of HP products including computers, printers, accessories, and supplies. In 2008, the managers of HPDirect.com were told that online sales had to grow 150% in the next three years, and this had to be done without exceeding marketing budgets. To do this, they had to attract more visitors to the site, they had to convert the visitors into customers by targeted marketing efforts, and they had to retain loyal customers by providing a satisfy- ing experience in a cost-efficient manner.

Developing a Model The massive nature of this project required the use of a variety of operations research models to achieve the objectives. Multiple regression was used to identify the key drivers of online visitors, and it was com- bined with time-series models (which identified seasonality and trend) to forecast the number of visits across all Web pages as well as the sales of the large variety of products. Bayesian models and Markov models were used to help predict the likelihood of making a purchase. Linear programming was used to determine which marketing channels to use for different customers and to optimize these decisions.

Acquiring Input Data Data were collected over a two-year period not only on visitors to the website and their behavior but also on sales and marketing activities. The data were separated into two groups: a training set to develop the model and a test set to validate the model.

Developing a Solution The training set of data was used to develop the models that would be used in this project, including the linear programs to optimally allocate the marketing budget.

Testing the Solution The data in the test set were then used to validate the models to make sure that the models were work- ing as planned. When the different parts of the project were implemented, a test group of customers received customized marketing material based on their segment profile, while a control group received generic material.

Analyzing the Results The test group performed better than the control group on all key metrics, including average order size, conversion rate, and total sales per dollar spent on marketing. During one particular period, the conversion rate of the targeted group was 58% higher than for the control group, and dollar sales per marketing item were up 33%.

Implementing the Results At the beginning of each quarter, the models are run to help the marketing team plan efforts for that quarter. The models themselves are refreshed every quarter. Since 2009, the models have been cred- ited with increasing incremental revenue by $117 million, increasing order size, and reducing overall inventory cost.

Source: Based on R. Tandon et al., “Hewlett Packard: Delivering Profitable Growth for HPDirect.com Using Operations Research,” Interfaces 43, 1 (January–February 2013): 48–61, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Increasing sales at Hewlett Packard

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M07_REND3161_13_AIE_C07.indd 246 27/10/16 2:17 PM

7.3 GRAPHICAL soLUTIon To An LP PRobLEM  247

We can now connect these two points with a straight line. This profit line is illustrated in Figure 7.6. All points on the line represent feasible solutions that produce a profit of $2,100.3

Now, obviously, the isoprofit line for $2,100 does not produce the highest possible profit to the firm. In Figure 7.7, we try graphing two more lines, each yielding a higher profit. The middle equation, $2,800 = $70T + $50C, was plotted in the same fashion as the lower line. When T = 0,

$2,800 = $70102 + $50C C = 56

When C = 0,

$2,800 = $70T + $501C2 T = 40

Isoprofit involves graphing parallel profit lines.

20 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

(0,42)

(30,0)

$2,100 = $70 T + $50 C

0

FIGURE 7.6 Profit Line of $2,100 Plotted for the Flair Furniture Company

3Iso means “equal” or “similar.” Thus, an isoprofit line represents a line with all profits the same—in this case, $2,100.

20 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

$2,100 = $70T + $50C

$2,800 = $70T + $50C

$3,500 = $70T + $50C

$4,200 = $70T + $50C

0

FIGURE 7.7 Four Isoprofit Lines Plotted for the Flair Furniture Company

M07_REND3161_13_AIE_C07.indd 247 27/10/16 2:17 PM

248  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Again, any combination of tables (T) and chairs (C) on this isoprofit line produces a total profit of $2,800. Note that the third line generates a profit of $3,500, even more of an improve- ment. The farther we move from the origin, the higher our profit will be. Another important point is that these isoprofit lines are parallel. We now have two clues as to how to find the opti- mal solution to the original problem. We can draw a series of parallel lines (by carefully moving our ruler in a plane parallel to the first profit line). The highest profit line that still touches some point of the feasible region pinpoints the optimal solution. Notice that the fourth line ($4,200) is too high to be considered.

The last point that an isoprofit line would touch in this feasible region is the corner point where the two constraint lines intersect, so this point will result in the maximum possible profit. To find the coordinates of this point, solve the two equations simultaneously (as detailed in the next section). This results in the point (30, 40), as shown in Figure 7.8. Calculating the profit at this point, we get

Profit = 70T + 50C = 701302 + 501402 = $4,100 So producing 30 tables and 40 chairs yields the maximum profit of $4,100.

Corner Point Solution Method A second approach to solving LP problems employs the corner point method. This technique is simpler conceptually than the isoprofit line approach, but it involves looking at the profit at every corner point of the feasible region.

The mathematical theory behind LP states that an optimal solution to any problem (that is, the values of T and C that yield the maximum profit) will lie at a corner point, or extreme point, of the feasible region. Hence, it is necessary to find the values of the variables only at each corner; an optimal solution will lie at one (or more) of them.

The first step in the corner point method is to graph the constraints and find the feasible region. This was also the first step in the isoprofit method, and the feasible region is shown again in Figure 7.9. The second step is to find the corner points of the feasible region. For the Flair Furniture example, the coordinates of three of the corner points are obvious from observing the graph. These are (0, 0), (50, 0), and (0, 80). The fourth corner point is where the two constraint lines intersect, and the coordinates must be found algebraically by solving the two equations simultaneously for two variables.

There are a number of ways to solve equations simultaneously, and any of these may be used. We will illustrate the elimination method here. To begin the elimination method, select a variable to be eliminated. We will select T in this example. Then multiply or divide one equation

We draw a series of parallel isoprofit lines until we find the highest isoprofit line—that is, the one with the optimal solution.

The mathematical theory behind LP is that the optimal solution must lie at one of the corner points in the feasible region.

20 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

$4,100 = $70T + $50C

Maximum Profit Line

Optimal Solution Point ( = 30, = 40)CT

0

FIGURE 7.8 optimal solution to the Flair Furniture Problem

M07_REND3161_13_AIE_C07.indd 248 27/10/16 2:17 PM

7.3 GRAPHICAL soLUTIon To An LP PRobLEM  249

by a number so that the coefficient of that variable (T) in one equation will be the negative of the coefficient of that variable in the other equation. The two constraint equations are

4T + 3C = 240 1carpentry2 2T + 1C = 100 1painting2

To eliminate T, we multiply the second equation by -2:

-212T + 1C = 1002 = -4T - 2C = -200 and then add it to the first equation:

+4T + 3C = 240 + 1C = 40

or

C = 40

Doing this has enabled us to eliminate one variable, T, and to solve for C. We can now substitute 40 for C in either of the original equations and solve for T. Let’s use the first equation. When C = 40, then

4T + 1321402 = 240 4T + 120 = 240

or

4T = 120 T = 30

Thus, the last corner point is (30, 40). The next step is to calculate the value of the objective function at each of the corner points.

The final step is to select the corner with the best value, which would be the highest profit in this example. Table 7.3 lists these corners points with their profits. The highest profit is found to be $4,100, which is obtained when 30 tables and 40 chairs are produced. This is exactly what was obtained using the isoprofit method.

Table 7.4 provides a summary of both the isoprofit method and the corner point method. Ei- ther of these can be used when there are two decision variables. If a problem has more than two

20 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

3

4

1

0

2

20 40 60 80 100 T

20

40

60

N um

be r

of C

ha irs 80

100

C

Number of Tables

0

FIGURE 7.9 Four Corner Points of the Feasible Region

M07_REND3161_13_AIE_C07.indd 249 27/10/16 2:17 PM

250  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

decision variables, we must rely on computer software or use the simplex algorithm discussed in Module 7.

Slack and Surplus In addition to knowing the optimal solution to a linear program, it is helpful to know whether all of the available resources are being used. The term slack is used for the amount of a resource that is not used. For a less-than-or-equal-to constraint,

Slack = 1Amount of resource available2 - 1Amount of resource used2 In the Flair Furniture example, there were 240 hours of carpentry time available. If the com-

pany decided to produce 20 tables and 25 chairs instead of the optimal solution, the amount of carpentry time used 14T + 3C2 would be 41202 + 31252 = 155. So

Slack time in carpentry = 240 - 155 = 85

For the optimal solution 130, 402 to the Flair Furniture problem, the slack is 0, since all 240 hours are used.

The term surplus is used with greater-than-or-equal-to constraints to indicate the amount by which the right-hand side of a constraint is exceeded. For a greater-than-or-equal-to constraint,

Surplus = 1Actual amount2 - 1Minimum amount2 Suppose there had been a constraint in the example that required the total number of tables

and chairs combined to be at least 42 units (i.e., T + C Ú 42) and the company decided to produce 20 tables and 25 chairs. The total amount produced would be 20 + 25 = 45, so the surplus would be

Surplus = 45 - 42 = 3

meaning that 3 units more than the minimum were produced. For the optimal solution (30, 40) in the Flair Furniture problem, if this constraint had been in the problem, the surplus would be 70 - 42 = 28.

The term slack is associated with … constraints.

The term surplus is associated with Ú constraints.

NUMBER OF TABLES (T) NUMBER OF CHAIRS (C) Profit = $70T + $50C

0 0 $0

50 0 $3,500

0 80 $4,000

30 40 $4,100

TABLE 7.3 Feasible Corner Points and Profits for Flair Furniture

ISOPROFIT METHOD

1. Graph all constraints and find the feasible region.

2. Select a specific profit (or cost) line and graph it to find the slope.

3. Move the objective function line in the direction of increasing profit (or decreasing cost), while maintaining the slope. The last point it touches in the feasible region is the optimal solution.

4. Find the values of the decision variables at this last point and compute the profit (or cost).

CORNER POINT METHOD

1. Graph all constraints and find the feasible region.

2. Find the corner points of the feasible region.

3. Compute the profit (or cost) at each of the feasible corner points.

4. Select the corner point with the best value of the objective function found in step 3. This is the optimal solution.

TABLE 7.4 summaries of Graphical solution Methods

M07_REND3161_13_AIE_C07.indd 250 27/10/16 2:17 PM

7.4 soLVInG FLAIR FURnITURE’s LP PRobLEM UsInG QM FoR WIndoWs, EXCEL 2016, And EXCEL QM  251

So the slack and surplus represent the difference between the left-hand side (LHS) and the right-hand side (RHS) of a constraint. The term slack is used when referring to less-than-or- equal-to constraints, and the term surplus is used when referring to greater-than-or-equal-to con- straints. Most computer software for linear programming will provide the amount of slack or surplus that exists for each constraint in the optimal solution.

A constraint that has zero slack or surplus for the optimal solution is called a binding con- straint. A constraint with positive slack or surplus for the optimal solution is called a nonbinding constraint. Some computer outputs will specify whether a constraint is binding or nonbinding.

7.4 Solving Flair Furniture’s LP Problem Using QM for Windows, Excel 2016, and Excel QM

Almost every organization has access to computer programs that are capable of solving enor- mous LP problems. Although each computer program is slightly different, the approach each takes toward handling LP problems is basically the same. The format of the input data and the level of detail provided in output results may differ from program to program and computer to computer, but once you are experienced in dealing with computerized LP algorithms, you can easily adjust to minor changes.

Using QM for Windows Let us begin by demonstrating QM for Windows on the Flair Furniture Company problem. To use QM for Windows, select the Linear Programming module. Then specify the number of con- straints (other than the nonnegativity constraints, as it is assumed that the variables must be non- negative), the number of variables, and whether the objective is to be maximized or minimized. For the Flair Furniture Company problem, there are two constraints and two variables. Once these numbers are specified, the input window opens, as shown in Program 7.1A. Then you can enter the coefficients for the objective function and the constraints. Placing the cursor over X1 and X2 and typing new names, such as T and C, will change the variable names. The constraint names can be similarly modified. Program 7.1B shows the QM for Windows screen after the data have been input and before the problem is solved. When you click the Solve button, you get the output shown in Program 7.1C.

Once the problem has been solved, a graph may be displayed by selecting Window—Graph from the menu bar in QM for Windows. Program 7.1C shows the output for the graphical solu- tion. Notice that in addition to the graph, the corner points and the original problem are shown.

Input the coefficients in the appropriate columns.

The equations will automatically appear as you enter the coefficients in the other columns.

Type over X1 and X2 to change the names of the variables.

PROGRAM 7.1A QM for Windows Linear Programming Input screen

Click Solve after entering the data.

Click here to change the type of constraint.

PROGRAM 7.1B QM for Windows data Input for Flair Furniture Problem

M07_REND3161_13_AIE_C07.indd 251 27/10/16 2:17 PM

252  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Later we return to see additional information related to sensitivity analysis that is provided by QM for Windows.

Using Excel’s Solver Command to Solve LP Problems Excel 2016 (as well as earlier versions) has an add-in called Solver that can be used to solve linear programs. If this add-in doesn’t appear on the Data tab in Excel 2016, it has not been acti- vated. See Appendix F for details on how to activate it.

PREPARING THE SPREADSHEET FOR SOLVER The spreadsheet must be prepared with data and formu- las for certain calculations before Solver can be used. Excel QM can be used to simplify this pro- cess (see Appendix F). We will briefly describe the steps, and further discussion and suggestions will be provided when the Flair Furniture example is presented. Here is a summary of the steps to prepare the spreadsheet:

1. Enter the problem data. The problem data consist of the coefficients of the objective function and the constraints, plus the RHS value for each of the constraints. It is best to organize this in a logical and meaningful way. The coefficients will be used when writing formulas in steps 3 and 4, and the RHS will be entered into Solver.

2. Designate specific cells for the values of the decision variables. Later, these cell addresses will be input into Solver.

3. Write a formula to calculate the value of the objective function, using the coefficients for the objective function (from step 1) that you have entered and the cells containing the values of the decision variables (from step 2). Later, this cell address will be input into Solver.

4. Write a formula to calculate the value of the LHS of each constraint, using the coefficients for the constraints (from step 1) that you have entered and the cells containing the values of the decision variables (from step 2). Later, these cell addresses and the cell addresses for the corresponding RHS values will be input into Solver.

These four steps must be completed in some way with all linear programs in Excel. Additional information may be put into the spreadsheet for clarification purposes. Let’s illustrate these with an example.

The objective function value (profit) is shown here.

Click Window and select Graph to see this graph and corner points.

The values of the variables are shown here.

PROGRAM 7.1C QM for Windows output and Graph for Flair Furniture Problem

M07_REND3161_13_AIE_C07.indd 252 27/10/16 2:17 PM

7.4 soLVInG FLAIR FURnITURE’s LP PRobLEM UsInG QM FoR WIndoWs, EXCEL 2016, And EXCEL QM  253

1. Program 7.2A provides the input data for the Flair Furniture example. You should enter the numbers in the cells shown. The words can be any description that you choose. The “…” symbols are entered for reference only. They are not specifically used by Excel Solver.

2. The cells designated for the values of the variables are B4 for T (tables) and C4 for C (chairs). These cell addresses will be entered into Solver in the By Changing Variables Cells box. Solver will change the values in these cells to find the optimal solution. It is sometimes helpful to enter a 1 in each of these to help identify any obvious errors when the formulas for the objective and the constraints are written.

3. A formula is written in Excel for the objective function (D5), and this is displayed in Program 7.2B. The Sumproduct function is very helpful, although there are other ways to write this. This cell address will be entered into Solver in the Set Objective box.

4. The hours used in carpentry (the LHS of the carpentry constraint) are calculated with the formula in cell D8, while cell D9 calculates the hours used in painting, as illustrated in Program 7.2B. These cells and the cells containing the RHS values will be used when the constraints are entered into Solver.

The problem is now ready for the use of Solver. However, even if the optimal solution is not found, this spreadsheet has benefits. You can enter different values for T and C into cells B4 and C4 just to see how the resource utilization (LHS) and profit change.

USING SOLVER To begin using Solver, go to the Data tab in Excel 2016 and click Solver, as shown in Program 7.2D. If Solver does not appear on the Data tab, see Appendix F for instructions on how to activate this add-in. Once you click Solver, the Solver Parameters dialog box opens, as

The signs for the constraints are entered here for reference only.

These cells are selected to contain the values of the decision variables. Solver will enter the optimal solution here, but you may enter numbers here also.

You can change these values to see how the profit and resource utilization change.

Because there is a 1 in each of these cells, the LHS values can be calculated very easily to see if a mistake has been made.

PROGRAM 7.2A Excel data Input for Flair Furniture Example

PROGRAM 7.2B Formulas for Flair Furniture Example

PROGRAM 7.2C Excel spreadsheet for Flair Furniture Example

M07_REND3161_13_AIE_C07.indd 253 27/10/16 2:17 PM

254  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

shown in Program 7.2E, and the following inputs should be entered, although the order is not important:

1. In the Set Objective box, enter the cell address for the total profit (D5). 2. In the By Changing Variable Cells box, enter the cell addresses for the variable values

(B4:C4). Solver will allow the values in these cells to change while searching for the best value in the Set Objective cell reference.

3. Click Max for a maximization problem and Min for a minimization problem. 4. Check the box for Make Unconstrained Variables Non-Negative, since the variables T and

C must be greater than or equal to zero.

From the Data ribbon, click Solver.

If Solver does not appear on the Data ribbon, it has not been activated. See Appendix F for help.

PROGRAM 7.2D starting solver in Excel 2016

Enter the cell address for the objective function value.

Always select Simplex LP for solution method.

Check this box for nonegative variables.

Click Add to input constraints.

Click Solve after constraints have been added.

Enter the location of the values for the variables.

Specify Max or Min.

PROGRAM 7.2E solver Parameters dialog box

M07_REND3161_13_AIE_C07.indd 254 27/10/16 2:17 PM

7.4 soLVInG FLAIR FURnITURE’s LP PRobLEM UsInG QM FoR WIndoWs, EXCEL 2016, And EXCEL QM  255

5. Click the Select Solving Method button and select Simplex LP from the menu that appears. 6. Click Add to add the constraints. When you do this, the dialog box shown in Program 7.2F

appears. 7. In the Cell Reference box, enter the cell references for the LHS values (D8:D9). Click the

button to open the drop-down menu to select 6 = , which is for … constraints. Then enter the cell references for the RHS values (F8:F9). Since these are all less-than-or-equal-to constraints, they can all be entered at one time by specifying the ranges. If there were other types of constraints, such as Ú constraints, you could click Add after entering these first constraints, and the Add Constraint dialog box would allow you to enter additional constraints. When preparing the spreadsheet for Solver, it is easier if all the … constraints are together and all the Ú constraints are together. After entering all the constraints, click OK. The Add Constraint dialog box closes, and the Solver Parameters dialog box reopens.

8. Click Solve on the Solver Parameters dialog box, and the solution is found. The Solver Results dialog box opens and indicates that a solution was found, as shown in Program 7.2G. In situations where there is no feasible solution, this box will indicate this. Addi- tional information may be obtained from the Reports section of this box, as will be seen later. Program 7.2H shows the results of the spreadsheet with the optimal solution.

Using Excel QM Using the Excel QM add-in can help you easily solve linear programming problems. Not only are all formulas automatically created by Excel QM, but also the spreadsheet is automatically prepared for the use of the Solver add-in. We will illustrate this using the Flair Furniture example.

To begin, from the Excel QM ribbon in Excel 2016, click the Alphabetical menu, and then select Linear, Integer & Mixed Integer Programming from the drop-down menu, as shown in Program 7.3A. The Excel QM Spreadsheet Initialization window opens, and in it, you enter the problem title, the number of variables, and the number of constraints (do

Enter the address for the LHS of the constraints. These may be entered one at a time or all together if they are of the same type (e.g., all < or all >).

Enter the address for the RHS of the constraints.

Click OK when finished. Click button to select the type of constraint relationship.

PROGRAM 7.2F solver Add Constraint dialog box

Additional information is available.

Check this to be sure that a solution was found.

PROGRAM 7.2G solver Results dialog box

M07_REND3161_13_AIE_C07.indd 255 27/10/16 2:17 PM

256  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

not count the nonnegativity constraints). Specify whether the problem is a maximization or minimization problem, and then click OK. When the initialization process is finished, a spreadsheet is prepared for data input, as shown in Program 7.3B. In this worksheet, enter the data in the section labeled Data. Specify the type of constraint (less-than, greater-than, or equal-to), and change the variable names and the constraint names, if desired. You do not have to write any formulas.

Once the data have been entered, from the Data tab, select Solver. The Solver Parameters window opens (refer back to Program 7.2E to see what input is normally required in a typical Solver Parameters window), and you will see that Excel QM has made all the necessary inputs and selections. You do not enter any information, and you simply click Solve to find the solution. The solution is displayed in Program 7.3C.

The optimal solution is T = 30, C = 40, profit = 4,100.

The hours used are given here.

PROGRAM 7.2H Flair Furniture solution Found by solver

From the Excel QM ribbon, click the Alphabetical menu, and then select Linear, Integer, & Mixed Integer Programming from the menu.

When the Initialization window appears, enter the number of variables and the number of constraints, and indicate whether to maximize or minimize.

PROGRAM 7.3A Using Excel QM in Excel 2016 for the Flair Furniture Example

M07_REND3161_13_AIE_C07.indd 256 27/10/16 2:17 PM

7.5 soLVInG MInIMIzATIon PRobLEMs  257

7.5 Solving Minimization Problems

Many LP problems involve minimizing an objective such as cost instead of maximizing a profit function. A restaurant, for example, may wish to develop a work schedule to meet staffing needs while minimizing the total number of employees. A manufacturer may seek to distribute its products from several factories to its many regional warehouses in such a way as to minimize total shipping costs. A hospital may want to provide a daily meal plan for its patients that meets certain nutritional standards while minimizing food purchase costs.

Minimization problems with only two variables can be solved graphically by first set- ting up the feasible solution region and then using either the corner point method or an iso- cost line approach (which is analogous to the isoprofit approach in maximization problems) to find the values of the decision variables (e.g., X1 and X2) that yield the minimum cost. Let’s take a look at a common LP problem referred to as the diet problem. This situation is similar to the one that the hospital faces in feeding its patients at the least cost.

Holiday Meal Turkey Ranch The Holiday Meal Turkey Ranch is considering buying two different brands of turkey feed and blending them to provide a good, low-cost diet for its turkeys. Each feed contains, in varying proportions, some or all of the three nutritional ingredients essential for fattening turkeys. Each pound of brand 1 purchased, for example, contains 5 ounces of ingredient A, 4 ounces of ingre- dient B, and 0.5 ounce of ingredient C. Each pound of brand 2 contains 10 ounces of ingredient A, 3 ounces of ingredient B, but no ingredient C. The brand 1 feed costs the ranch 2 cents a pound, while the brand 2 feed costs 3 cents a pound. The owner of the ranch would like to use LP to determine the lowest-cost diet that meets the minimum monthly intake requirement for each nutritional ingredient.

After entering the problem, click the Data tab, and select Solver from the Data ribbon. When the window for Solver opens, simply click Solve, as all the necessary inputs have been entered by Excel QM.

Enter the data in the appropriate cells. Do not change any other cells in the spreadsheet.

Instructions to access Solver are here.

PROGRAM 7.3B Excel QM data Input for the Flair Furniture Example

Solution is shown here.

PROGRAM 7.3C Excel QM output for the Flair Furniture Example

M07_REND3161_13_AIE_C07.indd 257 27/10/16 2:17 PM

258  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Table 7.5 summarizes the relevant information. If we let

X1 = number of pounds of brand 1 feed purchased X2 = number of pounds of brand 2 feed purchased

then we may proceed to formulate this linear programming problem as follows:

Minimize cost 1in cents2 = 2X1 + 3X2 subject to these constraints:

5X1 + 10X2 Ú 90 ounces 1ingredient A constraint2 4X1 + 3X2 Ú 48 ounces 1ingredient B constraint2

0.5 X1 Ú 1.5 ounces 1ingredient C constraint2 X1 Ú 0 1nonnegativity constraint2 X2 Ú 0 1nonnegativity constraint2

Before solving this problem, we want to be sure to note three features that affect its solu- tion. First, you should be aware that the third constraint implies that the farmer must purchase enough brand 1 feed to meet the minimum standards for the C nutritional ingredient. Buying only brand 2 would not be feasible because it lacks C. Second, as the problem is formulated, we will be solving for the best blend of brands 1 and 2 to buy per turkey per month. If the ranch houses 5,000 turkeys in a given month, it need simply multiply the X1 and X2 quantities by 5,000 to decide how much feed to order overall. Third, we are now dealing with a series of greater- than-or-equal-to constraints. These cause the feasible solution area to be above the constraint lines in this example.

USING THE CORNER POINT METHOD ON A MINIMIZATION PROBLEM To solve the Holiday Meal Turkey Ranch problem, we first construct the feasible solution region. This is done by plotting each of the three constraint equations as in Figure 7.10. Note that the third constraint, 0.5 X1 Ú 1.5, can be rewritten and plotted as X1 Ú 3. (This involves multiplying both sides of the inequality by 2 but does not change the position of the constraint line in any way.) Minimization problems are often unbounded outward (i.e., on the right side and the top), but this causes no difficulty in solv- ing them. As long as they are bounded inward (on the left side and the bottom), corner points may be established. The optimal solution will lie at one of the corners, as it would in a maximi- zation problem.

In this case, there are three corner points: a, b, and c. For point a, we find the coordinates at the intersection of the ingredient C and B constraints—that is, where the line X1 = 3 crosses the line 4X1 + 3X2 = 48. If we substitute X1 = 3 into the B constraint equation, we get

4132 + 3X2 = 48 or

X2 = 12

Thus, point a has the coordinates 1X1 = 3, X2 = 122. To find the coordinates of point b algebraically, we solve the equations 4X1 + 3X2 = 48

and 5X1 + 10X2 = 90 simultaneously. This yields 1X1 = 8.4, X2 = 4.82.

We plot the three constraints to develop a feasible solution region for the minimization problem.

Note that minimization problems often have unbounded feasible regions.

COMPOSITION OF EACH POUND OF FEED (OZ.) MINIMUM MONTHLY

REQUIREMENT PER TURKEY (OZ.)INGREDIENT BRAND 1 FEED BRAND 2 FEED

A 5 10 90

B 4 3 48

C 0.5 0 1.5

Cost per pound 2 cents 3 cents

TABLE 7.5 Holiday Meal Turkey Ranch data

M07_REND3161_13_AIE_C07.indd 258 27/10/16 2:17 PM

7.5 soLVInG MInIMIzATIon PRobLEMs  259

The coordinates at point c are seen by inspection to be 1X1 = 18, X2 = 02. We now evalu- ate the objective function at each corner point, and we get

Cost = 2X1 + 3X2 Cost at point a = 2132 + 31122 = 42 Cost at point b = 218.42 + 314.82 = 31.2 Cost at point c = 21182 + 3102 = 36

Hence, the minimum cost solution is to purchase 8.4 pounds of brand 1 feed and 4.8 pounds of brand 2 feed per turkey per month. This will yield a cost of 31.2 cents per turkey.

5 X1

P ou

nd s

of B

ra nd

2

X2

Pounds of Brand 1

0

5

10

15

20

10 15 20 25

c

Feasible Region

Ingredient C Constraint

Ingredient B Constraint

Ingredient A Constraint

a

b

FIGURE 7.10 Feasible Region for the Holiday Meal Turkey Ranch Problem

nbC Uses Linear, Integer, and Goal Programming in selling Advertising slots

The National Broadcasting Company (NBC) sells over $4 billion in television advertising each year. About 60% to 80% of the air time for an upcoming season is sold in a 2- to 3-week period in late May. The advertising agencies approach the networks to pur- chase advertising time for their clients. Included in each request are the dollar amount, the demographic (e.g., age of the view- ing audience) in which the client is interested, the program mix, weekly weighting, unit-length distribution, and a negotiated cost per 1,000 viewers. NBC must then develop detailed sales plans to meet these requirements. Traditionally, NBC developed these plans manually, and this required several hours per plan. These usually had to be reworked due to the complexity involved. With more than 300 such plans to be developed and reworked in a 2- to 3-week period, this was very time intensive and did not nec- essarily result in the maximum possible revenue.

In 1996, a project in the area of yield management was begun. Through this effort, NBC was able to create plans that more accurately meet customers’ requirements, respond to cus- tomers more quickly, make the most profitable use of its limited inventory of advertising time slots, and reduce rework. The suc- cess of this system led to the development of a full-scale optimi- zation system based on linear, integer, and goal programming. It is estimated that sales revenue between the years 1996 and 2000 increased by over $200 million due largely to this effort. Improve- ments in rework time, sales force productivity, and customer sat- isfaction were also benefits of this system.

Sources: Based on Srinivas Bollapragada et al., “NBC’s Optimization Sys- tems Increase Revenues and Productivity,” Interfaces 32, 1 (January–February 2002): 47–60, © Trevor S. Hale.

IN ACTION

M07_REND3161_13_AIE_C07.indd 259 27/10/16 2:17 PM

260  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

ISOCOST LINE APPROACH As mentioned before, the isocost line approach may also be used to solve LP minimization problems such as that of the Holiday Meal Turkey Ranch. As with isoprofit lines, we need not compute the cost at each corner point but instead draw a series of parallel cost lines. The lowest cost line (i.e., the one closest to the origin) to touch the feasible region provides us with the optimal solution corner.

For example, we start in Figure 7.11 by drawing a 54-cent cost line—namely, 54 = 2X1 + 3X2. Obviously, there are many points in the feasible region that would yield a lower total cost. We proceed to move our isocost line toward the lower left, in a plane parallel to the 54-cent solution line. The last point we touch while still in contact with the feasible region is the same as corner point b of Figure 7.10. It has the coordinates 1X1 = 8.4, X2 = 4.82 and an associated cost of 31.2 cents.

This could be solved using QM for Windows by selecting the Linear Programming Module and selecting New problem. Specify that there are two variables and three con- straints. When the input window opens, enter the data and click Solve. The output is shown in Program 7.4.

To solve this in Excel 2016, determine the cells where the solution will be, enter the coefficients from the objective function and the constraints, and write formulas for the total cost and the total of each ingredient (constraint). The input values and solution are shown in Program 7.5A, with column D containing the formulas. These formulas are shown in Program 7.5B. When the Solver Parameters window opens, the Set Objective cell is D5; the addresses in the By Changing Variable Cells box are B4:C4; the Simplex LP method is

The isocost line method is analogous to the isoprofit line method we used in maximization problems.

5 X1

P ou

nd s

of B

ra nd

2

X2

Pounds of Brand 1

0

5

10

15

20

10 15 20 25

25

30

Feasible Region

54¢ = 2X + 3X Isocost Line

1

2

Direction of Decreasing Cost

31.2¢ = 2X + 3X 1

2

(X = 8.4, X = 4.8)21

FIGURE 7.11 Graphical solution to the Holiday Meal Turkey Ranch Problem Using the Isocost Line

PROGRAM 7.4 solution to the Holiday Meal Turkey Ranch Problem in QM for Windows

M07_REND3161_13_AIE_C07.indd 260 27/10/16 2:17 PM

7.6 FoUR sPECIAL CAsEs In LP  261

used; the box for variables to be nonnegative is checked; and Min is selected because this is a minimization problem.

7.6 Four Special Cases in LP

Four special cases and difficulties arise at times when using the graphical approach to solv- ing LP problems: (1) infeasibility, (2) unboundedness, (3) redundancy, and (4) alternate optimal solutions.

No Feasible Solution When there is no solution to an LP problem that satisfies all of the constraints given, then no feasible solution exists. Graphically, it means that no feasible solution region exists— a situation that might occur if the problem was formulated with conf licting constraints. This, by the way, is a frequent occurrence in real-life, large-scale LP problems that involve hundreds of constraints. For example, if one constraint is supplied by the marketing man- ager, who states that at least 300 tables must be produced (namely, X1 Ú 300) to meet sales demand, and a second restriction is supplied by the production manager, who insists that no more than 220 tables be produced (namely, X1 … 220) because of a lumber short- age, no feasible solution region results. When the operations research analyst coordinating the LP problem points out this conf lict, one manager or the other must revise his or her input. Perhaps more raw materials could be procured from a new source, or perhaps sales demand for that table could be lowered by substituting a different model table to meet customer needs.

As a further graphic illustration of this, let us consider the following three constraints:

X1 + 2X2 … 6 2X1 + X2 … 8

X1 Ú 7

As seen in Figure 7.12, there is no feasible solution region for this LP problem because of the presence of conflicting constraints.

Unboundedness Sometimes a linear program will not have a finite solution. This means that in a maximization problem, for example, one or more solution variables, and the profit, can be made infinitely large without violating any constraints. If we try to solve such a problem graphically, we will note that the feasible region is open ended.

Lack of a feasible solution region can occur if constraints conflict with one another.

When the profit in a maximization problem can be infinitely large, the problem is unbounded and is missing one or more constraints.

Formulas are written to find the values in column D.PROGRAM 7.5A Excel 2016 solution for Holiday Meal Turkey Ranch Problem

PROGRAM 7.5B Excel 2016 Formulas for Holiday Meal Turkey Ranch Problem

M07_REND3161_13_AIE_C07.indd 261 27/10/16 2:17 PM

262  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Let us consider a simple example to illustrate the situation. A firm has formulated the fol- lowing LP problem:

Maximize profit = $3X1 + $5X2 subject to X1 Ú 5 X2 … 10 X1 + 2X2 Ú 10 X1, X2 Ú 0

As you see in Figure 7.13, because this is a maximization problem and the feasible region ex- tends infinitely to the right, there is unboundedness, or an unbounded solution. This implies that the problem has been formulated improperly. It would indeed be wonderful for the company to be able to produce an infinite number of units of X1 (at a profit of $3 each!), but obviously no firm has infinite resources available or infinite product demand.

Redundancy The presence of redundant constraints is another common situation that occurs in large LP for- mulations. Redundancy causes no major difficulties in solving LP problems graphically, but you should be able to identify its occurrence. A redundant constraint is simply one that does

A redundant constraint is one that does not affect the feasible solution region.

Region Satisfying First Two Constraints

2 X1

X2

0

2

4

6

8

4 6 8

Region Satisfying Third Constraint

FIGURE 7.12 A Problem with no Feasible solution

5 X1

X2

0

Feasible Region

10 15

5

10

15

X + 2X $ 101 2

X # 102

X $ 51

FIGURE 7.13 A Feasible Region That Is Unbounded to the Right

M07_REND3161_13_AIE_C07.indd 262 27/10/16 2:17 PM

7.6 FoUR sPECIAL CAsEs In LP  263

not affect the feasible solution region. In other words, other constraints may be more binding or restrictive than the redundant constraint.

Let’s look at the following example of an LP problem with three constraints:

Maximize profit = $1X1 + $2X2 subject to X1 + X2 … 20

2X1 + X2 … 30 X1 … 25

X1, X2 Ú 0

The third constraint, X1 … 25, is less binding, but the first two constraints are indeed more restrictive constraints (see Figure 7.14).

Alternate Optimal Solutions An LP problem may, on occasion, have two or more alternate optimal solutions. Graphically, this is the case when the objective function’s isoprofit or isocost line runs perfectly parallel to one of the problem’s constraints—in other words, when they have the same slope.

Managers of a firm noticed the presence of more than one optimal solution when they formulated this simple LP problem:

Maximize profit = $3X1 + $2X2 subject to 6X1 + 4X2 … 24 X1 … 3

X1, X2 Ú 0

As we see in Figure 7.15, our first isoprofit line of $8 runs parallel to the first constraint equa- tion. At a profit level of $12, the isoprofit line will rest directly on top of the segment of the first constraint line. This means that any point along the line between A and B provides an optimal X1 and X2 combination. Far from causing problems, the existence of more than one optimal solution

Multiple optimal solutions are possible in LP problems.

5 X1

X2

0 10 15

5

10

15

2X +X #301 2

20 25 30

20

25

30

X +X #201 2

X #251 Redundant Constraint

Feasible Region

FIGURE 7.14 Example of a Redundant Constraint

M07_REND3161_13_AIE_C07.indd 263 27/10/16 2:17 PM

264  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

allows managers great flexibility in deciding which combination to select. The profit remains the same at each alternate solution.

7.7 Sensitivity Analysis

Optimal solutions to LP problems have thus far been found under what are called deterministic assumptions. This means that we assume complete certainty in the data and relationships of a problem; namely, prices are fixes, resources are known, and the time needed to produce a unit is exactly set. But in the real world, conditions are dynamic and changing. How can we handle this apparent discrepancy?

One way we can do so is by continuing to treat each particular LP problem as a determin- istic situation. However, when an optimal solution is found, we recognize the importance of seeing just how sensitive that solution is to model assumptions and data. For example, if a firm realizes that profit per unit is not $5 as estimated but instead is closer to $5.50, how will the final solution mix and total profit change? If additional resources, such as 10 labor hours or 3 hours of machine time, should become available, will this change the problem’s answer? Such analyses are used to examine the effects of changes in three areas: (1) contribution rates for each variable, (2) technological coefficients (the numbers in the constraint equations), and (3) avail- able resources (the right-hand-side quantities in each constraint). This task is alternatively called sensitivity analysis, postoptimality analysis, parametric programming, or optimality analysis.

Sensitivity analysis also often involves a series of what-if questions. What if the profit on product 1 increases by 10%? What if less money is available in the advertising budget constraint? What if workers each stay one hour longer every day at 1 ½-time pay to provide increased pro- duction capacity? What if new technology will allow a product to be wired in one-third the time it used to take? So we see that sensitivity analysis can be used to deal not only with errors in esti- mating input parameters to the LP model but also with management’s experiments with possible future changes in the firm that may affect profits.

There are two approaches to determining just how sensitive an optimal solution is to changes. The first is simply a trial-and-error approach. This approach usually involves resolv- ing the entire problem, preferably by computer, each time one input data item or parameter is changed. It can take a long time to test a series of possible changes in this way.

The approach we prefer is the analytic postoptimality method. After an LP problem has been solved, we attempt to determine a range of changes in problem parameters that will not

How sensitive is the optimal solution to changes in profits, resources, or other input parameters?

An important function of sensitivity analysis is to allow managers to experiment with values of the input parameters.

Postoptimality analysis means examining changes after the optimal solution has been reached.

1 0

1

1

Feasible Region

2 3 4 5 6 7 8

2

3

4

5

6

7

8

A

B

Optimal Solution Consists of All Combinations of X and X Along the Segment

2

AB

Isoprofit Line for $8

Isoprofit Line for $12 Overlays Line Segment AB

X1

X2 FIGURE 7.15 Example of Alternate optimal solutions

M07_REND3161_13_AIE_C07.indd 264 27/10/16 2:17 PM

7.7 sEnsITIVITy AnALysIs  265

affect the optimal solution or change the variables in the solution. This is done without resolving the whole problem.

Let’s investigate sensitivity analysis by developing a small production mix problem. Our goal will be to demonstrate graphically and through the simplex tableau how sensitivity analysis can be used to make linear programming concepts more realistic and insightful.

High Note Sound Company The High Note Sound Company manufactures quality speakers and stereo receivers. Each of these products requires a certain amount of skilled artisanship, of which there is a limited weekly supply. The firm formulates the following LP problem in order to determine the best production mix of speakers 1X12 and receivers 1X22:

Maximize profit = $50X1 + $120X2 subject to 2X1 + 4X2 … 80 1hours of electricians> time available2

3X1 + 1X2 … 60 1hours of audio technicians> time available2 X1, X2 Ú 0

The solution to this problem is illustrated graphically in Figure 7.16. Given this information and deterministic assumptions, the firm should produce only stereo receivers (20 of them), for a weekly profit of $2,400.

For the optimal solution, 10, 202, the electrician hours used are 2X1 + 4X2 = 2102 + 41202 = 80

and this equals the amount available, so there is 0 slack for this constraint. Thus, it is a binding constraint. If a constraint is binding, obtaining additional units of that resource will usually re- sult in higher profits. The audio technician hours used for the optimal solution (0, 20) are

3X1 + 1X2 = 3102 + 11202 = 20 but the hours available are 60. Thus, there is a slack of 60 - 20 = 40 hours. Because there are extra hours available that are not being used, this is a nonbinding constraint. For a nonbinding constraint, obtaining additional units of that resource will not result in higher profits and will only increase the slack.

10 20 30 40 50 60

60

40

20

10

0 X 1

X 2

a = (0, 20)

b

Isoprofit Line: $2,400 = 50 + 120

= (16, 12)

X 1 X 2

Optimal Solution at Point a

X 1 = 0 Speakers X 2 = 20 Receivers Profits = $2,400

c = (20, 0)

(Receivers)

(Speakers)

FIGURE 7.16 High note sound Company Graphical solution

M07_REND3161_13_AIE_C07.indd 265 27/10/16 2:17 PM

266  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Changes in the Objective Function Coefficient In real-life problems, contribution rates (usually profit or cost) in the objective functions fluc- tuate periodically, as do most of a firm’s expenses. Graphically, this means that although the feasible solution region remains exactly the same, the slope of the isoprofit or isocost line will change. It is easy to see in Figure 7.17 that the High Note Sound Company’s profit line is opti- mal at point a. But what if a technical breakthrough just occurred that raised the profit per stereo receiver 1X22 from $120 to $150? Is the solution still optimal? The answer is definitely yes, for in this case the slope of the profit line accentuates the profitability at point a. The new profit is $3,000 = 01$502 + 201$1502.

On the other hand, if X2’s profit coefficient was overestimated and should have been only $80, the slope of the profit line changes enough to cause a new corner point (b) to become opti- mal. Here the profit is $1,760 = 161$502 + 121$802.

This example illustrates a very important concept about changes in objective function coef- ficients. We can increase or decrease the objective function coefficient (profit) of any variable, and the current corner point may remain optimal if the change is not too large. However, if we increase or decrease this coefficient too much, then the optimal solution would be at a different corner point. How much can the objective function coefficient change before another corner point becomes optimal? Both QM for Windows and Excel provide the answer.

QM for Windows and Changes in Objective Function Coefficients The QM for Windows input for the High Note Sound Company example is shown in Program 7.6A. When the solution has been found, selecting Window and Ranging allows us to see additional information on sensitivity analysis. Program 7.6B provides the output related to sensitivity analysis.

From Program 7.6B, we see the profit on speakers was $50, which is indicated as the origi- nal value in the output. This objective function coefficient has a lower bound of negative infinity

Changes in contribution rates are examined first.

A new corner point becomes optimal if an objective function coefficient is decreased or increased too much.

The current solution remains optimal unless an objective function coefficient is increased to a value above the upper bound or decreased to a value below the lower bound.

10 20 30 40 50 60

50

40

30

20

10

0 X 1

X 2

Profit Line for $50 + $80 (Passes Through Point b )

X 1

a b

c

X 2

Profit Line for $50 + $120 (Passes Through Point a )

X 1 X 2

Profit Line for $50 + $150 (Passes Through Point a )

X 1 X 2

FIGURE 7.17 Changes in the Receiver Contribution Coefficients

M07_REND3161_13_AIE_C07.indd 266 27/10/16 2:17 PM

7.7 sEnsITIVITy AnALysIs  267

and an upper bound of $60. This means that the current corner point solution remains optimal as long as the profit on speakers does not go above $60. If it equals $60, there would be two optimal solutions, as the objective function would be parallel to the first constraint. The points (0, 20) and (16, 12) would both give a profit of $2,400. The profit on speakers may decrease by any amount, as indicated by the negative infinity, and the optimal corner point does not change. This negative infinity is logical because currently there are no speakers being produced, as the profit is too low. Any decrease in the profit on speakers would make them less attractive relative to the receivers, and we certainly would not produce any speakers because of this.

The profit on receivers has an upper bound of infinity (it may increase by any amount) and a lower bound of $100. If this profit equaled $100, then the corner points (0, 20) and (16, 12) would both be optimal. The profit at each of these would be $2,000.

In general, a change can be made to one (and only one) objective function coefficient, and the current optimal corner point remains optimal as long as the change is between the upper and lower bounds. If two or more coefficients are changed simultaneously, then the problem should be solved with the new coefficients to determine whether or not this current solution remains optimal.

Excel Solver and Changes in Objective Function Coefficients Program 7.7A illustrates how the Excel 2016 spreadsheet for this example is set up for Solver. When Solver is selected from the Data tab, the appropriate inputs are made, and Solve is clicked in the Solver dialog box, the solution and the Solver Results window will appear, as in Program 7.7B. Selecting Sensitivity from the Reports area of this window will provide a sensitivity report on a new worksheet, with results as shown in Program 7.7C. Note how the cells are named based on the text from Program 7.7A. Notice that Excel does not provide lower bounds and upper bounds for the objective function coefficients. Instead, it gives the allowable increases

The upper and lower bounds relate to changing only one coefficient at a time.

PROGRAM 7.6A Input to QM for Windows High note sound Company data

PROGRAM 7.6B High note sound Company sensitivity Analysis output

The Set Objective cell in the Solver dialog box is D5.

The By Changing Variable Cells address in the Solver dialog box is B4:C4.

The constraints added into Solver are D8:D9 <=F8:F9.

PROGRAM 7.7A Excel 2016 spreadsheet for High note sound Company

M07_REND3161_13_AIE_C07.indd 267 27/10/16 2:17 PM

268  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

and decreases for these. By adding the allowable increase to the current value, we may obtain the upper bound. For example, the allowable increase on the profit (objective coefficient) for speakers is 10, which means that the upper bound on this profit is $50 + $10 = $60. Similarly, we may subtract the allowable decrease from the current value to obtain the lower bound.

Changes in the Technological Coefficients Changes in what are called the technological coefficients often reflect changes in the state of technology. If fewer or more resources are needed to produce a product such as a speaker or stereo receiver, coefficients in the constraint equations will change. These changes will have no effect on the objective function of an LP problem, but they can produce a significant change in the shape of the feasible solution region—and hence in the optimal profit or cost.

Figure 7.18 illustrates the original High Note Sound Company graphical solution, as well as two separate changes in technological coefficients. In Figure 7.18(a), we see that the opti- mal solution lies at point a, which represents X1 = 0, X2 = 20. You should be able to prove to yourself that point a remains optimal in Figure 7.18(b) despite a constraint change from 3X1 + 1X2 … 60 to 2X1 + 1X2 … 60. Such a change might take place when the firm discovers that it no longer demands three hours of audio technicians’ time to produce a speaker but only two hours.

In Figure 7.18(c), however, a change in the other constraint changes the shape of the fea- sible region enough to cause a new corner point (g) to become optimal. Before moving on, see

Excel solver gives allowable increases and decreases rather than upper and lower bounds.

Changes in technological coefficients affect the shape of the feasible solution region.

The solution found by Solver is here.

To see the sensitivity analysis report, select Sensitivity in the Solver Results window. Then click OK.

PROGRAM 7.7B Excel 2016 solution and solver Results Window for High note sound Company

The resources used are here. The RHS can change by these amounts and the shadow price will still be relevant.

The names presented in the sensitivity report combine the text in column A and the text above the data unless the cells have been named using the Name Manager from the Formulas tab.

The profit on speakers may change by these amounts and the current corner point will remain optimal.

PROGRAM 7.7C Excel 2016 sensitivity Report for High note sound Company

M07_REND3161_13_AIE_C07.indd 268 27/10/16 2:17 PM

7.7 sEnsITIVITy AnALysIs  269

if you reach an objective function value of $1,954 profit at point g (versus a profit of $1,920 at point f ).4

Changes in the Resources or Right-Hand-Side Values The right-hand-side values of the constraints often represent resources available to the firm. The resources could be labor hours or machine time or perhaps money or production materials avail- able. In the High Note Sound Company example, the two resources are available hours of elec- tricians’ time and hours of audio technicians’ time. If additional hours were available, a higher

X 1

X 2

60

40

20

0 20 40

S te

re o

R ec

ei ve

rs

Speakers

( ) Original Problema

3 + 1 < 60X1 X2 _

a

b

c

2 + 4 < 80X1 X2 _

Optimal Solution

X 1

X 2

60

40

20

0 20 40

( ) Change in Circled Coe�cient b

2 + 1 < 60X 1 X2 _

a d

e

2 + 4 < 80X1 X2 _

Still Optimal

30 X 1

X 2

60

40

20

0 20 40

( ) Change in Circled Coe�cient c

3 + 1X1 X2 _

f g

c

2 + 5 < 80X 1 2 _

Optimal Solution

X 16

< 60

FIGURE 7.18 Change in the Technological Coefficients for the High note sound Company

4Note that the values of X1 and X2 at point g are fractions. Although the High Note Sound Company cannot produce 0.67, 0.75, or 0.90 of a speaker or stereo, we can assume that the firm can begin a unit one week and complete it the next. As long as the production process is fairly stable from week to week, this raises no major problems. If solutions must be whole numbers each period, refer to our discussion of integer programming in Chapter 10 to handle the situation.

swift & Company Uses LP to schedule Production

Based in Greeley, Colorado, Swift & Company has annual sales over $8 billion, with beef and related products making up the vast majority of this. Swift has five processing plants, which han- dle over 6 billion pounds of beef each year. Each head of beef is cut into two sides, which yield the chuck, the brisket, the loins, the ribs, the round, the plate, and the flank. With some cuts in greater demand than others, the customer service representatives (CSRs) try to meet the customers’ demands while providing dis- counts when necessary to clear out some cuts that might be in excess supply. It is important that the CSRs have accurate infor- mation on product availability in close to real time so they can react quickly to changing demand.

With the cost of raw material being as high as 85%, and with a very thin profit margin, it is essential that the company oper- ate efficiently. Swift started a project in March 2001 to develop a mathematical programming model that would optimize the

supply chain. Ten full-time employees worked with four opera- tions research consultants from Aspen Technology on what was called Project Phoenix. At the heart of the final model are 45 inte- grated LP models that enable the company to dynamically sched- ule its operations in real time as orders are received.

With Project Phoenix, not only did profit margins increase, but also the improvements in forecasting, cattle procurement, and manufacturing improved relations with customers and enhanced the reputation of Swift & Company in the market- place. The company is better able to deliver products according to customer specification. While the model cost over $6 million to develop, in the first year of operation, it generated a benefit of $12.7 million.

Sources: Based on Ann Bixby, Brian Downs, and Mike Self, “A Scheduling and Capable-to-Promise Application for Swift & Company,” Interfaces 36, 1 (January–February 2006): 69–86, © Trevor S. Hale.

IN ACTION

M07_REND3161_13_AIE_C07.indd 269 27/10/16 2:17 PM

270  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

total profit could be realized. How much should the company be willing to pay for additional hours? Is it profitable to have some electricians work overtime? Should we be willing to pay for more audio technician time? Sensitivity analysis about these resources will help us answer these questions.

If the right-hand side of a constraint is changed, the feasible region will change (un- less the constraint is redundant), and often the optimal solution will change. In the High Note Sound Company example, there were 80 hours of electrician time available each week, and the maximum possible profit was $2,400. There is no slack for this constraint, so it is a binding constraint. If the available electricians’ hours are increased to 100 hours, the new optimal solution seen in Figure 7.19(a) is (0, 25), and the profit is $3,000. Thus, the extra 20 hours of time resulted in an increase in profit of $600, or $30 per hour. If the hours were decreased to 60 hours, as shown in Figure 7.19(b), the new optimal solution is (0, 15), and the profit is $1,800. Thus, reducing the hours by 20 results in a decrease in profit of $600, or $30 per hour. This $30 per hour change in profit that resulted from a change in the hours available is called the dual price or dual value. The dual price for a constraint is the improvement in the objective function value that results from a one-unit increase in the right-hand side of the constraint.

The dual price of $30 per hour of electrician time tells us we can increase profit if we have more electrician hours. However, there is a limit to this, as there is limited audio techni- cian time. If the total hours of electrician time were 240 hours, the optimal solution would be (0, 60), as shown in Figure 7.19(c), and the profit would be $7,200. Again, this is an increase of $30 profit per hour (the dual price) for each of the 160 hours that were added to the original amount. If the number of hours increased beyond 240, then profit would no longer increase, and the optimal solution would still be (0, 60), as shown in Figure 7.19(c). There would sim- ply be excess (slack) hours of electrician time, and all of the audio technician time would be used. Thus, the dual price is relevant only within limits. Both QM for Windows and Excel Solver provide these limits.

QM for Windows and Changes in Right-Hand-Side Values The QM for Windows sensitivity analysis output was shown in Program 7.6B. The dual value for the electrician hours constraint is given as 30, and the lower bound is zero, while the upper bound is 240. This means that each additional hour of electrician time, up to a total of 240 hours, will increase the maximum possible profit by $30. Similarly, if the avail- able electrician time is decreased, the maximum possible profit will decrease by $30 per hour until the available time is decreased to the lower bound of 0. If the amount of electri- cian time (the right-hand-side value for this constraint) is outside this range (0 to 240), then the dual value is no longer relevant, and the problem should be resolved with the new right- hand-side value.

In Program 7.6B, the dual value for audio technician hours is shown to be $0, and the slack is 40, so it is a nonbinding constraint. There are 40 hours of audio technician time that are not being used despite the fact that they are currently available. If additional hours were made avail- able, they would not increase profit but would simply increase the amount of slack. This dual value of zero is relevant as long as the right-hand side does not go below the lower bound of 20. The upper limit is infinity, indicating that adding more hours would simply increase the amount of slack.

Excel Solver and Changes in Right-Hand-Side Values The sensitivity report from Excel Solver was shown in Program 7.7C. Notice that Solver gives the shadow price instead of the dual price. A shadow price is the change in the objective func- tion value (e.g., profit or cost) that results from a one-unit increase in the right-hand side of a constraint.

Since an improvement in the objective function value in a maximization problem is the same as a positive change (increase), the dual price and the shadow price are exactly the same for maximization problems. For a minimization problem, an improvement in the objective func- tion value is a decrease, which is a negative change. So for minimization problems, the shadow price will be the negative of the dual price.

The value of one additional unit of a scarce resource may be found from the dual price.

Dual prices will change if the amount of the resource (the right-hand side of the constraint) goes above the upper bound or below the lower bound given in the Ranging section of the QM for Windows output.

The shadow price is the same as the dual price in maximization problems.

M07_REND3161_13_AIE_C07.indd 270 27/10/16 2:17 PM

7.7 sEnsITIVITy AnALysIs  271

The allowable increase and allowable decrease for the right-hand side of each con- straint are provided, and the shadow price is relevant for changes within these limits. For the electrician hours, the right-hand-side value of 80 may be increased by 160 (for a total of 240) or decreased by 80 (for a total of 0) and the shadow price will remain relevant. If a change is made that exceeds these limits, then the problem should be resolved to find the impact of the change.

20 40 60

60

40

20

0 X 1

X 2

Constraint Representing 60 Hours of Audio Technicians’ Time Resource

25

50 c

b

a

Changed Constraint Representing 100 Hours of Electricians’ Time Resource

( )a

20 40 60

60

40

20

0 X 1

X 2

Constraint Representing 60 Hours of Audio Technicians’ Time Resource

15

30 c

b

a Changed Constraint Representing 60 Hours of Electricians’ Time Resource

( )b

80 100 12060

20

40

60

40200 X1

X2

Changed Constraint Representing 240 Hours of Electricians’ Time Resource

(c)

Constraint Representing 60 Hours of Audio Technicians’ Time Resource

FIGURE 7.19 Changes in the Electricians’ Time Resource for the High note sound Company

M07_REND3161_13_AIE_C07.indd 271 27/10/16 2:17 PM

272 CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

In this chapter, we introduced a mathematical modeling tech- nique called linear programming (LP). It is used in reaching an optimum solution to problems that have a series of constraints binding the objective. We used both the corner point method and the isoprofit/isocost approach for graphically solving prob- lems with only two decision variables.

The graphical solution approaches of this chapter provide a conceptual basis for tackling larger, more complex problems, some of which are addressed in Chapter 8. To solve real-life LP problems with numerous variables and constraints, we need a solution procedure such as the simplex algorithm, the subject of Module 7. The simplex algorithm is the method that QM for Windows and Excel use to tackle LP problems.

In this chapter, we also presented the important concept of sensitivity analysis. Sometimes referred to as postoptimality analysis, sensitivity analysis is used by management to answer a series of what-if questions about LP model parameters. It also tests just how sensitive the optimal solution is to changes in profit or cost coefficients, technological coefficients, and right- hand-side resources. We explored sensitivity analysis graphi- cally (i.e., for problems with only two decision variables) and with computer output, but to see how to conduct sensitivity algebraically through the simplex algorithm, read Module 7 (located at www.pearsonhighered.com/render).

Summary

Glossary

Alternate Optimal Solution A situation in which more than one optimal solution is possible. It arises when the slope of the objective function is the same as the slope of a constraint.

Binding Constraint A constraint with zero slack or surplus for the optimal solution.

Constraint A restriction on the resources available to a firm (stated in the form of an inequality or an equation).

Corner Point, or Extreme Point A point that lies on one of the corners of the feasible region. This means that it falls at the intersection of two constraint lines.

Corner Point Method The method of finding the optimal solu- tion to an LP problem by testing the profit or cost level at each corner point of the feasible region. The theory of LP states that the optimal solution must lie at one of the corner points.

Decision Variable A variable whose value may be chosen by the decision maker.

Dual Price (value) The improvement in the objective func- tion value that results from a one-unit increase in the right- hand side of that constraint.

Feasible Region The area satisfying all of the problem’s re- source restrictions—that is, the region where all constraints overlap. All possible solutions to the problem lie in the fea- sible region.

Feasible Solution A point lying in the feasible region. Basically, it is any point that satisfies all of the problem’s constraints.

Inequality A mathematical expression containing a greater- than-or-equal-to relation 1Ú2 or a less-than-or-equal-to relation 1…2 used to indicate that the total consumption of a resource must be Ú or … some limiting value.

Infeasible Solution Any point lying outside the feasible re- gion. It violates one or more of the stated constraints.

Isocost Line A straight line representing all combinations of X1 and X2 for a particular cost level.

Isoprofit Line A straight line representing all nonnegative combinations of X1 and X2 for a particular profit level.

Linear Programming (LP) A mathematical technique used to help management decide how to make the most effective use of an organization’s resources.

Mathematical Programming The general category of math- ematical modeling and solution techniques used to allocate resources while optimizing a measurable goal. LP is one type of programming model.

Nonbinding Constraint A constraint with a positive amount of slack or surplus for the optimal solution.

Nonnegativity Constraints A set of constraints that requires each decision variable to be nonnegative; that is, each Xi must be greater than or equal to 0.

Objective Function A mathematical statement of the goal of an organization, stated as an intent to maximize or to minimize some important quantity such as profits or costs.

Product Mix Problem A common LP problem involving a decision as to which products a firm should produce given that it faces limited resources.

Redundancy The presence of one or more constraints that do not affect the feasible solution region.

Sensitivity Analysis The study of how sensitive an optimal solution is to model assumptions and to data changes. It is often referred to as postoptimality analysis.

Shadow Price The increase in the objective function value that results from a one-unit increase in the right-hand side of that constraint.

Slack The difference between the left-hand side and the right-hand side of a less-than-or-equal-to constraint. Often this is the amount of a resource that is not being used.

Surplus The difference between the left-hand side and the right-hand side of a greater-than-or-equal-to constraint. Of- ten this represents the amount by which a minimum quan- tity is exceeded.

Technological Coefficients Coefficients of the variables in the constraint equations. The coefficients represent the amount of resources needed to produce one unit of the variable.

Unboundedness A condition that exists when a solution variable and the profit can be made infinitely large without violating any of the problem’s constraints in a maximiza- tion process.

M07_REND3161_13_AIE_C07.indd 272 27/10/16 2:17 PM

soLVEd PRobLEMs  273

Solved Problems

Solved Problem 7-1 Personal Mini Warehouses is planning to expand its successful Orlando business into Tampa. In doing so, the company must determine how many storage rooms of each size to build. Its objective and con- straints follow:

Maximize monthly earnings = 50X1 + 20X2 subject to 20X1 + 40X2 … 4,000 1advertising budget available2

100X1 + 50X2 … 8,000 1square footage required2 X1 … 60 1rental limit expected2

X1, X2 Ú 0

where

X1 = number of large spaces developed X2 = number of small spaces developed

Solution An evaluation of the five corner points of the accompanying graph indicates that corner point C pro- duces the greatest earnings. Refer to the graph and table.

CORNER POINT VALUES OF X1, X2 OBJECTIVE FUNCTION

VALUE ($)

A (0, 0) 0

B (60, 0) 3,000

C (60, 40) 3,800

D (40, 80) 3,600

E (0, 100) 2,000

20 X1

X2

20

100X + 50X #8,000

40

60

80

100

120

140

160

180

200

40 60 80 100 120 140 160 180 200 220 240

1 2

X # 601

20X + 40X #4,0001 2

E

D

C

A B

Feasible Region

M07_REND3161_13_AIE_C07.indd 273 27/10/16 2:17 PM

274  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Solved Problem 7-2 The solution obtained with QM for Windows for Solved Problem 7-1 is given in the following pro- gram. Use this to answer the following questions.

a. For the optimal solution, how much of the advertising budget is spent? b. For the optimal solution, how much square footage will be used? c. Would the solution change if the budget were only $3,000 instead of $4,000? d. What would the optimal solution be if the profit on the large spaces were reduced from $50 to $45? e. How much would earnings increase if the square footage requirement were increased from 8,000

to 9,000?

Solution a. In the optimal solution, X1 = 60 and X2 = 40. Using these values in the first constraint gives us

20X1 + 40X2 = 201602 + 401402 = 2,800 Another way to find this is by looking at the slack:

Slack for constraint 1 = 1,200, so the amount used is 4,000 - 1,200 = 2,800

b. For the second constraint, we have

100X1 + 50X2 = 1001602 + 501402 = 8,000 square feet Instead of computing this, you may simply observe that the slack is 0, so all of the 8,000 square

feet will be used. c. No, the solution would not change. The dual price is 0, and there is slack available. The value

3,000 is between the lower bound of 2,800 and the upper bound of infinity. Only the slack for this constraint would change.

d. Since the new coefficient for X1 is between the lower bound (40) and the upper bound (infinity), the current corner point remains optimal. So X1 = 60 and X2 = 40, and only the monthly earn- ings change.

Earnings = 451602 + 201402 = $3,500

e. The dual price for this constraint is 0.4, and the upper bound is 9,500. The increase of 1,000 units will result in an increase in earnings of 1,00010.4 per unit2 = $400.

M07_REND3161_13_AIE_C07.indd 274 27/10/16 2:17 PM

soLVEd PRobLEMs  275

Solved Problem 7-3 Solve the following LP formulation graphically, using the isocost line approach:

Minimize costs = 24X1 + 28X2 subject to 5X1 + 4X2 … 2,000

X1 Ú 80 X1 + X2 Ú 300

X2 Ú 100 X1, X2 Ú 0

Solution A graph of the four constraints follows. The arrows indicate the direction of feasibility for each con- straint. The next graph illustrates the feasible solution region and plots of two possible objective function cost lines. The first, $10,000, was selected arbitrarily as a starting point. To find the optimal corner point, we need to move the cost line in the direction of lower cost—that is, down and to the left. The last point where a cost line touches the feasible region as it moves toward the origin is corner point D. Thus D, which represents X1 = 200, X2 = 100, and a cost of $7,600, is optimal.

80 X1

X2

100

5X + 4X #2,0001 2

X + X $3001 2

0 100 200 300 400 500

200

300

400

500 X $ 801

X $ 1002

X1

X2

100

100 200 300 400 500

200

300

400

500

A

B

D C

Feasible Region

1

Optimal Cost Line $7,600 = 24X + 28X 2

1$10,000 = 24X + 28X 2

Optimal Solution

M07_REND3161_13_AIE_C07.indd 275 27/10/16 2:17 PM

276  CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Solved Problem 7-4 Solve the following problem, using the corner point method. For the optimal solution, how much slack or surplus is there for each?

Maximize profit = 30X1 + 40X2 subject to 4X1 + 2X2 … 16 2X1 - X2 Ú 2 X2 … 2 X1, X2 Ú 0

Solution The graph appears next with the feasible region shaded.

CORNER POINT COORDINATES PROFIT ($)

A X1 = 1, X2 = 0 30 B X1 = 4, X2 = 0 120 C X1 = 3, X2 = 2 170 D X1 = 2, X2 = 2 140

The optimal solution is (3, 2). For this point, 4X1 + 2X2 = 4132 + 2122 = 16

Therefore, slack = 0 for constraint 1. Also, 2X1 - 1X2 = 2132 - 1122 = 4 7 2

Therefore, surplus = 4 - 2 = 2 for constraint 2. Also, X2 = 2

Therefore, slack = 0 for constraint 3.

X2

4

3

2

1

0

–1

–2

1 2 3 4 5 X1

4X1 1 2X2 # 16

X2 # 2

A B

CD

Feasible Region

8

7

6

5

2X1 – X2 $ 2

The optimal profit of $170 is at corner point C.

M07_REND3161_13_AIE_C07.indd 276 27/10/16 2:17 PM

sELF-TEsT  277

1. When using a graphical solution procedure, the region bounded by the set of constraints is called a. the solution. b. the feasible region. c. the infeasible region. d. maximum profit region. e. none of the above.

2. In an LP problem, at least one corner point must be an optimal solution if an optimal solution exists. a. True b. False

3. An LP problem has a bounded feasible region. If this problem has an equality 1=2 constraint, then a. this must be a minimization problem. b. the feasible region must consist of a line segment. c. the problem must be degenerate. d. the problem must have more than one optimal solution.

4. Which of the following would cause a change in the feasible region? a. Increasing an objective function coefficient in a

maximization problem b. Adding a redundant constraint c. Changing the right-hand side of a nonredundant

constraint d. Increasing an objective function coefficient in

a minimization problem 5. If a nonredundant constraint is removed from an LP

problem, then a. the feasible region will get larger. b. the feasible region will get smaller. c. the problem would become nonlinear. d. the problem would become infeasible.

6. In the optimal solution to a linear program, there are 20 units of slack for a constraint. From this, we know that a. the dual price for this constraint is 20. b. the dual price for this constraint is 0. c. this constraint must be redundant. d. the problem must be a maximization problem.

7. A linear program has been solved, and sensitivity analysis has been performed. The ranges for the objective function coefficients have been found. For the profit on X1, the upper bound is 80, the lower bound is 60, and the current value is 75. Which of the following must be true if the profit on this variable is lowered to 70 and the optimal solution is found? a. A new corner point will become optimal. b. The maximum possible total profit may increase. c. The values for all the decision variables will remain

the same. d. All of the above are possible.

8. A graphical method should only be used to solve an LP problem when a. there are only two constraints. b. there are more than two constraints. c. there are only two variables. d. there are more than two variables.

9. In LP, variables do not have to be integer valued and may take on any fractional value. This assumption is called a. proportionality. b. divisibility. c. additivity. d. certainty.

10. In solving a linear program, no feasible solution exists. To resolve this problem, we might a. add another variable. b. add another constraint. c. remove or relax a constraint. d. try a different computer program.

11. If the feasible region gets larger due to a change in one of the constraints, the optimal value of the objective function a. must increase or remain the same for a maximization

problem. b. must decrease or remain the same for a maximization

problem. c. must increase or remain the same for a minimization

problem. d. cannot change.

12. When alternate optimal solutions exist in an LP problem, then a. the objective function will be parallel to one of the

constraints. b. one of the constraints will be redundant. c. two constraints will be parallel. d. the problem will also be unbounded.

13. If a linear program is unbounded, the problem probably has not been formulated correctly. Which of the following would most likely cause this? a. A constraint was inadvertently omitted. b. An unnecessary constraint was added to the problem. c. The objective function coefficients are too large. d. The objective function coefficients are too small.

14. A feasible solution to an LP problem a. must satisfy all of the problem’s constraints

simultaneously. b. need not satisfy all of the constraints, only some of

them. c. must be a corner point of the feasible region. d. must give the maximum possible profit.

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

M07_REND3161_13_AIE_C07.indd 277 27/10/16 2:17 PM

278 CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Discussion Questions 7-1 Discuss the similarities and differences between

minimization and maximization problems using the graphical solution approaches of LP.

7-2 It is important to understand the assumptions un- derlying the use of any quantitative analysis model. What are the assumptions and requirements for an LP model to be formulated and used?

7-3 It has been said that each LP problem that has a feasible region has an infinite number of solutions. Explain.

7-4 You have just formulated a maximization LP prob- lem and are preparing to solve it graphically. What criteria should you consider in deciding whether it would be easier to solve the problem by the corner point method or the isoprofit line approach?

7-5 Under what condition is it possible for an LP prob- lem to have more than one optimal solution?

7-6 Develop your own set of constraint equations and inequalities, and use them to illustrate graphically each of the following conditions:

(a) an unbounded problem (b) an infeasible problem (c) a problem containing redundant constraints

7-7 The production manager of a large Cincinnati manufacturing firm once made the statement, “I would like to use LP, but it’s a technique that oper- ates under conditions of certainty. My plant doesn’t have that certainty; it’s a world of uncertainty. So LP can’t be used here.” Do you think this statement has any merit? Explain why the manager may have said it.

7-8 The mathematical relationships that follow were formulated by an operations research analyst at the Smith–Lawton Chemical Company. Which ones are invalid for use in an LP problem, and why?

Maximize profit = 4X1 + 3X1X2 + 8X2 + 5X3 subject to 2X1 + X2 + 2X3 … 50 X1 - 4X2 Ú 6 1.5X1

2 + 6X2 + 3X3 Ú 21 19X2 - 0.35X3 = 17 5X1 + 4X2 + 32X3 … 80 -X1 - X2 + X3 = 5

7-9 Discuss the role of sensitivity analysis in LP. Under what circumstances is it needed, and under what conditions do you think it is not necessary?

7-10 A linear program has the objective of maximiz- ing profit = 12X + 8Y. The maximum profit is $8,000. Using a computer, we find the upper bound for profit on X is 20 and the lower bound is 9. Dis- cuss the changes to the optimal solution (the values of the variables and the profit) that would occur if the profit on X were increased to $15. How would the optimal solution change if the profit on X were increased to $25?

7-11 A linear program has a maximum profit of $600. One constraint in this problem is 4X + 2Y … 80. Using a computer, we find the dual price for this constraint is 3, and there is a lower bound of 75 and an upper bound of 100. Explain what this means.

7-12 Develop your own original LP problem with two constraints and two real variables.

(a) Explain the meaning of the numbers on the right- hand side of each of your constraints.

(b) Explain the significance of the technological coefficients.

(c) Solve your problem graphically to find the opti- mal solution.

(d) Illustrate graphically the effect of increasing the contribution rate of your first variable 1X12 by 50% over the value you first assigned it. Does this change the optimal solution?

7-13 Explain how a change in a technological coefficient can affect a problem’s optimal solution. How can a change in resource availability affect a solution?

Problems 7-14 The Electrocomp Corporation manufactures two

electrical products: air conditioners and large fans. The assembly process for each is similar in that both require a certain amount of wiring and drilling. Each air conditioner takes 3 hours of wiring and 2 hours of drilling. Each fan must go through 2 hours of wiring and 1 hour of drilling. During the next production period, 240 hours of wiring time are available, and up to 140 hours of drilling time may be used. Each air conditioner sold yields a profit of $25. Each fan assembled may be sold for a $15 profit. Formulate and solve this LP production mix situation to find the best combination of air conditioners and fans that yields the highest profit. Use the corner point graphical approach.

7-15 Electrocomp’s management realizes that it forgot to include two critical constraints (see Problem 7-14). In particular, management decides that there should be a minimum number of air conditioners produced

Discussion Questions and Problems

Note: means the problem may be solved with QM for Windows; means the problem may be

solved with Excel; and means the problem may be solved with QM for Windows and/or Excel.

M07_REND3161_13_AIE_C07.indd 278 27/10/16 2:17 PM

dIsCUssIon QUEsTIons And PRobLEMs  279

in order to fulfill a contract. Also, due to an oversup- ply of fans in the preceding period, a limit should be placed on the total number of fans produced.

(a) If Electrocomp decides that at least 20 air con- ditioners should be produced but no more than 80 fans should be produced, what would be the optimal solution? How much slack or surplus is there for each of the four constraints?

(b) If Electrocomp decides that at least 30 air con- ditioners should be produced but no more than 50 fans should be produced, what would be the optimal solution? How much slack or surplus is there for each of the four constraints at the opti- mal solution?

7-16 A candidate for mayor in a small town has allocated $40,000 for last-minute advertising in the days pre- ceding the election. Two types of ads will be used: radio and television. Each radio ad costs $200 and reaches an estimated 3,000 people. Each television ad costs $500 and reaches an estimated 7,000 peo- ple. In planning the advertising campaign, the cam- paign manager would like to reach as many people as possible, but she has stipulated that at least 10 ads of each type must be used. Also, the number of radio ads must be at least as great as the number of tele- vision ads. How many ads of each type should be used? How many people will this reach?

7-17 The Outdoor Furniture Corporation manufactures two products, benches and picnic tables, for use in yards and parks. The firm has two main resources: its carpenters (labor force) and a supply of redwood for use in the furniture. During the next production cycle, 1,200 hours of labor are available under a union agreement. The firm also has a stock of 3,500 board feet of good-quality redwood. Each bench that Outdoor Furniture produces requires 4 labor hours and 10 board feet of redwood; each picnic table takes 6 labor hours and 35 board feet of redwood. Completed benches will yield a profit of $9 each, and tables will result in a profit of $20 each. How many benches and tables should Outdoor Furniture produce to obtain the largest possible profit? Use the graphical LP approach.

7-18 The dean of the Western College of Business must plan the school’s course offerings for the fall semes- ter. Student demands make it necessary to offer at least 30 undergraduate and 20 graduate courses in the term. Faculty contracts also dictate that at least 60 courses be offered in total. Each undergradu- ate course taught costs the college an average of $2,500 in faculty wages, and each graduate course costs $3,000. How many undergraduate and gradu- ate courses should be taught in the fall so that total faculty salaries are kept to a minimum?

7-19 MSA Computer Corporation manufactures two models of smartphones, the Alpha 4 and the

Beta 5. The firm employs five technicians, work- ing 160 hours each per month, on its assembly line. Management insists that full employment (i.e., all 160 hours of time) be maintained for each worker during next month’s operations. It requires 20 labor hours to assemble each Alpha 4 computer and 25 labor hours to assemble each Beta 5 model. MSA wants to see at least 10 Alpha 4s and at least 15 Beta 5s produced during the production period. Alpha 4s generate $1,200 profit per unit, and Beta 5s yield $1,800 each. Determine the most profitable number of each model of smartphone to produce during the coming month.

7-20 A winner of the Texas Lotto has decided to invest $50,000 per year in the stock market. Under con- sideration are stocks for a petrochemical firm and a public utility. Although a long-range goal is to get the highest possible return, some consideration is given to the risk involved with the stocks. A risk in- dex on a scale of 1–10 (with 10 being the most risky) is assigned to each of the two stocks. The total risk of the portfolio is found by multiplying the risk of each stock by the dollars invested in that stock.

The following table provides a summary of the return and risk:

STOCK ESTIMATED RETURN RISK INDEX

Petrochemical 12% 9

Utility 6% 4

The investor would like to maximize the return on the investment, but the average risk index of the in- vestment should not be higher than 6. How much should be invested in each stock? What is the aver- age risk for this investment? What is the estimated return for this investment?

7-21 Referring to the Texas Lotto situation in Problem 7-20, suppose the investor has changed his attitude about the investment and wishes to give greater em- phasis to the risk of the investment. Now the inves- tor wishes to minimize the risk of the investment as long as a return of at least 8% is generated. Formu- late this as an LP problem, and find the optimal solu- tion. How much should be invested in each stock? What is the average risk for this investment? What is the estimated return for this investment?

7-22 Solve the following LP problem using the corner point graphical method. At the optimal solution, cal- culate the slack for each constraint:

Maximize profit = 4X + 4Y subject to 3X + 5Y … 150

X - 2Y … 10 5X + 3Y … 150

X, Y Ú 0

M07_REND3161_13_AIE_C07.indd 279 27/10/16 2:17 PM

280 CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

7-23 Consider this LP formulation:

Minimize cost = $X + 2Y subject to X + 3Y Ú 90

8 X + 2Y Ú 160 3 X + 2Y Ú 120

Y … 70 X, Y Ú 0

Graphically illustrate the feasible region, and apply the isocost line procedure to indicate which corner point produces the optimal solution. What is the cost of this solution?

7-24 The stock brokerage firm of Blank, Leibowitz, and Weinberger has analyzed and recommended two stocks to an investors’ club of college pro- fessors. The professors were interested in factors such as short-term growth, intermediate growth, and dividend rates. The data for each stock are as follows:

STOCK ($)

FACTOR LOUISIANA GAS

AND POWER

TRIMEX INSULATION

COMPANY

Short-term growth potential, per dollar invested

0.36 0.24

Intermediate growth potential (over next three years), per dollar invested

1.67 1.50

Dividend rate potential

4% 8%

Each member of the club has an investment goal of (1) an appreciation of no less than $720 in the short term, (2) an appreciation of at least $5,000 in the next three years, and (3) a dividend income of at least $200 per year. What is the smallest investment that a professor can make to meet these three goals?

7-25 Woofer Pet Foods produces a low-calorie dog food for overweight dogs. This product is made from beef products and grain. Each pound of beef costs $0.90, and each pound of grain costs $0.60. A pound of the dog food must contain at least 9 units of Vitamin 1 and 10 units of Vitamin 2. A pound of beef contains 10 units of Vitamin 1 and 12 units of Vitamin 2. A pound of grain contains 6 units of Vitamin 1 and 9 units of Vitamin 2. Formulate this as an LP problem to minimize the cost of the dog food. How many pounds of beef and grain should be included in each pound of dog food? What are the cost and vitamin content of the final product?

7-26 The seasonal yield of olives in a Piraeus, Greece, vineyard is greatly inf luenced by a process of branch pruning. If olive trees are pruned every two weeks, output is increased. The pruning process, however, requires considerably more labor than per- mitting the olives to grow on their own and results in a smaller size olive. It also permits olive trees to be spaced closer together. The yield of 1 barrel of olives by pruning requires 5 hours of labor and 1 acre of land. The production of a barrel of olives by the nor- mal process requires only 2 labor hours but takes 2 acres of land. An olive grower has 250 hours of labor available and a total of 150 acres for growing. Be- cause of the olive size difference, a barrel of olives produced on pruned trees sells for $20, whereas a barrel of regular olives has a market price of $30. The grower has determined that because of uncertain demand, no more than 40 barrels of pruned olives should be produced. Use graphical LP to find

(a) the maximum possible profit. (b) the best combination of barrels of pruned and

regular olives. (c) the number of acres that the olive grower should

devote to each growing process. 7-27 Consider the following four LP formulations. Using

a graphical approach, determine

(a) which formulation has more than one optimal solution.

(b) which formulation is unbounded. (c) which formulation has no feasible solution. (d) which formulation is correct as is.

Formulation 1 Formulation 3

Maximize 10X1 + 10X2 Maximize 3X1 + 2X2 subject to 2X1 … 10 subject to X1 + X2 Ú 5

2X1 + 4X2 … 16 X1 Ú 2 4X2 … 8 2X2 Ú 8

X1 = 6 Formulation 2 Formulation 4

Maximize X1 + 2X2 Maximize 3X1 + 3X2 subject to X1 … 1 subject to 4X1 + 6X2 … 48

2X2 … 2 4X1 + 2X2 … 12 X1 + 2X2 … 2 3X2 Ú 3

2X1 Ú 2

7-28 Graph the following LP problem and indicate the optimal solution point:

Maximize profit = $3X + $2Y subject to 2X + Y … 150

2X + 3Y … 300

(a) Does the optimal solution change if the profit per unit of X changes to $4.50?

(b) What happens if the profit function should have been $3X + $3Y?

M07_REND3161_13_AIE_C07.indd 280 27/10/16 2:17 PM

dIsCUssIon QUEsTIons And PRobLEMs  281

7-29 Graphically analyze the following problem:

Maximize profit = $4X + $6Y subject to X + 2Y … 8 hours

6X + 4Y … 24 hours

(a) What is the optimal solution? (b) If the first constraint is altered to X + 3Y … 8,

does the feasible region or optimal solution change?

7-30 Examine the LP formulation in Problem 7-29. The problem’s second constraint reads

6X + 4Y … 24 hours 1time available on machine 22 If the firm decides that 36 hours of time can be made

available on machine 2 (namely, an additional 12 hours) at an additional cost of $10, should it add the hours?

7-31 Consider the following LP problem:

Maximize profit = 5X + 6 Y subject to 2X + Y … 120

2X + 3Y … 240 X, Y Ú 0

(a) What is the optimal solution to this problem? Solve it graphically.

(b) If a technical breakthrough occurred that raised the profit per unit of X to $8, would this affect the optimal solution?

(c) Instead of an increase in the profit coefficient X to $8, suppose that profit was overestimated and should only have been $3. Does this change the optimal solution?

7-32 Consider the LP formulation given in Problem 7-31. If the second constraint is changed from 2X + 3Y … 240 to 2X + 4Y … 240, what effect will this have on the optimal solution?

7-33 The computer output given below is for Problem 7-31. Use this to answer the following questions.

(a) How much could the profit on X increase or de- crease without changing the values of X and Y in the optimal solution?

(b) If the right-hand side of constraint 1 were in- creased by 1 unit, how much would the profit increase?

(c) If the right-hand side of constraint 1 were in- creased by 10 units, how much would the profit increase?

7-34 The computer output on the next page is for a prod- uct mix problem in which there are two products and three resource constraints. Use the output to help you answer the following questions. Assume that you wish to maximize profit in each case.

(a) How many units of product 1 and product 2 should be produced?

(b) How much of each of the three resources is be- ing used? How much slack is there for each con- straint? Which of the constraints are binding, and which are nonbinding?

(c) What are the dual prices for each resource? (d) If you could obtain more of one of the resources,

which one should you obtain? How much should you be willing to pay for this?

(e) What would happen to profit if, with the origi- nal output, management decided to produce one more unit of product 2?

7-35 Graphically solve the following problem:

Maximize profit = 8X1 + 5X2 subject to X1 + X2 … 10

X1 … 6 X1, X2 Ú 0

(a) What is the optimal solution? (b) Change the right-hand side of constraint 1 to 11

(instead of 10), and resolve the problem. How much did the profit increase as a result of this?

M07_REND3161_13_AIE_C07.indd 281 27/10/16 2:17 PM

282 CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

(c) Change the right-hand side of constraint 1 to 6 (instead of 10), and resolve the problem. How much did the profit decrease as a result of this? Looking at the graph, what would happen if the right-hand-side value were to go below 6?

(d) Change the right-hand-side value of constraint 1 to 5 (instead of 10), and resolve the problem. How much did the profit decrease from the origi- nal profit as a result of this?

(e) Using the computer output on this page, what is the dual price of constraint 1? What is the lower bound on this?

(f) What conclusions can you draw from this re- garding the bounds of the right-hand-side values and the dual price?

7-36 Serendipity5

The three princes of Serendip Went on a little trip. They could not carry too much weight; More than 300 pounds made them hesitate. They planned to the ounce. When they returned to Ceylon They discovered that their supplies were just about gone When, what to their joy, Prince William found A pile of coconuts on the ground. “Each will bring 60 rupees,” said Prince Richard

with a grin As he almost tripped over a lion skin. “Look out!” cried Prince Robert with glee

5The word serendipity was coined by the English writer Horace Walpole after a fairy tale titled The Three Princes of Serendip. Source of problem is unknown.

M07_REND3161_13_AIE_C07.indd 282 27/10/16 2:17 PM

dIsCUssIon QUEsTIons And PRobLEMs  283

As he spied some more lion skins under a tree. “These are worth even more—300 rupees each If we can just carry them all down to the beach.” Each skin weighed fifteen pounds and each coconut,

five, But they carried them all and made it alive. The boat back to the island was very small 15 cubic feet baggage capacity—that was all. Each lion skin took up one cubic foot While eight coconuts the same space took. With everything stowed they headed to sea And on the way calculated what their new wealth

might be. “Eureka!” cried Prince Robert, “Our worth is so

great That there’s no other way we could return in this

state. Any other skins or nut that we might have brought Would now have us poorer. And now I know what— I’ll write my friend Horace in England, for surely Only he can appreciate our serendipity.” Formulate and solve Serendipity by graphical LP in

order to calculate “what their new wealth might be.” 7-37 Bhavika Investments, a group of financial advi-

sors and retirement planners, has been requested to provide advice on how to invest $200,000 for one of its clients. The client has stipulated that the money must be put into either a stock fund or a money market fund and the annual return should be at least $14,000. Other conditions related to risk have also been specified, and the following linear

program was developed to help with this invest- ment decision:

Minimize risk = 12S + 5M subject to

S + M = 200,000 total investment is $200,000

0.10S + 0.05M Ú 14,000 return must be at least $14,000

M Ú 40,000 at least 40,000 must be in money market fund

S, M Ú 0

where S = dollars invested in stock fund M = dollars invested in money market fund

The QM for Windows output is shown below.

(a) How much money should be invested in the money market fund and the stock fund? What is the total risk?

(b) What is the total return? What rate of return is this?

(c) Would the solution change if the risk measure for each dollar in the stock fund were 14 instead of 12?

(d) For each additional dollar that is available, how much does the risk change?

(e) Would the solution change if the amount that must be invested in the money market fund were changed from $40,000 to $50,000?

7-38 Refer to the Bhavika Investments (Problem 7-37) situation once again. It has been decided that, rather than minimizing risk, the objective should be to maximize return while placing a restriction on

M07_REND3161_13_AIE_C07.indd 283 27/10/16 2:17 PM

284 CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

the amount of risk. The average risk should be no more than 11 (with a total risk of 2,200,000 for the $200,000 invested). The linear program was refor- mulated, and the QM for Windows output is shown above.

(a) How much money should be invested in the money market fund and the stock fund? What is the total return? What rate of return is this?

(b) What is the total risk? What is the average risk? (c) Would the solution change if the return for each

dollar in the stock fund were 0.09 instead of 0.10?

(d) For each additional dollar that is available, what is the marginal rate of return?

(e) How much would the total return change if the amount that must be invested in the money mar- ket fund were changed from $40,000 to $50,000? Problems 7-39 to 7-42 test your ability to for-

mulate LP problems that have more than two vari- ables. They cannot be solved graphically but will give you a chance to set up a larger problem.

7-39 The Feed ’N Ship Ranch fattens cattle for local farmers and ships them to meat markets in Kansas City and Omaha. The owners of the ranch seek to determine the amounts of cattle feed to buy so that minimum nutritional standards are satisfied and at the same time total feed costs are minimized. The feed mix can be made up of the three grains that contain the following ingredients per pound of feed:

FEED (OZ.)

INGREDIENT STOCK X STOCK Y STOCK Z

A 3 2 4

B 2 3 1

C 1 0 2

D 6 8 4

The cost per pound of stocks X, Y, and Z is $2, $4, and $2.50, respectively. The minimum requirement per cow per month is 4 pounds of ingredient A, 5 pounds of ingredient B, 1 pound of ingredient C, and 8 pounds of ingredient D.

The ranch faces one additional restriction: it can obtain only 500 pounds of stock Z per month from the feed supplier, regardless of its need. Be- cause there are usually 100 cows at the Feed ’N Ship Ranch at any given time, this means that no more than 5 pounds of stock Z can be counted on for use in the feed of each cow per month.

(a) Formulate this as an LP problem. (b) Solve using LP software.

7-40 The Weinberger Electronics Corporation manu- factures four highly technical products that it supplies to aerospace firms that hold NASA con- tracts. Each of the products must pass through the following departments before being shipped: wir- ing, drilling, assembly, and inspection. The time requirement in hours for each unit produced and its corresponding profit value are summarized in the following table:

DEPARTMENT

PRODUCT WIRING DRILLING ASSEMBLY INSPECTION

UNIT PROFIT

($)

XJ201 0.5 0.3 0.2 0.5 9

XM897 1.5 1 4 1 12

TR29 1.5 2 1 0.5 15

BR788 1 3 2 0.5 11

The production available in each department each month and the minimum monthly production require- ment to fulfill contracts are as follows:

M07_REND3161_13_AIE_C07.indd 284 27/10/16 2:17 PM

dIsCUssIon QUEsTIons And PRobLEMs  285

DEPARTMENT CAPACITY (HOURS) PRODUCT

MINIMUM PRODUCTION

LEVEL

Wiring 15,000 XJ201 150

Drilling 17,000 XM897 100

Assembly 26,000 TR29 300

Inspection 12,000 BR788 400

The production manager has the responsibility of specifying production levels for each product for the coming month. Help him by formulating (that is, setting up the constraints and objective function) Weinberger’s problem using LP.

7-41 Outdoor Inn, a camping equipment manufacturer in southern Utah, is developing a production schedule for a popular type of tent, the Double Inn. Orders have been received for 180 of these to be delivered at the end of this month, 220 to be delivered at the end of next month, and 240 to be delivered at the end of the month after that. This tent may be pro- duced at a cost of $120, and the maximum number of tents that can be produced in a month is 230. The company may produce some extra tents in one month and keep them in storage until the next month. The cost for keeping these in inventory for one month is estimated to be $6 per tent for each tent left at the end of the month. Formulate this as an LP problem to minimize cost while meeting demand and not exceeding the monthly production capacity. Solve it using any computer software. (Hint: Define variables to represent the number of tents left over at the end of each month.)

7-42 Outdoor Inn (see Problem 7-41) expanded its tent- making operations later in the year. While still mak- ing the Double Inn tent, it is also making a larger tent, the Family Rolls, which has four rooms. The company can produce up to a combined total of 280 tents per month. The following table provides the demand that must be met and the production costs for the next three months. Note that the costs will increase in month 2. The holding cost for keeping a tent in inventory at the end of the month for use in the next month is estimated to be $6 per tent for the Double Inn and $8 per tent for the Family Rolls. Develop a linear program to minimize the total cost. Solve it using any computer software.

MONTH

DEMAND FOR

DOUBLE INN

COST TO PRODUCE DOUBLE

INN

DEMAND FOR

FAMILY ROLLS

COST TO PRODUCE

FAMILY ROLLS

1 185 $120 60 $150

2 205 $130 70 $160

3 225 $130 65 $160

7-43 Modem Corporation of America (MCA) is the world’s largest producer of modem communica- tion devices. MCA sold 9,000 of the regular model and 10,400 of the smart (“intelligent”) model this September. Its income statement for the month is shown in the Table for Problem 7-43. Costs pre- sented are typical of prior months and are expected to remain at the same levels in the near future.

The firm is facing several constraints as it pre- pares its November production plan. First, it has ex- perienced a tremendous demand and has been unable to keep any significant inventory in stock. This situ- ation is not expected to change. Second, the firm is located in a small Iowa town from which additional labor is not readily available. Workers can be shifted from production of one modem to another, however. To produce the 9,000 regular modems in September required 5,000 direct labor hours. The 10,400 intel- ligent modems absorbed 10,400 direct labor hours.

Third, MCA is experiencing a problem affecting the intelligent modems model. Its component supplier is able to guarantee only 8,000 microprocessors for November delivery. Each intelligent modem requires one of these specially made microprocessors. Alter- native suppliers are not available on short notice.

TABLE FOR PROBLEM 7-43 MCA Income Statement for the Month Ended September 30

REGULAR MODEMS

INTELLIGENT MODEMS

Sales $450,000 $640,000

Less: Discounts 10,000 15,000

Returns 12,000 9,500

Warranty replacements 4,000 2,500

Net sales $424,000 $613,000

Sales costs

Direct labor 60,000 76,800

Indirect labor 9,000 11,520

Materials cost 90,000 128,000

Depreciation 40,000 50,800

Cost of sales $199,000 $267,120

Gross profit $225,000 $345,880

Selling and general expenses

General expenses —variable

30,000 35,000

General expenses —fixed

36,000 40,000

Advertising 28,000 25,000

Sales commissions 31,000 60,000

Total operating cost $125,000 $160,000

Pretax income $100,000 $185,880

Income taxes (25%) 25,000 46,470

Net income $ 75,000 $139,410

M07_REND3161_13_AIE_C07.indd 285 27/10/16 2:17 PM

286 CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

MCA wants to plan the optimal mix of the two modem models to produce in November to maxi- mize profits for MCA.

(a) Formulate, using September’s data, MCA’s prob- lem as a linear program.

(b) Solve the problem graphically. (c) Discuss the implications of your recommended

solution. 7-44 Working with chemists at Virginia Tech and George

Washington Universities, landscape contractor Kenneth Golding blended his own fertilizer, called “Golding-Grow.” It consists of four chemical com- pounds: C-30, C-92, D-21, and E-11. The cost per pound for each compound is indicated as follows:

CHEMICAL COMPOUND COST PER POUND ($)

C-30 0.12

C-92 0.09

D-21 0.11

E-11 0.04

The specifications for Golding-Grow are as follows: (1) E-11 must constitute at least 15% of the blend; (2) C-92 and C-30 must together constitute at least 45% of the blend; (3) D-21 and C-92 can together consti- tute no more than 30% of the blend; and (4) Golding- Grow is packaged and sold in 50-pound bags.

(a) Formulate an LP problem to determine what blend of the four chemicals will allow Golding

to minimize the cost of a 50-pound bag of the fertilizer.

(b) Solve using a computer to find the best solution.

7-45 Raptor Fuels produces three grades of gasoline— Regular, Premium, and Super. All of these are pro- duced by blending two types of crude oil—Crude A and Crude B. The two types of crude contain specific ingredients that help in determining the octane rating of gasoline. The important ingredi- ents and the costs are contained in the following table:

CRUDE A CRUDE B

Cost per gallon $0.42 $0.47

Ingredient 1 40% 52%

Other ingredients 60% 48%

In order to achieve the desired octane ratings, at least 41% of Regular gasoline should be ingredient 1; at least 44% of Premium gasoline must be ingre- dient 1, and at least 48% of Super gasoline must be Ingredient 1. Due to current contract commitments, Raptor Fuels must produce as least 20,000 gallons of Regular, at least 15,000 gallons of Premium, and at least 10,000 gallons of Super. Formulate a linear program that could be used to determine how much of Crude A and Crude B should be used in each of the gasolines to meet the demands at the minimum cost. What is the minimum cost? How much of Crude A and Crude B are used in each gallon of the different types of gasoline?

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 7-46 to 7-50.

Internet Homework Problems

Case Study

Mexicana Wire Winding, Inc.

Ron Garcia felt good about his first week as a management trainee at Mexicana Wire Winding, Inc. He had not yet devel- oped any technical knowledge about the manufacturing pro- cess, but he had toured the entire facility, located in the suburbs of Mexico City, and had met many people in various areas of the operation.

Mexicana, a subsidiary of Westover Wire Works, a Texas firm, is a medium-sized producer of wire windings used in mak- ing electrical transformers. José Arroyo, the production control manager, described the windings to Garcia as being of stan- dardized design. Garcia’s tour of the plant, laid out by process type (see Figure 7.20), followed the manufacturing sequence for the windings: drawing, extrusion, winding, inspection, and

packaging. After inspection, good product is packaged and sent to finished product storage; defective product is stored sepa- rately until it can be reworked.

On March 8, Vivian Espania, Mexicana’s general manager, stopped by Garcia’s office and asked him to attend a staff meet- ing at 1:00 p.m.

“Let’s get started with the business at hand,” Vivian said, opening the meeting. “You all have met Ron Garcia, our new management trainee. Ron studied operations management in his MBA program in southern California, so I think he is competent to help us with a problem we have been discussing for a long time without resolution. I’m sure that each of you on my staff will give Ron your full cooperation.”

M07_REND3161_13_AIE_C07.indd 286 27/10/16 2:17 PM

dIsCUssIon QUEsTIons And PRobLEMs  287

Vivian turned to José Arroyo, the production manager. “José, why don’t you describe the problem we are facing?”

“Well,” José said, “business is very good right now. We are booking more orders than we can fill. We will have some new equipment on line within the next several months, which will take care of our capacity problems, but that won’t help us in April. I have located some retired employees who used to work in the drawing department, and I am planning to bring them in as temporary employees in April to increase capacity there. Be- cause we are planning to refinance some of our long-term debt, Vivian wants our profits to look as good as possible in April. I’m having a hard time figuring out which orders to run and which to back order so that I can make the bottom line look as good as possible. Can you help me with this?”

Garcia was surprised and apprehensive to receive such an important, high-profile assignment so early in his career. Re- covering quickly, he said, “Give me your data and let me work with it for a day or two.”

April Orders

Product W0075C 1,400 units

Product W0033C 250 units

Product W0005X 1,510 units

Product W0007X 1,116 units

Note: Vivian Espania has given her word to a key customer that we will manufacture 600 units of product W0007X and 150 units of product W0075C for him during April.

Standard Cost

PRODUCT MATERIAL LABOR OVERHEAD SELLING

PRICE

W0075C $33.00 $ 9.90 $23.10 $100.00

W0033C 25.00 7.50 17.50 80.00

W0005X 35.00 10.50 24.50 130.00

W0007X 75.00 11.25 63.75 175.00

Plant Capacity (Hours)

DRAWING EXTRUSION WINDING PACKAGING

4,000 4,200 2,000 2,300

Note: Inspection capacity is not a problem; we can work overtime, as necessary, to accommodate any schedule.

Bill of Labor (Hours/Unit)

PRODUCT DRAWING EXTRUSION WINDING PACKAGING

W0075C 1.0 1.0 1.0 1.0

W0033C 2.0 1.0 3.0 0.0

W0005X 0.0 4.0 0.0 3.0

W0007X 1.0 1.0 0.0 2.0

Discussion Questions 1. What recommendations should Ron Garcia make, with

what justification? Provide a detailed analysis with charts, graphs, and computer printouts included.

2. Discuss the need for temporary workers in the drawing department.

3. Discuss the plant layout.

Source: Professor Victor E. Sower, Sam Houston State University. This case material is based on an actual situation, with names and data altered for confidentiality. Reprinted with permission.

O�ce Wire Drawing

Extrusion

Winding

Packaging

Inspection

Receiving and Raw Material Storage

Finished Product Storage

Rework Department

Rejected Product Storage

FIGURE 7.20 Mexicana Wire Winding, Inc. (Source: Trevor S. Hale)

Selected Operating Data

Average output per month = 2,400 units Average machine utilization = 63%

Average percentage of production sent to rework department = 5% (mostly from winding department)

Average no. of rejected units awaiting rework = 850 (mostly from winding department)

M07_REND3161_13_AIE_C07.indd 287 27/10/16 2:17 PM

288 CHAPTER 7 • LInEAR PRoGRAMMInG ModELs: GRAPHICAL And CoMPUTER METHods

Bibliography

See our Internet home page, at www.pearsonhighered.com/render, for this additional case study: Agri Chem Corporation. This case involves a company’s response to an energy shortage.

Internet Case Studies

Bassamboo, Achal, J. Michael Harrison, and Assaf Zeevi. “Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method,” Operations Research 54, 3 (May–June 2006): 419–435.

Behjat, Laleh, Anthony Vannelli, and William Rosehart. “Integer Linear Pro- gramming Model for Global Routing,” INFORMS Journal on Computing 18, 2 (Spring 2006): 137–150.

Bixby, Robert E. “Solving Real-World Linear Programs: A Decade and More of Progress,” Operations Research 50, 1 (January–February 2002): 3–15.

Bodington, C. E., and T. E. Baker. “A History of Mathematical Program- ming in the Petroleum Industry,” Interfaces 20, 4 (July–August 1990): 117–132.

Boros, E., L. Fedzhora, P. B. Kantor, K. Saeger, and P. Stroud. “A Large-Scale Linear Programming Model for Finding Optimal Container Inspection Strategies,” Naval Research Logistics 56, 5 (August 2009): 404–420.

Chakravarti, N. “Tea Company Steeped in OR,” OR/MS Today 27, 2 (April 2000): 32–34.

Ching, Wai-Ki, Wai-On Yuen, Michael K. Ng, and Shu-Qin Zhang. “A Linear Programming Approach for Determining Optimal Advertising Policy,” IMA Journal of Management Mathematics 17, 1 (2006): 83–96.

Dantzig, George B. “Linear Programming Under Uncertainty,” Management Science 50, 12 (December 2004): 1764–1769.

Degbotse, Alfred, Brian T. Denton, Kenneth Fordyce, R. John Milne, Robert Orzell, and Chi-Tai Wang. “IBM Blends Heuristics and Optimization to Plan Its Semiconductor Supply Chain,” Interfaces 43 (March–April 2013): 130–141.

Gass, Saul I. “The First Linear-Programming Shoppe,” Operations Research 50, 1 (January–February 2002): 61–68.

Greenberg, H. J. “How to Analyze the Results of Linear Programs—Part 1: Preliminaries,” Interfaces 23, 4 (July–August 1993): 56–68.

Greenberg, H. J. “How to Analyze the Results of Linear Programs—Part 3: Infeasibility Diagnosis,” Interfaces 23, 6 (November–December 1993): 120–139.

Hafizoğlu, A. B., and M. Azizoğlu. “Linear Programming Based Approaches for the Discrete Time/Cost Trade Off Problem in Project Networks,” Journal of the Operational Research Society 61 (April 2010): 676–685.

Higle, Julia L., and Stein W. Wallace. “Sensitivity Analysis and Uncertainty in Linear Programming,” Interfaces 33, 4 (July–August 2003): 53–60.

Marszalkowski, Jakub, and Drozdowski Maciej. “Optimization of Column Width in Website Layout for Advertisement Fit,” European Journal of Operational Research 226, 3 (May 2013): 592–601.

Murphy, Frederic H. “ASP, the Art and Science of Practice: Elements of a Theory of the Practice of Operations Research: Expertise in Practice,” Interfaces 35, 4 (July–August 2005): 313–322.

Orden, A. “LP from the ’40s to the ’90s,” Interfaces 23, 5 (September– October 1993): 2–12.

Pazour, Jennifer A., and Lucas C. Neubert. “Routing and Scheduling of Cross-Town Drayage Operations at J.B. Hunt Transport,” Interfaces 43, (March–April 2013): 117–129.

Romeijn, H. Edwin, Ravindra K. Ahuja, James F. Dempsey, and Arvind Kumar. “A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems,” Operations Research 54, 2 (March–April 2006): 201–216.

Rubin, D. S., and H. M. Wagner. “Shadow Prices: Tips and Traps for Managers and Instructors,” Interfaces 20, 4 (July–August 1990): 150–157.

Wendell, Richard E. “Tolerance Sensitivity and Optimality Bounds in Linear Programming,” Management Science 50, 6 (June 2004): 797–803.

M07_REND3161_13_AIE_C07.indd 288 27/10/16 2:17 PM

 289

Linear Programming Applications

8 CHAPTER

T he graphical method of linear programming (LP) discussed in Chapter 7 is useful for un-derstanding how to formulate and solve small LP problems. The purpose of this chapter is to go one step further and show how a large number of real-life problems can be mod- eled using LP. We do this by presenting examples of models in the areas of marketing research, media selection, production mix, labor scheduling, production scheduling, ingredient mix, and financial portfolio selection. We will solve many of these LP problems using Excel’s Solver and QM for Windows.

Although some of these models are relatively small numerically, the principles developed here are definitely applicable to larger problems. Moreover, this practice in “paraphrasing” LP model formulations should help you to develop skill in applying the technique to other, less common applications.

8.1 Marketing Applications

Media Selection Linear programming models have been used in the advertising field as a decision aid in selecting an effective media mix. Sometimes the technique is employed in allocating a fixed or limited budget across various media, which might include radio or television commercials, newspaper ads, direct mailings, social media, and so on. In other applications, the objective is the maxi- mization of audience exposure. Restrictions on the allowable media mix might arise through contract requirements, limited media availability, or company policy. An example follows.

Media selection problems can be approached with LP from two perspectives. The objective can be to maximize audience exposure or to minimize advertising costs.

8.4 Formulate and solve LP problems with Excel Solver in finance.

8.5 Formulate and solve LP problems with Excel Solver in the blending of ingredients.

8.6 Formulate and solve LP problems with Excel Solver in revenue management.

8.1 Formulate and solve LP problems with Excel Solver in marketing.

8.2 Formulate and solve LP problems with Excel Solver in production.

8.3 Formulate and solve LP problems with Excel Solver in the scheduling of employees.

After completing this chapter, students will be able to:

LEARNING OBJECTIVES

M08_REND3161_13_AIE_C08.indd 289 27/10/16 2:31 PM

290   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

The Win Big Gambling Club promotes gambling junkets from a large midwestern city to casinos in the Bahamas. The club has budgeted up to $8,000 per week for local advertis- ing. The money is to be allocated among four promotional media: TV spots, newspaper ads, and two types of radio advertisements. Win Big’s goal is to reach the largest possible high- potential audience through the various media. The following table presents the number of potential gamblers reached by making use of an advertisement in each of the four media. It also provides the cost per advertisement placed and the maximum number of ads that can be purchased per week.

MEDIUM AUDIENCE

REACHED PER AD COST PER

AD ($) MAXIMUM

ADS PER WEEK

TV sport (1 minute) 5,000 800 12

Daily newspaper (full-page ad) 8,500 925 5

Radio spot (30 seconds, prime time) 2,400 290 25

Radio spot (1 minute, afternoon) 2,800 380 20

Win Big’s contractual arrangements require that at least five radio spots be placed each week. To ensure a broad-scoped promotional campaign, management also insists that no more than $1,800 be spent on radio advertising every week.

In formulating this as an LP problem, the first step is to completely understand the problem. Sometimes asking what-if questions will help understand the situation. In this example, what would happen if exactly five ads of each type were used? What would the ads cost? How many people would they reach? Certainly the use of a spreadsheet for the calculations can help with this, since formulas can be written to calculate the cost and the number of people reached. Once the situation is understood, the objective and the constraints are stated:

Objective:

Maximize number of people 1audience2 reached Constraints:

(1) No more than 12 TV ads can be used. (2) No more than 5 newspaper ads can be used. (3) No more than 25 of the 30-second radio ads can be used. (4) No more than 20 of the 1-minute radio ads can be used. (5) Total amount spent cannot exceed $8,000. (6) Total number of radio ads must be at least 5. (7) Total amount spent on radio ads must not exceed $1,800.

Next, define the decision variables. The decisions being made here involve the number of ads of each type to use. Once these are known, they can be used to calculate the amount spent and the number of people reached. Let

X1 = number of 1@minute TV spots taken each week X2 = number of full@page daily newspaper ads taken each week X3 = number of 30@second prime@time radio spots taken each week X4 = number of 1@minute afternoon radio spots taken each week

Next, using these variables, write the mathematical expression for the objective and the con- straints that were identified. The nonnegativity constraints are also explicitly stated.

Objective:

Maximize audience coverage = 5,000X1 + 8,500X2 + 2,400X3 + 2,800X4 subject to X1 … 12 1maximum TV spots>week2

X2 … 5 1maximum newspaper ads>week2 X3 … 25 1maximum 30@second radio spots>week2

M08_REND3161_13_AIE_C08.indd 290 27/10/16 2:31 PM

8.1 mARkETing APPLiCATionS  291

X4 … 20 1maximum 1@minute radio spots>week2 800X1 + 925X2 + 290X3 + 380X4 … $8,000 1weekly advertising budget2

X3 + X4 Ú 5 1minimum radio spots contracted2 290X3 + 380X4 … $1,800 1maximum dollars spent on radio2

X1, X2, X3, X4 Ú 0

The solution to this can be found using Excel’s Solver. Program 8.1 gives the inputs to the Solver Parameter dialog box, the formula that must be written in the cell for the objective function value, and the cells where this formula should be copied. The results are shown in the spread- sheet. This solution is

X1 = 1.97 TV spots X2 = 5 newspaper ads X3 = 6.2 30@second radio spots X4 = 0 1@minute radio spots

This produces an audience exposure of 67,240 contacts. Because X1 and X3 are fractional, Win Big would probably round them to 2 and 6, respectively. Problems that require all-integer solutions (e.g., one can’t exactly buy 1.97 TVs or 6.2 radio spots) are discussed in detail in Chapter 10.

Marketing Research Linear programming has also been applied to marketing research problems and the area of con- sumer research. The next example illustrates how statistical pollsters can reach strategy deci- sions with LP.

Management Sciences Associates (MSA) is a marketing and computer research firm based in Washington, D.C., that handles consumer surveys. One of its clients is a national press service that periodically conducts political polls on issues of widespread interest. In a survey for the press service, MSA determines that it must fulfill several requirements in order to draw statisti- cally valid conclusions on the sensitive issue of new U.S. immigration laws:

PROGRAM 8.1 Win Big Solution in Excel 2016

SOLVER PARAMETER INPUTS AND SELECTIONS KEY FORMULAS Set Objective: F6

Copy F6 to F9:F15

By Changing cells: B5:E5

To: Max

Subject to the Constraints:

F9:F14 <= H9:H14

F15 >= H15

Solving Method: Simplex LP

Make Variables Non-Negative

M08_REND3161_13_AIE_C08.indd 291 27/10/16 2:31 PM

292   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

1. Survey at least 2,300 U.S. households in total. 2. Survey at least 1,000 households whose heads are 30 years of age or younger. 3. Survey at least 600 households whose heads are between 31 and 50 years of age. 4. Ensure that at least 15% of those surveyed live in a state that borders on Mexico. 5. Ensure that no more than 20% of those surveyed who are 51 years of age or over live in a

state that borders on Mexico.

MSA decides that all surveys should be conducted in person. It estimates that the costs of reaching people in each age and region category are as follows:

COST PER PERSON SURVEYED ($)

REGION AGE " 30 AGE 31–50 AGE # 51

State bordering Mexico $7.50 $6.80 $5.50

State not bordering Mexico $6.90 $7.25 $6.10

MSA would like to meet the five sampling requirements at the least possible cost. In formulating this as an LP, the objective is to minimize cost. The five requirements about

the number of people to be sampled with specific characteristics result in five constraints. The decision variables come from the decisions that must be made, which involve the number of people sampled from each of the two regions in each of the three age categories. Thus, the six variables are

X1 = number surveyed who are 30 or younger and live in a border state X2 = number surveyed who are 31–50 and live in a border state X3 = number surveyed who are 51 or older and live in a border state X4 = number surveyed who are 30 or younger and do not live in a border state X5 = number surveyed who are 31–50 and do not live in a border state X6 = number surveyed who are 51 or older and do not live in a border state

Objective function:

Minimize total interview costs = $7.50X1 + $6.80X2 + $5.50X3 + $6.90X4 + $7.25X5 + $6.10X6

subject to

X1 + X2 + X3 + X4 + X5 + X6 Ú 2,300 1total households2 X1 + X4 Ú 1,000 1households age 30 or younger2

X2 + X5 Ú 600 1households are 31950 2 X1 + X2 + X3 Ú 0.151X1 + X2 + X3 + X4 + X5 + X62 1border states) X3 … 0.21X3 + X62 1limit on households age 51and older that live in border states2 X1, X2, X3, X4, X5, X6 Ú 0

The computer solution to MSA’s problem costs $15,166 and is presented in the following table and in Program 8.2, which presents the input and output from Excel 2016. Note that the vari- ables in the constraints are moved to the left-hand side of the inequality.

REGION AGE " 30 AGE 31–50 AGE # 51

State bordering Mexico 0 600 140

State not bordering Mexico 1,000 0 560

M08_REND3161_13_AIE_C08.indd 292 27/10/16 2:31 PM

8.2 mAnuFACTuRing APPLiCATionS  293

8.2 Manufacturing Applications

Production Mix A fertile field for the use of LP is in planning for the optimal mix of products to manufacture. A company must meet a myriad of constraints, ranging from financial concerns to sales demand to material contracts to union labor demands. Its primary goal is to generate the largest profit possible.

Fifth Avenue Industries, a nationally known manufacturer of menswear, produces four vari- eties of ties. One is an expensive, all-silk tie; one is an all-polyester tie; one is a combination of polyester and cotton; and one is a combination of silk and cotton. The following table illustrates the cost and availability (per monthly production planning period) of the three materials used in the production process:

MATERIAL COST PER YARD ($)

MATERIAL AVAILABLE PER MONTH (YARDS)

Silk 24 1,200

Polyester 6 3,000

Cotton 9 1,600

The firm has fixed contracts with several major department store chains to supply ties. The con- tracts require that Fifth Avenue Industries supply a minimum quantity of each tie but allow for a larger demand if Fifth Avenue chooses to meet that demand. (Most of the ties are not shipped with the name Fifth Avenue on their label, incidentally, but with “private stock” labels supplied by the stores.) Table 8.1 summarizes the contract demand for each of the four styles of ties, the selling price per tie, and the fabric requirements of each variety. Fifth Avenue’s goal is to maxi- mize its monthly profit. It must decide upon a policy for product mix.

In formulating this problem, the objective is to maximize profit. There are three constraints (one for each material) indicating that the amount of silk, polyester, and cotton cannot exceed the amount that is available. There are four constraints (one for each type of tie) that specify that the

PROGRAM 8.2 mSA Solution in Excel 2016

Solver Parameter Inputs and Selections Key Formulas Set Objective: H5

Copy H5 to H8:H12

By Changing cells: B4:G4

To: Min

Subject to the Constraints:

H8:H11 <= J8:J11

H12 >= J12

Solving Method: Simplex LP

Make Variables Non-Negative

M08_REND3161_13_AIE_C08.indd 293 27/10/16 2:31 PM

294   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

number of all-silk ties, all-polyester ties, poly–cotton ties, and silk–cotton ties produced must be at least the minimum contract amount. There are four more constraints (one for each type of tie) that indicate that the number of each of these ties produced cannot exceed the monthly demand. The variables are defined as

X1 = number of all@silk ties produced per month X2 = number of all@polyester ties X3 = number of poly9cotton combination ties X4 = number of silk9cotton combination ties

But first the firm must establish the profit per tie:

1. Each all-silk tie 1X12 requires 0.125 yard of silk, at a cost of $24.00 per yard. Therefore, the material cost per tie is $3.00. The selling price is $19.24, leaving a net profit of $16.24 per silk tie.

2. Each all-polyester tie 1X22 requires 0.08 yard of polyester, at a cost of $6 per yard. There- fore, the material cost per tie is $0.48. The selling price is $8.70, leaving a net profit of $8.22 per polyester tie.

3. Each poly–cotton (combination) tie 1X32 requires 0.05 yard of polyester, at a cost of $6 per yard, and 0.05 yard of cotton, at $9 per yard, for a cost of $0.30 + $0.45 = $0.75 per tie. The selling price is $9.52, leaving a net profit of $8.77 per poly–cotton tie.

4. Performing similar calculations will show that each silk–cotton (combination) tie 1X42 has a material cost per tie of $1.98 and a profit of $8.66.

The objective function may now be stated as

Maximize profit = $16.24X1 + $8.22X2 + $8.77X3 + $8.66X4 subject to 0.125X1 + 0.066X4 … 1,200 1yards of silk2

0.08X2 + 0.05X3 … 3,000 1yards of polyester2 0.05X3 + 0.044X4 … 1,600 1yards of cotton2

X1 Ú 5,000 1contract minimum for all@silk2 X1 … 7,000 1contract maximum2 X2 Ú 10,000 1contract minimum for all@polyester2 X2 … 14,000 1contract maximum2 X3 Ú 13,000 1contract minimum for poly9cotton combination2 X3 … 16,000 1contract maximum2 X4 Ú 5,000 1contract minimum for silk9cotton combination2 X4 … 8,500 1contract maximum2

X1, X2, X3, X4 Ú 0

Using Excel and its Solver command, the computer-generated solution is to produce 5,112 all- silk ties each month; 14,000 all-polyester ties; 16,000 poly–cotton combination ties; and 8,500 silk–cotton combination ties. This produces a profit of $412,028 per production period. See Program 8.3 for details.

TABLE 8.1 Data for Fifth Avenue industries

VARIETY OF TIE

SELLING PRICE PER

TIE ($)

MONTHLY CONTRACT MINIMUM

MONTHLY DEMAND

MATERIAL REQUIRED PER

TIE (YARDS) MATERIAL

REQUIREMENTS

All-silk 19.24 5,000 7,000 0.125 100% silk

All-polyester 8.70 10,000 14,000 0.08 100% polyester

Poly–cotton combination 9.52 13,000 16,000 0.10 50% polyester–50% cotton

Silk–cotton combination 10.64 5,000 8,500 0.11 60% silk–40% cotton

M08_REND3161_13_AIE_C08.indd 294 27/10/16 2:31 PM

8.2 mAnuFACTuRing APPLiCATionS  295

PROGRAM 8.3 Fifth Avenue Solution in Excel 2016

MODEL JANUARY FEBRUARY MARCH APRIL

GM3A 800 700 1,000 1,100

GM3B 1,000 1,200 1,400 1,400

TABLE 8.2 Four-month order Schedule for Electrical motors

Solver Parameter Inputs and Selections Key Formulas Set Objective: F6

Copy F6 to F9:F19

By Changing cells: B5:E5

To: Max

Subject to the Constraints:

F9:F15 <= H9:H15

F16:F19 >= H16:H19

Solving Method: Simplex LP

  Make Variables Non-Negative

Production Scheduling Setting a low-cost production schedule over a period of weeks or months is a difficult and important management problem in most plants. The production manager has to consider many factors: labor capacity, inventory and storage costs, space limitations, product demand, and labor relations. Because most companies produce more than one product, the scheduling process is often quite complex.

Basically, the problem resembles the product mix model for each period in the future. The objective is either to maximize the profit from or to minimize the total cost (production plus inventory) of carrying out the task.

Production scheduling is amenable to solution by LP because it is a problem that must be solved on a regular basis. When the objective function and constraints for a firm are established, the inputs can easily be changed each month to provide an updated schedule.

Greenberg Motors, Inc., manufactures two different electrical motors for sale under contract to Drexel Corp., a well-known producer of small kitchen appliances. Its model GM3A is found in many Drexel food processors, and its model GM3B is used in the assembly of blenders.

Three times each year, the procurement officer at Drexel contacts Irwin Greenberg, the founder of Greenberg Motors, to place a monthly order for each of the coming 4 months. Drexel’s demand for motors varies each month based on its own sales forecasts, production capacity, and financial position. Greenberg has just received the January–April order and must begin his own 4-month production plan. The demand for motors is shown in Table 8.2.

An example of production scheduling: Greenberg Motors

M08_REND3161_13_AIE_C08.indd 295 27/10/16 2:31 PM

296   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

When setting up the production schedule, Irwin Greenberg must consider several factors:

1. The company must meet the demand for each of the two products in each of the four months (see Table 8.2). Also, the company would like to have 450 units of the GM3A and 300 units of the GM3B in inventory at the end of April, as demand in May is expected to be somewhat higher than demand in the previous months.

2. There is a carrying, or holding, cost for any inventory left at the end of the month. So pro- ducing too many extra units of either product may not be desirable. The carrying cost as- signed to the GM3A is $0.36 per unit per month, while the carrying cost for the GM3B is $0.26 per unit per month.

3. The company has been able to maintain a no-layoff policy, and it would like to continue with this. This is easier if the labor hours used do not fluctuate too much from month to month. Maintaining a production schedule that would require from 2,240 to 2,560 labor hours per month is desired. The GM3A requires 1.3 labor hours per unit, while the GM3B requires only 0.9 labor hour.

4. Warehouse limitations cannot be exceeded without great additional costs. There is room at the end of the month for only 3,300 units of the GM3A and GM3B combined.

Although these factors sometimes conflict, Greenberg has found that linear programming is an effective tool in setting up a production schedule that will minimize total cost. Production costs are currently $20 per unit for the GM3A and $15 per unit for the GM3B. However, each of these is due to increase by 10% on March 1 as a new labor agreement goes into effect.

In formulating this as a linear program, it is important to understand how all the important factors are related, how the costs are calculated, how the labor hours per month are calculated, and how demand is met with both production and inventory on hand. To help with understanding this, try to determine the number of labor hours used, the number of units left in inventory at the end of each month for each product, and the total cost if exactly 1,000 of the GM3A and exactly 1,200 of the GM3B were produced each month.

To begin formulating the linear program for the Greenberg production problem, the objec- tive and the constraints are:

Objective:

Minimize total cost 1production cost plus carrying cost2

Constraints:

4 demand constraints 11 constraint for each of 4 months2 for GM3A 4 demand constraints 11 constraint for each of 4 months2 for GM3B 2 constraints 11 for GM3A and 1 for GM3B2 for the inventory at the end of April 4 constraints for minimum labor hours 11 constraint for each month2 4 constraints for maximum labor hours 11 constraint for each month2 4 constraints for inventory storage capacity each month

The decisions involve determining how many units of each of 2 products to produce in each of 4 months, so there will be 8 variables. But, since the objective is to minimize cost and there are costs associated not only with the units produced each month but also with the number of units of each left in inventory, it would be best to define variables for these also. Let

Ai = number of units of GM3A produced in month i 1i = 1, 2, 3, 4 for January9April2 Bi = number of units of GM3B produced in month i 1i = 1, 2, 3, 4 for January9April2

IAi = units of GM3A left in inventory at end of month i 1i = 1, 2, 3, 4 for January9April2 IBi = units of GM3B left in inventory at end of month i 1i = 1, 2, 3, 4 for January9April2

The objective function in the LP model is

Minimize cost = 20A1 + 20A2 + 22A3 + 22A4 + 15B1 + 15B2 + 16.50B3 + 16.50B4 + 0.36IA1 + 0.36IA2 + 0.36IA3 + 0.36IA4 + 0.26IB1 + 0.26IB2 + 0.26IB3 + 0.26IB4

M08_REND3161_13_AIE_C08.indd 296 27/10/16 2:31 PM

8.2 mAnuFACTuRing APPLiCATionS  297

In setting up the constraints, we must recognize the relationship among last month’s ending in- ventory, the current month’s production, and the sales to Drexel this month. The inventory at the end of a month is§ Inventoryat the

end of

this month

¥ = § Inventoryat the end of

last month

¥ + £ Currentmonth>s production

≥ - £ Salesto Drexel this month

≥ While the constraints could be written in this form, inputting the problem into the computer re- quires all variables to be on the left-hand side of the constraint. Rearranging the terms to do this results in § Inventoryat the

end of

last month

¥ + £ Currentmonth>s production

≥ - § Inventoryat the end of

this month

¥ = £ Salesto Drexel this month

≥ Using this, the demand constraints are

A1 - IA1 = 800 1demand for GM3A in January2 IA1 + A2 - IA2 = 700 1demand for GM3A in February2 IA2 + A3 - IA3 = 1,000 1demand for GM3A in March2 IA3 + A4 - IA4 = 1,100 1demand for GM3A in April2

B1 - IB1 = 1,000 1demand for GM3B in January2 IB1 + B2 - IB2 = 1,200 1demand for GM3B in February2 IB2 + B3 - IB3 = 1,400 1demand for GM3B in March2 IB3 + B4 - IB4 = 1,400 1demand for GM3B in April2

IA4 = 450 1inventory of GM3A at end of April2 IB4 = 300 1inventory of GM3B at end of April2

The constraints for the minimum and maximum number of labor hours each month are

1.3A1 + 0.9B1 Ú 2,240 1minimum labor hours in January2 1.3A2 + 0.9B2 Ú 2,240 1minimum labor hours in February2 1.3A3 + 0.9B3 Ú 2,240 1minimum labor hours in March2 1.3A4 + 0.9B4 Ú 2,240 1minimum labor hours in April2 1.3A1 + 0.9B1 … 2,560 1maximum labor hours in January2 1.3A2 + 0.9B2 … 2,560 1maximum labor hours in February2 1.3A3 + 0.9B3 … 2,560 1maximum labor hours in March2 1.3A4 + 0.9B4 … 2,560 1maximum labor hours in April2

The storage capacity constraints are

IA1 + IB1 … 3,300 1storage capacity in January2 IA2 + IB2 … 3,300 1storage capacity in February2 IA3 + IB3 … 3,300 1storage capacity in March2 IA4 + IB4 … 3,300 1storage capacity in April2

All variables Ú 0 1nonnegativity constraints2 The solution was obtained using Solver in Excel 2016, as shown in Program 8.4. Some of the variables are not integers, but this is not a problem because work in process can be carried over from one month to the next. Table 8.3 summarizes the solution with the values rounded. The total cost is about $169,295. Greenberg can use this model to develop production schedules

Employment constraints are set for each month.

Inventory constraints set the relationship among closing inventory this month, closing inventory last month, this month’s production, and sales this month.

M08_REND3161_13_AIE_C08.indd 297 27/10/16 2:31 PM

298   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

PROGRAM 8.4 greenberg motors Solution in Excel 2016

PRODUCTION SCHEDULE JANUARY FEBRUARY MARCH APRIL

Units of GM3A produced 1,277 223 1,758 792

Units of GM3B produced 1,000 2,522 78 1,700

Inventory of GM3A carried 477 0 758 450

Inventory of GM3B carried 0 1,322 0 300

Labor hours required 2,560 2,560 2,355 2,560

TABLE 8.3 Solution to greenberg motors Problem

again in the future by letting the subscripts on the variables represent new months and making minor changes to the problem. The only things in the model that would have to be changed are the right-hand-side values for the demand constraints (and inventory desired at the end of the fourth month) and the objective function coefficients (costs) if they should change.

Solver Parameter Inputs and Selections Key Formulas Set Objective: F5

Copy formula in R5 to R8:R17 Copy formula in R5 to R19:R26 Copy formula in R5 to R28:R31

By Changing cells: B4:Q4

To: Min

Subject to the Constraints:

R19:R22 >= T19:T22

R23:R26 <= T23:T26

R28:R31 <= T28:T31

R8:R17 = T8:T17

Solving Method: Simplex LP

Make Variables Non-Negative

M08_REND3161_13_AIE_C08.indd 298 27/10/16 2:31 PM

8.3 EmPLoyEE SCHEDuLing APPLiCATionS  299

8.3 Employee Scheduling Applications

Labor Planning Labor planning problems address staffing needs over a specific time period. They are especially use- ful when managers have some flexibility in assigning workers to jobs that require overlapping or interchangeable talents. Banks and credit unions frequently use LP to tackle their labor scheduling.

Hong Kong Bank of Commerce and Industry is a busy bank that has requirements for between 10 and 18 tellers, depending on the time of day. The lunch time, from noon to 2 p.m., is usually heaviest. Table 8.4 indicates the workers needed at various hours that the bank is open.

The bank now employs 12 full-time tellers, but many people are on its roster of available part-time employees. A part-time employee must put in exactly 4 hours per day but can start anytime between 9 a.m. and 1 p.m. Part-timers are a fairly inexpensive labor pool, since no retirement or lunch benefits are provided for them. Full-timers, on the other hand, work from 9 a.m. to 5 p.m. but are allowed 1 hour for lunch. (Half of the full-timers eat at 11 a.m., the other half at noon.) Full-timers thus provide 35 hours per week of productive labor time.

By corporate policy, the bank limits part-time hours to a maximum of 50% of the day’s total requirement. Part-timers earn $8 per hour (or $32 per day) on average, and full-timers earn $100 per day in salary and benefits, on average. The bank would like to set a schedule that would minimize its total personnel costs. It will release one or more of its full-time tellers if it is profit- able to do so.

In formulating this as an LP, the objective is to minimize cost. There is a constraint for each hour of the day, stating that the number of people working at the bank during that hour should be at least the minimum number shown in Table 8.4, so there are eight of these constraints. Another constraint will limit the total number of full-time workers to no more than 12. The last constraint will specify that the number of part-time hours must not exceed 50% of the total hours.

The bank must decide how many full-time tellers to use, so there will be one decision vari- able for that. Similarly, the bank must decide about using part-time tellers, but this is more com- plex, as the part-time workers can start at different times of the day, while all full-time workers start at the beginning of the day. Thus, there must be a variable indicating the number of part- time workers starting at each hour of the day from 9 a.m. until 1 p.m. Any worker who starts at 1 p.m. will work until closing, so there is no need to consider having any part-time workers start after that. Let

F = full-time tellers P1 = part-timers starting at 9 a.m (leaving at 1 p.m.) P2 = part-timers starting at 10 a.m (leaving at 2 p.m.) P3 = part-timers starting at 11 a.m (leaving at 3 p.m.) P4 = part-timers starting at Noon (leaving at 4 p.m.) P5 = part-timers starting at 1 p.m (leaving at 5 p.m.)

Objective function:

Minimize total daily personnel cost = $100F + $321P1 + P2 + P3 + P4 + P52

TIME PERIOD NUMBER OF TELLERS REQUIRED

9 a.m.–10 a.m. 10

10 a.m.–11 a.m. 12

11 a.m.–Noon 14

Noon–1 p.m. 16

1 p.m.–2 p.m. 18

2 p.m.–3 p.m. 17

3 p.m.–4 p.m. 15

4 p.m.–5 p.m. 10

TABLE 8.4 Hong kong Bank of Commerce and industry

M08_REND3161_13_AIE_C08.indd 299 27/10/16 2:31 PM

300   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

Constraints:

For each hour, the available labor hours must be at least equal to the required labor hours.

F + P1 Ú 10 (9 a.m.–10 a.m. needs) F + P1 + P2 Ú 12 (10 a.m.–11 a.m. needs)

0.5F + P1 + P2 + P3 Ú 14 (11 a.m.–noon needs) 0.5F + P1 + P2 + P3 + P4 Ú 16 (noon–1 p.m. needs)

F + P2 + P3 + P4 + P5 Ú 18 (1 p.m.–2 p.m. needs) F + P3 + P4 + P5 Ú 17 (2 p.m.–3 p.m. needs) F + P4 + P5 Ú 15 (3 p.m.–4 p.m. needs) F + P5 Ú 10 (4 p.m.–5 p.m. needs)

Only 12 full-time tellers are available, so

F … 12

Part-time worker hours cannot exceed 50% of total hours required each day, which is the sum of the tellers needed each hour:

41P1 + P2 + P3 + P4 + P52 … 0.50110 + 12 + 14 + 16 + 18 + 17 + 15 + 102

or

4P1 + 4P2 + 4P3 + 4P4 + 4P5 … 0.5011122 F, P1, P2, P3, P4, P5 Ú 0

Program 8.5 gives the solution to this, found using Solver in Excel 2016. There are several alternate optimal schedules that Hong Kong Bank can follow. The first is to employ only 10 full-time tellers 1F = 102 and to start 7 part-timers at 10 a.m. 1P2 = 72, 2 part-timers at 11 a.m. 1P3 = 22, and 5 part-timers at noon 1P4 = 52. No part-timers would begin at 9 a.m. or 1 p.m.

A second solution also employs 10 full-time tellers but starts 6 part-timers at 9 a.m. 1P1 = 62, 1 part-timer at 10 a.m. 1P2 = 12, 2 part-timers at 11 a.m. (P3 = 2), 5 part-timers at noon (P4 = 5), and 0 part-timers at 1 p.m. 1P5 = 02. The cost of either of these two policies is $1,448 per day.

8.4 Financial Applications

Portfolio Selection A problem frequently encountered by managers of banks, mutual funds, investment services, and insurance companies is the selection of specific investments from among a wide variety of alternatives. The manager’s overall objective is usually to maximize expected return on invest- ment, given a set of legal, policy, or risk restraints.

For example, the International City Trust (ICT) invests in short-term trade credits, corporate bonds, gold stocks, and construction loans. To encourage a diversified portfolio, the board of directors has placed limits on the amount that can be committed to any one type of investment. ICT has $5 million available for immediate investment and wishes to do two things: (1) maxi- mize the return on the investments made over the next 6 months and (2) satisfy the diversifica- tion requirements as set by the board of directors.

Alternate optimal solutions are common in many LP problems. The sequence in which you enter the constraints into QM for Windows can affect the solution found.

Maximizing return on investment subject to a set of risk constraints is a popular financial application of LP.

M08_REND3161_13_AIE_C08.indd 300 27/10/16 2:31 PM

8.4 FinAnCiAL APPLiCATionS  301

INVESTMENT INTEREST RETURN

MAXIMUM INVESTMENT $1,000,000s

Trade credits 7% 1.0

Corporate bonds 11% 2.5

Gold stocks 19% 1.5

Construction loans 15% 1.8

In addition, the board specifies that at least 55% of the funds invested must be in gold stocks and construction loans and that no less than 15% must be invested in trade credits.

In formulating this as an LP, the objective is to maximize the return. There are four separate constraints limiting the maximum amount in each investment option to the maximum given in the table. The fifth constraint specifies that the total amount in gold stocks and construction loans must be at least 55% of the total amount invested, and the next constraint specifies that the total amount in trade credit must be at least 15% of the total amount invested. The final

PROGRAM 8.5 Labor Planning Solution in Excel 2016

The specifics of the investment possibilities are as follows:

Solver Parameter Inputs and Selections Key Formulas

Set Objective: H6

Copy H6 to H9:H18

By Changing cells: B5:G5

To: Min

Subject to the Constraints:

H9:H16 >= J9:J16

H17:H18 <= J17:J18

Solving Method: Simplex LP

Make Variables Non-Negative

M08_REND3161_13_AIE_C08.indd 301 27/10/16 2:31 PM

302   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

constraint stipulates that the total amount invested cannot exceed $5 million (it could be less). Define the variables as

X1 = dollars invested in trade credits X2 = dollars invested in corporate bonds X3 = dollars invested in gold stocks X4 = dollars invested in construction loans

The total amount invested is X1 + X2 + X3 + X4, which may be less than $5 million. This is important when calculating 55% of the total amount invested and 15% of the total amount in- vested in two of the constraints.

Objective:

Maximize dollars of interest earned = 0.07X1 + 0.11X2 + 0.19X3 + 0.15X4 subject to X1 … 1,000,000

X2 … 2,500,000 X3 … 1,500,000 X4 … 1,800,000 X3 + X4 Ú 0.551X1 + X2 + X3 + X42 X1 Ú 0.151X1 + X2 + X3 + X42 X1 + X2 + X3 + X4 … 5,000,000

X1, X2, X3, X4 Ú 0

optimization at uPS

On an average day, UPS delivers 13 million packages to almost 8 million customers in 200 countries and territories. Deliveries are classified as same-day air, next-day air, and second-day air. The next-day air operations average more than 1.1 million pack- ages per day and generate annual revenue of over $5 billion. The company has 256 aircraft and many more on order. During the busiest time of year, between Thanksgiving and New Year’s Day, the company leases additional aircraft to meet the demand. The size of its fleet makes UPS the 9th-largest commercial airline in the United States and the 11th-largest commercial airline in the world.

In the next-day delivery operation, the pickup and delivery of packages by UPS involves several stages. Packages are carried by truck to ground centers. From there, the packages are taken to the airport, and then they are flown to one of the airport hubs with at most one stop at another airport to pick up more packages. At the hub, the packages are sorted and loaded onto planes and flown to the destination. Packages are then loaded on large trucks and taken to ground centers. At the ground centers, additional sorting is done, and the packages are put on smaller trucks and delivered to their final destinations before 10:30 a.m.

The same aircraft are used in the second-day deliveries as well, so these two types of operations must be coordinated.

A team from UPS and Massachusetts Institute of Technology worked together to develop an optimization-based planning sys- tem called VOLCANO (Volume, Location, and Aircraft Network Optimizer) that is used for planning and managing operations. This group developed optimization methods to minimize overall cost (ownership and operating) while meeting capacity and ser- vice standard constraints. Mathematical models are used to de- termine the minimum cost set of routes, fleet assignments, and package flows. Constraints include the number of aircraft, land- ing restrictions at airports, and aircraft operating characteristics (such as speed, capacity, and range).

The VOLCANO system is credited with saving over $87 million from late in 2000 to the end of 2002. It is expected that $189 million will be saved over the next decade. This optimizer is also used to identify the needed fleet composition and recommend future aircraft acquisitions.

Source: Based on Andrew P. Armacost, Cynthia Barnhart, Keith A. Ware, and Alysia M. Wilson, “UPS Optimizes Its Air Network,” Interfaces 34, 1 (January– February 2004): 15–25, © Trevor S. Hale.

IN ACTION

M08_REND3161_13_AIE_C08.indd 302 27/10/16 2:31 PM

8.4 FinAnCiAL APPLiCATionS  303

Program 8.6 shows the solution found using Solver in Excel. ICT maximizes its interest earned by making the following investment: X1 = $750,000, X2 = $950,000, X3 = $1,500,000, and X4 = $ 1 ,8 0 0 ,0 0 0 . The total interest earned is $712,000.

Truck Loading Problem The truck loading problem involves deciding which items to load on a truck so as to maximize the value of a load shipped. As an example, we consider Goodman Shipping, an Orlando firm owned by Steven Goodman. One of his trucks, with a capacity of 10,000 pounds, is about to be loaded.1 Awaiting shipment are the following items:

ITEM VALUE ($) WEIGHT (POUNDS)

1 22,500 7,500

2 24,000 7,500

3 8,000 3,000

4 9,500 3,500

5 11,500 4,000

6 9,750 3,500

PROGRAM 8.6 iCT Portfolio Solution in Excel 2016

Solver Parameter Inputs and Selections Key Formulas Set Objective: F5

Copy F5 to F8:F14

By Changing cells: B4:E4

To: Min

Subject to the Constraints:

F8:F11 <= H8:H11

F12:F13 >= H12:H13

F14 <= H14

Solving Method: Simplex LP

Make Variables Non-Negative

1Based on an example in S. L. Savage, What’s Best! (Oakland, CA: General Optimization, Inc., and Holden-Day, 1985), © Trevor S. Hale.

M08_REND3161_13_AIE_C08.indd 303 27/10/16 2:31 PM

304   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

Each of these six items, we see, has an associated dollar value and weight. The objective is to maximize the total value of the items loaded onto the truck without

exceeding the truck’s weight capacity. We let Xi be the proportion of each item i loaded on the truck:

Maximize load value = $22,500X1 + $24,000X2 + $8,000X3 + $9,500X4 + $11,500X5 + $9,750X6

subject to 7,500X1 + 7,500X2 + 3,000X3 + 3,500X4 + 4,000X5 +3,500X6 … 10,000 lb capacity

X1 … 1 X2 … 1 X3 … 1 X4 … 1 X5 … 1 X6 … 1

X1, X2, X3, X4, X5, X6 Ú 0

These final six constraints reflect the fact that at most one “unit” of an item can be loaded onto the truck. In effect, if Goodman can load a portion of an item (say, item 1 is a batch of 1,000 folding chairs, not all of which need be shipped together), the Xis will all be proportions ranging from 0 (nothing) to 1 (all of that item loaded).

To solve this LP problem, we turn to Excel’s Solver. Program 8.7 shows Goodman’s Excel formulation, input data, and the solution, which yields a total load value of $31,500.

The answer leads us to an interesting issue that we deal with in detail in Chapter 10. What does Goodman do if fractional values of items cannot be loaded? For example, if electric cars are the items being loaded, we clearly cannot ship one-third of a Tesla.

PROGRAM 8.7 goodman Truck Loading Solution in Excel 2016

Solver Parameter Inputs and Selections Key Formulas Set Objective: H5

Copy H5 to H8:H14

By Changing cells: B4:G4

To: Min

Subject to the Constraints:

H8:H14 <= J8:J14

Solving Method: Simplex LP

Make Variables Non-Negative

M08_REND3161_13_AIE_C08.indd 304 27/10/16 2:31 PM

8.5 ingREDiEnT BLEnDing APPLiCATionS  305

If the proportion of item 1 was rounded up to 1.00, the weight of the load would increase to 15,000 pounds. This would violate the maximum weight constraint of 10,000 pounds. Therefore, the fraction of item 1 must be rounded down to zero. This would drop the weight of the load to 7,500 pounds, leaving 2,500 pounds of the load capacity unused. Because no other item weighs less than 2,500 pounds, the truck cannot be filled up further.

Thus, we see that by using regular LP and rounding the fractional weights, the truck would carry only item 2, for a load weight of 7,500 pounds and a load value of $24,000.

QM for Windows and spreadsheet optimizers such as Excel’s Solver are capable of dealing with integer programming problems as well—that is, LP problems requiring integer solutions. Using Excel, the integer solution to Goodman’s problem is to load items 3, 4, and 6, for a total weight of 10,000 pounds and load value of $27,250.

8.5 Ingredient Blending Applications

Diet Problems The diet problem, one of the earliest applications of LP, was originally used by hospitals to determine the most economical diet for patients. Known in agricultural applications as the feed mix problem, the diet problem involves specifying a food or feed ingredient combination that satisfies stated nutritional requirements at a minimum cost level.

The Whole Food Nutrition Center uses three bulk grains to blend a natural cereal that it sells by the pound. The cost of each bulk grain and the protein, riboflavin, phosphorus, and magne- sium units per pound of each are shown in Table 8.5.

On the packaging for each of its products, Whole Food indicates the nutritional content in each bowl of cereal when eaten with 0.5 cup of milk. The USRDA (U.S. Recommended Dietary Allowance) and the more recent DRI (Dietary Reference Intake) were consulted to establish recommended amounts of certain vitamins and minerals for an average adult. Based on these figures and the desired amounts for labeling on the package, Whole Food has determined that each 2-ounce serving of the cereal should contain 3 units of protein, 2 units of riboflavin, 1 unit of phosphorus, and 0.425 unit of magnesium.

In modeling this as an LP, the objective is to minimize cost. There will be four constraints (one each for protein, riboflavin, phosphorus, and magnesium) stipulating that the number of units must be at least the minimum amount specified. Since these requirements are for each 2-ounce serving, the last constraint must say that the total amount of the grains used will be 2 ounces, or 0.125 pound.

In defining the variables, notice that the cost is expressed per pound of the three grains. Thus, in order to calculate the total cost, we must know the number of pounds of the grains used in one serving of the cereal. Also, the numbers in Table 8.5 are expressed in units per pound of grain, so defining variables as the number of pounds of the grains makes it easier to calculate the amounts of protein, riboflavin, phosphorus, and magnesium. We let

XA = pounds of grain A in one 2@ounce serving of cereal XB = pounds of grain B in one 2@ounce serving of cereal XC = pounds of grain C in one 2@ounce serving of cereal

TABLE 8.5 Whole Food’s natural Cereal Requirements

GRAIN COST PER

POUND (CENTS) PROTEIN

(UNITS/LB) RIBOFLAVIN (UNITS/LB)

PHOSPHORUS (UNITS/LB)

MAGNESIUM (UNITS/LB)

A 33 22 16 8 5

B 47 28 14 7 0

C 38 21 25 9 6

M08_REND3161_13_AIE_C08.indd 305 27/10/16 2:31 PM

306   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

Objective:

Minimize total cost of mixing a 2@ounce serving = $0.33XA + $0.47XB + $0.38XC subject to

22XA + 28XB + 21XC Ú 3 1protein units2 16XA + 14XB + 25XC Ú 2 1riboflavin units2 8XA + 7XB + 9XC Ú 1 1phosphorus units2 5XA + 0XB + 6XC Ú 0.425 1magnesium units2 XA + XB + XC = 0.125 1total mix is 2 ounces or 0.125 pound2

XA, XB, XC Ú 0

The solution to this problem requires mixing together 0.025 lb of grain A, 0.050 lb of grain B, and 0.050 lb of grain C. Another way of stating the solution is in terms of the proportion of the 2-ounce serving of each grain—that is, 0.4 ounce of grain A, 0.8 ounce of grain B, and 0.8 ounce of grain C in each serving. The cost per serving is $0.05. Program 8.8 illustrates this solution using Solver in Excel 2016.

Ingredient Mix and Blending Problems Diet and feed mix problems are actually special cases of a more general class of LP problems known as ingredient or blending problems. Blending problems arise when a decision must be made regarding the blending of two or more resources to produce one or more products. Re- sources, in this case, contain one or more essential ingredients that must be blended so that each final product contains a specific percentage of each ingredient. The following example deals with an application frequently seen in the petroleum industry, the blending of crude oils to pro- duce refinable gasoline.

PROGRAM 8.8 Whole Food Diet Solution in Excel 2016

Solver Parameter Inputs and Selections Key Formulas Set Objective: E6

Copy E6 to E9:E13

By Changing cells: B5:D5

To: Min

Subject to the Constraints:

E9:E12 <= G9:G12

E13 = G13

Solving Method: Simplex LP

Make Variables Non-Negative

M08_REND3161_13_AIE_C08.indd 306 27/10/16 2:31 PM

8.5 ingREDiEnT BLEnDing APPLiCATionS  307

The Low Knock Oil Company produces two grades of cut-rate gasoline for industrial distri- bution. The grades, regular and economy, are produced by refining a blend of two types of crude oil, type X100 and type X220. Each crude oil differs not only in cost per barrel but in composi- tion as well. The following table indicates the percentages of crucial ingredients found in each of the crude oils and the cost per barrel for each:

CRUDE OIL TYPE INGREDIENT A (%) INGREDIENT B (%) COST/BARREL ($)

X100 35 55 30.00

X220 60 25 34.80

Weekly demand for the regular grade of Low Knock gasoline is at least 25,000 barrels, and demand for the economy is at least 32,000 barrels per week. At least 45% of each barrel of regu- lar must be ingredient A. At most, 50% of each barrel of economy should contain ingredient B. While the gasoline yield from one barrel of crude depends on the type of crude and the type of processing used, we will assume for the sake of this example that one barrel of crude oil will yield one barrel of gasoline.

The Low Knock management must decide how many barrels of each type of crude oil to buy each week for blending to satisfy demand at minimum cost. In modeling this as an LP, the objective is to minimize cost. Each of the two types of gasoline has a demand constraint, and each of the two types of gasoline has a constraint restricting the amount of the ingredients. Thus, there are four constraints. The decision involves the amount of each type of crude to use in each type of gasoline, so these will be the decision variables. Let

X1 = barrels of crude X100 blended to produce the refined regular X2 = barrels of crude X100 blended to produce the refined economy X3 = barrels of crude X220 blended to produce the refined regular X4 = barrels of crude X220 blended to produce the refined economy

This problem can be formulated as follows:

Objective:

Minimize cost = $30X1 + $30X2 + $34.80X3 + $34.80X4 subject to

X1 + X3 Ú 25,000 1demand for regular2 X2 + X4 Ú 32,000 1demand for economy2

At least 45% of each barrel of regular must be ingredient A:

1X1 + X32 = Total amount of crude blended to produce the refined regular gasoline demand

Thus,

0.451X1 + X32 = Minimum amount of ingredient A required But

0.35X1 + 0.60X3 = Amount of ingredient A in refined regular gas

So

0.35X1 + 0.60X3 Ú 0.45X1 + 0.45X3

or

-0.10X1 + 0.15X3 Ú 0 1ingredient A in regular constraint2

Major oil refineries all use LP for blending crude oils to produce gasoline grades.

M08_REND3161_13_AIE_C08.indd 307 27/10/16 2:31 PM

308   CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

Similarly, at most 50% of each barrel of economy should be ingredient B:

X2 + X4 = Total amount of crude blended to produce the refined economy gasoline demanded

Thus,

0.501X2 + X42 = Maximum amount of ingredient B allowed But

0.55X2 + 0.25X4 = Amount of ingredient B in refined economy gas

So

0.55X2 + 0.25X4 … 0.50X2 + 0.50X4

or

0.05X2 - 0.25X4 … 0 1ingredient B in economy constraint2 Here is the entire LP formulation:

Minimize cost = 30X1 + 30X2 + 34.80X3 + 34.80X4 subject to X1 + X3 Ú 25,000 X2 + X4 Ú 32,000

-0.10X1 + 0.15X3 Ú 0 0.05X2 - 0.25X4 … 0

X1, X2, X3, X4 Ú 0

Using Excel, the solution to Low Knock Oil’s formulation was found to be

X1 = 15,000 barrels of X100 into regular X2 = 26,666.67 barrels of X100 into economy X3 = 10,000 barrels of X220 into regular X4 = 5,333.33 barrels of X220 into economy

The cost of this mix is $1,783,600. Refer to Program 8.9 for details.

8.6 Other Linear Programming Applications

There are many other types of linear programming applications. One particular application was first developed and used by American Airlines in the early 1990s, and it is called revenue man- agement. This was designed to use differential pricing for seats so that additional revenue could be obtained. Some customers who were willing to book with certain restrictions, such as 14-day advance purchase or with a stay over a Saturday night, would receive lower fares. However, if all seats are sold at this reduced cost, then higher-paying passengers, often business travelers who might try to book seats at the last minute, would not be able to do so. The extra revenue generated from these passengers is then lost. A revenue management system was developed to determine how many seats to make available to each type of passenger. Linear programs would have an objective of maximizing the total revenue, while constraints would be based on the total number of seats available on the plane and the total number of seats allocated to each category. Companies have reported dramatic increases in revenues as a result of this.

Given the success of revenue management systems in the airlines industry, similar systems were also adopted by many hotel chains. The airline industry and the hotel industry have prod- ucts with similar characteristics—a limited inventory of a very perishable product. A plane has a limited number of seats, and when the plane takes off, any empty seats can no longer be sold and

M08_REND3161_13_AIE_C08.indd 308 27/10/16 2:31 PM

8.6 oTHER LinEAR PRogRAmming APPLiCATionS  309

the revenue is lost. A hotel has a limited number of rooms, and once a particular date has passed, an empty room on that date cannot be sold and the revenue is lost.

Another common type of application is data envelopment analysis (DEA). This is some- times used to measure the efficiency of several similar operating units such as hospitals or schools. It is often used with nonprofit entities where measuring the success of a particular unit is difficult, as there is no single objective, such as profit, that is to be optimized. In devel- oping the LP, the inputs and outputs of the particular system must be identified. For a hospital system, the inputs might be the number of doctors working, the number of nurses working, the number of bed-days available per year, and the total payroll. The outputs might be the number of patient-days in the hospital, the number of nurses trained, the number of surgeries per- formed, the number of outpatient procedures performed, and the number of doctors trained. Constraints are developed for each of these inputs and outputs for each unit in the system. The objective is basically to minimize the resources needed to generate specific levels of output. The results indicate whether fewer resources could have been used to generate the same level of outputs when compared to a typical unit in the system. Efforts can then be made to identify specific areas that are deemed to be potentially inefficient, and improvements can be targeted for these areas.

Transportation problems, transshipment problems, and assignment problems are very widely used in business. These are so common that special purpose algorithms have been developed to solve these more quickly than the current procedures used for other types of linear programming problems. These applications will be presented in the next chapter.

Solver Parameter Inputs and Selections Key Formulas

Set Objective: F6

Copy F6 to F9:F12

By Changing cells: B5:E5

To: Min

Subject to the Constraints:

F9:F11 >= H9:H11

F12 <= H12

Solving Method: Simplex LP

Make Variables Non-Negative

PROGRAM 8.9 Low knock oil Solution in Excel 2016

M08_REND3161_13_AIE_C08.indd 309 27/10/16 2:31 PM

310  CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

Harrah’s Cherokee Casino uses Linear Programming for Revenue management

Identifying the customers who would generate the most rev- enue is usually very difficult, but Harrah’s Cherokee Casino has benefited from a unique way of placing customers into particu- lar market segments based on spending habits. Harrah’s encour- ages casino customers to join their Total Rewards club. Points in this club are earned each time the member plays a casino game or spends money in a restaurant, spa, gift shop, or hotel facility. Earning points entitles players to receive benefits such as free or discounted rooms, meals, show tickets, and other things. Track- ing the size of the bets as well as the number of bets allows Harrah’s to place the players in segments based on the amount that they typically play when visiting the casinos. The best rev- enue generators are guests who typically gamble more money during each day of their stay. When a player tries to reserve a room, a low-spending player might be told there are no rooms available, while a high-spending customer will get to reserve the room. To promote goodwill, the customer in the lower-spending segment might be offered a free room at a nearby hotel. The ad- ditional revenue that will be obtained by reserving the room for a high-roller will more than offset this cost.

A linear program is used to maximize the revenue generated subject to the total number of rooms available and the total

number of rooms that are allocated to each segment of custom- ers. The variables include the number of rooms to make avail- able for each segment. The shadow prices of the constraints indicate how much extra revenue will be generated if one ad- ditional room is made available to the different segments. The model is frequently updated based on the number of rooms still available, the number of days remaining until the date of the reservation, and other factors. Based on results from this model, marketing efforts are targeted for very specific Total Rewards members when it appears that hotel traffic might be light on a particular day.

While revenue management implementations typically increase revenue by 3–7%, Harrah’s has experienced a 15% increase in revenues from the revenue management systems throughout its many hotels and casinos. At Harrah’s Cherokee Casino, the hotel opened with the system already in place so there is no basis for comparison. However, the profit margin of this particular property is 60% on gross revenue, which is twice the industry average.

Source: Based on Richard Metters, et al., “The ‘Killer Application’ of Revenue Management: Harrah’s Cherokee Casino & Hotel,” Interfaces 38, 3 (May–June 2008): 161–175, © Trevor S. Hale.

IN ACTION

In this chapter, we continued our discussion of linear program- ming models. The basic steps for formulating a linear program were followed for a variety of problems. These included applica- tions in marketing, production scheduling, finance, and ingredient blending. Attention was paid to understanding the problem, identi- fying the objective and the constraints, defining the decision vari- ables, and developing the mathematical model from these.

In future chapters, additional applications of linear pro- gramming will be presented. The transportation problem will be discussed in Chapter 9, along with two other closely related applications: the assignment problem and the transshipment problem.

Summary

Self-Test

●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the glossary at the end of the chapter.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Linear programming can be used to select effective media mixes, allocate fixed or limited budgets across media, and maximize audience exposure. a. True b. False

2. Using LP to maximize audience exposure in an advertising campaign is an example of the type of LP application known as a. marketing research. b. media selection. c. portfolio assessment.

d. media budgeting. e. all of the above.

3. Which of the following does not represent a factor a manager might consider when employing LP for production scheduling? a. labor capacity b. space limitations c. product demand d. risk assessment e. inventory costs

M08_REND3161_13_AIE_C08.indd 310 27/10/16 2:31 PM

PRoBLEmS  311

4. When applying LP to diet problems, the objective function is usually designed to a. maximize profits from blends of nutrients. b. maximize ingredient blends. c. minimize production losses. d. maximize the number of products to be produced. e. minimize the costs of nutrient blends.

5. The diet problem is a. also called the feed mix problem in agriculture. b. a special case of the ingredient mix problem.

c. a special case of the blending problem. d. all of the above.

6. The selection of specific investments from among a wide variety of alternatives is the type of LP problem known as a. the product mix problem. b. the investment banker problem. c. the portfolio selection problem. d. the Wall Street problem. e. none of the above.

Problems

8-1 (Production problem) Winkler Furniture manufac- tures two different types of china cabinets: a French Provincial model and a Danish Modern model. Each cabinet produced must go through three depart- ments: carpentry, painting, and finishing. The table on this page contains all relevant information con- cerning production times per cabinet produced and production capacities for each operation per day, along with net revenue per unit produced. The firm has a contract with an Indiana distributor to produce a minimum of 300 of each cabinet per week (or 60 cabinets per day). Owner Bob Winkler would like to determine a product mix to maximize his daily revenue.

(a) Formulate as an LP problem. (b) Solve using an LP software program or

spreadsheet.

8-2 (Investment decision problem) The Heinlein and Krampf Brokerage firm has just been instructed by one of its clients to invest $250,000 of her money obtained recently through the sale of land holdings in Ohio. The client has a good deal of trust in the investment house, but she also has her own ideas about the distribution of the funds being invested. In particular, she requests that the firm select what- ever stocks and bonds they believe are well rated but within the following guidelines:

●● Municipal bonds should constitute at least 20% of the investment.

●● At least 40% of the funds should be placed in a combination of electronic firms, aerospace firms, and drug manufacturers.

●● No more than 50% of the amount invested in municipal bonds should be placed in a high-risk, high-yield nursing home stock.

Subject to these restraints, the client’s goal is to max- imize projected return on investments. The analysts at Heinlein and Krampf, aware of these guidelines, prepare a list of high-quality stocks and bonds and their corresponding rates of return:

INVESTMENT PROJECTED RATE

OF RETURN (%)

Los Angeles municipal bonds 5.3

Thompson Electronics, Inc. 6.8

United Aerospace Corp. 4.9

Palmer Drugs 8.4

Happy Days Nursing Homes 11.8

(a) Formulate this portfolio selection problem using LP.

(b) Solve this problem.

Data for Problem 8.1

CABINET STYLE

CARPENTRY (HOURS/

CABINET)

PAINTING (HOURS/

CABINET)

FINISHING (HOURS/

CABINET) NET REVENUE/

CABINET ($)

French Provincial 3 1.5 0.75 28

Danish Modern 2 1 0.75 25

Department capacity (hours) 360 200 125

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel; and means the problem may be solved with QM for Windows and/or Excel.

M08_REND3161_13_AIE_C08.indd 311 27/10/16 2:31 PM

312  CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

8-3 (Restaurant work scheduling problem) The famous Y. S. Chang Restaurant is open 24 hours a day. Waiters and busboys report for duty at 3 a.m., 7 a.m., 11 a.m., 3 p.m., 7 p.m., or 11 p.m., and each works an 8-hour shift. The following table shows the minimum number of workers needed during the six periods into which the day is divided. Chang’s scheduling problem is to determine how many wait- ers and busboys should report for work at the start of each time period to minimize the total staff required for one day’s operation. (Hint: Let Xi equal the num- ber of waiters and busboys beginning work in time period i, where i = 1, 2, 3, 4, 5, 6.)

PERIOD TIME NUMBER OF WAITERS

AND BUSBOYS REQUIRED

1 3 a.m.–7 a.m. 3

2 7 a.m.–11 a.m. 12

3 11 a.m.–3 p.m. 16

4 3 p.m.–7 p.m. 9

5 7 p.m.–11 p.m. 11

6 11 p.m.–3 a.m. 4

8-4 (Animal feed mix problem) The Battery Park Stable feeds and houses the horses used to pull tourist-filled carriages through the streets of Charleston’s historic waterfront area. The stable owner, an ex-racehorse trainer, recognizes the need to set a nutritional diet for the horses in his care. At the same time, he would like to keep the overall daily cost of feed to a minimum.

The feed mixes available for the horses’ diet are an oat product, a highly enriched grain, and a mineral product. Each of these mixes contains a certain amount of five ingredients needed daily to keep the average horse healthy. The table on this page shows these minimum requirements, units of each ingredient per pound of feed mix, and costs for the three mixes.

In addition, the stable owner is aware that an overfed horse is a sluggish worker. Consequently, he determines that a total of 6 pounds of feed per day is the most that any horse needs to function properly. Formulate this problem and solve for the optimal daily mix of the three feeds.

8-5 The Kleenglass Corporation makes a dishwasher that has excellent cleaning power. This dishwasher uses less water than most competitors, and it is extremely quiet. Orders have been received from several retail stores for delivery at the end of each of the next 3 months, as shown below:

MONTH NUMBER OF

UNITS

June 195

July 215

August 205

Due to limited capacity, only 200 of these dish- washers can be made each month on regular time, and the cost is $300 each. However, an extra 15 units per month can be produced if overtime is used, but the cost goes up to $325 each. Also, if there are any dishwashers produced in a month that are not sold in that month, there is a $20 cost to carry this item to the next month. Use linear programming to deter- mine how many units to produce in each month on regular time and on overtime to minimize the total cost while meeting the demand.

8-6 Eddie Kelly is running for reelection as mayor of a small town in Alabama. Jessica Martinez, Kelly’s campaign manager during this election, is plan- ning the marketing campaign, and there is some stiff competition. Martinez has selected four ways to advertise: television ads, radio ads, billboards, and newspaper ads. The costs of these, the audience reached by each type of ad, and the maximum num- ber available are shown in the following table:

Data for Problem 8.4

FEED MIX

DIET REQUIREMENT (INGREDIENTS)

OAT PRODUCT (UNITS/LB)

ENRICHED GRAIN

(UNITS/LB)

MINERAL PRODUCT (UNITS/LB)

MINIMUM DAILY REQUIREMENT

(UNITS)

A 2 3 1 6

B 0.5 1 0.5 2

C 3 5 6 9

D 1 1.5 2 8

E 0.5 0.5 1.5 5

Cost/lb $0.09 $0.14 $0.17

M08_REND3161_13_AIE_C08.indd 312 27/10/16 2:31 PM

PRoBLEmS  313

TYPE OF AD COST

PER AD AUDIENCE

REACHED/AD MAXIMUM NUMBER

TV $800 30,000 10

Social media $400 22,000 10

Billboards $500 24,000 10

Newspapers $100 8,000 10

In addition, Martinez has decided that there should be at least six ads on TV or social media or some combination of those two. The amount spent on billboards and newspapers together must not exceed the amount spent on TV ads. While fund- raising is still continuing, the monthly budget for advertising has been set at $15,000. How many ads of each type should be placed to maximize the total number of people reached?

8-7 (Media selection problem) The advertising direc- tor for Diversey Paint and Supply, a chain of four retail stores on Chicago’s North Side, is consider- ing two media possibilities. One plan is for a series of half-page ads in the Sunday Chicago Tribune newspaper, and the other is for advertising time on Chicago TV. The stores are expanding their lines of do-it-yourself tools, and the advertising director is interested in an exposure level of at least 40% within the city’s neighborhoods and 60% in northwest sub- urban areas.

The TV viewing time under consideration has an exposure rating per spot of 5% in city homes and 3% in the northwest suburbs. The Sunday newspaper has corresponding exposure rates of 4% and 3% per ad. The cost of a half-page Tribune advertisement is $925; a television spot costs $2,000.

Diversey Paint would like to select the least costly advertising strategy that would meet desired exposure levels.

(a) Formulate using LP. (b) Solve the problem.

8-8 (Automobile leasing problem) Sundown Rent-a- Car, a large automobile rental agency operating in the Midwest, is preparing a leasing strategy for the next six months. Sundown leases cars from an au- tomobile manufacturer and then rents them to the public on a daily basis. A forecast of the demand for Sundown’s cars in the next six months follows:

MONTH MARCH APRIL MAY JUNE JULY AUGUST

Demand 420 400 430 460 470 440

Cars may be leased from the manufacturer for either three, four, or five months. These are leased on the first day of the month and are returned on the last day of the month. Every six months the automobile

manufacturer is notified by Sundown about the num- ber of cars needed during the next six months. The automobile manufacturer has stipulated that at least 50% of the cars leased during a six-month period must be on the five-month lease. The cost per month is $420 for the three-month lease, $400 for the four- month lease, and $370 for the five-month lease.

Currently, Sundown has 390 cars. The lease on 120 cars expires at the end of March. The lease on another 140 cars expires at the end of April, and the lease on the rest of these expires at the end of May.

Use LP to determine how many cars should be leased in each month on each type of lease to mini- mize the cost of leasing over the six-month period. How many cars are left at the end of August?

8-9 Management of Sundown Rent-a-Car (see Problem 8.8) has decided that perhaps the cost during the six- month period is not the appropriate cost to minimize because the agency may still be obligated to additional months on some leases after that time. For example, if Sundown had some cars delivered at the beginning of the sixth month, Sundown would still be obligated for two additional months on a three-month lease. Use LP to determine how many cars should be leased in each month on each type of lease to minimize the cost of leasing over the entire life of these leases.

8-10 (High school busing problem) The Arden County, Maryland, superintendent of education is responsi- ble for assigning students to the three high schools in his county. He recognizes the need to bus a certain number of students, for several sectors of the county are beyond walking distance to a school. The super- intendent partitions the county into five geographic sectors as he attempts to establish a plan that will minimize the total number of student miles traveled by bus. He also recognizes that if a student happens to live in a certain sector and is assigned to the high school in that sector, there is no need to bus that stu- dent because he or she can walk to school. The three schools are located in sectors B, C, and E.

The following table reflects the number of high- school-age students living in each sector and the busing distance in miles from each sector to each school:

DISTANCE TO SCHOOL

SECTOR SCHOOL IN SECTOR B

SCHOOL IN SECTOR C

SCHOOL IN SECTOR E

NUMBER OF STUDENTS

A 5 8 6 700

B 0 4 12 500

C 4 0 7 100

D 7 2 5 800

E 12 7 0 400 2,500

M08_REND3161_13_AIE_C08.indd 313 27/10/16 2:31 PM

314  CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

Each high school has a capacity of 900 students. Set up the objective function and constraints of this problem using LP so that the total number of student miles traveled by bus is minimized. Then solve the problem.

8-11 (Pricing and marketing strategy problem) The I. Kruger Paint and Wallpaper Store is a large retail distributor of the Supertrex brand of vinyl wallcov- erings. Kruger will enhance its citywide image in Miami if it can sell more rolls of Supertrex next year than other local stores. It is able to estimate the de- mand function as follows:

Number of rolls of Supertrex sold = 20 * Dollars spent on advertising + 6.8 * Dollars spent on in@store displays + 12 * Dollars invested in on@hand wallpaper inventory - 65,000 * Percentage markup taken above wholesale cost of a roll

The store budgets a total of $17,000 for adver- tising, in-store displays, and on-hand inventory of Supertrex for next year. It decides it must spend at least $3,000 on advertising; in addition, at least 5% of the amount invested in on-hand inventory should be devoted to displays. Markups on Supertrex seen at other local stores range from 20% to 45%. Kru- ger decides that its markup had best be in this range as well.

(a) Formulate as an LP problem. (b) Solve the problem. (c) What is the difficulty with the answer? (d) What constraint would you add?

8-12 (College meal selection problem) Kathy Roniger, campus dietitian for a small Idaho college, is re- sponsible for formulating a nutritious meal plan for students. For an evening meal, she feels that the fol- lowing five meal-content requirements should be met: (1) between 900 and 1,500 calories; (2) at least 4 milligrams of iron; (3) no more than 50 grams of fat; (4) at least 26 grams of protein; and (5) no more than 50 grams of carbohydrates. On a particular day, Roniger’s food stock includes seven items that can be prepared and served for supper to meet these require- ments. The cost per pound for each of the seven food items and the contribution of each to the five nutritional requirements are given in the table on this page.

What combination and amounts of food items will provide the nutrition Roniger requires at the least total food cost?

(a) Formulate as an LP problem. (b) What is the cost per meal? (c) Is this a well-balanced diet?

8-13 (High-tech production problem) Quitmeyer Elec- tronics Incorporated manufactures the following six microcomputer peripheral devices: internal mo- dems, external modems, graphics circuit boards, CD drives, hard disk drives, and memory expansion boards. Each of these technical products requires time, in minutes, on three types of electronic testing devices, as shown in the table on this page.

The first two test devices are available 120 hours per week. The third (device 3) requires more preventive maintenance and may be used only 100

Data for Problem 8.12

FOOD VALUES

FOOD ITEM

CALORIES/ LB

IRON (MG/LB)

FAT (GM/ LB)

PROTEIN (GM/LB)

CARBOHYDRATES (GM/LB)

COST/ LB ($)

Milk 295 0.2 16 16 22 0.60

Ground meat 1,216 0.2 96 81 0 2.35

Chicken 394 4.3 9 74 0 1.15

Fish 358 3.2 0.5 83 0 2.25

Beans 128 3.2 0.8 7 28 0.58

Spinach 118 14.1 1.4 14 19 1.17

Potatoes 279 2.2 0.5 8 63 0.33

Source: Based on Jean A. T. Pennington and Judith S. Douglass, Bowes and Church’s Food Values of Portions Commonly Used, 18th ed., (Philadelphia: Lippincott Williams & Wilkins, 2004), pp. 100–130, © Trevor S. Hale.

INTERNAL MODEM

EXTERNAL MODEM

CIRCUIT BOARD

CD DRIVE

HARD DRIVE

MEMORY BOARD

Test device 1 7 3 12 6 18 17

Test device 2 2 5 3 2 15 17

Test device 3 5 1 3 2 9 2

Data for Problem 8.13

M08_REND3161_13_AIE_C08.indd 314 27/10/16 2:31 PM

PRoBLEmS  315

hours each week. The market for all six computer components is vast, and Quitmeyer Electronics be- lieves that it can sell as many units of each product as it can manufacture. The table that follows summa- rizes the revenue and material cost for each product:

DEVICE REVENUE PER UNIT SOLD ($)

MATERIAL COST PER UNIT ($)

Internal modem 200 35

External modem 120 25

Graphics circuit board 180 40

CD drive 130 45

Hard disk drive 430 170

Memory expansion board

260 60

In addition, variable labor costs are $15 per hour for test device 1, $12 per hour for test device 2, and $18 per hour for test device 3. Quitmeyer Elec- tronics wants to maximize its profits.

(a) Formulate this as an LP model problem. (b) Solve the problem by computer. What is the best

product mix? (c) What is the value of an additional minute of time

per week on test device 1? Test device 2? Test device 3? Should Quitmeyer Electronics add one or more test devices to make more time avail- able? If so, on which device(s) should it add?

8-14 (Nuclear plant staffing problem) South Central Utilities has just announced the August 1 opening of its second nuclear generator at its Baton Rouge, Louisiana, nuclear power plant. Its personnel department has been directed to determine how many nuclear technicians need to be hired and trained over the remainder of the year.

The plant currently employs 350 fully trained technicians and projects the following personnel needs:

MONTH PERSONNEL HOURS NEEDED

August 40,000

September 45,000

October 35,000

November 50,000

December 45,000

By Louisiana law, a reactor employee can ac- tually work no more than 130 hours per month. (Slightly over 1 hour per day is used for check-in and check-out, recordkeeping, and daily radiation health scans.) Policy at South Central Utilities also dictates that layoffs are not acceptable in those months when the nuclear plant is overstaffed. So if more trained employees are available than are needed in any month, each worker is still fully paid, even though he or she is not required to work the 130 hours.

Training new employees is an important and costly procedure. It takes 1 month of one-on-one classroom instruction before a new technician is per- mitted to work alone in the reactor facility. There- fore, South Central must hire trainees 1 month before they are actually needed. Each trainee teams up with a skilled nuclear technician and requires 90 hours of that employee’s time, meaning that he or she has 90 fewer hours available that month for actual reactor work.

Personnel department records indicate a turn- over rate of trained technicians at 5% per month. In other words, about 5% of the skilled employ- ees at the start of any month resign by the end of that month. A trained technician earns an average monthly salary of $2,000 (regardless of the number of hours worked, as noted earlier). Trainees are paid $900 during their 1 month of instruction.

(a) Formulate this staffing problem using LP. (b) Solve the problem. How many trainees must

begin each month?

8-15 (Agricultural production planning problem) Mar- garet Black’s family owns five parcels of farmland, referred to as the southeast sector, north sector, northwest sector, west sector, and southwest sector. Margaret is involved primarily in growing wheat, al- falfa, and barley crops and is currently preparing her production plan for next year. The Pennsylvania Water Authority has just announced its yearly water allot- ment, with the Black farm receiving 7,400 acre-feet. Each parcel can tolerate only a specified amount of irrigation per growing season, as specified in the fol- lowing table:

PARCEL AREA

(ACRES) WATER IRRIGATION LIMIT

(ACRE-FEET)

Southeast 2,000 3,200

North 2,300 3,400

Northwest 600 800

West 1,100 500

Southwest 500 600

Each of Margaret’s crops needs a minimum amount of water per acre, and there is a projected limit on sales of each crop. Crop data follow:

CROP MAXIMUM SALES WATER NEEDED PER ACRE

(ACRE-FEET)

Wheat 110,000 bushels 1.6

Alfalfa 1,800 tons 2.9

Barley 2,200 tons 3.5

Margaret’s best estimate is that she can sell wheat at a net profit of $2 per bushel, alfalfa at $40 per ton, and barley at $50 per ton. One acre of land yields an

M08_REND3161_13_AIE_C08.indd 315 27/10/16 2:31 PM

316  CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

average of 1.5 tons of alfalfa and 2.2 tons of barley. The wheat yield is approximately 50 bushels per acre.

(a) Formulate Margaret’s production plan. (b) What should the crop plan be, and what profit

will it yield? (c) The Water Authority informs Margaret that for

a special fee of $6,000 this year, her farm will qualify for an additional allotment of 600 acre- feet of water. How should she respond?

8-16 (Material blending problem) Amalgamated Prod- ucts has just received a contract to construct steel body frames for automobiles that are to be produced at a new Japanese auto factory in Tennessee. The Japanese auto manufacturer has strict quality con- trol standards for all of its component subcontrac- tors and has informed Amalgamated that each frame must have the following steel content:

MATERIAL MINIMUM

PERCENTAGE MAXIMUM

PERCENTAGE

Manganese 2.1 2.3

Silicon 4.3 4.6

Carbon 5.05 5.35

Amalgamated mixes batches of eight different available materials to produce 1 ton of steel for use in the body frames. The table on this page details these materials.

Formulate and solve the LP problem, indicating how much of each of the eight materials should be blended into a 1-ton load of steel so that Amalgam- ated meets its requirements while minimizing costs.

8-17 Refer to Problem 8.16. Find the cause of the diffi- culty and recommend how to adjust it. Then solve the problem again.

8-18 (Hospital expansion problem) Mt. Sinai Hospital in New Orleans is a large, private, 600-bed facility, complete with laboratories, operating rooms, and x-ray equipment. In seeking to increase revenues, Mt. Sinai’s administration has decided to build a 90-bed addition on a portion of adjacent land cur- rently used for staff parking. The administrators feel that the labs, operating rooms, and x-ray department are not being fully utilized at present and do not

need to be expanded to handle additional patients. The addition of 90 beds, however, requires a deci- sion as to how many beds should be allocated to the medical staff for medical patients and how many to the surgical staff for surgical patients.

The hospital’s accounting and medical records departments have provided the following pertinent information. The average hospital stay for a medi- cal patient is 8 days, and the average medical patient generates $2,280 in revenues. The average surgi- cal patient is in the hospital 5 days and receives a $1,515 bill. The laboratory is capable of handling 15,000 tests per year more than it was handling. The average medical patient requires 3.1 lab tests and the average surgical patient takes 2.6 lab tests. Furthermore, the average medical patient uses one x-ray, whereas the average surgical patient requires two x-rays. If the hospital was expanded by 90 beds, the x-ray department could handle up to 7,000 x-rays without significant additional cost. Finally, the ad- ministration estimates that up to 2,800 additional operations could be performed in existing operating room facilities. Medical patients, of course, do not require surgery, whereas each surgical patient gener- ally has one surgery performed.

Formulate this problem so as to determine how many medical beds and how many surgical beds should be added to maximize revenues. Assume that the hos- pital is open 365 days a year. Then solve the problem.

8-19 Prepare a written report to the CEO of Mt. Sinai Hos- pital in Problem 8.18 on the expansion of the hospital. Round off your answers to the nearest integer. The format in which you present the results is important. The CEO is a busy person and wants to be able to find your optimal solution quickly in your report. Cover all the areas given in the following sections, but do not mention any variables or shadow prices.

(a) What is the maximum revenue per year, how many medical patients/year are there, and how many surgical patients/year are there? How many medical beds and how many surgical beds should be added in the 90-bed addition?

(b) Are there any empty beds with this optimal solu- tion? If so, how many empty beds are there? Dis- cuss the effect of acquiring more beds if needed.

MATERIAL AVAILABLE

MANGANESE (%)

SILICON (%)

CARBON (%)

POUNDS AVAILABLE

COST PER POUND ($)

Alloy 1 70.0 15.0 3.0 No limit 0.12 Alloy 2 55.0 30.0 1.0 300 0.13 Alloy 3 12.0 26.0 0 No limit 0.15 Iron 1 1.0 10.0 3.0 No limit 0.09 Iron 2 5.0 2.5 0 No limit 0.07 Carbide 1 0 24.0 18.0 50 0.10

Carbide 2 0 25.0 20.0 200 0.12

Carbide 3 0 23.0 25.0 100 0.09

Data for Problem 8.16

M08_REND3161_13_AIE_C08.indd 316 27/10/16 2:31 PM

PRoBLEmS  317

(c) Are the laboratories being used to their capac- ity? Is it possible to perform more lab tests/year? If so, how many more? Discuss the effect of ac- quiring more lab space if needed.

(d) Is the x-ray facility being used to its maximum? Is it possible to do more x-rays/year? If so, how many more? Discuss the effect of acquiring more x-ray facilities if needed.

(e) Are the operating rooms being used to capacity? Is it possible to do more operations/year? If so, how many more? Discuss the effect of acquiring more operating room facilities if needed. (Source: Pro- fessor Chris Vertullo. Reprinted with permission.)

8-20 In the Low Knock Oil Company blending problem in Section 8.6, it was assumed that one barrel of crude would result in one barrel of gasoline as the final product. In processing one barrel of crude, a typical gasoline yield is about 0.46 barrel, although it could be higher or lower than this, depending on the particular crude and processing used. However, other products such as diesel, jet fuel, home fuel oil, and asphalt also come from that same barrel. Assum- ing that only 46% of the crude turns into gasoline, modify the Low Knock Oil Company linear pro- gramming example to account for this. Solve the resulting LP problem using any computer software.

8-21 A paper mill produces rolls of paper that are 10 inches wide and 100 feet long. These rolls are used for creating narrower rolls of paper that are used in cash registers, automatic teller machines (ATMs), and other devices. The narrower widths (2.5, 3, and 3.5 inches) needed for these devices are obtained by cutting the 10-inch rolls using prespecified cutting patterns. Cutting pattern #1 will cut the 10-inch roll into four rolls that are 2.5 inches each. Cutting pattern #2 results in three rolls that are each 3 inches wide (leaving 1 inch of waste on the end). Cutting pattern #3 results in one roll that is 3 inches wide and two rolls that are 3.5 inches wide. Cutting pat- tern #4 results in one 2.5-inch roll, one 3-inch roll, and one 3.5-inch roll (leaving 1 inch of waste). Cutting pat- tern #5 results in one roll that is 2.5 inches wide and two rolls that are 3.5 inches wide (leaving 0.5 inch of waste on the end). An order has been received for 2,000 of the 2.5-inch rolls, 4,000 of the 3-inch rolls, and 5,000 of the 3.5-inch rolls. How many rolls should be cut using each pattern if the company wants to minimize the total number of 10-inch rolls used? How many rolls should be cut using each pattern if the company wants to mini- mize the total waste?

8-22 (Portfolio selection problem) Daniel Grady is the financial advisor for a number of professional athletes. An analysis of the long-term goals for many of these athletes has resulted in a recommendation to purchase stocks with some of the income that they have set aside for investments. Five stocks have been identified as hav- ing very favorable expectations for future performance. Although the expected return is important in these investments, the risk, as measured by the beta of the

stock, is also important. (A high value of beta indicates that the stock has a relatively high risk.) The expected return and the beta for five stocks are as follows:

STOCK 1 2 3 4 5

Expected return (%) 11.0 9.0 6.5 15.0 13.0

Beta 1.20 0.85 0.55 1.40 1.25

Daniel would like to minimize the beta of the stock portfolio (calculated using a weighted average of the amounts put into the different stocks) while maintaining an expected return of at least 11%. Since future conditions may change, Daniel has decided that no more than 35% of the portfolio should be invested in any one stock.

(a) Formulate this as a linear program. (Hint: Define each variables as the proportion of the total investment that would be put in that stock. Include a constraint that restricts the sum of these vari- ables to be 1.)

(b) Solve this problem. What are the expected return and beta for this portfolio?

8-23 (Airline fuel problem) Coast-to-Coast Airlines is investigating the possibility of reducing the cost of fuel purchases by taking advantage of lower fuel costs in certain cities. Since fuel purchases represent a sub- stantial portion of operating expenses for an airline, it is important that these costs be carefully monitored. However, fuel adds weight to an airplane, and, con- sequently, excess fuel raises the cost of getting from one city to another. In evaluating one particular flight rotation, a plane begins in Atlanta, flies from Atlanta to Los Angeles, from Los Angeles to Houston, from Houston to New Orleans, and from New Orleans to Atlanta. When the plane arrives in Atlanta, the flight rotation is said to have been completed, and then it starts again. Thus, the fuel on board when the flight arrived in Atlanta must be taken into consideration when the flight begins. Along each leg of this route, there is a minimum and a maximum amount of fuel that may be carried. This and additional information are provided in the table on the following page.

The regular fuel consumption is based on the plane carrying the minimum amount of fuel. If more than this is carried, the amount of fuel consumed is higher. Specifically, for each 1,000 gallons of fuel above the minimum, 5% (or 50 gallons per 1,000 gallons of extra fuel) is lost due to excess fuel consump- tion. For example, if 25,000 gallons of fuel are on board when the plane takes off from Atlanta, the fuel consumed on this route will be 12 + 0.05 = 12.05 thousand gallons. If 26,000 gallons are on board, the fuel consumed will be increased by 0.05 thousand, for a total of 12.1 thousand gallons.

Formulate this as an LP problem to minimize the cost. How many gallons should be purchased in each city? What is the total cost of this?

M08_REND3161_13_AIE_C08.indd 317 27/10/16 2:31 PM

318  CHAPTER 8 • LinEAR PRogRAmming APPLiCATionS

LEG

MINIMUM FUEL REQUIRED (1,000 GAL.)

MAXIMUM FUEL ALLOWED (1,000 GAL.)

REGULAR FUEL CONSUMPTION

(1,000 GAL.) FUEL PRICE PER

GALLON

Atlanta–Los Angeles 24 36 12 $4.15

Los Angeles–Houston 15 23 7 $4.25

Houston–New Orleans 9 17 3 $4.10

New Orleans–Atlanta 11 20 5 $4.18

Data for Problem 8.23

Case Study

Cable & Moore With the company expanding into several new markets in the coming months, Cable & Moore was anticipating a large in- crease in sales revenue. The future looked bright for this pro- vider of television, telephone, and Internet services. However, management of Cable & Moore was well aware of the impor- tance of customer service in new markets. If customers had problems with new service and could not quickly and efficiently have their problems solved, demand would quickly erode, and it might take years to recover from the bad publicity. Therefore, management was adamant that there be enough well-trained customer service representatives to handle the calls from new customers and from potential customers.

Based on experience in other markets, the anticipated number of phone calls to customer service was projected. Given the aver- age call-length, the number of hours of customer-service time from April to August was projected and is shown in the table below.

MONTH APRIL MAY JUNE JULY AUGUST

Hours needed 21,600 24,600 27,200 28,200 29,700

Through experience, management knew that training a new em- ployee well was essential. Each new employee was put through a 1-month training program and was assigned to an existing em- ployee for an entire month. Normally, an existing employee would work 160 hours per month. However, when an employee was assigned to perform training of a new hire, the productive work hours for that employee dropped to 80 hours per month.

During the training period, the trainee was paid $2,000 for the month. At the end of that time, the monthly salary increased to the standard salary for a regular customer service representa- tive, which is $3,000 per month. In the past, the company lost about 5% of the trained customer service representatives per month due to attrition. While the company is looking to im- prove upon this, for the next several months it is anticipated that this will continue. There will be 150 trained employees at the beginning of April. Management of the company would like to develop a schedule for hiring new employees so that there are sufficient customer service representatives to meet the demand, but this is to be done at the lowest possible cost.

Discussion Question 1. Develop a schedule for hiring new employees. What is the

total cost of this schedule? 2. Discuss any limitations that exist for this solution.

3. How would the schedule change if the attrition rate could be lowered to 3% per month instead of 5%? What would be the impact on the cost?

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 8-24 to 8-28.

Internet Homework Problems

Bibliography

See the Bibliography at the end of Chapter 7.

See out Internet home page, at www.pearsonhighered.com/render, for this additional case study: Chase Manhattan Bank. This case is about scheduling employees at a bank.

Internet Case Studies

M08_REND3161_13_AIE_C08.indd 318 27/10/16 2:31 PM

 319

Transportation, Assignment, and Network Models

9 CHAPTER

Chapter 8 provided examples of a number of managerial problems that could be modeled using linear programming (LP), and this chapter will provide even more such examples. However, all of the problems in this chapter can be modeled as networks as well as linear programs. The use of networks helps in visualizing and understanding the managerial problem. These models include the transportation problem, the transshipment problem, the assignment problem, the maximal-flow problem, the shortest-route problem, and the minimal-spanning tree problem. The use of linear programming software will be the primary means of solving these problems in this chapter. However, to take advantage of the unique structure of some of these problems, specialized algorithms have been developed to solve very large problems more quickly and efficiently. These algorithms are presented on the Companion Website for this text- book in Module 8.

The basic transportation problem is concerned with finding the best (usually least-cost) way to distribute goods from sources, such as factories, to final destinations, such as retail outlets. If there are intermediate points, such as regional distribution centers, where the items must go before being shipped to the final destination, then the transportation problem becomes a transshipment problem. The assignment problem involves finding the best (usually least-cost) way to assign individuals or pieces of equipment to projects or jobs on a one-to-one basis. In other words, each person is assigned to only one job, and each job only needs one person assigned to it.

The maximal-flow technique finds the maximum flow of any quantity or substance through a network. This technique can determine, for example, the maximum number of vehicles (cars,

9.4 Use LP to model and solve shortest route problems.

9.5 Solve minimal-spanning tree problems.

9.1 Construct LP problems for the transportation, assignment, and transshipment models.

9.2 Solve facility location and other application problems with transportation models.

9.3 Use LP to model and solve maximal-flow problems.

After completing this chapter, students will be able to:

LEARNING OBJECTIVES

M09_REND3161_13_AIE_C09.indd 319 27/10/16 2:29 PM

320  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

trucks, and so forth) that can go through a network of roads from one location to another. The shortest-route technique can find the shortest path through a network. For example, this tech- nique can find the shortest route from one city to another through a network of roads. The minimal-spanning tree technique determines the path through the network that connects all the points while minimizing total distance. When the points represent houses in a subdivi- sion, the minimal-spanning tree technique can be used to determine how to connect all of the houses to electrical power, water systems, and so on, in a way that minimizes the total distance or length of power lines or water pipes.

While there are many different types of examples in this chapter, some terminology is com- mon to all of the network models. The points on the network are referred to as nodes and the lines on the network that connect these nodes are called arcs. Typically nodes are presented as circles, although sometimes squares or rectangles are used for the nodes.

9.1 The Transportation Problem

The transportation problem deals with the distribution of goods from several points of supply (origins or sources) to a number of points of demand (destinations). Usually, we are given a capacity (supply) of goods at each source, a requirement (demand) for goods at each destination, and the shipping cost per unit from each source to each destination. An example is shown in Figure 9.1. The objective of such a problem is to schedule shipments so that total transportation costs are minimized. At times, production costs are also included.

Transportation models can also be used when a firm is trying to decide where to locate a new facility. Before opening a new warehouse, factory, or sales office, it is good practice to con- sider a number of alternative sites. Good financial decisions concerning the facility location also attempt to minimize total transportation and production costs for the entire system.

Linear Program for the Transportation Example The Executive Furniture Corporation is faced with the transportation problem shown in Figure 9.1. The company would like to minimize the transportation costs while meeting the demand at each destination and not exceeding the supply at each source. In formulating this as a linear program, there are three supply constraints (one for each source) and three demand constraints (one for each destination). The decisions to be made involve the number of units to ship on each route, so there is one decision variable for each arc (arrow) in the network. Let

Xij = number of units shipped from source i to destination j

The circles in the networks are called nodes. The lines connecting them are called arcs.

improving Package delivery

TNT Express is one of the world’s largest delivery companies. The 77,000 employees of the company handle over 4 million packages each week, using about 30,000 trucks and other road vehicles and about 50 aircraft. Trying to maintain a high level of customer service while keeping costs low through efficient opera- tions is a daunting task. In 2005, the director of operations for TNT Express turned to the use of operations research models to improve the road network of deliveries in Italy. A decrease in costs of over 6% caused the company to incorporate the use of optimi- zation models into every aspect of its supply chain.

Several initiatives were developed to improve the com- pany’s supply chain. The Global Optimization (GO) Academy was established to teach employees the principles of optimiza- tion. Communities of practice (CoPs) were developed, and key employees met three times a year to discuss and share their best practices with their suppliers and academia members. In

addition to developing optimization models and improving ef- ficiency, the company taught employees the basic concepts of operations management and management science so that ev- eryone would recognize opportunities for improvement through the use of these techniques.

The result of TNT Express implementing these practices was a cost savings of 207 million euros from 2008 to 2011. Other benefits include the reduction of CO2 emissions from the compa- ny’s vehicles by 283 million kilograms, improved networking with other employees of the company, and a feeling of empowerment as workers now feel they can obtain support from colleagues out- side their own operating units or even outside their own country. Optimization models truly delivered for TNT Express.

Source: Based on H. Fleuren, C. Goossens, M. Hendricks, M.-L. Lombard, and J. Poppelaars, “Supply Chain Wide Optimization at TNT Express,” Inter- faces 43, 1 (January/February 2013): 5–20, © Trevor S. Hale.

IN ACTION

M09_REND3161_13_AIE_C09.indd 320 27/10/16 2:29 PM

9.1 THE TRAnSPoRTATion PRobLEm  321

where

i = 1, 2, 3, with 1 = Des Moines, 2 = Evansville, and 3 = Fort Lauderdale j = 1, 2, 3, with 1 = Albuquerque, 2 = Boston, and 3 = Cleveland

The LP formulation is

Minimize total cost = 5X11 + 4X12 + 3X13 + 8X21 + 4X22 + 3X23 + 9X31 + 7X32 + 5X33

subject to

X11 + X12 + X13 … 100 1Des Moines supply2 X21 + X22 + X23 … 300 1Evansville supply2 X31 + X32 + X33 … 300 1Fort Lauderdale supply2 X11 + X21 + X31 = 300 1Albuquerque demand2 X12 + X22 + X32 = 200 1Boston demand2 X13 + X23 + X33 = 200 1Cleveland demand2

Xij Ú 0 for all i and j

The solution is found using computer software, and the optimal shipping schedule is the following:

100 units from Des Moines to Albuquerque

200 units from Evansville to Boston

100 units from Evansville to Cleveland

200 units from Ft. Lauderdale to Albuquerque

100 units from Ft. Lauderdale to Cleveland

The total cost is $3,900. The following section will illustrate how this solution was found.

Solving Transportation Problems Using Computer Software The solution to this transportation problem modeled as an LP problem could be found by using Solver in Excel 2016, as illustrated in Chapter 7; by using QM for Windows; or by using Excel

FIGURE 9.1 network Representation of a Transportation Problem, with Costs, demands, and Supplies

Supply Demand

Source Destination

Des Moines (Source 1)100 300

$5

$4

$3

$8

$4

$3

$9

$7

$5

300 200

300 200

Evansville (Source 2)

Albuquerque (Destination 1)

Boston (Destination 2)

Fort Lauderdale (Source 3)

Cleveland (Destination 3)

M09_REND3161_13_AIE_C09.indd 321 27/10/16 2:30 PM

322  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

QM in Excel 2016. When using Excel 2016 and Solver, the constraints could be entered in rows, as discussed in Chapter 7. However, the special structure for this problem allows for an easier and more intuitive input in Excel 2016 with Solver, and Excel QM will be used for this example to illustrate this.

Program 9.1 provides the input data and the solution for this example. Click the Excel QM tab and select the Alphabetical menu from the Excel QM ribbon. When the menu appears, scroll down and select Transportation. In the input window that opens, enter the number of Or- igins or sources (3 in this example) and the number of Destinations (3 in this example), select Minimize, and click OK. A worksheet appears and you enter the costs, supplies, and demands shown in the data table. Then click the Data tab, select Solver from the Data ribbon, and click Solve in the Solver input window. You do not have to write any formulas or change any of the parameters.

A General LP Model for Transportation Problems In this example, there were sources and destinations. The LP had 3 * 3 = 9 variables and 3 + 3 = 6 constraints. In general, for a transportation problem with m sources and n destina- tions, the number of variables is mn, and the number of constraints is m + n. For example, if there are 5 (i.e., m = 5) constraints and 8 (i.e., n = 8) variables, the linear program would have 5182 = 40 variables and 5 + 8 = 13 constraints.

The use of the double subscripts on the variables makes the general form of the linear pro- gram for a transportation problem with m sources and n destinations easy to express. Let

xij = number of units shipped from source i to destination j cij = cost of one unit from source i to destination j si = supply at source i dj = demand at destination j

The linear programming model is

Minimize cost = a n

j=1 a

m

i=1 cij xij

subject to

a n

j=1 xij … si i = 1, 2, c, m

a m

i=1 xij = dj j = 1, 2, c, n

xij Ú 0 for all i and j

The number of variables and constraints for a typical transportation problem can be found from the number of sources and destinations.

From the Excel QM ribbon, select Menu (Alphabetical or By Chapter). Select Transportation from the drop-down menu, and then input 3 Origins (sources) and 3 Destinations.

The solution is shown here.

Fill in the table with the costs, supplies, and demands.

From the Data tab, select Solver and then click Solve.

PROGRAM 9.1 Executive Furniture Corporation Solution in Excel 2016 Using Excel Qm

M09_REND3161_13_AIE_C09.indd 322 27/10/16 2:30 PM

9.1 THE TRAnSPoRTATion PRobLEm  323

Facility Location Analysis The transportation method has proved to be especially useful in helping a firm decide where to locate a new factory or warehouse. Since a new location is an issue of major financial impor- tance to a company, several alternative locations must ordinarily be considered and evaluated. Even though a wide variety of subjective factors is considered, including quality of labor sup- ply, presence of labor unions, community attitude and appearance, utilities, and recreational and educational facilities for employees, a final decision also involves minimizing total shipping and production costs. This means that each alternative facility location should be analyzed within the framework of one overall distribution system.

To determine which of two locations should be selected for a new production facility, linear programming models will be developed for two transportation problems—one for each location. (If three or more locations were being considered, a transportation problem modeled as a linear programming model would be developed for each of these.) The existing sources and destina- tions will be used in each of these, and one new source will be included as well. This will find the minimum cost for the distribution system if that one source is added to the system. This will be repeated for the second source, and the minimum costs for these two problems will be com- pared to find which one is better. This will be illustrated in the following example.

The Hardgrave Machine Company produces computer components at its plants in Cincin- nati, Salt Lake City, and Pittsburgh. These plants have not been able to keep up with demand for orders at Hardgrave’s four warehouses in Detroit, Dallas, New York, and Los Angeles. As a result, the firm has decided to build a new plant to expand its productive capacity. The two sites being considered are Seattle and Birmingham; both cities are attractive in terms of labor supply, municipal services, and ease of factory financing.

Table 9.1 presents the production costs and output requirements for each of the three existing plants, demand at each of the four warehouses, and estimated production costs of the new pro- posed plants. Transportation costs from each plant to each warehouse are summarized in Table 9.2.

The important question that Hardgrave now faces is this: Which of the new locations will yield the lower cost for the firm in combination with the existing plants and warehouses? Note that the cost of each individual plant-to-warehouse route is found by adding the shipping costs (in the body of Table 9.2) to the respective unit production costs (from Table 9.1). Thus, the to- tal production plus shipping cost of one computer component from Cincinnati to Detroit is $73 ($25 for shipping plus $48 for production).

Locating a new facility within one overall distribution system is aided by the transportation method.

TO FROM DETROIT DALLAS NEW YORK

LOS ANGELES

CINCINNATI $25 $55 $40 $60

SALT LAKE CITY 35 30 50 40

PITTSBURGH 36 45 26 66

SEATTLE 60 38 65 27

BIRMINGHAM 35 30 41 50

TABLE 9.2 Hardgrave’s Shipping Costs

ESTIMATED PRODUCTION COST PER UNIT AT PROPOSED PLANTS

Seattle $53

Birmingham $49

WAREHOUSE

MONTHLY DEMAND (UNITS)

PRODUCTION PLANT

MONTHLY SUPPLY

COST TO PRODUCE ONE UNIT ($)

Detroit 10,000 Cincinnati 15,000 48

Dallas 12,000 Salt Lake City 6,000 50

New York 15,000 Pittsburgh 14,000 52

Los Angeles 9,000 35,000

46,000

Supply needed from new plant = 46,000 - 35,000 = 11,000 units per month

TABLE 9.1 Hardgrave’s demand and Supply data

M09_REND3161_13_AIE_C09.indd 323 27/10/16 2:30 PM

324  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

The use of transportation models to minimize the cost of shipping from a number of sources to a number of destinations was first proposed in 1941. This study, called “The Distribu- tion of a Product from Several Sources to Numerous Localities,” was written by F. L. Hitchcock. Six years later, T. C. Koopmans independently produced the second major contribution, a

report titled “Optimum Utilization of the Transportation System.” In 1953, A. Charnes and W. W. Cooper developed the stepping- stone method, an algorithm discussed in detail in this chapter. The modified-distribution (MODI) method, a quicker computa- tional approach, came about in 1955.

Source: Trevor S. Hale.

How Transportation models StartedHISTORY

To determine which new plant (Seattle or Birmingham) shows the lower total systemwide cost of distribution and production, we solve two transportation problems—one for each of the two possible combinations. The first linear program will be for the Seattle location, and the second will be for Birmingham. To evaluate the Seattle location, the variables are defined as follows:

Xij = number of units shipped from source i to destination j

where

i = 1, 2, 3, 4 with 1 = Cincinnati, 2 = Salt Lake City, 3 = Pittsburgh, and 4 = Seattle j = 1, 2, 3, 4 with 1 = Detroit, 2 = Dallas, 3 = New York, and 4 = Los Angeles

The linear program formulation has an objective of minimizing the total cost—transportation cost plus production cost.

Minimize total cost = 73X11 + 103X12 + 88X13 + 108X14 + 85X21 + 80X22 + 100X23 + 90X24 + 88X31 + 97X32 + 78X33 + 118X34 + 113X41 + 91X42 + 118X43 + 80X44

subject to

X11 + X21 + X31 + X41 = 10,000 (Detroit demand) X12 + X22 + X32 + X42 = 12,000 (Dallas demand) X13 + X23 + X33 + X43 = 15,000 (New York demand) X14 + X24 + X34 + X44 = 9,000 (Los Angeles demand) X11 + X12 + X13 + X14 … 15,000 (Cincinnati supply) X21 + X22 + X23 + X24 … 6,000 (Salt Lake City supply) X31 + X32 + X33 + X34 … 14,000 (Pittsburgh supply) X41 + X42 + X43 + X44 … 11,000 (Seattle supply) All variables Ú 0

When this is solved, the total cost with the Seattle location is found to be $3,704,000. For the second transportation model, the linear program is modified and the Birmingham

location replaces the Seattle location. Now in the linear program, i = 4 represents Birmingham instead of Seattle, the last constraint is for Birmingham instead of Seattle, and the costs for these four variables in the objective function are now 84 for X41, 79 for X42, 90 for X43, and 99 for X44. Nothing else in the problem changes. When this is solved, the total cost with the Birmingham location is $3,741,000. Thus, the Seattle location results in an overall lower cost and would be the preferred location based on cost.

Excel QM will be used for this example, and Program 9.2 provides the solution for the problem with the Seattle location. To enter the problem, click the Excel QM tab, select the Al- phabetical menu from the Excel QM ribbon, and when the menu appears, scroll down to select Transportation. An input window opens and you simply enter the number of Origins (sources) and the number of Destinations, select Minimize, and click OK. A worksheet is then developed and you enter the numbers for the costs, the supplies, and the demands shown in the Data table in Program 9.2. Once all inputs have been entered, click the Data tab, select Solver, and click Solve from the Solver input window. No other input for Solver is necessary. The shipments for

We solve two transportation problems to find the new plant with lower system cost.

M09_REND3161_13_AIE_C09.indd 324 27/10/16 2:30 PM

9.2 THE ASSignmEnT PRobLEm  325

From the Excel QM ribbon, select Menu (Alphabetical or By Chapter). Select Transportation from the drop- down menu, and then input 4 Origins (sources) and 4 Destinations.

After entering the costs, click the Data tabs and select Solver. Then click Solve.

The cost is here.

Fill in the table with the costs, supplies, and demands.

The cost is here.

PROGRAM 9.2 Facility Location (Seattle) Solution in Excel 2016 Using Excel Qm

PROGRAM 9.3 Facility Location (birmingham) Solution in Excel 2016 Using Excel Qm

the optimal solution are shown in the Shipments table. Program 9.3 provides the Excel QM re- sults for the Birmingham location.

9.2 The Assignment Problem

The assignment problem refers to the class of LP problem that involves determining the most efficient assignment of people to projects, salespeople to territories, auditors to companies for audits, contracts to bidders, jobs to machines, heavy equipment (such as cranes) to construction jobs, and so on. The objective is most often to minimize total cost or total time of performing the tasks at hand. One important characteristic of assignment problems is that only one job or worker is assigned to one machine or project.

Figure 9.2 provides a network representation of an assignment problem. Notice that this network is very similar to the network for the transportation problem. In fact, an assignment problem may be viewed as a special type of transportation problem in which the supply at each source and the demand at each destination must equal one. Each person may be assigned to only one job or project, and each job needs only one person.

Linear Program for Assignment Example The network in Figure 9.2 represents a problem faced by the Fix-It Shop, which has just received three new repair projects that must be completed quickly: (1) a radio, (2) a toaster oven, and (3) a coffee table. Three repair persons, each with different talents, are available to do

An assignment problem is equivalent to a transportation problem with each supply and each demand equal to 1.

M09_REND3161_13_AIE_C09.indd 325 27/10/16 2:30 PM

326  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

the jobs. The shop owner estimates the cost in wages if one worker is assigned to each of the three projects. The costs differ due to the talents of each worker. The owner wishes to assign the jobs so that total cost is minimized, each job has one person assigned to it, and each person is assigned to only one job.

In formulating this as a linear program, the general LP form of the transportation problem can be used. In defining the variables, let

Xij = e1 if person i is assigned to project j0 otherwise where

i = 1, 2, 3, with 1 = Adams, 2 = Brown, and 3 = Cooper j = 1, 2, 3, with 1 = Project 1, 2 = Project 2, and 3 = Project 3

The LP formulation is

Minimize total cost = 11X11 + 14X12 + 6X13 + 8X21 + 10X22 + 11X23 + 9X31 + 12X32 + 7X33

subject to

X11 + X12 + X13 … 1 X21 + X22 + X23 … 1 X31 + X32 + X33 … 1 X11 + X21 + X31 = 1 X12 + X22 + X32 = 1 X13 + X23 + X33 = 1

xij = 0 or 1 for all i and j

The solution is shown in Program 9.4. From this, x13 = 1, so Adams is assigned to project 3; x22 = 1, so Brown is assigned to project 2; and x31 = 1, so Cooper is assigned to project 1. All other variables are 0. The total cost is $25.

Special variables 0 and 1 are used with the assignment model.

Supply Demand

Person Project

Adams (Source 1)1 1

$11

$14

$6

$8

$10

$11

$9

$12

$7

1 1

1 1

Brown (Source 2)

Project 1 (Destination 1)

Project 2 (Destination 2)

Cooper (Source 3)

Project 3 (Destination 3)

FIGURE 9.2 Example of an Assignment Problem in a Transportation network Format

M09_REND3161_13_AIE_C09.indd 326 27/10/16 2:30 PM

9.3 THE TRAnSSHiPmEnT PRobLEm  327

From the Excel QM ribbon, select Menu (Alphabetical or By Chapter). Select Assignment from the drop- down menu, and then input the number of assignments (3).

After entering the costs, click the Data tab and select Solver. Then click Solve.

The cost is here.

Fill in the table with the costs, supplies, and demands.

This problem could be input into Excel, Excel QM, or QM for Windows as a linear pro- gram, or it could be input as a transportation problem with all supplies and demands equal to 1. However, both Excel QM and QM for Windows have a module for this assignment problem. In Excel QM, from the Alphabetical menu on the Excel QM ribbon, select Assignment. The initial- ization window opens, and you enter the number of assignments and select Minimization. Click OK, and a worksheet opens for you to enter the costs as shown in the Data table in Program 9.4. Then select Solver from the Data ribbon, and click Solve in the Solver input window. The results are shown in Program 9.4.

The software for the assignment problem assumes that the problem is balanced, which means that the number of sources (or people) is equal to the number of destinations (or jobs). If the problem is not balanced, a dummy source or a dummy destination is added to the problem to make it balanced. In some cases, more than one dummy source or destination is used. Because this dummy is not a real assignment and indicates only which source or destination will be lack- ing an assignment, all costs are zero. Solved Problem 9.2 at the end of the chapter illustrates this.

In the assignment problem, the variables are required to be either 0 or 1. Due to the special structure of this problem, with the constraint coefficients as 0 or 1 and all the right-hand-side values equal to 1, the problem can be solved as a linear program. The solution to such a problem (if one exists) will always have the variables equal to 0 or 1. There are other types of problems where the use of such 0 and 1 variables is desired, but the solution to such problems using nor- mal linear programming methods will not necessarily have only zeros and ones. In such cases, special methods must be used to force the variables to be either 0 or 1, and this will be discussed as a special type of integer programming problem in Chapter 10.

9.3 The Transshipment Problem

In a transportation problem, if the items being transported must go through an intermediate point (called a transshipment point) before reaching a final destination, the problem is called a trans- shipment problem. For example, a company might be manufacturing a product at several fac- tories to be shipped to a set of regional distribution centers. From these centers, the items are shipped to retail outlets that are the final destinations. Figure 9.3 provides a network represen- tation of a transshipment problem. In this example, there are two sources, two transshipment points, and three final destinations.

Linear Program for Transshipment Example Frosty Machines manufactures snow blowers in factories located in Toronto and Detroit. These are shipped to the regional distribution centers in Chicago and Buffalo, and then delivered to the supply houses in New York, Philadelphia, and St. Louis, as illustrated in Figure 9.3.

The available supplies at the factories, the demands at the final destinations, and shipping costs are shown in the Table 9.3. Notice that snow blowers may not be shipped directly from Toronto or Detroit to any of the final destinations but must first go to either Chicago or Buffalo. This is why Chicago and Buffalo are listed not only as destinations but also as sources.

A transportation problem with intermediate points is a transshipment problem.

PROGRAM 9.4 mr. Fix-it Shop Assignment Solution in Excel 2016 Using Excel Qm

M09_REND3161_13_AIE_C09.indd 327 27/10/16 2:30 PM

328  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

Frosty would like to minimize the transportation costs associated with shipping sufficient snow blowers to meet the demands at the three destinations while not exceeding the supply at each factory. Thus, we have supply and demand constraints similar to the transportation problem, but we also have one constraint for each transshipment point, indicating that anything shipped from these to a final destination must have been shipped into that transshipment point from one of the sources. The verbal statement of this problem would be as follows:

Minimize cost subject to

1. The number of units shipped from Toronto is not more than 800 2. The number of units shipped from Detroit is not more than 700 3. The number of units shipped to New York is 450 4. The number of units shipped to Philadelphia is 350 5. The number of units shipped to St. Louis is 300 6. The number of units shipped out of Chicago is equal to the number of units shipped

into Chicago 7. The number of units shipped out of Buffalo is equal to the number of units shipped into Buffalo

The decision variables should represent the number of units shipped from each source to each transshipment point and the number of units shipped from each transshipment point to each final destination, as these are the decisions management must make. The decision variables are

Xij = number of units shipped from location (node) i to location (node) j

where

i = 1, 2, 3, 4 j = 3, 4, 5, 6, 7

Special transshipment constraints are used in the linear program.

Supply

800

450

350

300

700

DemandSource

Toronto (Node 1)

Detroit (Node 2)

Chicago (Node 3)

New York City (Node 5)

Philadelphia (Node 6)

St. Louis (Node 7)

Buƒalo (Node 4)

DestinationTransshipment Point FIGURE 9.3 network Representation of a Transshipment Example

TO

FROM CHICAGO BUFFALO NEW YORK

CITY PHILADELPHIA ST.

LOUIS SUPPLY

Toronto $4 $7 — — — 800

Detroit $5 $7 — — — 700

Chicago — — $6 $4 $5 —

Buffalo — — $2 $3 $4 —

Demand — — 450 350 300

TABLE 9.3 Frosty machines Transshipment data

M09_REND3161_13_AIE_C09.indd 328 27/10/16 2:30 PM

9.3 THE TRAnSSHiPmEnT PRobLEm  329

The numbers are the nodes shown in Figure 9.3, and there is one variable for each arc (route) in the figure.

The LP model is

Minimize total cost = 4X13 + 7X14 + 5X23 + 7X24 + 6X35 + 4X36 + 5X37 + 2X45 + 3X46 + 4X47

subject to

X13 + X14 … 800 (Supply at Toronto [node 1]) X23 + X24 … 700 (Supply at Detroit [node 2]) X35 + X45 = 450 (Demand at New York City [node 5]) X36 + X46 = 350 (Demand at Philadelphia [node 6]) X37 + X47 = 300 (Demand at St. Louis [node 7]) X13 + X23 = X35 + X36 + X37 (Shipping through Chicago [node 3]) X14 + X24 = X45 + X46 + X47 (Shipping through Buffalo [node 4])

xij Ú 0 for all i and j

Defining the Problem The sugar market had been in a crisis for over a decade. Low sugar prices and decreasing demand added to an already unstable market. Sugar producers needed to minimize costs. They targeted the largest unit cost in the manufacturing of raw sugar—namely, sugar cane transportation costs.

Developing a Model To solve this problem, researchers developed a linear program with some integer decision variables (e.g., number of trucks) and some continuous (linear) variables and linear decision variables (e.g., tons of sugar cane).

Acquiring Input Data In developing the model, the inputs gathered were the operating demands of the sugar mills involved, the capacities of the intermediary storage facilities, the per-unit transportation costs per route, and the pro- duction capacities of the various sugar cane fields.

Testing the Solution The researchers involved first tested a small version of their mathematical formulation using a spreadsheet. After noting encouraging results, they implemented the full version of their model on a large-capacity computer. Results were obtained for this very large and complex model (on the order of 40,000 decision variables and 10,000 constraints) in just a few milliseconds.

Analyzing the Results The solution obtained contained information on the quantity of cane delivered to each sugar mill, the field where cane should be collected, the means of transportation (by truck, by train, etc.), and several other vital operational attributes.

Implementing the Results While solving such large problems with some integer variables might have been impossible only a decade ago, solving these problems now is certainly possible. To implement these results, the researchers worked to develop a more user-friendly interface so that managers would have no problem using this model to help make decisions.

Source: Based on E. L. Milan, S. M. Fernandez, and L. M. Pla Aragones, “Sugar Cane Transportation in Cuba: A Case Study,” European Journal of Operational Research 174, 1 (2006): 374–386, © Trevor S. Hale.

MODELING IN THE REAL WORLD

moving Sugar Cane in Cuba

Defining the Problem

Developing a Model

Acquiring Input Data

Testing the Solution

Analyzing the Results

Implementing the Results

M09_REND3161_13_AIE_C09.indd 329 27/10/16 2:30 PM

330  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

The solution found using Solver in Excel 2016 and Excel QM is shown in Program 9.5. The total cost is $9,550 by shipping 650 units from Toronto to Chicago, 150 units from Toronto to Buffalo, 300 units from Detroit to Buffalo, 350 units from Chicago to Philadelphia, 300 units from Chicago to St. Louis, and 450 units from Buffalo to New York City.

9.4 Maximal-Flow Problem

The maximal-flow problem involves determining the maximum amount of material that can flow from one point (the source) to another (the sink) in a network. Examples of this type of problem include determining the maximum number of cars that can flow through a highway system, the maximum amount of a liquid that can flow through a series of pipes, the maxi- mum number of cell-phone calls that can pass through a series of cell towers, and the maximum amount of data that can flow through a computer network.

To find the maximal flow from the source or start of a network to the sink or finish of that network, two common methods are used: linear programming and the maximal-flow technique. We will begin by presenting an example and demonstrating the use of linear programming for this type of problem.

Example Waukesha, a small town in Wisconsin, is in the process of developing a road system for the downtown area. Bill Blackstone, one of the city planners, would like to determine the maximum number of cars that can flow through the town from west to east. The road network is shown in Figure 9.4. The streets are indicated by their respective arcs. For example, the arc from node 1 to node 2 is arc 1–2. The arc in the reverse direction (from node 2 to node 1) is arc 2–1. The num- bers by the nodes indicate the maximum number of cars (in hundreds of cars per hour) that can flow from the various nodes along the respective arcs. The maximum flow along arc 1–2 is 3, while the flow along arc 1–3 is 10. The city planners would like to know the capacity of the cur- rent road system in the west-to-east direction.

The maximal-flow problem can be modeled as a linear program. This type of problem may be viewed as a special type of transshipment problem with one source, one destination, and a number of transshipment points. The number shipped through the network would be called the flow. The objective is to maximize the flow through the network. There are two types of con- straints. The first set of constraints restricts the amount of flow on any arc to the capacity of that arc. The second set of constraints indicates that the amount of flow out of a node will equal the amount of flow into that node. These are the same as the transshipment constraints in the trans- shipment problem.

From the Excel QM ribbon, select Menu (Alphabetical or By Chapter). Select Linear Programming from the drop-down menu. Then fill in the number of constraints (7) and the number of variables (10), select Minimize, and click OK.

The solution is here.

After entering the data, click the Data tab and select Solver. Then click Solve.

When the worksheet opens, fill in the table with the coefficients for the objective function and the constraints. Type over the “,” symbol to change it.

PROGRAM 9.5 Excel Qm Solution to Frosty machines Transshipment Problem in Excel 2016

M09_REND3161_13_AIE_C09.indd 330 27/10/16 2:30 PM

9.4 mAximAL-FLow PRobLEm  331

The variables are defined as:

Xij = flow from node i to node j

One additional arc will be added to the network, and this arc will go from the sink (node 6) back to the source (node 1). The flow along this arc represents the total flow in the network. The first set of constraints in the linear program consists of the maximum flows along each arc in each direction. These flows are grouped together based on the node from which the flow originates. The last six constraints are restricting the flow out of a node to equal the flow into a node (i.e., the flow into a node minus the flow out of that node must equal zero). The linear program is

Maximize flow = X61

subject to

X12 … 3 X13 … 10 X14 … 2 (Capacities for arcs from node 1) X21 … 1 X24 … 1 X26 … 2 (Capacities for arcs from node 2) X34 … 3 X35 … 2 (Capacities for arcs from node 3) X42 … 1 X43 … 1 X46 … 1 (Capacities for arcs from node 4) X53 … 1 X56 … 1 (Capacities for arcs from node 5) X62 … 2 X64 … 1 (Capacities for arcs from node 6)

1X21 + X612 - 1X12 + X13 + X142 = 0 (Flows into = flows out of node 1) 1X12 + X42 + X622 - 1X21 + X24 + X262 = 0 (Flows into = flows out of node 2)

1X13 + X43 + X532 - 1X34 + X352 = 0 (Flows into = flows out of node 3) 1X14 + X24 + X34 + X642 - 1X42 + X43 + X462 = 0 (Flows into = flows out of node 4)

1X352 - 1X56 + X532 = 0 (Flows into = flows out of node 5) 1X26 + X46 + X562 - 1X61 + X62 + X642 = 0 (Flows into = flows out of node 6)

Xij Ú 0

The problem is now ready to solve using the linear programming module QM for Windows or using Solver in Excel 2016. However, Program 9.6 illustrates the solution found using Excel QM. To obtain this, from the Excel QM ribbon, select Network Analysis as LP and then choose Maximal Flow. In the initialization window that opens, you enter the number of nodes (6) and click OK. A worksheet is developed as seen in Program 9.6. Enter the data for the arc capacities, and then click Solver from the Data ribbon. Click Solve from the Solver input window, and the results (flows) are put into the worksheet.

3

2 10

1 2

1

0 1 1

1

0 3 2

1 6

1 2

0 West Point

Capacity in Hundreds of Cars per Hour

East Point

1

2

6

5

4

3

FIGURE 9.4 Road network for waukesha maximal-Flow Example

M09_REND3161_13_AIE_C09.indd 331 27/10/16 2:30 PM

332  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

9.5 Shortest-Route Problem

The objective of the shortest-route problem is to find the shortest distance from one location to another. In a network, this often involves determining the shortest route from one node to each of the other nodes. This problem can be modeled as a linear program with 0 and 1 variables, or it could be modeled and solved using a specialized algorithm that is presented in Module 8. The following example is a typical shortest-route problem.

Every day, Ray Design, Inc., must transport beds, chairs, and other furniture items from the factory to the warehouse. This involves going through several cities, and there are no direct interstate highways to make the delivery easier. Ray would like to find the route with the shortest distance. The road network is shown in Figure 9.5.

The shortest-route problem may be viewed as a special type of transshipment problem with one source having a supply of 1, one destination having a demand of 1, and a number of transshipment points. This type of problem can be modeled as a linear program with 0 and 1 variables. Ray is try- ing to decide which of the routes (arcs) to choose to be a part of the delivery system. Therefore, the decision variables will indicate whether a particular arc is chosen to be a part of the route taken. For the Ray Design, Inc., example, the objective is to minimize the total distance (cost) from the start to the finish. The constraints will specify that the number of units (either 0 or 1) going into a node must equal the number going out of that node. The variables are defined as

Xij = 1 if arc from node i to node j is selected and Xij = 0 otherwise

Since the starting point is node 1, we will not include variables going from node 2 or 3 back to node 1. Similarly, since node 6 is the final destination, we will not include any variable that

PROGRAM 9.6 waukesha maximal-Flow Solution in Excel 2016 Using Excel Qm

From the Excel QM ribbon, select Menu (Alphabetical or By Chapter). Select Network Analysis as LP and Maximal Flow from the drop-down menu. Then fill in the number of branches or arcs (6). Click OK.

When the worksheet opens, enter the flows in the table.

This is entered already and is used by Excel QM.

After entering the data, click the Data tab and select Solver. Then click Solve.

100

100 200

100

100

50 150

200

40

Plant

Warehouse

1

2

3

4

5

6

FIGURE 9.5 Roads from Ray’s Plant to warehouse

M09_REND3161_13_AIE_C09.indd 332 27/10/16 2:30 PM

9.5 SHoRTEST-RoUTE PRobLEm  333

starts at node 6. Viewing this as a transshipment problem, the origin node (node 1) must have one unit shipped out of it. This would be

X12 + X13 = 1

The final destination node (node 6) must have one unit shipped to it, and this is written as

X46 + X56 = 1

Each intermediate node will have a constraint requiring the amount coming into the node to equal the amount going out of that node (i.e., the flow into a node minus the flow out of a node must equal zero). For node 2, this would be

X12 + X32 = X23 + X24 + X25

This simplifies to

X12 + X32 - X23 - X24 - X25 = 0

The other constraints would be constructed in a similar manner. The linear program is

Minimize distance = 100X12 + 200X13 + 50X23 + 50X32 + 200X24 + 200X42 + 100X25 + 100X52 + 40X35 + 40X53 + 150X45 + 150X54 + 100X46 + 100X56

subject to

X12 + X13 = 1 Node 1 X12 + X32 - X23 - X24 - X25 = 0 Node 2

X13 + X23 - X32 - X35 = 0 Node 3 X24 + X54 - X42 - X45 - X46 = 0 Node 4

X25 + X35 + X45 - X52 - X53 - X54 - X56 = 0 Node 5 X46 + X56 = 1 Node 6

All variables = 0 or 1

While this problem could be solved as a linear program, using Excel QM is the easiest way to obtain the solutions. To solve a shortest-route problem, from the Excel QM ribbon, select Net- work Analysis as LP and then choose Shortest Path. In the initialization window that opens, you enter the number of nodes (6) and click OK. A worksheet is developed, as seen in Program 9.7.

From the Excel QM ribbon, select Menu (Alphabetical or By Chapter). Select Network Analysis as LP and Shortest Route from the drop-down menu. Then fill in the number of branches or arcs (6). Click OK.

After entering the data, click the Data tab and select Solver. Then click Solve.

When the worksheet opens, enter the distances in the table.

PROGRAM 9.7 Ray designs, inc., Solution in Excel 2016 Using Excel Qm

M09_REND3161_13_AIE_C09.indd 333 27/10/16 2:30 PM

334  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

Enter the data for the distances, and then click Solver from the Data ribbon. Click Solve from the Solver input window, and the results (flows) are put into the worksheet. From Program 9.7, we see that

X12 = X23 = X35 = X56 = 1

So Ray will travel from city 1 to city 2, then to city 3, then to city 5, and then to the final destination, city 6. The total distance is 290 miles.

9.6 Minimal-Spanning Tree Problem

The minimal-spanning tree problem involves connecting all points of a network together while minimizing the total distance of these connections. Some common examples include telephone or cable companies trying to connect houses in a neighborhood, and network administrators try- ing to minimize the cable required to hardwire computers in a network. While a linear program- ming model can be used for this problem, it has certain properties that make this quite complex. Fortunately, there is another method for finding the solution to such a problem that is very easy, and that will be presented here. The minimal-spanning tree technique problem will be presented using the following example.

Let us consider the Lauderdale Construction Company, which is currently developing a lux- urious housing project in Panama City Beach, Florida. Melvin Lauderdale, owner and president of Lauderdale Construction, must determine the least expensive way to provide water and power to each house. The network of houses is shown in Figure 9.6.

As seen in Figure 9.6, there are eight houses on the gulf. The distance between each house in hundreds of feet is shown on the network. The distance between houses 1 and 2, for example, is 300 feet. (The number 3 is between nodes 1 and 2.) Now, the minimal-spanning tree technique is used to determine the minimal distance that can be used to connect all of the nodes. The ap- proach is outlined as follows.

Steps for the Minimal-Spanning Tree Technique

1. Select any node in the network. 2. Connect this node to the nearest node that minimizes the total distance. 3. Considering all of the nodes that are now connected, find and connect the nearest node that

is not connected. If there is a tie for the nearest node, select one arbitrarily. A tie suggests there may be more than one optimal solution.

4. Repeat the third step until all nodes are connected.

Now, we solve the network in Figure 9.6 for Melvin Lauderdale. We start by arbitrarily se- lecting node 1. Since the nearest node is the third node at a distance of 2 (200 feet), we connect node 1 to node 3. This is shown in Figure 9.7.

Considering nodes 1 and 3, we look for the next-nearest node. This is node 4, which is the closest to node 3. The distance is 2 (200 feet). Again, we connect these nodes, as shown in Fig- ure 9.8(a).

We continue, looking for the nearest unconnected node to nodes 1, 3, and 4. This is node 2 or node 6, each at a distance of 3 from node 3. We will pick node 2 and connect it to node 3, as shown in Figure 9.8(b).

We continue the process. There is another tie for the next iteration with a minimum distance of 3 (node 2–node 5 and node 3–node 6). You should note that we do not consider node 1–node 2 with a distance of 3 because both nodes 1 and 2 are already connected. We arbitrarily select node 5 and connect it to node 2, as shown in Figure 9.9(a). The next-nearest node is node 6, and we connect it to node 3, as shown in Figure 9.9(b).

At this stage, we have only two unconnected nodes left. Node 8 is the nearest to node 6, with a distance of 1, and we connect it, as shown in Figure 9.9(c). Then the remaining node, node 7, is connected to node 8, as shown in Figure 9.9(d).

There are four steps for the minimal-spanning tree problem.

Step 1: We select node 1. Step 2: We connect node 1 to node 3.

Step 3: We connect the next-nearest node.

Step 4: We repeat the process.

M09_REND3161_13_AIE_C09.indd 334 27/10/16 2:30 PM

9.6 minimAL-SPAnning TREE PRobLEm  335

3

3

3

2

5 2

6

3

1

2

7

5

4

Gulf

1

2 5

7

8

6

3

4

FIGURE 9.6 network for Lauderdale Construction

3

3

3

2

5 2

6

3

1

2

7

5

4

Gulf

1

2 5

7

8

6

3

4

FIGURE 9.7 First iteration for Lauderdale Construction

3

3

3

2

5 2

6

3

1

27

5

4

( ) Second Iterationa

1

2 5

7

8

6

3

4

3

3

3

2

5 2

6

3

1

27

5

4

( ) Third Iterationb

1

2 5

7

8

6

3

4

FIGURE 9.8 Second and Third iterations for Lauderdale Construction

M09_REND3161_13_AIE_C09.indd 335 27/10/16 2:30 PM

336  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

3

3

3

2

5 2

6

3

1

2

7

5

4

( ) Fourth Iterationa

1

2 5

7

8

6

3

4

3

3

3

2

5 2

6

3

1

2

7

5

4

( ) Fifth Iterationb

1

2 5

7

8

6

3

4

3

3

3

2

5 2

6

3

1

2

7

5

4

( ) Sixth Iterationc

1

2 5

7

8

6

3

4

3

3

3

2

5 2

6

3

1

2

7

5

4

( ) Seventh Iterationd

1

2 5

7

8

6

3

4

FIGURE 9.9 Last Four iterations for Lauderdale Construction

The final solution can be seen in the seventh and final iteration. Nodes 1, 2, 4, and 6 are all connected to node 3. Node 2 is connected to node 5. Node 6 is connected to node 8, and node 8 is connected to node 7. All of the nodes are now connected. The total distance is found by adding the distances for the arcs used in the spanning tree. In this example, the distance is 2 + 2 + 3 + 3 + 3 + 1 + 2 = 16 (or 1,600 feet). This is summarized in Table 9.4.

The minimal-spanning tree problem can be solved with Excel QM or QM for Windows. Using Excel QM in Excel 2016, select the Alphabetical menu from the ribbon, scroll down

TABLE 9.4 Summary of Steps in Lauderdale Construction minimal-Spanning Tree Problem

STEP CONNECTED

NODES UNCONNECTED

NODES

CLOSEST UNCONNECTED

NODES ARC

SELECTED ARC

LENGTH TOTAL

DISTANCE

1 1 2, 3, 4, 5, 6, 7, 8 3 1–3 2 2

2 1, 3 2, 4, 5, 6, 7, 8 4 3–4 2 4

3 1, 3, 4 2, 5, 6, 7, 8 2 or 6 3–2 3 7

4 1, 2, 3, 4 5, 6, 7, 8 5 or 6 2–5 3 10

5 1, 2, 3, 4, 5 6, 7, 8 6 3–6 3 13

6 1, 2, 3, 4, 5, 6 7, 8 8 6–8 1 14

7 1, 2, 3, 4, 5, 6, 8 7 7 8–7 2 16

M09_REND3161_13_AIE_C09.indd 336 27/10/16 2:30 PM

SUmmARY  337

to Network Analysis, and select Minimal Spanning Tree. In the spreadsheet initialization window that opens, enter the number of branches or arcs (13 in this example). When the worksheet opens, for each arc enter the beginning node, the ending node, and the distance between the two (i.e., the length of the arc), as shown in Program 9.8. Click the Solve button that appears in the spreadsheet, and the solution will be displayed, as in Program 9.8. The problem could also be solved in QM for Windows by selecting the Networks module and entering a new problem as a minimal-spanning tree. The input is very similar to the Excel QM input.

From the Excel QM ribbon, select Menu (Alphabetical or By Chapter). Select Network Analysis and Minimum Spanning Tree from the drop-down menu. Then fill in the number of branches or arcs (13). Click OK.

When the worksheet opens, enter the starting node, ending node, and flow for each arc.

After entering the data, click Solve.

PROGRAM 9.8 Lauderdale Construction minimal-Spanning Tree Example

In this chapter, we explored several problems that are com- monly modeled as networks, with nodes and arcs representing a variety of situations. These problems were the transportation, assignment, transshipment, maximal-flow, shortest-route, and minimal-spanning tree problems. Linear programming models

were developed for all but the minimal-spanning tree, high- lighting the fact that linear programming can be beneficial in many different areas. Computer software that takes advantage of the special structure of these problems can help solve large network problems very efficiently.

Summary

Facility Location Leads to improved Supply-Chain Reliability

S upply chains are, at their physical level, interconnected networks of delivery routes (roads, bridges, shipping lanes, etc.) that lead from multiple sources (warehouses, factories, refineries, etc.), to multiple destinations (stores, outlets, other warehouses, etc.) along which products and commodities travel. In most cases, the allocation of par- ticular destinations to particular sources is known and fairly constant.

Researchers, in trying to help companies plan for emergen- cies, have investigated the problem of supply-chain disruption. What would happen if one of the sources were to catastrophi- cally fail due to an earthquake, a tornado, or worse? The answer

lies in the area of the facility location problem: Which ware- houses should deliver to which stores? Analyzing the transpor- tation problem with current sources eliminated one by one, the analysts were able to measure the impact of such disruption. The researchers concluded that “backup assignments” of warehouses to stores should be planned ahead of time to help mitigate the impact of possible catastrophes. It always pays to plan ahead!

Source: Based on L. Snyder and M. Daskin, “Reliability Models for Facility Location: The Expected Failure Cost Case,” Transportation Science 39, 3 (2005): 400–416, © Trevor S. Hale.

IN ACTION

M09_REND3161_13_AIE_C09.indd 337 27/10/16 2:30 PM

338  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

Glossary

Arc A line in a network that may represent a path or route. An arc or branch is used to connect the nodes in a network.

Assignment Problem A special type of network problem in which costs are minimized while assigning people to jobs (or other such assignments) on a one-to-one basis.

Destination A demand location in a transportation problem. Facility Location Analysis An application of the transpor-

tation method to help a firm decide where to locate a new factory, warehouse, or other facility.

Maximal-Flow Problem A network problem with the objec- tive of determining the maximum amount that may flow from the origin or source to the final destination or sink.

Minimal-Spanning Tree Problem A network problem with the objective of minimizing the total distance or cost required to connect all the nodes in the network.

Node A point in a network, often represented by a circle, that is at the beginning or end of an arc.

Shortest-Route Problem A network problem with the objective of finding the shortest distance from one location to another while passing through intermediate nodes.

Sink The final node or destination in a network. Source An origin or supply location in a transportation prob-

lem. Also, the origin or beginning node in a maximal-flow network.

Transportation Problem A specific case of LP concerned with scheduling shipments from sources to destinations so that total transportation costs are minimized.

Solved Problems

Solved Problem 9-1 Don Yale, president of Hardrock Concrete Company, has plants in three locations and is currently working on three major construction projects, located at different sites. The shipping cost per truck- load of concrete, plant capacities, and project requirements are provided in the accompanying table. Formulate Hardrock’s transportation problem as a linear program and solve using software.

TO FROM

PROJECT A

PROJECT B

PROJECT C

PLANT CAPACITIES

PLANT 1 $10 $4 $11 70

PLANT 2 $12 $5 $8 50

PLANT 3 9 $7 $6 30

PROJECT REQUIREMENTS

40 50 60 150

Solution Define the variables as

Xij = number of units shipped from Plant i to Project j where

i = 1, 2, 3 with 1 = Plant 1, 2 = Plant 2, and 3 = Plant 3

j = 1, 2, 3 with 1 = Project A, 2 = Project B, and 3 = Project C

The linear program formulation is

Minimize total cost = 10X11 + 4X12 + 11X13 + 12X21 + 5X22 + 8X23 + 9X31 + 7X32 + 6X33

subject to

X11 + X21 + X31 = 40 (Project A requirements)

X12 + X22 + X32 = 50 (Project B requirements)

X13 + X23 + X33 = 60 (Project C requirements)

X11 + X12 + X13 … 70 (Plant 1 capacity) X21 + X22 + X23 … 50 (Plant 2 capacity) X31 + X32 + X33 … 30 (Plant 3 capacity)

All variables Ú 0

M09_REND3161_13_AIE_C09.indd 338 27/10/16 2:30 PM

SoLvEd PRobLEmS  339

The computer output found using Excel QM gives the optimal solution. From Plant 1, ship 20 units to Project A and 50 units to Project B. From Plant 2, ship 50 units to Project C. From Plant 3, ship 20 units to Project A and 10 units to Project B. The total cost of this solution is $1,040. While not shown in the computer output, there are alternate optimal solutions to this problem.

Program for Solved Problem 9-1

Solved Problem 9-2 Prentice Hall, Inc., a publisher headquartered in New Jersey, wants to assign three recently hired col- lege graduates—Jones, Smith, and Wilson—to regional sales districts in Omaha, Dallas, and Miami. But the firm also has an opening in New York and would send one of the three there if it were more economical than a move to Omaha, Dallas, or Miami. It will cost $1,000 to relocate Jones to New York, $800 to relocate Smith there, and $1,500 to move Wilson. What is the optimal assignment of personnel to offices?

OFFICE HIREE OMAHA MIAMI DALLAS

JONES $800 $1,100 $1,200

SMITH $500 $1,600 $1,300

WILSON $500 $1,000 $2,300

Because there are three new hires and four offices when New York is included, the problem is not balanced. It is impossible for all four cities to have a person assigned (i.e., there is no feasible solu- tion). Therefore, a dummy source (new hire) is added, and the costs are zero for this dummy. Thus, the variables could be omitted from the objective function, but they are included for the sake of completeness.

Define the variables as

Xij = 1 if new hire i is assigned to office j

where

i = 1, 2, 3, 4 with 1 = Jones, 2 = Smith, 3 = Wilson, and 4 = Dummy hire j = 1, 2, 3, 4 with 1 = Omaha, 2 = Miami, 3 = Dallas, and 4 = New York

M09_REND3161_13_AIE_C09.indd 339 27/10/16 2:30 PM

The linear program formulation is

Minimize total cost = 800X11 + 1100X12 + 1200X13 + 1000X14 + 500X21 + 1600X22 + 1300X23 + 800X24 + 500X31 + 1000X32 + 2300X33 + 1500X34 + 0X41 + 0X42 + 0X43 + 0X44

subject to

X11 + X21 + X31 + X41 … 1 (Omaha office) X12 + X22 + X32 + X42 … 1 (Miami office) X13 + X23 + X33 + X43 … 1 (Dallas office) X14 + X24 + X34 + X44 … 1 (New York office) X11 + X12 + X13 + X14 = 1 (Jones) X21 + X22 + X23 + X24 = 1 (Smith) X31 + X32 + X33 + X34 = 1 (Wilson) X41 + X42 + X43 + X44 = 1 (Dummy hire)

All variables Ú 0

The solution found using Excel QM is shown below, and it provides the optimal solution: Jones is assigned to Miami 1X12 = 12, Smith is assigned to New York 1X24 = 12, Wilson is assigned to Omaha 1X31 = 12, and no one (the dummy) is assigned to Dallas 1X43 = 12. The total cost is $2,400.

Program for Solved Problem 9-2

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. If a transportation problem has 4 sources and 5 destinations, the linear program for this will have

a. 4 variables and 5 constraints. b. 5 variables and 4 constraints. c. 9 variables and 20 constraints. d. 20 variables and 9 constraints.

2. An assignment problem may be viewed as a transportation problem with

a. a cost of $1 for all shipping routes. b. all supplies and demands equal to 1. c. only demand constraints. d. only supply constraints.

340  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

M09_REND3161_13_AIE_C09.indd 340 27/10/16 2:30 PM

diSCUSSion QUESTionS And PRobLEmS  341

3. A company is considering opening one new production facility, and three locations are being considered. For this facility location problem, how many transportation models must be developed and solved?

a. 1 b. 2 c. 3 d. 4

4. Four cranes are being assigned to five construction jobs. One of the jobs will be delayed until one of the cranes becomes available after finishing the first job. An assignment model will be used. To allow specialized software to find a solution to this problem,

a. nothing special must be done to this problem. b. one dummy crane must be used in the model. c. one dummy job must be used in the model. d. both a dummy job and a dummy crane must be used in

the model. 5. Which network model is used to determine how

to connect all points of a network together while minimizing the total distance between them?

a. the assignment model b. the maximal-flow model c. the shortest-route model d. the minimal-spanning tree model

6. In a typical shortest-route model, the objective is to a. minimize the number of nodes in the route. b. minimize the time or distance to get from one point

to another. c. minimize the number of arcs in the route. d. travel through all nodes in the best way possible.

7. A large city is planning for the Olympic Games, which will be coming in a few years. The transportation system is being evaluated to determine what expansion is needed to handle the large number of visitors to the games. Which of the following models would most likely help the city planners determine the capacity of the current system?

a. the transportation model b. the maximal-flow model c. the shortest-route model d. the minimal-spanning tree model

8. The computing center of a large university is installing fiber-optic cables to link fifteen buildings on campus. Which of the following models could be used to determine the least amount of cable required to connect all the buildings?

a. the transportation model b. the maximal-flow model c. the shortest-route model d. the minimal-spanning tree model

Discussion Questions and Problems

Discussion Questions 9-1 Is the transportation model an example of decision

making under certainty or decision making under uncertainty? Why?

9-2 Explain how to determine the number of variables and constraints in a transportation problem when only the number of sources and the number of desti- nations are known.

9-3 Explain what it means for an assignment model to be balanced.

9-4 Explain the purpose of the transshipment constraints in the linear program for a transshipment model.

9-5 Describe a problem that can be solved by using the shortest-route model.

9-6 Explain how the maximal-f low model might be viewed as a transshipment model.

Problems* 9-7 The management of the Executive Furniture Corpo-

ration decided to expand the production capacity at its Des Moines factory and to cut back the produc- tion capacities at its other two factories. It also rec- ognizes a shifting market for its desks and revises the requirements at its three warehouses.

The table on this page provides the requirement at each of the warehouses, the capacity at each of the factories, and the shipping cost per unit to ship from each factory to each warehouse. Find the least-cost way to meet the requirements given the capacity at each factory.

9-8 The Hardrock Concrete Company has plants in three locations and is currently working on three major construction projects, each located at a different site. The shipping cost per truckload of concrete, daily

TO FROM ALBUQUERQUE BOSTON CLEVELAND CAPACITY

DES MOINES $5 $4 $3 300

EVANSVILLE $8 $4 $3 150

FORT LAUDERDALE $9 $7 $5 250

REQUIREMENTS 200 200 300

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M09_REND3161_13_AIE_C09.indd 341 27/10/16 2:30 PM

342  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

plant capacities, and daily project requirements are provided in the table on this page.

Formulate this as a linear program to determine the least-cost way to meet the requirements. Solve using any computer software.

9-9 Hardrock Concrete’s owner has decided to increase the capacity at his smallest plant (see Problem 9.8). Instead of producing 30 loads of concrete per day at plant 3, that plant’s capacity has been doubled to 60 loads. Does this change the schedule developed previously?

9-10 The Saussy Lumber Company ships pine flooring to three building-supply houses from its mills in Pine- ville, Oak Ridge, and Mapletown. Determine the best transportation schedule for the data given in the table on this page.

9-11 The Krampf Lines Railway Company specializes in coal handling. On Friday, April 13, Krampf had empty cars at the following towns in the quantities indicated:

TOWN SUPPLY OF CARS

Morgantown 35

Youngstown 60

Pittsburgh 25

By Monday, April 16, the following towns will need the numbers of coal cars listed:

TOWN DEMAND FOR CARS

Coal Valley 30

Coaltown 45

Coal Junction 25

Coalsburg 20

Using a railway city-to-city distance chart, the dis- patcher constructs a mileage table for the preceding towns. The result is shown in the table on this page. Minimizing total miles over which cars are moved to new locations, compute the best shipment of coal cars.

9-12 An air-conditioning manufacturer produces room air conditioners at plants in Houston, Phoenix, and Memphis. These are sent to regional distributors in Dallas, Atlanta, and Denver. The shipping costs vary, and the company would like to find the least-cost way to meet the demands at each of the distribution centers. Dallas needs to receive 800 air condition- ers per month, Atlanta needs 600, and Denver needs 200. Houston has 850 air conditioners available each month, Phoenix has 650, and Memphis has 300. The shipping cost per unit from Houston to Dallas is $8,

TO FROM PROJECT A PROJECT B PROJECT C CAPACITY

PLANT 1 $10 $4 $11 70

PLANT 2 $12 $5 $ 8 50

PLANT 3 $ 9 $7 $ 6 30

REQUIREMENTS 40 50 60

Table for Problem 9-8

TO FROM

SUPPLY HOUSE 1

SUPPLY HOUSE 2

SUPPLY HOUSE 3

MILL CAPACITY (TONS)

PINEVILLE $3 $3 $2 25

OAK RIDGE $4 $2 $3 40

MAPLETOWN $3 $2 $3 30

SUPPLY-HOUSE DEMAND 30 30 35

Table for Problem 9-10

TO FROM COAL VALLEY COALTOWN COAL JUNCTION COALSBURG

MORGANTOWN 50 30 60 70

YOUNGSTOWN 20 80 10 90

PITTSBURGH 100 40 80 30

Table for Problem 9-11

M09_REND3161_13_AIE_C09.indd 342 27/10/16 2:30 PM

diSCUSSion QUESTionS And PRobLEmS  343

to Atlanta is $12, and to Denver is $10. The shipping cost per unit from Phoenix to Dallas is $10, to Atlanta is $14, and to Denver is $9. The shipping cost per unit from Memphis to Dallas is $11, to Atlanta is $8, and to Denver is $12. How many units should be shipped from each plant to each regional distribution center? What is the total cost for this?

9-13 Finnish Furniture manufactures tables in facilities located in three cities—Reno, Denver, and Pitts- burgh. The tables are then shipped to three retail stores located in Phoenix, Cleveland, and Chicago. Management wishes to develop a distribution sched- ule that will meet the stores’ demands at the lowest possible cost. The shipping cost per unit from each of the sources to each of the destinations is shown in the following table:

TO FROM PHOENIX CLEVELAND CHICAGO

RENO 10 16 19

DENVER 12 14 13

PITTSBURGH 18 12 12

The available supplies are 120 units from Reno, 200 from Denver, and 160 from Pittsburgh. Phoenix has a demand of 140 units, Cleveland has a demand of 160 units, and Chicago has a demand of 180 units. How many units should be shipped from each manu- facturing facility to each of the retail stores if cost is to be minimized? What is the total cost?

9-14 The state of Missouri has three major power-generating companies (A, B, and C). During the months of peak demand, the Missouri Power Authority authorizes these companies to pool their excess supply and to

distribute it to smaller, independent power compa- nies that do not have generators large enough to han- dle the demand. Excess supply is distributed on the basis of cost per kilowatt hour transmitted. The fol- lowing table shows the demand and supply in mil- lions of kilowatt hours and the cost per kilowatt hour of transmitting electric power to four small compa- nies in cities W, X, Y, and Z:

TO FROM

W X Y Z EXCESS SUPPLY

A 12¢ 4¢ 9¢ 5¢ 55

B 8¢ 1¢ 6¢ 6¢ 45

C 1¢ 12¢ 4¢ 7¢ 30

UNFILLED POWER DEMAND 40 20 50 20

Find the least-cost distribution system. 9-15 The three blood banks in Franklin County are coor-

dinated through a central office that facilitates blood delivery to four hospitals in the region. The cost to ship a standard container of blood from each bank to each hospital is shown in the table on this page. Also given are the biweekly number of containers of blood available at each bank and the biweekly num- ber of containers needed at each hospital. How many shipments should be made biweekly from each blood bank to each hospital so that total shipment costs are minimized?

9-16 The B. Hall Real Estate Investment Corporation has identified four small apartment buildings in which it would like to invest. Mrs. Hall has approached three savings and loan companies regarding financ- ing. Because Hall has been a good client in the past

Table for Problem 9-15

TO FROM HOSPITAL 1 HOSPITAL 2 HOSPITAL 3 HOSPITAL 4 SUPPLY

BANK 1 $8 $9 $11 $16 50

BANK 2 12 7 5 8 80

BANK 3 14 10 6 7 120

DEMAND 90 70 40 50

Table for Problem 9-16

PROPERTY (INTEREST RATES) (%)

SAVINGS AND LOAN COMPANY HILL ST. BANKS ST. PARK AVE. DRURY LANE

MAXIMUM CREDIT LINE ($)

FIRST HOMESTEAD 8 8 10 11 80,000

COMMONWEALTH 9 10 12 10 100,000

WASHINGTON FEDERAL 9 11 10 9 120,000

LOAN REQUIRED TO PURCHASE BUILDING

$60,000 $40,000 $130,000 $70,000

M09_REND3161_13_AIE_C09.indd 343 27/10/16 2:30 PM

344  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

and has maintained a high credit rating in the com- munity, each savings and loan company is willing to consider providing all or part of the mortgage loan needed on each property. Each loan officer has set differing interest rates on each property (rates are affected by the neighborhood of the apartment building, condition of the property, and desire by the individual savings and loan to finance various- size buildings), and each loan company has placed a maximum credit ceiling on how much it will lend Hall in total. This information is summarized in the table on the previous page.

Each apartment building is equally attractive as an investment to Hall, so she has decided to pur- chase all four buildings at the lowest total payment of interest. From which savings and loan companies should she borrow to purchase which buildings? More than one savings and loan can finance the same property.

9-17 The J. Mehta Company’s production manager is planning for a series of 1-month production periods for stainless steel sinks. The demand for the next 4 months is as follows:

MONTH DEMAND FOR

STAINLESS STEEL SINKS

1 120

2 160

3 240

4 100

The Mehta firm can normally produce 100 stainless steel sinks in a month. This is done during regular pro- duction hours at a cost of $100 per sink. If demand in any 1 month cannot be satisfied by regular production, the production manager has three other choices: (1) he can produce up to 50 more sinks per month in overtime

but at a cost of $130 per sink; (2) he can purchase a limited number of sinks from a friendly competitor for resale (the maximum number of outside purchases over the 4-month period is 450 sinks, at a cost of $150 each); or (3) he can fill the demand from his on-hand inventory. The inventory carrying cost is $10 per sink per month. Back orders are not permitted. Inventory on hand at the beginning of month 1 is 40 sinks. Set up this “production smoothing” problem as a transporta- tion problem to minimize cost.

9-18 Ashley’s Auto Top Carriers currently maintains plants in Atlanta and Tulsa that supply major dis- tribution centers in Los Angeles and New York. Be- cause of an expanding demand, Ashley has decided to open a third plant and has narrowed the choice to one of two cities—New Orleans or Houston. The pertinent production and distribution costs, as well as the plant capacities and distribution demands, are shown in the table on this page.

Which of the new possible plants should be opened? 9-19 Marc Smith, vice president for operations of HHN,

Inc., a manufacturer of cabinets for telephone switches, is constrained from meeting the 5-year forecast by limited capacity at the existing three plants. These three plants are Waterloo, Pusan, and Bogota. You, as his able assistant, have been told that because of existing capacity constraints and the expanding world market for HHN cabinets, a new plant is to be added to the existing three plants. The real estate department has advised Marc that two sites seem particularly good because of a stable po- litical situation and tolerable exchange rate: Dublin, Ireland, and Fontainebleau, France. Marc suggests that you should be able to take the data on the next page and determine where the fourth plant should be located on the basis of production costs and trans- portation costs. Which location is better?

Data for Problem 9-18

Indicates distribution cost (shipping, handling, storage) will be $6 per carrier if sent from Houston to New York

TO DISTRIBUTION CENTERSFROM

PLANTS

ATLANTA

TULSA

NEW ORLEANS

HOUSTON

FORECAST DEMAND

LOS ANGELES

NEW YORK

NORMAL PRODUCTION

UNIT PRODUCTION

COST ($)

800

$4

$5

$4

$8

1,200

$6

$6

$7

$5

2,000

500

500

900

600 6

5

4

3

Existing plants

Proposed locations

(anticipated)

(anticipated)

M09_REND3161_13_AIE_C09.indd 344 27/10/16 2:30 PM

diSCUSSion QUESTionS And PRobLEmS  345

Data for Problem 9-19

PLANT LOCATION

MARKET AREA WATERLOO PUSAN BOGOTA FONTAINEBLEAU DUBLIN

Canada Demand 4,000

Production cost $50 $30 $40 $50 $45

Transportation cost 10 25 20 25 25

South America Demand 5,000

Production cost 50 30 40 50 45

Transportation cost 20 25 10 30 30

Pacific Rim Demand 10,000

Production cost 50 30 40 50 45

Transportation cost 25 10 25 40 40

Europe Demand 5,000

Production cost 50 30 40 50 45

Transportation cost 25 40 30 10 20

Capacity 8,000 2,000 5,000 9,000 9,000

9-20 Don Levine Corporation is considering adding an additional plant to its three existing facilities in Decatur, Minneapolis, and Carbondale. Both St. Louis and East St. Louis are being considered. Evaluating only the transportation costs per unit, as shown in the tables below, which site is better?

FROM EXISTING PLANTS

TO DECATUR MINNEAPOLIS CARBONDALE DEMAND

Blue Earth $20 $17 $21 250

Ciro 25 27 20 200

Des Moines 22 25 22 350

Capacity 300 200 150

FROM PROPOSED PLANTS

TO EAST ST. LOUIS ST. LOUIS

Blue Earth $29 $27

Ciro $30 $28

Des Moines $30 $31

Capacity 150 150

9-21 Using the data from Problem 9-20 plus the unit pro- duction costs shown in the following table, which locations yield the lowest cost?

LOCATION PRODUCTION COSTS

Decatur $50

Minneapolis 60

Carbondale 70

East St. Louis 40

St. Louis 50

9-22 In a job shop operation, four jobs may be performed on any of four machines. The hours required for each job on each machine are presented in the fol- lowing table. The plant supervisor would like to as- sign jobs so that total time is minimized. Find the best solution. Which assignments should be made?

MACHINE

JOB W X Y Z

A12 10 14 16 13

A15 12 13 15 12

B2 9 12 12 11

B9 14 16 18 16

M09_REND3161_13_AIE_C09.indd 345 27/10/16 2:30 PM

346  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

9-23 Four automobiles have entered Bubba’s Repair Shop for various types of work, ranging from a transmis- sion overhaul to a brake job. The experience level of the mechanics is quite varied, and Bubba would like to minimize the time required to complete all of the jobs. He has estimated the time in minutes for each mechanic to complete each job. Billy can complete job 1 in 400 minutes, job 2 in 90 minutes, job 3 in 60 minutes, and job 4 in 120 minutes. Taylor will finish job 1 in 650 minutes, job 2 in 120 minutes, job 3 in 90 minutes, and job 4 in 180 minutes. Mark will finish job 1 in 480 minutes, job 2 in 120 minutes, job 3 in 80 minutes, and job 4 in 180 minutes. John will complete job 1 in 500 minutes, job 2 in 110 minutes, job 3 in 90 minutes, and job 4 in 150 minutes. Each mechanic should be assigned to just one of these jobs. What is the minimum total time required to finish the four jobs? Who should be assigned to each job?

9-24 Baseball umpiring crews are currently in four cities where three-game series are beginning. When these are finished, the crews are needed to work games in four different cities. The distances (miles) from each of the cities where the crews are currently working to the cities where the new games will begin are shown in the following table:

TO

FROM KANSAS CITY CHICAGO DETROIT TORONTO

Seattle 1,500 1,730 1,940 2,070

Arlington 460 810 1,020 1,270

Oakland 1,500 1,850 2,080 X

Baltimore 960 610 400 330

The X indicates that the crew in Oakland cannot be sent to Toronto. Determine which crew should be sent to each city to minimize the total distance traveled. How many miles will be traveled if these assignments are made?

9-25 In Problem 9-24, the minimum travel distance was found. To see how much better this solution is than the assignments that might have been made, find the assignments that would give the maximum distance traveled. Compare this total distance with the dis- tance found in Problem 9-24.

9-26 Roscoe Davis, chairman of a college’s business depart- ment, has decided to apply a new method in assigning professors to courses next semester. As a criterion for judging who should teach each course, Professor Da- vis reviews the past two years’ teaching evaluations (which were filled out by students). Since each of the four professors taught each of the four courses at one time or another during the two-year period, Davis is able to record a course rating for each instructor. These ratings are shown in the following table. Find the best assignment of professors to courses to maximize the overall teaching rating.

COURSE

PROFESSOR STATISTICS MANAGEMENT FINANCE ECONOMICS

Anderson 90 65 95 40

Sweeney 70 60 80 75

Williams 85 40 80 60

McKinney 55 80 65 55

9-27 The hospital administrator at St. Charles General must appoint head nurses to four newly established depart- ments: urology, cardiology, orthopedics, and obstetrics. In anticipation of this staffing problem, she had hired four nurses: Hawkins, Condriac, Bardot, and Hoolihan. Believing in the quantitative analysis approach to prob- lem solving, the administrator has interviewed each nurse; considered his or her background, personality, and talents; and developed a cost scale ranging from 0 to 100 to be used in the assignment. A 0 for Nurse Bar- dot being assigned to the cardiology unit implies that she would be perfectly suited to that task. A value close to 100, on the other hand, would imply that she is not at all suited to head that unit. The table below gives the complete set of cost figures that the hospital adminis- trator felt represented all possible assignments. Which nurse should be assigned to which unit?

DEPARTMENT

NURSE UROLOGY CARDIOLOGY ORTHOPEDICS OBSTETRICS

Hawkins 28 18 15 75

Condriac 32 48 23 38

Bardot 51 36 24 36

Hoolihan 25 38 55 12

9-28 The Gleaming Company has just developed a new dishwashing liquid and is preparing for a national television promotional campaign. The firm has decided to schedule a series of 1-minute commer- cials during the peak homemaker audience viewing hours of 1 p.m. to 5 p.m. To reach the widest possible audience, Gleaming wants to schedule one commer- cial on each of four networks and to have one com- mercial appear during each of the four 1-hour time blocks. The exposure ratings for each hour, which represent the number of viewers per $1,000 spent, are presented in the following table. Which network should be scheduled each hour to provide the maxi- mum audience exposure?

NETWORK

VIEWING HOURS A B C INDEPENDENT

1–2 p.m. 27.1 18.1 11.3 9.5

2–3 p.m. 18.9 15.5 17.1 10.6

3–4 p.m. 19.2 18.5 9.9 7.7

4–5 p.m. 11.5 21.4 16.8 12.8

M09_REND3161_13_AIE_C09.indd 346 27/10/16 2:30 PM

diSCUSSion QUESTionS And PRobLEmS  347

Data for Problem 9-29

PLANT MEDICAL DEVICES 1 2 3 4 5 6 7 8

C53 $0.10 $0.12 $0.13 $0.11 $0.10 $0.06 $0.16 $0.12

C81 0.05 0.06 0.04 0.08 0.04 0.09 0.06 0.06

D5 0.32 0.40 0.31 0.30 0.42 0.35 0.36 0.49

D44 0.17 0.14 0.19 0.15 0.10 0.16 0.19 0.12

E2 0.06 0.07 0.10 0.05 0.08 0.10 0.11 0.05

E35 0.08 0.10 0.12 0.08 0.09 0.10 0.09 0.06

G99 0.55 0.62 0.61 0.70 0.62 0.63 0.65 0.59

Data for Problem 9-30

CAPACITY SOURCE JAN. FEB. MAR. APR. MAY JUNE JULY AUG.

Labor

Regular time 235 255 290 300 300 290 300 290

Overtime 20 24 26 24 30 28 30 30

Subcontract 12 15 15 17 17 19 19 20

Demand 255 294 321 301 330 320 345 340

9-29 The Patricia Garcia Company is producing seven new medical products. Each of Garcia’s eight plants can add one more product to its current line of medical devices. The unit manufacturing costs for producing the different parts at the eight plants are shown in the table on this page. How should Garcia assign the new products to the plants to minimize manufacturing costs?

9-30 Haifa Instruments, an Israeli producer of portable kidney dialysis units and other medical products, develops an 8-month aggregate plan. Demand and capacity (in units) are forecast as shown in the table on this page.

The cost of producing each dialysis unit is $1,000 on regular time, $1,300 on overtime, and $1,500 on a subcontract. Inventory carrying cost is $100 per unit per month. There is no beginning or ending inventory in stock.

(a) Set up a production plan, using the transporta- tion model, that minimizes cost. What is this plan’s cost?

(b) Through better planning, regular time produc- tion can be set at exactly the same value, 275 per month. Does this alter the solution?

(c) If overtime costs rise from $1,300 to $1,400, does this change your answer to part (a)? What if they fall to $1,200?

9-31 NASA’s astronaut crew currently includes 10 mis- sion specialists who hold a doctoral degree in either

astrophysics or astromedicine. One of these spe- cialists will be assigned to each of the 10 f lights scheduled for the upcoming nine months. Mission specialists are responsible for carrying out scientific and medical experiments in space or for launching, retrieving, or repairing satellites. The chief of as- tronaut personnel, himself a former crew member with three missions under his belt, must decide who should be assigned and trained for each of the very different missions. Clearly, astronauts with medical educations are more suited to missions involving bi- ological or medical experiments, whereas those with engineering- or physics-oriented degrees are best suited to other types of missions. The chief assigns each astronaut a rating on a scale of 1 to 10 for each possible mission, with a 10 being a perfect match for the task at hand and a 1 being a mismatch. Only one specialist is assigned to each flight, and none is reas- signed until all others have flown at least once.

(a) Who should be assigned to which flight to maxi- mize ratings?

(b) NASA has just been notified that Anderson is getting married in February and has been granted a highly sought publicity tour in Europe that month. (He intends to take his wife and let the trip double as a honeymoon.) How does this change the final schedule?

(c) Certo has complained that he was misrated on his January missions. Both ratings should be 10s, he claims to the chief, who agrees and

M09_REND3161_13_AIE_C09.indd 347 27/10/16 2:30 PM

348  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

Data for Problem 9-31

MISSION

ASTRONAUT JAN.

12 JAN.

27 FEB.

5 FEB.

26 MAR.

26 APR.

12 MAY

1 JUN.

9 AUG.

20 SEP. 19

Vincze 9 7 2 1 10 9 8 9 2 6

Veit 8 8 3 4 7 9 7 7 4 4

Anderson 2 1 10 10 1 4 7 6 6 7

Herbert 4 4 10 9 9 9 1 2 3 4

Schatz 10 10 9 9 8 9 1 1 1 1

Plane 1 3 5 7 9 7 10 10 9 2

Certo 9 9 8 8 9 1 1 2 2 9

Moses 3 2 7 6 4 3 9 7 7 9

Brandon 5 4 5 9 10 10 5 4 9 8

Drtina 10 10 9 7 6 7 5 4 8 8

Table for Problem 9-32

AUSTIN/SAN ANTONIO

DALLAS/FT. WORTH

EL PASO/ WEST TEXAS

HOUSTON/ GALVESTON

CORPUS CHRISTI/RIO GRANDE VALLEY

Erica 5 3 2 3 4

Louis 3 4 4 2 2

Maria 4 5 4 3 3

Paul 2 4 3 4 3

Orlando 4 5 3 5 4

recomputes the schedule. Do any changes occur over the schedule set in part (b)?

(d) What are the strengths and weaknesses of this approach to scheduling?

9-32 The XYZ Corporation is expanding its market to include Texas. Each salesperson is assigned to po- tential distributors in one of five different areas. It is anticipated that the salesperson will spend about three to four weeks in the assigned area. A statewide marketing campaign will begin once the product has been delivered to the distributors. The five salespeo- ple who will be assigned to these areas (one person for each area) have rated the areas on the desirability

of the assignment, as shown in the table on this page. The scale is 1 (least desirable) to 5 (most desirable). Which assignments should be made if the total of the ratings is to be maximized?

9-33 Bechtold Construction is in the process of installing power lines to a large housing development. Steve Bechtold wants to minimize the total length of wire used, which will minimize his costs. The housing development is shown as a network on this page. Each house has been numbered, and the distances between houses are given in hundreds of feet. What do you recommend?

1

2

4

5

7

63 8 12

14

9 13

11 10

1

3 7 7 4

5

5 332

2

4 4

5

6

7

4

3

3

6 6

5

Network for Problem 9-33

M09_REND3161_13_AIE_C09.indd 348 27/10/16 2:30 PM

Haozi Liang

diSCUSSion QUESTionS And PRobLEmS  349

9-34 The city of New Berlin is considering making sev- eral of its streets one-way (see the network on this page). Also, due to increased property taxes and an aggressive road development plan, the city of New Berlin has been considering increasing the road capacity of two of its roads. If this is done, traffic along road 1–2 (from node 1 to node 2) will be in- creased from 2 to 5, and traffic capacity along road 1–4 will be increased from 1 to 3. What is the maxi- mum number of cars per hour that can travel from east to west with the current road system? If the in- creases in capacity for roads 1–2 and 1–4 were both made, how would that change the number of cars per hour that can travel from east to west?

9-35 The director of security wants to connect security video cameras to the main control site from five potential trouble locations. Ordinarily, cable would simply be run from each location to the main con- trol site. However, because the environment is po- tentially explosive, the cable must be run in a special conduit that is continually air purged. This conduit is very expensive but large enough to handle five cables (the maximum that might be needed). Use the minimal-spanning tree technique to find a minimum distance route for the conduit between the locations noted in the network below. (Note that it makes no difference which one is the main control site.)

9-36 The road system between the hotel complex on In- ternational Drive (node 1) and Disney World (node 11) in Orlando, Florida, is shown in the network below. The numbers by the nodes represent the traffic flow in hundreds of cars per hour. What is the maximum flow of cars from the hotel complex to Disney World?

9-37 The numbers in the network below represent thou- sands of gallons per hour as they f low through a chemical processing plant. Two terminals in the chemical processing plant, represented by nodes 6

Network for Problem 9-34

8 4

6

3 1

25

7

2

0

0

2

2

2 2 2

0 2

2

2 04

4 3 1

1

2 5

0

1

Network for Problem 9-35

75

65

50 37

53

56

41

48 23

26

1

2

3

4

5

6

Network for Problem 9-36

1

2 6

7

9

10

11

8

3

4

5

4

15

14 2

15

4

1

3

2 0

3

3

1

0

0

0 8

8

8 8 00

08

2

10

10 0

Network for Problem 9-37

1 3

4

2 5

6

7

8

11

13

12 9

10 144

1 1

3

3

2 2

2 1

1 1 4

0

2 2

2 1

6 0

3 1

5 0

6 05

2

1 0

4 41 0

0

3 1 5

1

M09_REND3161_13_AIE_C09.indd 349 27/10/16 2:30 PM

350  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

and 7, have had problems recently, and repairs on these are being considered. However, these repairs would require that these terminals (nodes) be shut down for a significant amount of time, and no mate- rial could flow into or out of these nodes until the re- pairs are finished. What impact would closing these nodes have on the capacity of the network?

9-38 The German towns around the Black Forest are rep- resented by nodes in the network below. The dis- tances between towns are shown in kilometers. Find the shortest route from city 1 to city 16. If flooding in cities 7 and 8 forces closure of all roads leading into or coming out of those cities, how would that impact the shortest route?

(b) After reviewing cable and installation costs, Grey Construction would like to alter the costs for installing cable TV between its houses. The first branches need to be changed. The changes are summarized in the following table. What is the impact on total costs?

BRANCH START NODE

END NODE

COST ($100s)

Branch 1 1 2 5

Branch 2 1 3 1

Branch 3 1 4 1

Branch 4 1 5 1

Branch 5 2 6 7

Branch 6 3 7 5

Branch 7 4 7 7

Branch 8 5 8 4

Branch 9 6 7 1

Branch 10 7 9 6

Branch 11 8 9 2

9-40 In going from Quincy to Old Bainbridge, there are 10 possible roads that George Olin can take. Each road can be considered a branch in the shortest-route problem.

(a) Using the following table, determine the route from Quincy (node 1) to Old Bain- bridge (node 8) that will minimize total dis- tance traveled. All distances are in hundreds of miles.

BRANCH START NODE

END NODE

DISTANCE (100s OF MILES)

Branch 1 1 2 3

Branch 2 1 3 2

Branch 3 2 4 3

Branch 4 3 5 3

Branch 5 4 5 1

Branch 6 4 6 4

Branch 7 5 7 2

Branch 8 6 7 2

Branch 9 6 8 3

Branch 10 7 8 6

(b) George Olin made a mistake in estimating the distances from Quincy to Old Bainbridge. The new distances are given in the following table. What impact does this have on the short- est route from Quincy to Old Bainbridge?

9-39 Grey Construction would like to determine the least expensive way of connecting houses it is building with cable TV. It has identified 11 possible branches or routes that could be used to connect the houses. The cost in hundreds of dollars and the branches are summarized in the following table.

(a) What is the least expensive way to run cable to the houses?

BRANCH START NODE

END NODE

COST ($100s)

Branch 1 1 2 5

Branch 2 1 3 6

Branch 3 1 4 6

Branch 4 1 5 5

Branch 5 2 6 7

Branch 6 3 7 5

Branch 7 4 7 7

Branch 8 5 8 4

Branch 9 6 7 1

Branch 10 7 9 6

Branch 11 8 9 2

Network for Problem 9-38

1 3

4

2

5

6

7

8 12

11

10

9

13

14

15

1615

20

11

8

12

22

12

18

10

10 16

16 12

18

18

20

15

15

25

16

17

14

1810

M09_REND3161_13_AIE_C09.indd 350 27/10/16 2:30 PM

diSCUSSion QUESTionS And PRobLEmS  351

BRANCH START NODE

END NODE

DISTANCE (100s OF MILES)

Branch 1 1 2 3

Branch 2 1 3 2

Branch 3 2 4 3

Branch 4 3 5 1

Branch 5 4 5 1

Branch 6 4 6 4

Branch 7 5 7 2

Branch 8 6 7 2

Branch 9 6 8 3

Branch 10 7 8 6

9-41 South Side Oil and Gas, a new venture in Texas, has developed an oil pipeline network to transport oil from exploration fields to the refinery and other locations. There are 10 pipelines (branches) in the network. The oil flow in hundreds of gallons and the network of pipelines are given in the following table.

(a) What is the maximum that can flow through the network?

BRANCH

START

NODE

END

NODE CAPACITY

REVERSE

CAPACITY FLOW

Branch 1 1 2 10 4 10

Branch 2 1 3 8 2 5

Branch 3 2 4 12 1 10

Branch 4 2 5 6 6 0

Branch 5 3 5 8 1 5

Branch 6 4 6 10 2 10

Branch 7 5 6 10 10 0

Branch 8 5 7 5 5 5

Branch 9 6 8 10 1 10

Branch 10 7 8 10 1 5

(b) South Side Oil and Gas needs to modify its pipe- line network flow patterns. The new data are given in the following table. What impact does this have on the maximum flow through the network?

BRANCH START NODE

END NODE CAPACITY

REVERSE CAPACITY FLOW

Branch 1 1 2 10 4 10

Branch 2 1 3 8 2 5

Branch 3 2 4 12 1 10

Branch 4 2 5 0 0 0

Branch 5 3 5 8 1 5

Branch 6 4 6 10 2 10

Branch 7 5 6 10 10 0

Branch 8 5 7 5 5 5

Branch 9 6 8 10 1 10 Branch 10 7 8 10 1 5

9-42 The following table represents a network with the arcs identified by their starting and ending nodes. Draw the network and use the minimal-spanning tree technique to find the minimum distance required to connect these nodes.

ARC DISTANCE

1–2 12

1–3 8

2–3 7

2–4 10

3–4 9

3–5 8

4–5 8

4–6 11

5–6 9

9-43 Northwest University is in the process of complet- ing a computer bus network that will connect com- puter facilities throughout the university. The prime objective is to string a main cable from one end of the campus to the other (nodes 1–25) through underground conduits. These conduits are shown in the network below; the distance between them is in hundreds of feet. Fortunately, these underground conduits have remaining capacity through which the bus cable can be placed.

(a) Given the network for this problem, how long (in hundreds of feet) is the shortest route from node 1 to node 25?

(b) In addition to the computer bus network, a new phone system is also being planned. The phone system would use the same underground conduits. If the phone system were installed, the follow- ing paths along the conduit would be at capacity and would not be available for the computer bus network: 6–11, 7–12, and 17–20. What changes (if any) would you have to make to the path used for the computer bus if the phone system were installed?

Network for Problem 9-43

1

2

3

4

9

8

7

6

5

10

11

12

13

16

17

15

14 18

19

20

21

24

23

22

25

10 9

10

15

7 6

10

15

17

8 6 20

10 10

8

8

8 5

5

5

5

6

6

6

7

7

20

8

15

M09_REND3161_13_AIE_C09.indd 351 27/10/16 2:30 PM

352  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

(c) The university did decide to install the new phone system before the cable for the computer network. Because of unexpected demand for computer net- working facilities, an additional cable is needed to

connect node 1 to node 25. Unfortunately, the cable for the first or original network has completely used up the capacity along its path. Given this situation, what is the best path for the second network cable?

Andrew–Carter, Inc. (A–C), is a major Canadian producer and distributor of outdoor lighting fixtures. Its fixture is distributed throughout North America and has been in high demand for several years. The company operates three plants that manu- facture the fixture and distribute it to five distribution centers (warehouses).

During the present recession, A–C has seen a major drop in demand for its fixture as the housing market has declined. Based on the forecast of interest rates, the head of operations feels that demand for housing and thus for its product will re- main depressed for the foreseeable future. A–C is considering closing one of its plants, as it is now operating with a fore- casted excess capacity of 34,000 units per week. The forecasted weekly demands for the coming year are

Warehouse 1 9,000 units

Warehouse 2 13,000 units

Warehouse 3 11,000 units

Warehouse 4 15,000 units

Warehouse 5 8,000 units

The plant capacities in units per week are

Plant 1, regular time 27,000 units

Plant 1, on overtime 7,000 units

Plant 2, regular time 20,000 units

Plant 2, on overtime 5,000 units

Plant 3, regular time 25,000 units

Plant 3, on overtime 6,000 units

If A–C shuts down any plants, its weekly costs will change, as fixed costs are lower for a nonoperating plant. Table 9.5 shows production costs at each plant, both variable at regular time and overtime and fixed when operating and shut down. Table 9.6 shows the distribution cost from each plant to each warehouse (distribution center).

Discussion Question 1. Evaluate the various configurations of operating and

closed plants that will meet weekly demand. Determine which configuration minimizes total costs.

2. Discuss the implications of closing a plant.

Source: Professor Emeritus Michael Ballot, ESB, University of the Pacific.

Case Study

Andrew–Carter, Inc.

See our Internet home page, at www.pearsonhighered.com/render, for additional problems, Problems 9-44 through 9-52.

Internet Homework Problems

TABLE 9.5 Andrew–Carter, inc., variable Costs and Fixed Costs per week (Source: Trevor S. Hale)

FIXED COST PER WEEK

PLANT VARIABLE COST OPERATING NOT OPERATING

No. 1, regular time $2.80/unit $14,000 $6,000

No. 1, overtime 3.52

No. 2, regular time 2.78 12,000 5,000

No. 2, overtime 3.48

No. 3, regular time 2.72 15,000 7,500

No. 3, overtime 3.42

M09_REND3161_13_AIE_C09.indd 352 27/10/16 2:30 PM

CASE STUdY  353

TABLE 9.6 Andrew–Carter, inc., distribution Cost per Unit (Source: Trevor S. Hale)

TO DISTRIBUTION CENTER

FROM PLANT W1 W2 W3 W4 W5

No. 1 $0.50 $0.44 $0.49 $0.46 $0.56

No. 2 0.40 0.52 0.50 0.56 0.57

No. 3 0.56 0.53 0.51 0.54 0.35

Case Study

Northeastern Airlines

Northeastern Airlines is a regional airline serving nine cities in the New England states, as well as cities in New York, New Jersey, and Pennsylvania. While nonstop flights are available for some of the routes, connecting flights are often necessary. The network shows the cities served and profit in U.S. dollars per passenger along each of these routes. To service these cit- ies, Northeastern operates a fleet of eighteen 122-passenger Embraer E-195 jets. These jets, which were first introduced by Embraer in late 2004, have helped Northeastern Airlines remain profitable for a number of years. However, in recent years, the profit margins have been falling, and Northeastern is facing the prospect of downsizing its operations.

Management at Northeastern Airlines has considered sev- eral options to reduce cost and increase profitability. Due to Federal Aviation Administration regulations, the company must continue to serve each of the nine cities. How it serves these cities, however, is up to the management at Northeastern. One suggestion has been made to provide fewer direct flights, which

would mean that a city served by Northeastern might have di- rect flights to only one other city. The company plans to hire a marketing analytics consultant to determine how demand would be impacted by longer flights with more connections and to forecast the demand along each of the routes based on a modified flight operations map. Before hiring the consultant, the company would like to determine the most profitable (on a profit-per-passenger basis) way to continue serving all of the cities.

Discussion Question 1. Develop a flight operations map that still serves each of

the nine cities but that maximizes the company’s profit per passenger. (Hint: Find the maximal-spanning tree.)

2. Comment on how the 18 jets should be assigned.

Source: Northeastern Airlines by Faizul Huq © Faizul Huq. Reprinted by per- mission of Faizul Huq.

Northeastern Airlines Service Area (Source: Trevor S. Hale)

15

12

10 14

12

13

18

16

14

State College, PA

Newark, NJ

Hartford, CT Providence, RI

Boston, MA

Nashua, NH

Orono, MEBurlington, VT Syracuse, NY

17

12 9

22

21

M09_REND3161_13_AIE_C09.indd 353 27/10/16 2:30 PM

354  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

Southwestern University (SWU), located in the small town of Stephenville, Texas, is experiencing increased interest in its football program now that a big-name coach has been hired. The increase in season ticket sales for the upcoming season means additional revenues, but it also means increased com- plaints due to the traffic problems associated with the football games. When a new stadium is built, this will only get worse. Marty Starr, SWU’s president, has asked the University Plan- ning Committee to look into this problem.

Based on traffic projections, Dr. Starr would like to have sufficient capacity so that 35,000 cars per hour could travel from the stadium to the interstate highway. To alleviate the an- ticipated traffic problems, some of the current streets leading from the university to the interstate highway are being consid- ered for widening to increase the capacity. The current street ca- pacities with the number of cars (in 1,000s) per hour are shown below. Since the major problem will be after the game, only the flows away from the stadium are indicated. These flows take into account the fact that some streets closest to the stadium are transformed into one-way streets for a short period after each game, with police officers directing traffic.

Alexander Lee, a member of the University Planning Com- mittee, has said that a quick check of the road capacities in the diagram indicates that the total number of cars per hour that may leave the stadium (node 1) is 33,000. The number of cars that may pass through nodes 2, 3, and 4 is 35,000 per hour, and the number of cars that may pass through nodes 5, 6, and 7 is

even greater. Therefore, Dr. Lee has suggested that the current capacity is 33,000 cars per hour. He has also suggested that a recommendation be made to the city manager for expansion of one of the routes from the stadium to the highway to permit an additional 2,000 cars per hour. He recommends expanding whichever route is cheapest. If the city chooses not to expand the roads, it is felt that the traffic problem would be a nuisance but would be manageable.

Based on past experience, it is believed that as long as the street capacity is within 2,500 cars per hour of the number of cars that leave the stadium, the problem is not too severe. How- ever, the severity of the problem grows dramatically for each additional 1,000 cars that are added to the streets.

Discussion Question 1. If there is no expansion, what is the maximum number of

cars that may actually travel from the stadium to the inter- state per hour? Why is this number not equal to 33,000, as Dr. Lee suggested?

2. If the cost of expanding a street were the same for each street, which street(s) would you recommend expanding to increase the capacity to 33,000? Which streets would you recommend expanding to get the total capacity of the system to 35,000 per hour?

Source: Trevor S. Hale.

Case Study

Southwestern University Traffic Problems

Roads from Stadium to interstate (Source: Trevor S. Hale)

1

2

4

3

5

6

7

8

4

Stadium Interstate12 0 6 8

0

0 7

5 55

0 0

0

12 0

80

6

160

15

0

0

M09_REND3161_13_AIE_C09.indd 354 27/10/16 2:30 PM

APPEndix 9.1: USing Qm FoR windowS  355

Bibliography

Adlakha, V., and K. Kowalski. “Simple Algorithm for the Source-Induced Fixed-Charge Transportation Problem,” Journal of the Operational Research Society 55, 12 (2004): 1275–1280.

Bowman, E. “Production Scheduling by the Transportation Method of Linear Programming,” Operations Research 4 (1956): 100–103.

Dawid, Herbert, Johannes Konig, and Christine Strauss. “An Enhanced Rostering Model for Airline Crews,” Computers and Operations Research 28, 7 (June 2001): 671–688.

Hezarkhani, Behzad, and Wieslaw Kubiak. “A Coordinating Contract for Transshipment in a Two-Company Supply Chain,” European Journal of Operational Research 207, 1 (2010): 232–237.

Jacobs, T., B. Smith, and E. Johnson. “Incorporating Network Flow Effects into the Airline Fleet Assignment Process,” Transportation Science 42, 4 (2008): 514–529.

Johnsonbaugh, Richard. Discrete Mathematics, 5th ed. Upper Saddle River, NJ: Prentice Hall, 2001.

Kawatra, R., and D. Bricker. “A Multiperiod Planning Model for the Capacitated Minimal Spanning Tree Problem,” European Journal of Operational Research 121, 2 (2000): 412–419.

Koksalan, Murat, and Haldun Sural. “Efes Beverage Group Makes Location and Distribution Decisions for Its Malt Plants,” Interfaces 29, 2 (March–April, 1999): 89–103.

Liu, Jinming, and Fred Rahbar. “Project Time–Cost Trade-off Optimization by Maximal Flow Theory,” Journal of Construction Engineering & Management 130, 4 (July/August 2004): 607–609.

Liu, Shiang-Tai. “The Total Cost Bounds of the Transportation Problem with Varying Demand and Supply,” Omega 31, 4 (2003): 247–251.

Martello, Silvano. “Jeno Egervary: From the Origins of the Hungarian Algorithm to Satellite Communication,” Central European Journal of Operations Research 18, 1 (2010): 47–58.

McKeown, P., and B. Workman. “A Study in Using Linear Programming to Assign Students to Schools,” Interfaces 6, 4 (August 1976).

Render, B., and R. M. Stair. Introduction to Management Science. Boston: Allyn & Bacon, Inc., 1992.

Sancho, N. G. F. “On the Maximum Expected Flow in a Network,” Journal of the Operational Research Society 39 (May 1988): 481–485.

Sedeño-Noda, Antonio, Carlos González-Martín, and Sergio Alonso. “A Generalization of the Scaling Max-Flow Algorithm,” Computers & Operations Research 31, 13 (November 2004): 2183–2198.

Troutt, M. D., and G. P. White. “Maximal Flow Network Modeling of Produc- tion Bottleneck Problems,” Journal of the Operational Research Society 52, 2 (February 2001): 182–187.

See our Internet home page, at www.pearsonhighered.com/render, for these additional case studies: (1) Northwest General Hospital: This case involves improving the food distribution system in a

hospital to reduce the chances of food getting cold before it is delivered to the patients. (2) Custom Vans, Inc.: This case involves finding the best location for a plant that will manufac-

ture showers used in customized vans. (3) Ranch Development Project: This case involves finding the least-cost way to provide water

and sewer services to homes in a new housing development. (4) Old Oregon Wood Store: This case involves determining the best way to assign employees to

jobs in a small manufacturing company. (5) Binder’s Beverage: This case is about finding the shortest route from a plant to a warehouse.

Internet Case Studies

Appendix 9.1: Using QM for Windows

QM for Windows has both a transportation module and an assignment module in its menu. Both are easy to use in terms of data entry and easy to interpret in terms of output. Program 9.9A shows the input screen for the Executive Furniture trans- portation example. The starting solution technique may be

specified. The results are shown in Program 9.9B. Program 9.10A provides the input screen for the Fix-It Shop assignment example. Simply enter the costs and then click Solve. Program 9.10B gives the solution to this.

M09_REND3161_13_AIE_C09.indd 355 27/10/16 2:30 PM

356  CHAPTER 9 • TRAnSPoRTATion, ASSignmEnT, And nETwoRk modELS

PROGRAM 9.9A Qm for windows input for Executive Furniture Transportation Example

Click New Problem, and when the window opens, fill in the number of sources and destinations. Click OK.

From the Module drop-down menu, select Transportation.

Enter the costs, supplies, and demands.

After entering the data, click Solve.

PROGRAM 9.9B Qm for windows Solution for Executive Furniture Transportation Example

PROGRAM 9.10A Qm for windows input for Fix-it Shop Assignment Example

Click New Problem, and when the window opens, fill in the number of assignments.

From the Module drop-down menu, select Assignment.

After entering the data, click Solve.

Enter the costs.

PROGRAM 9.10B Qm for windows output for the Fix-it Shop Assignment Example

M09_REND3161_13_AIE_C09.indd 356 27/10/16 2:30 PM

 357

Integer Programming, Goal Programming, and Nonlinear Programming

10 CHAPTER

This chapter presents a series of other important mathematical programming models that arise when some of the basic assumptions of LP are made more or less restrictive. For example, one assumption of LP is that decision variables can take on fractional values such as X1 = 0.33, X2 = 1.57, or X3 = 109.4. Yet a large number of business problems can be solved only if variables have integer values. When an airline decides how many Boeing 757s or Boeing 777s to purchase, it can’t place an order for 5.38 aircraft; it must order 4, 5, 6, 7, or some other integer amount. In this chapter, we present the general topic of integer programming, and we specifically consider the use of special variables that must be either 0 or 1.

Another major limitation of LP is that it forces the decision maker to state one objective only. But what if a business has several objectives? Management may indeed want to maximize profit, but it might also want to maximize market share, maintain full employment, and mini- mize costs. Many of these goals can be conflicting and difficult to quantify. South States Power and Light, for example, wants to build a nuclear power plant in Taft, Louisiana. Its objectives are to maximize power generated, reliability, and safety and to minimize the cost of operating the system and the environmental effects on the community. Goal programming is an extension to LP that can permit multiple objectives such as these.

Lastly, linear programming can, of course, be applied only to cases in which the constraints and objective function are linear. Yet in many situations, this is not the case. The price of various products, for example, may be a function of the number of units produced. As more units are produced, the price per unit decreases. Hence, an objective function may read as follows:

Maximize profit = 25X1 - 0.4X12 + 30X2 - 0.5X22

10.3 Formulate and solve goal programming problems using Excel and QM for Windows.

10.4 Formulate and solve nonlinear programming problems using Excel.

10.1 Understand the difference between LP and integer programming.

10.2 Formulate and solve the three types of integer programming problems.

After completing this chapter, students will be able to:

LEARNING OBJECTIVES

Integer programming is the extension of LP that solves problems requiring integer solutions.

Goal programming is the extension of LP that permits more than one objective to be stated.

Nonlinear programming is the case in which objectives or constraints are nonlinear.

M10_REND3161_13_AIE_C10.indd 357 27/10/16 2:29 PM

358  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Because of the squared terms, this is a nonlinear programming problem. Let’s examine each of these extensions of LP—integer, goal, and nonlinear programming—

one at a time.

10.1 Integer Programming

An integer programming model is a model that has constraints and an objective function identical to that formulated by LP. The only difference is that one or more of the decision variables has to take on an integer value in the final solution. There are three types of integer programming problems:

1. Pure integer programming problems are cases in which all variables are required to have integer values.

2. Mixed-integer programming problems are cases in which some, but not all, of the decision variables are required to have integer values.

3. Zero–one integer programming problems are special cases in which all the decision vari- ables must have integer solution values of 0 or 1.

Solving an integer programming problem is much more difficult than solving an LP problem. The solution time required to solve some of these may be excessive even on the fastest computer.

Harrison Electric Company Example of Integer Programming The Harrison Electric Company, located in Chicago’s Old Town area, produces two products popular with home renovators: old-fashioned chandeliers and ceiling fans. Both the chandeliers and the fans require a two-step production process involving wiring and assembly. It takes about 2 hours to wire each chandelier and 3 hours to wire each ceiling fan. Final assembly of the chandeliers and fans requires 6 and 5 hours, respectively. The production capability is such that only 12 hours of wiring time and 30 hours of assembly time are available. If each chandelier produced nets the firm $7 and each fan nets $6, Harrison’s production mix decision can be for- mulated using LP as follows:

Maximize profit = $7X1 + $6X2 subject to 2X1 + 3X2 … 12 1wiring hours2

6X1 + 5X2 … 30 1assembly hours2 X1, X2 Ú 0

where

X1 = number of chandeliers produced X2 = number of ceiling fans produced

With only two variables and two constraints, Harrison’s production planner, Wes Wallace, employed the graphical LP approach (see Figure 10.1) to generate the optimal solution of X1 = 3.75 chandeliers and X2 = 1.5 ceiling fans during the production cycle. Recognizing that the company could not produce and sell a fraction of a product, Wes decided that he was dealing with an integer programming problem.

It seemed to Wes that the simplest approach was to round off the optimal fractional solu- tions for X1 and X2 to integer values of X1 = 4 chandeliers and X2 = 2 ceiling fans. Unfortu- nately, rounding can produce two problems. First, the new integer solution may not be in the feasible region and thus is not a practical answer. This is the case if we round to X1 = 4, X2 = 2. Second, even if we round off to a feasible solution, such as X1 = 4, X2 = 1, it may not be the optimal feasible integer solution.

Listing all feasible solutions and selecting the one with the best objective function value is called the enumeration method. Obviously, this can be quite tedious for even small problems, and it is virtually impossible for large problems, as the number of feasible integer solutions is extremely large.

Table 10.1 lists the entire set of integer-valued solutions to the Harrison Electric problem. By inspecting the right-hand column, we see that the optimal integer solution is

X1 = 5 chandeliers, X2 = 0 ceiling fans, with a profit = $35

Solution values must be whole numbers in integer programming.

There are three types of integer programs: pure integer programming; mixed-integer programming; and 0–1 integer programming.

Although enumeration is feasible for some small integer program- ming problems, it can be difficult or impossible for large ones.

Rounding off is one way to reach integer solution values, but it often does not yield the best solution.

M10_REND3161_13_AIE_C10.indd 358 27/10/16 2:29 PM

10.1 InTEgER PRogRAMMIng  359

6

5

4

3

2

1

0 1 2 3 4 5 6

X2

X1

6X1 + 5X2 # 30

+ = Possible Integer Solution

Optimal LP Solution (X1 = 3.75, X2 = 1.5, Profit = $35.25)

2X1 + 3X2 # 12

FIGURE 10.1 Harrison Electric Problem

CHANDELIERS 1X1 2

CEILING FANS 1X2 2

PROFIT 1$7X1 + $6X2 2

0 0 $0

1 0 7

2 0 14

3 0 21

4 0 28

5 0 35

0 1 6

1 1 13

2 1 20

3 1 27

4 1 34

0 2 12

1 2 19

2 2 26

3 2 33

0 3 18

1 3 25

0 4 24

TABLE 10.1 Integer solutions to the Harrison Electric Company Problem

Optimal solution to integer programming problem

Solution if rounding is used

M10_REND3161_13_AIE_C10.indd 359 27/10/16 2:29 PM

360  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Note that this integer restriction results in a lower profit level than the original optimal LP solu- tion. As a matter of fact, an integer programming solution can never produce a greater profit than the LP solution to the same problem; usually, it means a lesser value.

Using Software to Solve the Harrison Integer Programming Problem QM for Windows and Excel spreadsheets are capable of handling integer programming prob- lems such as the Harrison Electric case. Program 10.1A illustrates the data input to QM for Windows, and Program 10.1B provides the results.

To use QM for Windows, select the Integer & Mixed Integer Programming Results module. Specify the number of constraints and the number of variables. Program 10.1A provides the input screen, with data entered for the Harrison Electric example. The last row of the table al- lows you to classify each variable according to the type of variable (Integer, Real, or 0/1). Once all variables have been correctly specified, click Solve, and you will see the output as shown in Program 10.1B.

Solver in Excel 2016 can also be used to solve this problem, as shown in Program 10.2. The Solver parameters and selections are shown, and the key formulas are displayed. To specify that the variables must be integers, a special constraint is entered in Solver. After opening the Solver Parameters window, select Add, just as you would do to enter other constraints. When the Change Constraint window opens, enter the range containing the solution values, as shown in Program 10.2. Then click the tab to open the drop-down menu and then change the type of constraint to int, for integer. Click OK to return to the Solver Parameters window. Then enter the other constraints, specify the parameters and selections, and click Solve. The solution is shown to be 5 chandeliers and 0 fans, for a profit of $35.

Solver Parameter Inputs and Selections Key Formulas

Set Objective: D5

Copy D5 to D8:D9 By Changing cells: B4:C4

To: Max

Subject to the Constraints:

D8:D9 <= F8:F9

B4:C4 = integer

Solving Method: Simplex LP

☑  Make Variables Non-Negative

Mixed-Integer Programming Problem Example Although the Harrison Electric example was a pure integer problem, there are many situations in which some of the variables are restricted to integers and others are not. The following is an example of such a mixed-integer programming problem.

An important concept to understand is that an integer programming solution can never be better than the solution to the same LP problem. The integer problem is usually worse in terms of higher cost or lower profit.

PROGRAM 10.1A QM for Windows Input Screen for Harrison Electric Problem

M10_REND3161_13_AIE_C10.indd 360 27/10/16 2:29 PM

10.1 InTEgER PRogRAMMIng  361

Bagwell Chemical Company, in Jackson, Mississippi, produces two industrial chemicals. The first product, xyline, must be produced in 50-pound bags; the second, hexall, is sold by the pound in dry bulk and hence can be produced in any quantity. Both xyline and hexall are com- posed of three ingredients—A, B, and C—as follows:

AMOUNT PER 50-POUND BAG OF XYLINE (LB)

AMOUNT PER POUND OF HEXALL (LB)

AMOUNT OF INGREDIENTS AVAILABLE

30 0.5 2,000 lb—ingredient A

18 0.4 800 1b—ingredient B

2 0.1 200 1b—ingredient C

Bagwell sells 50-pound bags of xyline for $85 and hexall in any weight for $1.50 per pound. If we let X = number of 50-pound bags of xyline produced and Y = number of pounds

of hexall (in dry bulk) mixed, Bagwell’s problem can be described with mixed-integer programming:

Maximize profit = $85X + $1.50Y subject to 30X + 0.5Y … 2,000

18X + 0.4Y … 800 2X + 0.1Y … 200

X, Y Ú 0 and X integer

Note that Y represents the bulk weight of hexall and is not required to be integer valued.

USING QM FOR WINDOWS AND EXCEL TO SOLVE BAGWELL’S INTEGER PROGRAMMING MODEL The solution to Bagwell’s problem is to produce 44 bags of xyline and 20 pounds of hexall, yielding a profit of $3,770. (The optimal linear solution, by the way, is to produce 44.444 bags of xyline and 0 pounds of hexall, yielding a profit of $3,777.78.) This is first illustrated in Program 10.3, which uses the Integer & Mixed Integer Programming Results module in QM for Windows. Note that variable X is identified as Integer, while Y is Real in Program 10.3.

In Program 10.4, we use Excel to provide an alternative solution method.

PROGRAM 10.1B QM for Windows Solution Screen for Harrison Electric Problem

PROGRAM 10.2 Excel 2016 Solver Solution for Harrison Electric Problem

M10_REND3161_13_AIE_C10.indd 361 27/10/16 2:29 PM

362  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Defining the Problem The U.S. Postal Service (USPS) operates one of the largest transportation networks in the world, delivering one-fifth of a trillion items every year. The inherent transportation-related problems are, obviously, very large. Nevertheless, USPS’s problem is how to deliver mail in the most cost-efficient manner possible.

Developing a Model A large-scale integer program known as the Highway Corridor Analytical Program (HCAP) was developed to help solve the problem. More specifically, the HCAP solves a Vehicle Routing Problem (VRP) with known pickup and delivery locations. That is, the model takes into account all the different modes of transporta- tion, the capacities inherent in the system, all the pickup locations, and all the delivery locations and then assigns trucks to routes as the (binary) decision variable of interest.

Acquiring Input Data Geographic information system (GIS) data of all the pickup and delivery locations is integrated into the model. Realistic time and distance constraints were placed on the model to prevent drivers from being assigned a pickup in one area and a delivery in an area too far away.

Testing the Solution The model was loaded into a large-scale mathematical programming solver. Several versions and models were tested.

Analyzing the Results Decision makers found improvements in several areas. For example, one of the model outputs resulted in a 20% reduction in redundant trips.

Implementing the Results USPS has already realized over $5 million in transportation savings due to its implementation of the HCAP integer programming optimization model. Efforts are under way to seek out additional efficiencies through the use of HCAP.

Source: Based on A. Pajunas, E. J. Matto, M. Trick, and L. F. Zuluaga, “Optimizing Highway Transportation at the United States Postal Service,” Interfaces 37, 6 (2007): 515–525, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Integer Programming at the USPS

Defining the Problem

Developing a Model

Acquiring Input Data

Testing the Solution

Analyzing the Results

Implementing the Results

Limits are used, and the best solution available after a certain time is presented.

Notice that only X must be integer, while Y may be any real number.

PROGRAM 10.3 QM for Windows Solution for Bagwell Chemical Problem

M10_REND3161_13_AIE_C10.indd 362 27/10/16 2:29 PM

10.2 ModELIng WITH 0–1 (BInARy) VARIABLES  363

Solver Parameter Inputs and Selections Key Formulas

Set Objective: D5

Copy D5 to D8:D10 By Changing cells: B4:C4

To: Max

Subject to the Constraints:

D8:D10 <= F8:F10

B4 = integer

Solving Method: Simplex LP

☑  Make Variables Non-Negative

10.2 Modeling with 0–1 (Binary) Variables

In this section, we demonstrate how 0–1 decision variables can be used to model several diverse situations. Typically, a 0–1 decision variable is assigned a value of 0 if a certain condition is not met and 1 if the condition is met. Another name for a 0–1 decision variable is a binary variable. A com- mon problem of this type, the assignment problem, involves deciding which individuals to assign to a set of jobs. (This is discussed in Chapter 9.) In this assignment problem, a value of 1 indicates a person is assigned to a specific job, and a value of 0 indicates the assignment was not made. We present other types of 0–1 problems to show the wide applicability of this modeling technique.

PROGRAM 10.4 Excel 2016 Solver Solution for Bagwell Chemical Problem

Mixed-Integer Programming in the IBM Supply Chain

The manufacture of semiconductors is a very expensive opera- tion, often requiring investments in the billions of dollars. The IBM Systems and Technology Group has used mixed-integer program- ming (MIP) along with other operations research techniques to plan and optimize its semiconductor supply chain. The business of supply-chain optimization (SCO) has been deemed business critical and must incorporate a variety of planning criteria and constraints.

IBM uses a central planning engine (CPE) to balance the supply chain’s resources against the semiconductor demand. The MIP is an important part of this CPE. The MIP model is a cost-minimization problem with constraints related to material flows and other aspects of the supply chain.

Some of the models involved in SCO include sourcing among multiple plants, the logistics of interplant shipping, and the de- velopment of production plans for all the plants within the sys- tem. They may involve a planning horizon of a few days, a few months, or even a few years, depending on the specific type of

application. While LP is commonly used in supply-chain modeling, it is necessary to use models in which some of the variables are required to be integers. The resulting MIP models are so large (millions of variables) that they cannot be solved with even the fastest computers. Therefore, the IBM Systems and Technology Group developed heuristic methods to solve the optimization models as part of the company’s advanced planning systems.

The benefits of the CPE are many. The on-time deliveries improved by 15%. A 25% to 30% reduction in inventory was observed as a result of the model. The company also observed an improvement in asset allocation of between 2% and 4% of costs. This model allowed “what-if” questions to be quickly answered— a process that was not possible in the past. Strategic planning was also facilitated by the CPE. IBM benefited greatly from the use of MIP in managing the semiconductor supply chain.

Source: Based on Brian T. Denton, John Forrest, and R. John Milne, “IBM Solves a Mixed-Integer Program to Optimize Its Semiconductor Supply Chain,” Interfaces 36, 5 (September–October 2006): 386–399, © Trevor S. Hale.

IN ACTION

M10_REND3161_13_AIE_C10.indd 363 27/10/16 2:29 PM

364  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Capital Budgeting Example A common capital budgeting decision involves selecting from a set of possible projects when budget limitations make it impossible to select all of these. A separate 0–1 variable can be defined for each project. We will see this in the following example.

Quemo Chemical Company is considering three possible improvement projects for its plant: a new catalytic converter, a new software program for controlling operations, and an expansion of the warehouse used for storage. Capital requirements and budget limitations in the next 2 years prevent the firm from undertaking all of these at this time. The net present value (the future value discounted back to the present time) of each project, the capital requirements for each project, and the available funds for the next 2 years are given in Table 10.2.

To formulate this as an integer programming problem, we identify the objective function and the constraints as follows:

Maximize net present value of projects undertaken

subject to Total funds used in year 1 … $20,000 Total funds used in year 2 … $16,000

We define the decision variables as

X1 = b1 if catalytic converter project is funded0 otherwise X2 = b1 if software project is funded0 otherwise X3 = b1 if warehouse expansion project is funded0 otherwise

The mathematical statement of the integer programming problem becomes

Maximize NPV = 25,000X1 + 18,000X2 + 32,000X3 subject to 8,000X1 + 6,000X2 + 12,000X3 … 20,000 7,000X1 + 4,000X2 + 8,000X3 … 16,000

X1, X2, X3 = 0 or 1

PROJECT NET PRESENT VALUE YEAR 1 YEAR 2

Catalytic converter $25,000 $8,000 $7,000

Software $18,000 $6,000 $4,000

Warehouse expansion $32,000 $12,000 $8,000

Available funds $20,000 $16,000

TABLE 10.2 Quemo Chemical Company Information

PROGRAM 10.5 Excel 2016 Solver Solution for Quemo Chemical Problem

M10_REND3161_13_AIE_C10.indd 364 27/10/16 2:29 PM

10.2 ModELIng WITH 0–1 (BInARy) VARIABLES  365

Program 10.5 provides the Solver solution in Excel 2016. You specify the variables to be binary (0–1) by selecting bin from the Change Constraint window. The optimal solution is X1 = 1, X2 = 0, X3 = 1, with an objective function value of 57,000. This means that Quemo should fund the catalytic converter project and the warehouse expansion project but not the new soft- ware project. The net present value of these investments will be $57,000.

Solver Parameter Inputs and Selections Key Formulas

Set Objective: E5

Copy E5 to E8:E9 By Changing cells: B4:D4

To: Max

Subject to the Constraints:

E8:E9 <= G8:G9

B4:D4 = binary

Solving Method: Simplex LP

☑  Make Variables Non-Negative

Limiting the Number of Alternatives Selected One common use of 0–1 variables involves limiting the number of projects or items that are selected from a group. Suppose that in the Quemo Chemical Company example, the company is required to select no more than two of the three projects regardless of the funds available. This could be modeled by adding the following constraint to the problem:

X1 + X2 + X3 … 2

If we wished to force the selection of exactly two of the three projects for funding, the following constraint should be used:

X1 + X2 + X3 = 2

This forces exactly two of the variables to have values of 1, whereas the other variable must have a value of 0.

Dependent Selections At times, the selection of one project depends in some way on the selection of another project. This situation can be modeled with the use of 0–1 variables. Now suppose in the Quemo Chemi- cal problem that the new catalytic converter can be purchased only if the software is also pur- chased. The following constraint would force this to occur:

X1 … X2

or, equivalently,

X1 - X2 … 0

Thus, if the software is not purchased, the value of X2 is 0, and the value of X1 must also be 0 because of this constraint. However, if the software is purchased 1X2 = 12, then it is possible that the catalytic converter could also be purchased 1X1 = 12, although this is not required.

If we wished for the catalytic converter and the software projects to either both be selected or both not be selected, we should use the following constraint:

X1 = X2

or, equivalently,

X1 - X2 = 0

Thus, if either of these variables is equal to 0, the other must also be 0. If either of these is equal to 1, the other must also be 1.

M10_REND3161_13_AIE_C10.indd 365 27/10/16 2:29 PM

366  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Fixed-Charge Problem Example Often businesses are faced with decisions involving a fixed charge that will affect the cost of future operations. Building a new factory or entering into a long-term lease on an existing facility would involve a fixed cost that might vary, depending on the size and the location of the facility. Once a factory is built, the variable production costs will be affected by the labor cost in the particular city where it is located. An example follows.

Sitka Manufacturing is planning to build at least one new plant, and three cities are being considered: Baytown, Texas; Lake Charles, Louisiana; and Mobile, Alabama. Once the plant or plants have been constructed, the company wishes to have sufficient capacity to produce at least 38,000 units each year. The costs associated with the possible locations are given in Table 10.3.

In modeling this as an integer program, the objective function is to minimize the total of the fixed cost and the variable cost. The constraints are as follows: (1) total production capacity is at least 38,000; (2) number of units produced at the Baytown plant is 0 if the plant is not built, and it is no more than 21,000 if the plant is built; (3) number of units produced at the Lake Charles plant is 0 if the plant is not built, and it is no more than 20,000 if the plant is built; (4) number of units produced at the Mobile plant is 0 if the plant is not built, and it is no more than 19,000 if the plant is built.

Then we define the decision variables as

X1 = b1 if factory is built in Baytown0 otherwise X2 = b1 if factory is built in Lake Charles0 otherwise X3 = b1 if factory is built in Mobile0 otherwise X4 = number of units produced at Baytown plant X5 = number of units produced at Lake Charles plant X6 = number of units produced at Mobile plant

The integer programming problem formulation becomes

Minimize cost = 340,000X1 + 270,000X2 + 290,000X3 + 32X4 + 33X5 + 30X6 subject to X4 + X5 + X6 Ú 38,000

X4 - 21,000 X1 … 0 X5 - 20,000 X2 … 0 X6 - 19,000 X3 … 0

X1, X2, X3 = 0 or 1; X4, X5, X6 Ú 0 and integer

SITE

ANNUAL FIXED COST

VARIABLE COST PER UNIT

ANNUAL CAPACITY

Baytown, TX $340,000 $32 21,000

Lake Charles, LA $270,000 $33 20,000

Mobile, AL $290,000 $30 19,000

TABLE 10.3 Fixed and Variable Costs for Sitka Manufacturing

The number of units produced must be 0 if the plant is not built.

PROGRAM 10.6 Excel 2016 Solver Solution for Sitka Manufacturing Problem

M10_REND3161_13_AIE_C10.indd 366 27/10/16 2:29 PM

10.2 ModELIng WITH 0–1 (BInARy) VARIABLES  367

Solver Parameter Inputs and Selections Key Formulas

Set Objective: E5

Copy H5 to H8:H11 By Changing cells: B4:G4

To: Min

Subject to the Constraints:

H8 >= J8

H9:H11 <= J9:J11

B4:D4 = binary

E4:G4 = integer

Solving Method: Simplex LP

☑ Make Variables Non-Negative

Notice that if X1 = 0 (meaning the Baytown plant is not built), then X4 (the number of units produced at the Baytown plant) must also equal zero due to the second constraint. If X1 = 1, then X4 may be any integer value less than or equal to the limit of 21,000. The third and fourth constraints are similarly used to guarantee that no units are produced at the other locations if the plants are not built. The optimal solution, shown in Program 10.6, is

X1 = 0, X2 = 1, X3 = 1, X4 = 0, X5 = 19,000, X6 = 19,000 Objective function value = 1,757,000

This means that factories will be built at Lake Charles and Mobile. Each of these will produce 19,000 units each year, and the total annual cost will be $1,757,000.

Financial Investment Example Numerous financial applications exist with 0–1 variables. A very common type of problem involves selecting from a group of investment opportunities. The following example illustrates this application.

The Houston-based investment firm of Simkin, Simkin, and Steinberg specializes in rec- ommending oil stock portfolios for wealthy clients. One such client has made the following specifications: (1) at least two Texas oil firms must be in the portfolio, (2) no more than one investment can be made in foreign oil companies, and (3) one of the two California oil stocks must be purchased. The client has up to $3 million available for investments and insists on pur- chasing large blocks of shares of each company that he invests in. Table 10.4 describes various stocks that Simkin considers. The objective is to maximize annual return on investment subject to the constraints.

To formulate this as a 0–1 Integer Programming problem, Simkin lets Xi be a 0–1 integer variable, where Xi = 1 if stock i is purchased and Xi = 0 if stock i is not purchased:

STOCK

COMPANY NAME

EXPECTED ANNUAL RETURN ($1,000s)

COST FOR BLOCK OF SHARES ($1,000s)

1 Trans-Texas Oil 50 480

2 British Petroleum 80 540

3 Dutch Shell 90 680

4 Houston Drilling 120 1,000

5 Texas Petroleum 110 700

6 San Diego Oil 40 510

7 California Petro 75 900

TABLE 10.4 oil Investment opportunities

Here is an example of stock portfolio analysis with 0–1 programming.

M10_REND3161_13_AIE_C10.indd 367 27/10/16 2:29 PM

368  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

The shortcoming of mathematical programming techniques such as linear and integer pro- gramming is that their objective function is measured in one dimension only. It’s not possible for LP to have multiple goals unless they are all measured in the same units (such as dollars), a highly unusual situation. An important technique that has been developed to supplement LP is called goal programming.

Goal programming is capable of handling decision problems involving multiple goals. It be- gan with the work of Charnes and Cooper in 1961 and was refined and extended by Lee in 1972 and by Ignizio in 1985 (see the Bibliography).

In typical decision-making situations, the goals set by management can be achieved only at the expense of other goals. It is necessary to establish a hierarchy of importance among these goals so that lower-priority goals are tackled only after higher-priority goals are satisfied. Since it is not always possible to achieve every goal to the extent the decision maker desires, goal pro- gramming attempts to reach a satisfactory level of multiple objectives. This, of course, differs from LP, which tries to find the best possible outcome for a single objective. Nobel Laureate

Solver Parameter Inputs and Selections Key Formulas

Set Objective: I5

Copy I5 to I7:I10 By Changing cells: B4:H4

To: Max

Subject to the Constraints:

I7 >= K7

I8 <= K8

I9 = K9

I10 <= K10

B4:H4 = binary

Solving Method: Simplex LP

☑ Make Variables Non-Negative

Maximize return = 50X1 + 80X2 + 90X3 + 120X4 + 110X5 + 40X6 + 75X7 subject to X1 + X4 + X5 Ú 2 1Texas constraint2

X2 + X3 … 1 1foreign oil constraint2 X6 + X7 = 1 1California constraint2

480X1 + 540X2 + 680X3 + 1,000X4 + 700X5 + 510X6 + 9 00X7 … 3,000 1$3 million limit2

Xi = 0 or 1 for all i

The solution found using Solver in Excel 2016 is shown is Program 10.7.

10.3 Goal Programming

In today’s business environment, profit maximization or cost minimization is not always the only objective that a firm sets forth. Often, maximizing total profit is just one of several goals, including such contradictory objectives as maximizing market share, maintaining full employ- ment, providing quality ecological management, minimizing noise level in the neighborhood, and meeting numerous other noneconomic goals.

Firms usually have more than one goal.

PROGRAM 10.7 Excel 2016 Solver Solution for Financial Investment Problem

Goal programming permits multiple goals.

Goal programming “satisfices,” as opposed to LP, which tries to “optimize.” This means coming as close as possible to reaching goals.

M10_REND3161_13_AIE_C10.indd 368 27/10/16 2:29 PM

10.3 goAL PRogRAMMIng  369

Herbert A. Simon, of Carnegie-Mellon University, states that modern managers may not be able to optimize but may instead have to “satisfice” or “come as close as possible” to reaching goals. This is the case with models such as goal programming.

How, specifically, does goal programming differ from LP? The objective function is the main difference. Instead of trying to maximize or minimize the objective function directly, with goal programming we try to minimize deviations between set goals and what we can actually achieve within the given constraints. In the LP simplex approach, such deviations are called slack and surplus variables. Because the coefficient for each of these in the objective function is zero, slack and surplus variables do not have an impact on the optimal solution. In goal program- ming, the deviational variables are typically the only variables in the objective function, and the objective is to minimize the total of these deviational variables.

When the goal programming model is formulated, the computational algorithm is almost the same as a minimization problem solved by the simplex method.

Example of Goal Programming: Harrison Electric Company Revisited To illustrate the formulation of a goal programming problem, let’s look back at the Harrison Electric Company case presented earlier in this chapter as an integer programming problem. That problem’s LP formulation, you recall, is

Maximize profit = $7X1 + $6X2 subject to 2 X1 + 3X2 … 12 1wiring hours2

6X1 + 5X2 … 30 1assembly hours2 X1, X2 Ú 0

where

X1 = number of chandeliers produced X2 = number of ceiling fans produced

We saw that if Harrison’s management had a single goal—say, profit—LP could be used to find the optimal solution. But let’s assume that the firm is moving to a new location during a particular production period and feels that maximizing profit is not a realistic goal. Management sets a profit level, which would be satisfactory during the adjustment period, of $30. We now have a goal programming problem in which we want to find the production mix that achieves this goal as closely as possible, given the production time constraints. This simple case will pro- vide a good starting point for tackling more-complicated goal programs.

Continental Airlines Saves $40 Million Using CrewSolver

Airlines use state-of-the-art processes and automated tools to develop schedules that maximize profit. These schedules will assign aircraft to specific routes and then schedule pilots and flight attendant crews to each of these aircraft. When disruptions occur, planes and personnel are often left in positions where they are unable to adhere to the next day’s assignments. Airlines face schedule disruptions from a variety of unexpected reasons such as bad weather, mechanical problems, and crew unavailability.

In the 1990s, Houston-based Continental Airlines (now part of United Airlines) began an effort to develop a system of dealing with disruptions in real time. Working with CALEB Technologies, Continen- tal developed the CrewSolver and OptSolver systems (based on 0–1 integer programming models) to produce comprehensive recovery so- lutions for both aircraft and crews. These solutions retain revenue and promote customer satisfaction by reducing flight cancellations and minimizing delays. These crew recovery solutions are low cost while maintaining a high quality of life for pilots and flight attendants.

In late 2000 and throughout 2001, Continental and other air- lines experienced four major disruptions. The first two were due to severe snowstorms in early January and in March 2001. The Houston floods caused by Tropical Storm Allison closed a major hub in June 2001 and left aircraft in locations where they were not scheduled to be. The terrorist attacks of September 11, 2001, left aircraft and crews scattered about and totally disrupted the flight schedules. The CrewSolver system provided a faster and more efficient recovery than had been possible in the past. It is estimated that the CrewSolver system saved approximately $40 million for these major disruptions in 2001. This system also saved additional money and made recovery much easier when there were minor disruptions due to local weather problems at other times throughout the year.

Source: Based on Gang Yu, Michael Arguello, Gao Song, Sandra M. McCowan, and Anna White, “A New Era for Crew Recovery at Continental Airlines,” Interfaces 33, 1 (January–February 2003): 5–22, © Trevor S. Hale.

IN ACTION

The objective function is the main difference between goal programming and LP.

In goal programming, we want to minimize deviational variables, which are the only terms in the objective function.

M10_REND3161_13_AIE_C10.indd 369 27/10/16 2:29 PM

370  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

We first define two deviational variables:

d1 - = underachievement of the profit target

d1 + = overachievement of the profit target

Now we can state the Harrison Electric problem as a single-goal programming model:

Minimize under@or overachievement of profit target = d1- + d1+

subject to $7X1 + $6X2 + d1- - d1+ = $30 1profit goal constraint2 2X1 + 3X2 … 12 1wiring hours constraint2 6X1 + 5X2 … 30 1assembly hours constraint2

X1, X2, d1 -, d1

+ Ú 0

Note that the first constraint states that the profit made, $7X1 + $6X2, plus any underachievement of profit minus any overachievement of profit has to equal the target of $30. For example, if X1 = 3 chan- deliers and X2 = 2 ceiling fans, then $33 profit has been made. This exceeds $30 by $3, so d1 + will be equal to 3. Since the profit goal constraint was overachieved, Harrison did not underachieve, and d1

- will be equal to zero. This problem is now ready for solution by a goal programming algorithm.

If the target profit of $30 is exactly achieved, we see that both d1 + and d1

- are equal to zero. The objective function will also be minimized at zero. If Harrison’s management was concerned only with underachievement of the target goal, how would the objective function change? It would be as follows: minimize underachievement = d1 -. This is also a reasonable goal, since the firm would probably not be upset with an overachievement of its target.

In general, once all goals and constraints are identified in a problem, management should analyze each goal to see if underachievement or overachievement of that goal is an acceptable situation. If overachievement is acceptable, the appropriate d+ variable can be eliminated from the objective function. If underachievement is okay, the d- variable should be dropped. If man- agement seeks to attain a goal exactly, both d- and d+ must appear in the objective function.

Extension to Equally Important Multiple Goals Let’s now look at the situation in which Harrison’s management wants to achieve several goals, each equal in priority.

Goal 1: to produce profit of $30 if possible during the production period

Goal 2: to fully utilize the available wiring department hours

Goal 3: to avoid overtime in the assembly department

Goal 4: to meet a contract requirement to produce at least seven ceiling fans

The deviational variables can be defined as follows:

d1 - = underachievement of the profit target

d1 + = overachievement of the profit target

d2 - = idle time in the wiring department 1underutilization2

d2 + = overtime in the wiring department 1overutilization2

d3 - = idle time in the assembly department 1underutilization2

d3 + = overtime in the assembly department 1overutilization2

d4 - = underachievement of the ceiling fan goal

d4 + = overachievement of the ceiling fan goal

Management is unconcerned about whether there is overachievement of the profit goal, overtime in the wiring department, or idle time in the assembly department and whether more than seven ceiling fans are produced: hence, d1

+, d2 +, d3

-, and d4 + may be omitted from the objective func-

tion. The new objective function and constraints are

Minimize total deviation = d1- + d2- + d3+ + d4- subject to 7X1 + 6X2 + d1- - d1+ = 30 1profit constraint2

2X1 + 3X2 + d2- - d2+ = 12 1wiring constraint2 6X1 + 5X2 + d3- - d3+ = 30 1assembly constraint2

X2 + d4- - d4+ = 7 1ceiling fan constraint2 All Xi, di variables Ú 0

Deviational variables are zero if a goal is exactly obtained.

We need a clear definition of deviational variables, such as these.

M10_REND3161_13_AIE_C10.indd 370 27/10/16 2:29 PM

10.3 goAL PRogRAMMIng  371

Ranking Goals with Priority Levels In most goal programming problems, one goal will be more important than another, which, in turn, will be more important than a third. The idea is that goals can be ranked with respect to their importance in management’s eyes. Lower-order goals are considered only after higher- order goals are met. A priority 1Pi2 is assigned to each deviational variable—with the ranking that P1 is the most important goal, P2 the next most important, then P3, and so on.

Let’s say Harrison Electric sets the priorities shown in the following table:

GOAL PRIORITY

Reach a profit as much above $30 as possible P1

Fully use wiring department hours available P2

Avoid assembly department overtime P3

Produce at least seven ceiling fans P4

This means, in effect, that meeting the profit goal (which has a priority of 1P12) is infinitely more important than meeting the wiring goal 1P22, which is, in turn, infinitely more important than meeting the assembly goal 1P32, which is infinitely more important than producing at least seven ceiling fans 1P42.

With ranking of goals considered, the new objective function becomes

Minimize total deviation = P1d1- + P2d2- + P3d3+ + P4d4-

The constraints remain identical to the previous ones.

Goal Programming with Weighted Goals When priority levels are used in goal programming, any goal in the top priority level is infinitely more important than the goals in lower priority levels. However, there may be times when one goal is more important than another goal, but it may be only two or three times as important. In- stead of placing these goals in different priority levels, they would be placed in the same priority level but with different weights. When using weighted goal programming, the coefficients in the objective function for the deviational variables include both the priority level and the weight. If all goals are in the same priority level, then simply using the weights as objective function coef- ficients is sufficient.

A key idea in goal programming is that one goal is more important than another. Priorities are assigned to each deviational variable.

Priority 1 is infinitely more important than Priority 2, which is infinitely more important than the next goal, and so on.

The Use of goal Programming for Tuberculosis drug Allocation in Manila

Allocation of resources is critical when applied to the health industry. It is a matter of life and death when neither the right sup- ply nor the correct quantity is available to meet patient demand. This was the case faced by the Manila (Philippines) Health Center, whose drug supply for patients afflicted with Category I tuber- culosis (TB) was not being efficiently allocated to its 45 regional health centers. When the TB drug supply does not reach patients on time, the disease becomes worse and can result in death. Only 74% of TB patients were being cured in Manila, 11% short of the 85% target cure rate set by the government. Unlike other diseases, TB can be treated with only four medicines and cannot be cured by alternative drugs.

Researchers at the Mapka Institute of Technology set out to create a model, using goal programming, to optimize the al- location of resources for TB treatment while considering supply constraints. The objective function of the model was to meet the

target cure rate of 85% (which is the equivalent of minimizing the underachievement in the allocation of anti-TB drugs to the 45 centers). Four goal constraints considered the interrelation- ships among variables in the distribution system. Goal 1 was to satisfy the medication requirement (a 6-month regimen) for each patient. Goal 2 was to supply each health center with the proper allocation. Goal 3 was to satisfy the cure rate of 85%. Goal 4 was to satisfy the drug requirements of each health center.

The goal programming model successfully dealt with all of these goals and raised the TB cure rate to 88%, a 13% improve- ment in drug allocation over the previous distribution approach. This means that 335 lives per year were saved through this thoughtful use of goal programming.

Source: Based on G. J. C. Esmeria, “An Application of Goal Programming in the Allocation of Anti-TB Drugs in Rural Health Centers in the Philippines,” Proceedings of the 12th Annual Conference of the Production and Operations Management Society (March 2001), Orlando, FL: 50, © Trevor S. Hale.

IN ACTION

M10_REND3161_13_AIE_C10.indd 371 27/10/16 2:29 PM

372  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Consider the Harrison Electric example, in which the least important goal is goal 4 (produce at least seven ceiling fans). Suppose Harrison decides to add another goal of producing at least two chandeliers. The goal of seven ceiling fans is considered twice as important as this goal, so both of these should be in the same priority level. The goal of two chandeliers is assigned a weight of 1, while the goal of seven ceiling fans is given a weight of 2. Both of these will be in priority level 4. A new constraint (goal) would be added:

X1 + d5- - d5+ = 2 1chandeliers2 The new objective function value would be

Minimize total deviation = P1d1 - + P2d2 - + P3d3 + + P412d4 -2 + P4d5 -

Note that the ceiling fan goal has a weight of 2. The weight for the chandelier goal is 1. Technically, all of the goals in the other priority levels are assigned weights of 1 also.

USING QM FOR WINDOWS TO SOLVE HARRISON’S PROBLEM The QM for Windows Goal Programming module is illustrated in Programs 10.8A and 10.8B. The input screen is shown first, in Program 10.8A. Note in this first screen that there are two priority-level columns for each constraint. For this example, the priority for either the positive or the negative deviation will be zero, since the objective function does not contain both types of deviational variables for any of these goals. If a problem had a goal with both deviational variables in the objective function, both priority-level columns for this goal (constraint) would contain values other than zero. Also, the weight for each deviational variable contained in the objective function is listed as 1. (It is 0 if the variable does not appear in the objective function.) If different weights were used, they would be placed in the appropriate weight column within one priority level.

The solution, with an analysis of deviations and goal achievement, is shown in Program 10.8B. We see that the first two constraints have negative deviational variables equal to 0, indicating full achievement of those goals. In fact, the positive deviational variables both have values of 6, indicating overachievement of these goals by six units each. Goal (constraint) 3 has both deviational variables equal to 0, indicating complete achievement of that goal, whereas goal 4 has a negative deviational variable equal to 1, indicating underachievement by one unit.

10.4 Nonlinear Programming

Linear, integer, and goal programming all assume that a problem’s objective function and con- straints are linear. That means that they contain no nonlinear terms such as X1

3, 1>X2, log X3, or 5X1X2. Yet in many mathematical programming problems, the objective function and/or one or more of the constraints are nonlinear.

PROGRAM 10.8A Harrison Electric’s goal Programming Analysis Using QM for Windows: Inputs

PROGRAM 10.8B Summary Solution Screen for Harrison Electric’s goal Programming Problem Using QM for Windows

M10_REND3161_13_AIE_C10.indd 372 27/10/16 2:29 PM

10.4 nonLInEAR PRogRAMMIng  373

Unlike with linear programming methods, computational procedures for solving many non- linear programming (NLP) problems do not always yield an optimal solution. In many NLP problems, a particular solution may be better than any other point nearby, but it may not be the overall best point. This is called a local optimum, and the overall best solution is called the global optimum. Thus, for a particular problem, a solution technique may indicate that an opti- mum solution has been found, but it is only a local optimum, so there may be a global optimum that is better. The mathematics involved in solving these problems is beyond the scope of this text. We will rely on Solver in Excel to solve the nonlinear problems presented in this section.

In this section, we examine three categories of NLP problems and illustrate how Excel can be used to search for the solutions to these problems. In Solved Problem 10–3, we will see how NLP in Excel can help find the best parameter to use in an exponential smoothing forecasting model.

Nonlinear Objective Function and Linear Constraints The Great Western Appliance Company sells two models of toaster ovens, the Microtoaster 1X12 and the Self-Clean Toaster Oven 1X22. The firm earns a profit of $28 for each Microtoaster, re- gardless of the number sold. Profits for the Self-Clean model, however, increase as more units are sold because of fixed overhead. Profit on this model may be expressed as 21X2 + 0.25X22.

Hence, the firm’s objective function is nonlinear:

Maximize profit = 28X1 + 21X2 + 0.25X2 2

Great Western’s profit is subject to two linear constraints on production capacity and sales time available:

X1 + X2 … 1,000 1units of production capacity2 0.5X1 + 0.4X2 … 500 1hours of sales time available2

X1, X2 Ú 0

When an objective function contains squared decision variables (such as 0.25X2 2) and the prob-

lem’s constraints are linear, it is called a quadratic programming problem. A number of useful problems in the field of portfolio selection fall into this category. Quadratic programs can be solved by a modified form of the simplex method. Such work is outside the scope of this book but can be found in sources listed in the Bibliography.

The solution to the Great Western Appliance nonlinear programming problem is shown in Program 10.9. This was found using Solver in Excel 2016, and there are two important fea- tures of this spreadsheet that are different from the previous linear and integer programming examples. First, the solving method used for this in Solver is GRG Nonlinear instead of Simplex LP. The second change involves the objective function and the changing cells. For the sake of consistency, values for both X2 (cell C4) and X2

2 (cell D7) are shown in Program 10.9. However, cell D7 is simply cell C4 squared. Thus, when cell C4 changes, D7 will automatically change, and the Changing cells specified in Solver are B4:C4, while D7 is not included.

Both Nonlinear Objective Function and Nonlinear Constraints The annual profit at a medium-sized (200–400 beds) Hospicare Corporation–owned hospital depends on the number of medical patients admitted 1X12 and the number of surgical patients admitted 1X22. The nonlinear objective function for Hospicare is

Maximize profit = $13X1 + $6X1X2 + $5X2 + $1>X2 The corporation identifies three constraints, two of which are also nonlinear, that affect opera- tions. They are

2X1 2 + 4X2 … 90 1nursing capacity, in thousands of labor9days2

X1 + X2 3 … 75 1x@ray capacity, in thousands2 8X1 - 2X2 … 61 1marketing budget limit, in thousands of dollars2

Excel’s Solver is capable of formulating such a problem. The optimal solution is provided in Program 10.10.

Here is an example of a nonlinear objective function.

Quadratic programming contains squared terms in the objective function.

An example in which the objective and constraints are both nonlinear.

An example of nonlinear constraints.

M10_REND3161_13_AIE_C10.indd 373 27/10/16 2:29 PM

374  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Solver Parameter Inputs and Selections Key Formulas

Set Objective: E8

By Changing cells: B4:C4

To: Max

Subject to the Constraints:

E11:E12 <= G11:G12

Solving Method: GRG Nonlinear

☑ Make Variables Non-Negative

PROGRAM 10.9 Excel 2016 Solver Solution for great Western Appliance nLP Problem

PROGRAM 10.10 Excel 2016 Solution for Hospicare nLP Problem

Solver Parameter Inputs and Selections Key Formulas

Set Objective: H8

Copy H8 to H11:H13

By Changing cells: B4:C4

To: Max

Subject to the Constraints:

H11:H13 <= J11:J13

Solving Method: GRG Nonlinear

☑ Make Variables Non-Negative

Linear Objective Function with Nonlinear Constraints Thermlock Corporation produces rubber washers and gaskets like the type used to seal joints on the International Space Station. To do so, it combines two ingredients: rubber 1X12 and oil 1X22. The cost of the industrial-quality rubber used is $5 per pound, and the cost of the high-viscosity oil is $7 per pound. Two of the three constraints Thermlock faces are nonlinear. The firm’s ob- jective function and constraints are

Minimize costs = $5X1 + $7X2 subject to 3X1 + 0.25X12 + 4X2 + 0.3X22 Ú 125 1hardness contraint2

13X1 + X1 3 Ú 80 1tensile strength constraint2 0.7X1 + X2 Ú 17 1elasticity constraint2

M10_REND3161_13_AIE_C10.indd 374 27/10/16 2:29 PM

gLoSSARy  375

To solve this nonlinear programming problem, we turn again to Excel. The output is pro- vided in Program 10.11.

PROGRAM 10.11 Excel 2016 Solution to the Thermlock nLP Problem

Solver Parameter Inputs and Selections Key Formulas

Set Objective: D5

Copy g10 to g11:g12

By Changing cells: B4:C4

To: Min

Subject to the Constraints:

G10:G12 >= I10:I12

Solving Method: GRG Nonlinear

☑ Make Variables Non-Negative

This chapter addresses three special types of LP problems. The first, integer programming, examines LP problems that cannot have fractional answers. We also note that there are three types of integer programming problems: (1) pure or all-integer pro- grams; (2) mixed problems, in which some solution variables need not be integers; and (3) 0–1 problems, in which all solu- tions are either 0 or 1. We also demonstrate how 0–1 variables can be used to model special situations such as fixed-charge problems. QM for Windows and Excel are used to illustrate computer approaches to these problems.

The next part of the chapter deals with goal programming. This extension of LP allows problems to have multiple goals. Again, software such as QM for Windows is a powerful tool in solving this offshoot of LP.

Finally, the advanced topic of NLP is introduced as a special mathematical programming problem. Excel is demonstrated as a useful tool in solving simple NLP models. However, it is important to remember that the solution found for an NLP problem might be a local optimum and not a global optimum.

Summary

Glossary

0–1 Integer Programming Problems in which all decision variables must have integer values of 0 or 1. These vari- ables are also called binary variables.

Deviational Variables Terms that are minimized in a goal programming problem. Like slack variables in LP, they are real. They are the only terms in the objective function.

Global Optimum The overall best solution to a nonlinear programming problem.

Goal Programming A mathematical programming tech- nique that permits decision makers to set and prioritize multiple objectives.

Integer Programming A mathematical programming tech- nique that produces integer solutions to linear programming problems.

Local Optimum A solution to a nonlinear programming problem that is better than any nearby point, but that may not be the global optimum.

Nonlinear Programming A category of mathematical pro- gramming techniques that allows the objective function and/or constraints to be nonlinear.

Satisficing The process of coming as close as possible to reaching your set of objectives.

M10_REND3161_13_AIE_C10.indd 375 27/10/16 2:29 PM

376  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Solved Problems

Solved Problem 10-1 Consider the 0–1 integer programming problem that follows:

Maximize 50X1 + 45X2 + 48X3 subject to 19X1 + 27X2 + 34X3 … 80

22X1 + 13X2 + 12X3 … 40 X1, X2, X3 must be either 0 or 1

Now reformulate this problem with additional constraints so that no more than two of the three vari- ables can take on a value equal to 1 in the solution. Further, make sure that if X1 = 1, then X2 = 1 also. Then solve the new problem using Excel.

Solution Excel can handle all-integer, mixed-integer, and 0–1 integer problems. Program 10.12 shows two new constraints to handle the reformulated problem. These constraints are

X1 + X2 + X3 … 2

and

X1 - X2 … 0

The optimal solution is X1 = 1, X2 = 1, X3 = 0, with an objective function value of 95.

PROGRAM 10.12 Excel 2016 Solution for Solved Problem 10.1

Solver Parameter Inputs and Selections Key Formulas

Set Objective: E5

Copy E5 to E8:E11

By Changing cells: B4:D4

To: Max

Subject to the Constraints:

E8:E11 <= G8:G11

B4:D4 = binary

Solving Method: Simplex LP

☑ Make Variables Non-Negative

Solved Problem 10-2 Recall the Harrison Electric Company goal programming problem seen in Section 10.4. Its LP formulation was

Maximize profit = $7X1 + $6X2 subject to 2X1 + 3X2 … 12 1wiring hours2 6X1 + 5X2 … 30 1assembly hours2

X1, X2 Ú 0

M10_REND3161_13_AIE_C10.indd 376 27/10/16 2:29 PM

SoLVEd PRoBLEMS  377

where

X1 = number of chandeliers produced X2 = number of ceiling fans produced

Reformulate Harrison Electrical as a goal programming model with the following goals: Priority 1: Produce at least 4 chandeliers and 3 ceiling fans. Priority 2: Limit overtime in the assembly department to 10 hours and in the wiring department to

6 hours. Priority 3: Maximize profit.

Solution

Minimize P11d1- + d2-2 + P21d3+ + d4+2 + P3d5-

subject to X1 + d1- - d1+ = 4 X2 + d2- - d2+ = 3

f Priority 1

2X1 + 3X2 + d3- - d3+ = 18 6X1 + 5X2 + d4- - d4+ = 40

f Priority 2

7X1 + 6X2 + d5- - d5+ = 99,9996 Priority 3 In the priority 3 goal constraint, the 99,999 represents an unrealistically high profit. It is just a math- ematical trick to use as a target so that we can get as close as possible to the maximum profit.

Solved Problem 10-3 In Chapter 5, the exponential smoothing method for forecasting time series was presented. Program 10.13A provides an example of this, with the smoothing constant 1a2 selected to be 0.1. The forecast in time period 1 is assumed to be perfect, so the error and the absolute value of the error are both 0. The mean absolute deviation (MAD) is the measure of accuracy, and the first time period error is not used in computing this, since it was simply assumed to be perfect. The MAD is very dependent on the value of a. Use Excel to find the value of a that will minimize the MAD. Hint: Instead of writing the entire objective function, simply use the cell already developed in Excel for the MAD. Remember, a must be between 0 and 1.

Solution The MAD is a nonlinear function, so Solver in Excel can be used to solve this. There is only one constraint: the smoothing constant, a, must be less than or equal to 1. This can be entered di- rectly into the Change Constraint window in Solver, with a 1 entered on the right-hand side of the inequality. Program 10.13B provides the information and the final solution for this. The value for a that minimizes the MAD is 0.3478, and this yields a MAD of 16.70.

Note: Solver can be used in a similar manner to find the best weights to use in a weighted moving average forecast.

PROGRAM 10.13A Excel 2016 Spreadsheet for Solved Problem 10.3

Key Formulas

Copy C6:E6 to C7:E11

M10_REND3161_13_AIE_C10.indd 377 27/10/16 2:29 PM

Solver Parameter Inputs and Selections Key Formulas

Set Objective: E12

Copy C6:E6 to C7:E11 By Changing cells: B3

To: Min

Subject to the Constraints:

B3 <= 1

Solving Method: GRG Nonlinear

☑ Make Variables Non-Negative

PROGRAM 10.13B Excel 2016 Spreadsheet Solution for Solved Problem 10.3

Self-Test

●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the glossary at the end of the chapter.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. If all of the decision variables require integer solutions, the problem is a. a pure integer programming type of problem. b. a simplex method type of problem. c. a mixed-integer programming type of problem. d. a Gorsky type of problem.

2. In a mixed-integer programming problem, a. some integers must be even and others must

be odd. b. some decision variables must require integer results

only and some variables must allow for continuous results.

c. different objectives are mixed together even though they sometimes have relative priorities established.

3. A model containing a linear objective function and linear constraints but requiring that one or more of the decision variables take on an integer value in the final solution is called a. an integer programming problem. b. a goal programming problem. c. a nonlinear programming problem. d. a multiple objective LP problem.

4. An integer programming solution can never produce a greater profit than the LP solution to the same problem. a. True b. False

5. In goal programming, if all the goals are achieved, the value of the objective function will always be zero. a. True b. False

6. The objective in a goal programming problem with one priority level is to maximize the sum of the deviational variables. a. True b. False

7. Nobel Laureate Herbert A. Simon of Carnegie-Mellon University says that modern managers should always optimize, not satisfice. a. True b. False

8. The fixed-charge problem is typically classified as a. a goal programming problem. b. a 0–1 integer problem. c. a quadratic programming problem. d. an assignment problem.

378  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

M10_REND3161_13_AIE_C10.indd 378 27/10/16 2:29 PM

dISCUSSIon QUESTIonS And PRoBLEMS  379

c. is an algorithm with the goal of a quicker solution to the pure integer programming problem.

d. is an algorithm with the goal of a quicker solution to the mixed-integer programming problem.

11. Nonlinear programming includes a. problems in which the objective function is linear but

some constraints are not linear. b. problems in which the constraints are linear but the ob-

jective function is not linear. c. problems in which both the objective function and all

of the constraints are not linear. d. problems that are solvable by quadratic programming. e. all of the above.

9. The 0–1 integer programming problem a. requires the decision variables to have values between

0 and 1. b. requires all the constraints to have coefficients between

0 and 1. c. requires the decision variables to have coefficients

between 0 and 1. d. requires the decision variables to be equal to

0 or 1. 10. Goal programming

a. requires only that you know whether the goal is direct profit maximization or cost minimization.

b. allows you to have multiple goals.

Discussion Questions and Problems

Discussion Questions 10-1 Compare the similarities and differences of linear

and goal programming. 10-2 A linear programming problem was developed,

and the feasible region was found. If the additional restriction that all variables must be integers were added to the problem, how would the size of the fea- sible region change? How would the optimal value of the objective function change?

10-3 List the advantages and disadvantages of solving integer programming problems by (a) rounding off and (b) enumeration.

10-4 How do the three types of integer programming problems differ? Which do you think is most com- mon, and why?

10-5 What is meant by satisficing, and why is the term often used in conjunction with goal programming?

10-6 What are deviational variables? How do they differ from decision variables in traditional LP problems?

10-7 If you were the president of the college you are attending and were employing goal programming to assist in decision making, what might your goals be? What kinds of constraints would you include in your model?

10-8 What does it mean to rank goals in goal program- ming? How does this affect the problem’s solution?

10-9 Which of the following are NLP problems, and why?

(a) Maximize profit = 3X1 + 5X2 + 99X3 subject to X1 Ú 10

X2 … 5 X3 Ú 18

(b) Maximize cost = 25X1 + 30X2 + 8X1X2 subject to X1 Ú 8

X1 + X2 Ú 12 0.0005X1 - X2 = 11

(c) Maximize Z = P1d1 - + P2d2 + + P3 +

subject to X1 + X2 + d1- - d1+ = 300 X2 + d2 - - d2 + = 200 X1 + d3- - d3+ = 100

(d) Maximize profit = 3X1 + 4X2 subject to X1

2 - 5X2 Ú 8 3X1 + 4X2 Ú 12

(e) Minimize cost = 18X1 + 5X2 + X22

subject to 4X1 - 3X2 Ú 8 X1 + X2 Ú 18

Are any of these quadratic programming problems?

Problems 10-10 Elizabeth Bailey is the owner and general manager of

Princess Brides, which provides a wedding planning service in southwestern Louisiana. She uses radio advertising to market her business. Two types of ads are available—those during prime-time hours and those at other times. Each prime-time ad costs $390 and reaches 8,200 people, while the off-peak ads each cost $240 and reach 5,100 people. Bailey has budgeted $1,800 per week for advertising. Based on comments from her customers, Bailey wants to have at least two prime-time ads and no more than six off-peak ads.

(a) Formulate this as a linear program. (b) Find a good or optimal integer solution for part

(a) by rounding off or making an educated guess at the answer.

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel; and means the problem may be solved with QM for Windows and/or Excel.

M10_REND3161_13_AIE_C10.indd 379 27/10/16 2:29 PM

380  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

the planes purchased should be the longer-range 787; (4) the annual maintenance budget is to be no more than $8 million; (5) the annual maintenance cost per 787 is estimated to be $800,000, and it is $500,000 for each 767; and (6) each 787 can carry 125,000 passengers per year, whereas each 767 can fly 81,000 passengers annually. Formulate this as an integer programming problem to maximize the annual passenger-carrying capability. What category of integer programming problem is this? Solve this problem.

10-14 Trapeze Investments is a venture capital firm that is currently evaluating six different investment oppor- tunities. There is not sufficient capital to invest in all of these, but more than one will be selected. A 0–1 integer programming model is planned to help determine which of the six opportunities to choose. Variables X1, X2, X3, X4, X5, and X6 represent the six choices. For each of the following situations, write a constraint (or several constraints) that would be used.

(a) At least three of these choices are to be selected. (b) Either investment 1 or investment 4 must be

undertaken but not both. (c) If investment 4 is selected, then investment

6 must also be selected. However, if investment 4 is not selected, it is still possible to select investment 6.

(d) Investment 5 cannot be selected unless invest- ments 2 and 3 are both also selected.

(e) Investment 5 must be selected if investments 2 and 3 are both also selected.

10-15 Horizon Wireless, a cellular telephone company, is expanding into a new era. Relay towers are neces- sary to provide wireless telephone coverage to the different areas of the city. A grid is superimposed on a map of the city to help determine where the tow- ers should be located. The grid consists of 8 areas labeled A through H. Six possible tower locations (numbered 1–6) have been identified, and each loca- tion could serve several areas. The following table indicates the areas served by each of the towers.

TOWER LOCATION

1 2 3 4 5 6

AREAS SERVED

A, B, D B, C, G C, D, E, F E, F, H E, G, H A, D, F

Formulate this as a 0–1 programming model to mini- mize the total number of towers required to cover all the areas. Solve this using a computer.

10-16 Innis Construction Company specializes in building moderately priced homes in Cincinnati, Ohio. Tom Innis has identified eight potential locations to con- struct new single-family dwellings, but he cannot put up homes on all of the sites because he has only $300,000 to invest in all projects. The following table shows the cost of constructing homes in each

(c) Solve this as an integer programming problem using a computer.

10-11 A group of college students is planning a camping trip during the upcoming break. The group must hike several miles through the woods to get to the camp- site, and anything that is needed on this trip must be packed in a knapsack and carried to the campsite. One particular student, Tina Shawl, has identified eight items that she would like to take on the trip, but the combined weight is too great to take all of them. She has decided to rate the utility of each item on a scale of 1 to 100, with 100 being the most beneficial. Each item’s weight in pounds and utility value are given below.

ITEM 1 2 3 4 5 6 7 8

WEIGHT 8 1 7 6 3 12 5 14

UTILITY 80 20 50 55 50 75 30 70

Recognizing that the hike to the campsite is a long one, a limit of 35 pounds has been set as the maxi- mum total weight of the items to be carried.

(a) Formulate this as a 0–1 programming problem to maximize the total utility of the items carried. Solve this knapsack problem using a computer.

(b) Suppose item 3 is an extra battery pack, which may be used with several of the other items. Tina has decided that she will take item 5, a CD player, only if she also takes item 3. On the other hand, if she takes item 3, she may or may not take item 5. Modify the problem to reflect this, and solve the new problem.

10-12 Student Enterprises sells two sizes of wall posters, a large 3- by 4-foot poster and a smaller 2- by 3-foot poster. The profit earned from the sale of each large poster is $3; each smaller poster earns $2. The firm, although profitable, is not large; it consists of one art student, Jan Meising, at the University of Kentucky. Because of her classroom schedule, Jan has the fol- lowing weekly constraints: (1) up to three large post- ers can be sold, (2) up to five smaller posters can be sold, and (3) up to 10 hours can be spent on posters during the week, with each large poster requiring 2 hours of work and each smaller one taking 1 hour. With the semester almost over, Jan plans on taking a 3-month summer vacation to England and doesn’t want to leave any unfinished posters behind. Find the integer solution that will maximize her profit.

10-13 An airline owns an aging fleet of Boeing 737 jet air- planes. It is considering a major purchase of up to 17 new Boeing model 787 and 767 jets. The decision must take into account numerous cost and capabil- ity factors, including the following: (1) the airline can finance up to $1.6 billion in purchases; (2) each Boeing 787 will cost $80 million, and each Boeing 767 will cost $110 million; (3) at least one-third of

M10_REND3161_13_AIE_C10.indd 380 27/10/16 2:29 PM

dISCUSSIon QUESTIonS And PRoBLEMS  381

10-19 Triangle Utilities provides electricity for three cit- ies. The company has four electric generators that are used to provide electricity. The main generator operates 24 hours per day, with an occasional shut- down for routine maintenance. Three other genera- tors (1, 2, and 3) are available to provide additional power when needed. A start-up cost is incurred each time one of these generators is started. The start-up costs are $6,000 for 1, $5,000 for 2, and $4,000 for 3. These generators are used in one of the following ways: a generator may be started at 6:00 a.m. and run for either 8 hours or 16 hours, or it may be started at 2:00 p.m. and run for 8 hours (until 10:00 p.m.). All generators except the main generator are shut down at 10:00 p.m. Forecasts indicate the need for 3,200 megawatts more than provided by the main genera- tor before 2:00 p.m., and this need goes up to 5,700 megawatts between 2:00 and 10:00 p.m. Generator 1 may provide up to 2,400 megawatts, generator 2 may provide up to 2,100 megawatts, and generator 3 may provide up to 3,300 megawatts. The cost per megawatt used per 8-hour period is $8 for 1, $9 for 2, and $7 for 3.

(a) Formulate this problem as an integer program- ming problem to determine the least-cost way to meet the needs of the area.

(b) Solve using computer software.

10-20 The campaign manager for a politician who is run- ning for reelection to a political office is planning the campaign. Four ways to advertise have been se- lected: TV ads, radio ads, billboards, and social me- dia advertising buys. The costs of these are $900 for each TV ad, $500 for each radio ad, $600 for a bill- board for 1 month, and $180 for each buy on social media (approximately 40,000 unique impressions). The audience reached by each type of advertising has been estimated to be 40,000 for each TV ad, 32,000 for each radio ad, 34,000 for each billboard, and 17,000 for each social media buy. The total monthly advertising budget is $16,000. The follow- ing goals have been established and ranked: 1. The number of people reached should be at

least 1,500,000. 2. The total monthly advertising budget should

not be exceeded. 3. Together, the number of ads on either TV or

radio should be at least 6. 4. No more than 10 ads/buys of any one type

should be used. (a) Formulate this as a goal programming problem. (b) Solve this using computer software. (c) Which goals are exactly met and which are not?

10-21 Geraldine Shawhan is president of Shawhan File Works, a firm that manufactures two types of metal file cabinets. The demand for her two-drawer model is up to 600 cabinets per week; the demand for

area and the expected profit to be made from the sale of each home. Note that the home-building costs dif- fer considerably due to lot costs, site preparation, and differences in the models to be built. Note also that a fraction of a home cannot be built.

LOCATION

COST OF BUILDING AT THIS SITE ($)

EXPECTED PROFIT ($)

Clifton 60,000 5,000

Mt. Auburn 50,000 6,000

Mt. Adams 82,000 10,000

Amberly 103,000 12,000

Norwood 50,000 8,000

Covington 41,000 3,000

Roselawn 80,000 9,000

Eden Park 69,000 10,000

(a) Formulate Innis’s problem using 0–1 integer programming.

(b) Solve with QM for Windows or Excel. 10-17 A real estate developer is considering three possible

projects: a small apartment complex, a small shop- ping center, and a mini-warehouse. Each of these requires different funding over the next 2 years, and the net present values of the investments also vary. The following table provides the required invest- ment amounts (in $1,000s) and the net present value (NPV) of each (also expressed in $1,000s):

INVESTMENT

NPV YEAR 1 YEAR 2

Apartment complex 18 40 30

Shopping center 15 30 20

Mini-warehouse 14 20 20

The company has $80,000 to invest in year 1 and $50,000 to invest in year 2.

(a) Develop an integer programming model to maxi- mize the NPV in this situation.

(b) Solve the problem in part (a) using computer software. Which of the three projects would be undertaken if NPV is maximized? How much money would be used each year?

10-18 Refer to the real estate investment situation in Prob- lem 10.17.

(a) Suppose that the shopping center and the apart- ment complex would be on adjacent properties and that the shopping center would be considered only if the apartment complex were also built. Formulate the constraint that would stipulate this.

(b) Formulate a constraint that would force exactly two of the three projects to be undertaken.

M10_REND3161_13_AIE_C10.indd 381 27/10/16 2:29 PM

382  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

X1 = number of hours of sleep needed per week X2 = number of personal hours 1eating, personal

hygiene, handling laundary, and so on2 X3 = number of hours of class and studying X4 = number of hours of social time off base

1dating, sports, family visits, and so on2 He thinks that students should study 30 hours a week to have time to absorb material. This is his most important goal. Bligh feels that students need at most 7 hours sleep per night on average and that this goal is number 2. He believes that goal number 3 is to provide at least 20 hours per week of social time.

(a) Formulate this as a goal programming problem. (b) Solve the problem using computer software.

10-26 Mick Garcia, a certified financial planner (CFP), has been asked by a client to invest $250,000. This money may be placed in stocks, bonds, or a mutual fund in real estate. The expected return on investment is 13% for stocks, 8% for bonds, and 10% for real es- tate. While the client would like a very high expected return, she would be satisfied with a 10% expected return on her money. Due to risk considerations, sev- eral goals have been established to keep the risk at an acceptable level. One goal is to put at least 30% of the money in bonds. Another goal is that the amount of money in real estate should not exceed 50% of the money invested in stocks and bonds combined. In ad- dition to these goals, there is one absolute restriction. Under no circumstances should more than $150,000 be invested in any one area. (a) Formulate this as a goal programming problem.

Assume that all of the goals are equally important. (b) Use any available software to solve this prob-

lem. How much money should be put in each of the investment options? What is the total return? Which of the goals are not met?

10-27 Hinkel Rotary Engine, Ltd., produces four- and six- cylinder models of automobile engines. The firm’s profit for each four-cylinder engine sold during its quarterly production cycle is $1,800 - $50X1, where X1 is the number sold. Hinkel makes $2,400 - $70X2 for each of the larger engines sold, with X2 equal to the number of six-cylinder engines sold. There are 5,000 hours of production time avail- able during each production cycle. A four-cylinder engine requires 100 hours of production time, whereas six-cylinder engines take 130 hours to man- ufacture. Formulate this production planning prob- lem for Hinkel.

10-28 Motorcross of Wisconsin produces two models of snowmobiles, the XJ6 and the XJ8. In any given production-planning week, Motorcross has 40 hours available in its final testing bay. Each XJ6 requires 1 hour to test and each XJ8 takes 2 hours. The revenue

a three-drawer cabinet is limited to 400 per week. Shawhan File Works has a weekly operating ca- pacity of 1,300 hours, with the two-drawer cabinet taking 1 hour to produce and the three-drawer cabi- net requiring 2 hours. Each two-drawer model sold yields a $10 profit, and the profit for the large model is $15. Shawhan has listed the following goals in or- der of importance:

1. Attain a profit as close to $11,000 as possible each week.

2. Avoid underutilization of the firm’s produc- tion capacity.

3. Sell as many two- and three-drawer cabinets as the demand indicates.

Set this up as a goal programming problem. 10-22 Solve Problem 10-21. Are any goals unachieved in

this solution? Explain. 10-23 Hilliard Electronics produces specially coded com-

puter chips for laser surgery in 64MB, 256MB, and 512MB sizes. (1MB means that the chip holds 1 million bytes of information.) To produce a 64MB chip requires 8 hours of labor, a 256MB chip takes 13 hours, and a 512MB chip requires 16 hours. Hill- iard’s monthly production capacity is 1,200 hours. Mr. Blank, the firm’s sales manager, estimates that the maximum monthly sales of the 64MB, 256MB, and 512MB chips are 40, 50, and 60, respectively. The company has the following goals (ranked in or- der from most important to least important):

1. Fill an order from the best customer for thirty 64MB chips and thirty-five 256MB chips.

2. Provide sufficient chips to at least equal the sales estimates set by Mr. Blank.

3. Avoid underutilization of the production capacity.

Formulate this problem using goal programming. 10-24 An Oklahoma manufacturer makes two products:

speaker telephones 1X12 and pushbutton telephones 1X22. The following goal programming model has been formulated to find the number of each to pro- duce each day to meet the firm’s goals:

Minimize P1d1 - + P2d2- + P3d3+ + P4d1+

subject to 2X1 + 4X2 + d1- - d1+ = 8 0 8X1 + 10X2 + d2- - d2+ = 320 8X1 + 6X2 + d3- - d3+ = 240

All Xi, di Ú 0

Find the optimal solution using a computer. 10-25 Major Bill Bligh, director of the Army War College’s

new 6-month attaché training program, is concerned about how the 20 officers taking the course spend their precious time while in his charge. Major Bligh recognizes that there are 168 hours per week and thinks that his students have been using them rather inefficiently. Bligh lets

M10_REND3161_13_AIE_C10.indd 382 27/10/16 2:29 PM

dISCUSSIon QUESTIonS And PRoBLEMS  383

these is sensitive to the price, and historical data in- dicate that the weekly demands are given by

X1 = 500 - 12P1 X2 = 400 - 15P2 where

X1 = demand for tank top P1 = price for tank top X2 = demand for regular T@shirt P2 = price for regular T@shirt

(a) Develop an equation for the total profit. (b) Use Excel to find the optimal solution to the fol-

lowing nonlinear program. Use the profit func- tion developed in part (a).

Maximize profit

subject to X1 = 500 - 12P1 X2 = 400 - 15P2 P1 … 20 P2 … 25

X1, P1, X2, P2 Ú 0

10-32 The integer programming problem below has been developed to help First National Bank decide where, out of 10 possible sites, to locate four new branch of- fices: Xi represents Winter Park, Maitland, Osceola, Downtown, South Orlando, Airport, Winter Garden, Apopka, Lake Mary, and Cocoa Beach, for i equals 1 to 10, respectively.

(a) Where should the four new sites be located, and what will be the expected return?

(b) If at least one new branch must be opened in Maitland or Osceola, will this change the answers? Add the new constraint and rerun.

(c) The expected return at Apopka was overesti- mated. The correct value is $160,000 per year (i.e., 160). Using the original assumptions—that is, ignoring part (b)—does your answer to part (a) change?

(in $1,000s) for the firm is nonlinear and is stated as (Number of XJ6s)(4 - 0.1 number of XJ6s) + (Number of XJ8s)(5 - 0.2 number of XJ8s). (a) Formulate this problem. (b) Solve using Excel.

10-29 During the busiest season of the year, Green-Gro Fertilizer produces two types of fertilizers. The stan- dard type (X) is just fertilizer, and the other type (Y) is a special fertilizer and weed-killer combination. The following model has been developed to deter- mine how much of each type should be produced to maximize profit subject to a labor constraint:

Maximize profit = 12X - 0.04X2 + 15Y - 0.06Y2

subject to 2X + 4Y … 160 hours X, Y Ú 0

Find the optimal solution to this problem. 10-30 Pat McCormack, a financial advisor for Investors R

Us, is evaluating two stocks in a particular industry. He wants to minimize the variance of a portfolio consisting of these two stocks, but he wants to have an expected return of at least 9%. After obtaining historical data on the variance and returns, he devel- ops the following nonlinear program:

Minimize portfolio variance = 0.16X2 + 0.2XY + 0.09Y2

subject to X + Y = 1 1all funds must be invested2 0.11X + 0.08Y Ú 0.09 1return on the investment2

X, Y Ú 0

where

X = proportion of money invested in stock 1 Y = proportion of money invested in stock 2

Solve this using Excel and determine how much to invest in each of the two stocks. What is the return for this portfolio? What is the variance of this portfolio?

10-31 Summertime Tees sells two very popular styles of embroidered shirts in southern Florida: a tank top and a regular T-shirt. The cost of the tank top is $6, and the cost of the T-shirt is $8. The demand for

IP for Problem 10.32

Maximize expected returns = 120X1 + 100X2 + 110X3 + 140X4 + 155X5 + 128X6 + 145X7 + 190X8 + 170X9 + 150X10 subject to

20X1 + 30X2 + 20X3 + 25X4 + 30X5 + 30X6 + 25X7 + 20X8 + 25X9 + 30X10 … 110 15X1 + 5X2 + 20X3 + 20X4 + 5X5 + 5X6 + 10X7 + 20X8 + 5X9 + 20X10 … 50 X2 + X6 + X7 + X9 + X10 … 3 X2 + X3 + X5 + X8 + X9 Ú 2

X1 + X3 + X10 Ú 1 X1 + X2 + X3 + X4 + X5 + X6 + X7 + X8 + X9 + X10 … 4

All Xi = 0 or 1

M10_REND3161_13_AIE_C10.indd 383 27/10/16 2:29 PM

384  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

10-33 In Solved Problem 10.3, nonlinear programming was used to find the best value for the smoothing constant, a, in an exponential smoothing forecasting problem. To see how much the MAD can vary due to the selec- tion of the smoothing constant, use Excel and the data in Program 10.13A to find the value of the smooth- ing constant that would maximize the MAD. Compare this MAD to the minimum MAD found in the solved problem.

10-34 Using the data in Solved Problem 10-3, develop a spreadsheet for a two-period weighted moving

average forecast with weights of 0.6 1w12 for the most recent period and 0.4 1w22 for the other period. Note these weights sum to 1, so the forecast is simply

Forecast for next period = w11Value in current period2 + w21Value in last period2

Find the weights for this two-period weighted mov- ing average that would minimize the MAD. (Hint: The weights must sum to 1.)

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems 10-35 to 10-42.

Internet Homework Problems

Schank Marketing Research has just signed contracts to con- duct studies for four clients. At present, three project man- agers are free for assignment to the tasks. Although all are capable of handling each assignment, the times and cost to complete the studies depend on the experience and knowledge of each manager. Using his judgment, John Schank, the presi- dent, has been able to establish a cost for each possible assign- ment. These costs, which are really the salaries each manager would draw on each task, are summarized in the table on the next page.

Schank is very hesitant about neglecting NASA, which has been an important customer in the past. (NASA has employed the firm to study the public’s attitude toward the International Space Station.) In addition, Schank has promised to try to provide Ruth a salary of at least $3,000 on his next assignment. From previous contracts, Schank also knows that Gardener does not get along well with the management at CBT Television, so he hopes to avoid assigning her to CBT. Finally, as Hines Corporation is also an old and valued client, Schank feels that it is twice as important

Case Study

Schank Marketing Research

to assign a project manager immediately to Hines’s task as it is to provide one to General Foundry, a brand-new client. Schank wants to minimize the total costs of all projects while consider- ing each of these goals. He feels that all of these goals are impor- tant, but if he had to rank them, he would put his concern about NASA first, his worry about Gardener second, his need to keep Hines Corporation happy third, his promise to Ruth fourth, and his concern about minimizing all costs last.

Each project manager can handle, at most, one new client.

Discussion Questions 1. If Schank were not concerned about noncost goals, how

would he formulate this problem so that it could be solved quantitatively?

2. Develop a formulation that will incorporate all five objectives.

Source: Trevor S. Hale.

CLIENT

PROJECT MANAGER HINES CORP. NASA GENERAL FOUNDRY CBT TELEVISION

Gardener $3,200 $3,000 $2,800 $2,900

Ruth 2,700 3,200 3,000 3,100

Hardgraves 1,900 2,100 3,300 2,100

M10_REND3161_13_AIE_C10.indd 384 27/10/16 2:29 PM

BIBLIogRAPHy  385

The Oakton River had long been considered an impediment to the development of a certain medium-sized metropolitan area in the Southeast. Lying to the east of the city, the river made it difficult for people living on its eastern bank to commute to jobs in and around the city and to take advantage of the shop- ping and cultural attractions that the city had to offer. Simi- larly, the river inhibited the access of those on its western bank to the ocean resorts lying 1 hour to the east. The bridge over the Oakton River had been built prior to World War II and was grossly inadequate to handle the existing traffic, much less the increased traffic that would accompany the forecasted growth in the area. A congressional delegation from the state prevailed upon the federal government to fund a major portion of a new toll bridge over the Oakton River, and the state legislature ap- propriated the rest of the needed monies for the project.

Progress in construction of the bridge has been in accor- dance with what was anticipated at the start of construction. The state highway commission, which will have operational juris- diction over the bridge, has concluded that the opening of the bridge for traffic is likely to take place at the beginning of the next summer, as scheduled. A personnel task force has been es- tablished to recruit, train, and schedule the workers needed to operate the toll facility.

The members of the personnel task force are well aware of the budgetary problems facing the state. They have taken as part of their mandate the requirement that personnel costs be kept as low as possible. One particular area of concern is the number of toll collectors that will be needed. The bridge is scheduling three shifts of collectors: shift A from midnight to 8 a.m., shift B from 8 a.m. to 4 p.m., and shift C from 4 p.m. to midnight. Recently, the state employees union negotiated a contract with the state that requires that all toll collectors be permanent, full- time employees. In addition, all collectors must work a five-on, two-off schedule on the same shift. Thus, for example, a worker could be assigned to work Tuesday, Wednesday, Thursday, Friday, and Saturday on shift A, followed by Sunday and Monday off. An employee could not be scheduled to work, say, Tuesday on shift A followed by Wednesday, Thursday, Friday, and Satur- day on shift B or on any other mixture of shifts during a 5-day block. The employees would choose their assignments in order of their seniority.

The task force has received projections of traffic flow on the bridge by day and hour. These projections are based on extrapolations of existing traffic patterns—the pattern of com- muting, shopping, and beach traffic currently experienced with growth projections factored in. Standards data from other state- operated toll facilities have allowed the task force to convert these traffic flows into toll collector requirements—that is, the minimum number of collectors required per shift, per day, to handle the anticipated traffic load. These toll collector require- ments are summarized in the following table:

Minimum Number of Toll Collectors Required per Shift

SHIFT SUN. MON. TUE. WED. THU. FRI. SAT.

A 8 13 12 12 13 13 15

B 10 10 10 10 10 13 15

C 15 13 13 12 12 13 8

The numbers in the table include one or two extra col- lectors per shift to fill in for collectors who call in sick and to provide relief for collectors on their scheduled breaks. Note that each of the eight collectors needed for shift A on Sun- day, for example, could have come from any of the A shifts scheduled to begin on Wednesday, Thursday, Friday, Saturday, or Sunday.

Discussion Questions 1. Determine the minimum number of toll collectors

that would have to be hired to meet the requirements expressed in the table.

2. The union had indicated that it might lift its opposition to the mixing of shifts in a 5-day block in exchange for additional compensation and benefits. By how much could the number of toll collectors required be reduced if this is done?

Source: Based on B. Render, R. M. Stair, and I. Greenberg, Cases and Read- ings in Management Science, 2nd ed., © 1990. Reprinted and electronically reproduced by permission of Pearson Education, Inc., New York, NY.

Case Study

Oakton River Bridge

Bibliography

Aköz, Onur, and Dobrila Petrovic. “A Fuzzy Goal Programming Method with Imprecise Goal Hierarchy,” European Journal of Operational Research 181, 3 (September 2007): 1427–1433.

Araz, Ceyhun, Pinar Mizrak Ozfirat, and Irem Ozkarahan. “An Integrated Multicriteria Decision-Making Methodology for Outsourcing Manage- ment,” Computers & Operations Research 34, 12 (December 2007): 3738–3756.

Bertsimas, Dimitris, Christopher Darnell, and Robert Soucy. “Portfolio Con- struction through Mixed-Integer Programming at Grantham, Mayo, Van Otterloo and Company,” Interfaces 29, 1 (January 1999): 49–66.

Chang, Ching-Ter. “Multi-Choice Goal Programming,” Omega 25, 4 (August 2007): 389–396.

M10_REND3161_13_AIE_C10.indd 385 27/10/16 2:29 PM

386  CHAPTER 10 • InTEgER PRogRAMMIng, goAL PRogRAMMIng, And nonLInEAR PRogRAMMIng

Lee, Sang M. Goal Programming for Decision Analysis. Auerbach. Philadel- phia 1972.

Lee, Sang M., and Marc J. Schniederjans. “A Multicriterial Assignment Prob- lem: A Goal Programming Approach,” Interfaces 13, 4 (August 1983): 75–79.

Pati, Rupesh Kumar, Prem Vrat, and Pradeep Kumar. “A Goal Program- ming Model for a Paper Recycling System,” Omega 36, 3 (June 2008): 405–417.

Reyes, Pedro M., and Gregory V. Frazier. “Goal Programming Model for Grocery Shelf Space Allocation,” European Journal of Operational Research 181, 2 (September 2007): 634–644.

Wadhwa, Vijay, and A. Ravi Ravindran. “Vendor Selection in Outsourc- ing,” Computers & Operations Research 34, 12 (December 2007): 3725–3737.

Zangwill, W. I. Nonlinear Programming: A Unified Approach. Upper Saddle River, NJ: Prentice Hall, 1969.

Charnes, A., and W. W. Cooper. Management Models and Industrial Applica- tions of Linear Programming, 2 vols. New York: John Wiley & Sons, Inc., 1961.

Dawid, Herbert, Johannes König, and Christine Strauss. “An Enhanced Ros- tering Model for Airline Crews,” Computers & Operations Research 28, 7 (June 2001): 671–688.

Drees, Lawrence David, and Wilbert E. Wilhelm. “Scheduling Experiments on a Nuclear Reactor Using Mixed Integer Programming,” Computers & Operations Research 28, 10 (September 2001): 1013–1037.

Hueter, Jackie, and William Swart. “An Integrated Labor-Management System for Taco Bell,” Interfaces 28, 1 (January–February 1998): 75–91.

Ignizio, James P. Introduction to Linear Goal Programming. Beverly Hills, CA: Sage Publications, 1985.

Katok, Elena, and Dennis Ott. “Using Mixed-Integer Programming to Reduce Label Changes in the Coors Aluminum Can Plant,” Interfaces 30, 2 (March 2000): 1–12.

Land, Alisa, and Susan Powell. “A Survey of the Operational Use of ILP Mod- els,” Annals of Operations Research 149, 1 (2007): 147–156.

M10_REND3161_13_AIE_C10.indd 386 27/10/16 2:29 PM

 387

Project Management

11 CHAPTER

Most realistic projects that organizations like Microsoft, General Motors, or the U.S. Defense Department undertake are large and complex. A builder putting up an office building, for example, must complete thousands of activities costing millions of dollars. NASA must inspect countless components before it launches a rocket. The Bath Iron Works shipyard on the Kennebec River in Bath, Maine, must manage and coordinate thousands of complex activities simultaneously. Almost every industry worries about how to manage similar large-scale, complicated projects effectively. It is a difficult problem, and the stakes are high. Millions of dollars have been wasted through cost overruns due to poor project planning. Unnecessary delays have occurred due to poor scheduling. How can such problems be solved?

The first step in planning and scheduling a project is to develop the work breakdown structure (WBS). This involves identifying the activities that must be performed in the project. An activity is a job or task that is a part of a project. The beginning or end of an activity is called an event. There may be varying levels of detail, and each activity may be broken into its most basic components. The time, cost, resource requirements, predecessors, and person(s) respon- sible are identified for each activity. When this has been done, a schedule for the project can be developed.

The program evaluation and review technique (PERT) and the critical path method (CPM) are two popular quantitative analysis techniques that help managers plan, schedule, monitor, and control large and complex projects. They were developed because there was a criti- cal need for a better way to manage (see the History box).

Project management can be used to manage complex projects.

PERT is probabilistic, whereas CPM is deterministic.

11.3 Reduce total project time at the least total cost by crashing the network using manual and linear programming techniques.

11.4 Understand the important role of software in project management.

11.1 Understand how to plan, monitor, and control projects with the use of PERT and CPM.

11.2 Determine earliest start, earliest finish, latest start, latest finish, and slack times for each activity, along with the total project completion time and total project cost.

After completing this chapter, students will be able to:

LEARNING OBJECTIVES

M11_REND3161_13_AIE_C11.indd 387 27/10/16 2:28 PM

388  CHAPTER 11 • PRojECT MAnAgEMEnT

When they were first developed, PERT and CPM were similar in their basic approach, but they differed in the way activity times were estimated. For every PERT activity, three time esti- mates are combined to determine the expected activity completion time. Thus, PERT is a proba- bilistic technique. On the other hand, CPM is a deterministic method, since it is assumed that the times are known with certainty. While these differences are still noted, the two techniques are so similar that the term PERT/CPM is often used to describe the overall approach. This reference is used in this chapter, and differences are noted where appropriate.

There are six steps common to both PERT and CPM. The procedure follows:

Six Steps of PERT/CPM

1. Define the project and all of its significant activities or tasks. 2. Develop the relationships among the activities. Decide which activities must precede

others. 3. Draw the network connecting all of the activities. 4. Assign time and/or cost estimates to each activity. 5. Compute the longest time path through the network; this is called the critical path. 6. Use the network to help plan, schedule, monitor, and control the project.

Finding the critical path is a major part of controlling a project. The activities on the critical path represent tasks that will delay the entire project if they are delayed. Managers derive flexibility by identifying noncritical activities and replanning, rescheduling, and reallocating resources such as personnel and finances.

The critical path is important because activities on the critical path can delay the entire project.

Managers have been planning, scheduling, monitoring, and controlling large-scale projects for hundreds of years, but it has only been in the past 50 years that QA techniques have been applied to major projects. One of the earliest techniques was the Gantt chart. This type of chart shows the start and finish times of one or more activities, as shown in the accompanying chart.

In 1958, the Special Projects Office of the U.S. Navy, the consulting firm Booz Allen Hamilton, and a division of Lockheed

Martin, Inc., developed the program evaluation and review tech- nique (PERT) to plan and control the Polaris missile program. This project involved the coordination of thousands of contrac- tors. Today, PERT is still used to monitor countless government contract schedules. At about the same time (1957), the critical path method (CPM) was developed by J. E. Kelley, Jr. of Reming- ton Rand and M. R. Walker of DuPont. Originally, CPM was used to assist in the building and maintenance of chemical plants at DuPont.

How PERT and CPM StartedHISTORY

A

B

C

D

E

F

G

H

14 1513121110987654321 Week

A ct

iv ity

M11_REND3161_13_AIE_C11.indd 388 27/10/16 2:28 PM

11.1 PERT/CPM  389

11.1 PERT/CPM

Almost any large project can be subdivided into a series of smaller activities or tasks that can be analyzed with PERT/CPM. When you recognize that projects can have thousands of specific activities, you see why it is important to be able to answer questions such as the following:

1. When will the entire project be completed? 2. What are the critical activities or tasks in the project—that is, the ones that will delay the

entire project if they are late? 3. Which are the noncritical activities—that is, the ones that can run late without delaying the

entire project’s completion? 4. If there are three time estimates, what is the probability that the project will be completed

by a specific date? 5. At any particular date, is the project on schedule, behind schedule, or ahead of schedule? 6. On any given date, is the money spent equal to, less than, or greater than the budgeted

amount? 7. Are there enough resources available to finish the project on time?

General Foundry Example of PERT/CPM General Foundry, Inc., a metalworks plant in Milwaukee, has long been trying to avoid the expense of installing air pollution control equipment. The local environmental protection group has recently given the foundry 16 weeks to install a complex air filter system on its main smoke- stack. General Foundry was warned that it will be forced to close unless the device is installed in the allotted period. Lester Harky, the managing partner, wants to make sure that installation of the filtering system progresses smoothly and on time.

When the project begins, the building of the internal components for the device (activity A) and the modifications that are necessary for the floor and roof (activity B) can be started. The construction of the collection stack (activity C) can begin once the internal components are completed, and the pouring of the new concrete floor and installation of the frame (activity D) can be completed as soon as the roof and floor have been modified. After the collection stack has been constructed, the high-temperature burner can be built (activity E), and the installation of the pollution control system (activity F) can begin. The air pollution device can be installed (activity G) after the high-temperature burner has been built, the concrete floor has been poured, and the frame has been installed. Finally, after the control system and pollution device have been installed, the system can be inspected and tested (activity H).

All of these activities seem rather confusing and complex until they are placed in a network. First, all of the activities must be listed. This information is shown in Table 11.1. We see in the table that before the collection stack can be constructed (activity C), the internal components must be built (activity A). Thus, activity A is the immediate predecessor of activity C. Simi- larly, both activities D and E must be performed just prior to installation of the air pollution device (activity G).

Questions answered by PERT.

The first step is to define the project and all project activities.

Immediate predecessors are determined in the second step.

ACTIVITY

DESCRIPTION

IMMEDIATE PREDECESSORS

A Build internal components —

B Modify roof and floor —

C Construct collection stack A

D Pour concrete and install frame B

E Build high-temperature burner C

F Install pollution control system C

G Install air pollution device D, E

H Inspect and test pollution control system F, G

TABLE 11.1 Activities and Immediate Predecessors for general Foundry, Inc.

M11_REND3161_13_AIE_C11.indd 389 27/10/16 2:28 PM

390  CHAPTER 11 • PRojECT MAnAgEMEnT

Drawing the PERT/CPM Network Once the activities have all been specified (step 1 of the PERT procedure) and management has decided which activities must precede others (step 2), the network can be drawn (step 3).

There are two common techniques for drawing PERT networks. The first is called activity- on-node (AON) because the nodes represent the activities. The second is called activity-on-arc (AOA) because the arcs are used to represent the activities. In this book, we present the AON technique, as this is easier and is often used in commercial software.

In constructing an AON network, there should be one node representing the start of the project and one node representing the finish of the project. There will be one node (represented as a rectangle in this chapter) for each activity. Figure 11.1 gives the entire network for General Foundry. The arcs (arrows) are used to show the predecessors for the activities. For example, the arrows leading into activity G indicate that both D and E are immediate predecessors for G.

Activities and events are drawn and connected in the third step.

Defining the Problem Delays in care at a hospital emergency room were causing loss of life and dollars.

Developing a Model A PERT model was developed to track patients as they moved through the various stages of emergency care.

Acquiring Input Data A sample of 100 patients was selected at random from a population of 460 patients over a 2-month period. Process times were recorded with a stopwatch.

Developing a Solution The data were put into the PERT model, and project completion times and variances were calculated.

Testing the Solution The results were as expected. Some processes such as filling out forms were slowing down the system.

Analyzing the Results The PERT model showed a project completion time of 84.9 minutes and a project variance of 253.1 minutes.

Implementing the Results PERT was able to help the hospital identify the critical activities of patient care in an emergency room set- ting. The hospital was better able to schedule and control various activities of patient care as a result of the PERT model. PERT also helped identify those activities that could be improved.

Source: Based on V. R. Girija and M.S. Bhat, “Process Flow Analysis in the Emergency Department of a Tertiary Care Hospital Using Program Evaluation and Review Technique (PERT),” Journal of Health Management 15, 3 (2013): 353–359, © Trevor S. Hale.

MODELING IN THE REAL WORLD

PERT Helps Hospital Improve Customer Service

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M11_REND3161_13_AIE_C11.indd 390 27/10/16 2:28 PM

11.1 PERT/CPM  391

Start Finish

A

Build Internal Components

B

Modify Roof and Floor

C

Construct Collection Stack

E

Build High- Temperature Burner

D

Pour Concrete and Install Frame

F

Install Pollution Control System

G

Install Air Pollution Device

H

Inspect and Test Pollution Control System

FIGURE 11.1 network for general Foundry, Inc.

Most Optimistic Time

Most Likely Time

Most Pessimistic Time

Activity Time

P ro

ba bi

lit y

Probability of 1 in 100 of Occurringa

Probability of 1 in 100 of Occurringb

( )a ( )m ( )b

FIGURE 11.2 Beta Probability Distribution with Three Time Estimates

Activity Times The next step in both CPM and PERT is to assign estimates of the time required to complete each activity. For some projects, such as construction projects, the time to complete each activity may be known with certainty. The developers of CPM assigned just one time estimate to each activity. These times are then used to find the critical path, as described in the sections that follow.

However, for one-of-a-kind projects or for new jobs, providing activity time estimates is not always an easy task. Without solid historical data, managers are often uncertain about the activity times. For this reason, the developers of PERT employed a probability distribution based on three time estimates for each activity. A weighted average of these times is used with PERT in place of the single time estimate used with CPM, and these averages are used to find the critical path. The time estimates in PERT are

Optimistic time (a) = time an activity will take if everything goes as well as possible. There should be only a small probability (say, 1�100) of this occurring.

Pessimistic time (b) = time an activity will take assuming very unfavorable conditions. There should also be only a small probability that the activity will really take this long.

Most likely time (m) = most realistic time estimate to complete the activity.

PERT often assumes that time estimates follow the beta probability distribution (see Figure 11.2). This continuous distribution has been found to be appropriate, in many cases, for determining an expected value and variance for activity completion times.

The fourth step is to assign activity times.

The beta probability distribution is often used.

M11_REND3161_13_AIE_C11.indd 391 27/10/16 2:28 PM

392  CHAPTER 11 • PRojECT MAnAgEMEnT

To find the expected activity time (t), the beta distribution weights the estimates as follows:

t = a + 4m + b

6 (11-1)

To compute the dispersion or variance of activity completion time, we use this formula:1

Variance = ab - a 6

b 2

(11-2)

Table 11.2 shows General Foundry’s optimistic, most likely, and pessimistic time estimates for each activity. It also reveals the expected time (t) and variance for each of the activities, as computed with Equations 11-1 and 11-2.

How to Find the Critical Path Once the expected completion time for each activity has been determined, we accept it as the actual time of that task. Variability in times will be considered later.

Although Table 11.2 indicates that the total expected time for all eight of General Foundry’s activities is 25 weeks, it is obvious in Figure 11.3 that several of the tasks can be taking place simultaneously. To find out just how long the project will take, we perform the critical path analysis for the network.

The critical path is the longest time path route through the network. If Lester Harky wants to reduce the total project time for General Foundry, he will have to reduce the length of some activity on the critical path. Conversely, any delay of an activity on the critical path will delay completion of the entire project.

To find the critical path, we need to determine the following quantities for each activity in the network:

1. Earliest start time (ES): the earliest time an activity can begin without violation of imme- diate predecessor requirements

2. Earliest finish time (EF): the earliest time at which an activity can end

The fifth step is to compute the longest path through the network—the critical path.

TABLE 11.2 Time Estimates (Weeks) for general Foundry, Inc.

ACTIVITY

OPTIMISTIC, a

MOST LIKELY, m

PESSIMISTIC, b

EXPECTED TIME, t = 3 1a + 4m + b 2 ,6 4

VARIANCE, 3 1b − a 2 ,6 42

A 1 2 3 2 a3 - 1

6 b

2

= 4

36

B 2 3 4 3 a4 - 2

6 b

2

= 4

36

C 1 2 3 2 a3 - 1

6 b

2

= 4

36

D 2 4 6 4 a6 - 2 6

b 2

= 16

36

E 1 4 7 4 a7 - 1

6 b

2

= 36

36

F 1 2 9 3 a9 - 1

6 b

2

= 64

36

G 3 4 11 5 a11 - 3 6

b 2

= 64

36

H 1 2 3 2 a3 - 1

6 b

2

= 4

36

25

1This formula is based on the statistical concept that, from one end of the beta distribution to the other, there are 6 standard deviations ({3 standard deviations from the mean). Because b - a is 6 standard deviations, 1 standard deviation is (b - a)>6. Thus, the variance is [(b - a)>6]2.

M11_REND3161_13_AIE_C11.indd 392 27/10/16 2:28 PM

11.1 PERT/CPM  393

3. Latest start time (LS): the latest time an activity can begin without delaying the entire project 4. Latest finish time (LF): the latest time an activity can end without delaying the entire project

In the network, we represent these times, as well as the activity times (t), in the nodes, as seen here:

ACTIVITY t

ES EF

LS LF

We first show how to determine the earliest times. When we find these, the latest times can be computed.

EARLIEST TIMES There are two basic rules to follow when computing ES and EF. The first rule is for the earliest finish time, which is computed as follows:

Earliest finish time = Earliest start time + Expected activity time EF = ES + t (11-3)

Also, before any activity can be started, all of its predecessor activities must be completed. In other words, we search for the largest EF for all of the immediate predecessors in determining ES. The second rule is for the earliest start time, which is computed as follows:

Earliest start time = Largest of the earliest finish times of immediate predecessors ES = Largest EF of immediate predecessors

The start of the whole project will be set at time zero. Therefore, any activity that has no pre- decessors will have an earliest start time of zero. So ES = 0 for both A and B in the General Foundry problem, as seen here:

The ES is the largest EF of the immediate predecessors.

Start Finish

A

B

C

E

F

G

H

2

3

2

4

3

5

2

D 4

FIGURE 11.3 general Foundry’s network with Expected Activity Times

A ES = 0 EF = 0 + 2 = 2

t = 2

B ES = 0 EF = 0 + 3 = 3

t = 3

Start

M11_REND3161_13_AIE_C11.indd 393 27/10/16 2:28 PM

394  CHAPTER 11 • PRojECT MAnAgEMEnT

The rest of the earliest times for General Foundry are shown in Figure 11.4. These are found using a forward pass through the network. At each step, EF = ES + t, and ES is the largest EF of the predecessors. Notice that activity G has an earliest start time of 8, since both D (with EF = 7) and E (with EF = 8) are immediate predecessors. Activity G cannot start until both predecessors are finished, so we choose the larger of their earliest finish times. Thus, G has ES = 8. The finish time for the project will be 15 weeks, which is the EF for activity H.

LATEST TIMES The next step in finding the critical path is to compute LS and LF for each activity. We do this by making a backward pass through the network—that is, starting at the finish and working backward.

There are two basic rules to follow when computing the latest times. The first rule involves the latest start time, which is computed as

Latest start time = Latest finish time - Expected activity time LS = LF - t (11-4)

The earliest times are found by beginning at the start of the project and making a forward pass through the network.

Start Finish

A

B

C

E

F

G

H

2

3

2

4

3

0 2 42 4 7

5

2

4 138 15

D 4

0 83 133 7

Start Finish

A

B

C

E

F

G

H

2

3

2

4

3

0 2 42 4 7

0 2 102 4 13

5

2

4 138 15

4 138 15

D 4

0 83 133 7

1 84 134 8

FIGURE 11.5 general Foundry’s Latest Start (LS) and Latest Finish (LF) Times

FIGURE 11.4 general Foundry’s Earliest Start (ES) and Earliest Finish (EF) Times

M11_REND3161_13_AIE_C11.indd 394 27/10/16 2:28 PM

11.1 PERT/CPM  395

Also, since all immediate predecessors must be finished before an activity can begin, the latest start time for an activity determines the latest finish time for its immediate predecessors. If an activity is the immediate predecessor for two or more activities, it must be finished so that all following activities can begin by their latest start times. Thus, the second rule involves the latest finish time, which is computed as

Latest finish time = Smallest of the latest start times of following activities LF = Smallest LS of following activities

To compute the latest times, we start at the finish and work backwards. Since the finish time for the General Foundry project is 15, activity H has LF = 15. The latest start for activity H is

LS = LF - t = 15 - 2 = 13 weeks

Continuing to work backward, this latest start time of 13 becomes the latest finish time for immediate predecessors F and G. All of the latest times are shown in Figure 11.5. Notice that for activity C, which is the immediate predecessor for two activities (E and F), the latest finish time is the smaller of the latest start times (4 and 10) for activities E and F.

CONCEPT OF SLACK IN CRITICAL PATH COMPUTATIONS When ES, LS, EF, and LF have been deter- mined, it is a simple matter to find the amount of slack time, or free time, that each activity has. Slack is the length of time an activity can be delayed without delaying the whole project. Mathematically,

Slack = LS - ES or Slack = LF - EF (11-5)

Table 11.3 summarizes the ES, EF, LS, LF, and slack time for all of General Foundry’s activities. Activity B, for example, has 1 week of slack time, since LS - ES = 1 - 0 = 1 (or, similarly, LF - EF = 4 - 3 = 1). This means that it can be delayed up to 1 week without causing the project to run any longer than expected.

On the other hand, activities A, C, E, G, and H have no slack time; this means that none of them can be delayed without delaying the entire project. Because of this, they are called critical activities and are said to be on the critical path. Lester Harky’s critical path is shown in network form in Figure 11.6. The total project completion time (T ), 15 weeks, is seen as the largest num- ber in the EF or LF column of Table 11.3. Industrial managers call this a boundary timetable.

Probability of Project Completion The critical path analysis helped us determine that the foundry’s expected project completion time is 15 weeks. Harky knows, however, that if the project is not completed in 16 weeks, Gen- eral Foundry will be forced to close by environmental controllers. He is also aware that there is significant variation in the time estimates for several activities. Variation in activities that are on

The latest times are found by beginning at the finish of the project and making a backward pass through the network.

The LF is the smallest LS of the activities that immediately follow.

Slack time is free time for an activity.

Critical activities have no slack time.

Project Management in an officeless, Cloud-Based Work Environment

Stillwater Associates is an energy supply chain consulting com- pany with a unique characteristic: It is an office-less company. It does not have a building, per se. All of its associates are scattered across the country. Needless to say, in some ways, not having a “brick-and-mortar” office helped Stillwater. For example, Stillwater’s overhead costs are extremely low when compared to their competition. In other ways, however, not having an office hindered the company—especially in the area of project management. Employees were duplicating effort and experienced trouble communicating. As a result, schedules slipped, budgets busted, and clients became irritated.

Stillwater turned to Project Insight, a software tool by Meta- fuse, Inc. Project Insight allowed Stillwater employees to log in to particular projects from any work site and from any platform. As soon as Stillwater Associates’ employees logged in, the soft- ware kept track of their hours on any task, on any project, from anywhere.

As a result, Stillwater Associates’ budget overruns became a thing of the past, allowing their employees to more effectively respond to their clients’ needs.

Source: Based on “Project Insight Drives Budget Management Success at Stillwater Associates,” Wall Street Journal, May 21, 2013, © Trevor S. Hale.

IN ACTION

M11_REND3161_13_AIE_C11.indd 395 27/10/16 2:28 PM

396  CHAPTER 11 • PRojECT MAnAgEMEnT

the critical path can affect overall project completion—possibly delaying it. This is one occur- rence that worries Harky considerably.

PERT uses the variance of critical path activities to help determine the variance of the over- all project. If the activity times are statistically independent, the project variance is computed by summing the variances of the critical activities:

Project variance = g variances of activities on the critical path (11-6) From Table 11.2, we know that

CRITICAL ACTIVITY

VARIANCE

A 4�36 C 4�36 E 36�36 G 64�36 H 4�36

Hence, the project variance is

Project variance = 4�36 + 4�36 + 36�36 + 64�36 + 4�36 = 112�36 = 3.111

Computing project variance is done by summing activity variances along the critical path.

ACTIVITY

EARLIEST START,

ES

EARLIEST FINISH,

EF

LATEST START,

LS

LATEST FINISH,

LF

SLACK, LS – ES

ON CRITICAL

PATH?

A 0 2 0 2 0 Yes

B 0 3 1 4 1 No

C 2 4 2 4 0 Yes

D 3 7 4 8 1 No

E 4 8 4 8 0 Yes

F 4 7 10 13 6 No

G 8 13 8 13 0 Yes

H 13 15 13 15 0 Yes

TABLE 11.3 general Foundry’s Schedule and Slack Times

Start Finish

A

B

C

E 4 H

F

G

2

3

2 3

0 2 42 4 7

0 2 102 4 13

5

2

4 138 15

4 138 15

D 4

0 83 133 7

1 84 134 8

FIGURE 11.6 general Foundry’s Critical Path (A–C–E–g–H)

M11_REND3161_13_AIE_C11.indd 396 27/10/16 2:28 PM

11.1 PERT/CPM  397

We know that the standard deviation is just the square root of the variance, so

Project standard deviation = sT = 2Project variance = 23.111 = 1.76 weeks

How can this information be used to help answer questions regarding the probability of finishing the project on time? In addition to assuming that the activity times are independent, we assume that the total project completion time follows a normal probability distribution. With these assumptions, the bell-shaped curve shown in Figure 11.7 can be used to represent project completion dates. It also means that there is a 50% chance that the entire project will be completed in less than the expected 15 weeks and a 50% chance that it will exceed 15 weeks.2

For Harky to find the probability that his project will be finished on or before the 16-week deadline, he needs to determine the appropriate area under the normal curve. The standard nor- mal equation can be applied as follows:

Z = Due date - Expected date of completion

sT

= 16 weeks - 15 weeks

1.76 weeks = 0.57 (11-7)

where

Z = the number of standard deviations the due date or target date lies from the mean or expected completion date

Computing the standard deviation.

Computing the probability of project completion.

2You should be aware that noncritical activities also have variability (as shown in Table 11.2). In fact, a different critical path can evolve because of the probabilistic situation. This may also cause the probability estimates to be unreliable. In such instances, it is better to use simulation to determine the probabilities.

PERT has two assumptions.

15 Weeks

(Expected Completion Time)

Standard Deviation = 1.76 Weeks FIGURE 11.7 Probability Distribution for Project Completion Times

15 Weeks

16 Weeks

0.57 Standard DeviationsExpected Time Is 15 Weeks

Time

Probability ( )T #16 Weeks Is 71.6%

FIGURE 11.8 Probability of general Foundry’s Meeting the 16-Week Deadline

M11_REND3161_13_AIE_C11.indd 397 27/10/16 2:28 PM

398  CHAPTER 11 • PRojECT MAnAgEMEnT

Referring to the normal table in Appendix A, we find a probability of 0.71566. Thus, there is a 71.6% chance that the pollution control equipment can be put in place in 16 weeks or less. This is shown in Figure 11.8.

What PERT Was Able to Provide PERT has thus far been able to provide Lester Harky with several valuable pieces of manage- ment information:

1. The project’s expected completion date is 15 weeks. 2. There is a 71.6% chance that the equipment will be in place within the 16-week deadline.

PERT can easily find the probability of finishing by any date Harky is interested in. 3. Five activities (A, C, E, G, H) are on the critical path. If any one of them is delayed for any

reason, the entire project will be delayed. 4. Three activities (B, D, F) are not critical but have some slack time built in. This means that

Harky can borrow from their resources, if needed, possibly to speed up the entire project. 5. A detailed schedule of activity starting and ending dates has been made available (see

Table 11.3).

Using Excel QM for the General Foundry Example This example can be worked using Excel QM. To do this, select Excel QM from the Add-Ins tab in Excel 2016, as shown in Program 11.1A. In the drop-down menu, put the cursor over Pro­ ject Management, and choices will appear to the right. To input a problem that is presented in a table with the immediate predecessors and three time estimates, select Predecessor List (AON), and the Initialization window will appear. Specify the number of activities and the maximum number of immediate predecessors for the activities, and select the 3 time estimate option. If you

The sixth and final step is to monitor and control the project using the information provided by PERT.

From the Add-Ins tab, select Excel QM.

Select Predecessor List (AON).

Select Project Management from the drop-down menu.

Choose the number of activities and the maximum number of predecessors, and select 3 time estimate. Click OK.

PROGRAM 11.1A Excel QM Initialization Screen for general Foundry Example with Three Time Estimates.

M11_REND3161_13_AIE_C11.indd 398 27/10/16 2:28 PM

11.1 PERT/CPM  399

wish to see a Gantt chart, check Graph. Click OK when finished, and a spreadsheet will appear, with all the necessary rows and columns labeled. For this example, enter the three time estimates in cells B8:D15, and then enter the immediate predecessors in cells C18:D25, as shown in Pro- gram 11.1B. No other inputs or steps are required.

As these data are being entered, Excel QM calculates the expected times and variances for all activities, and a table will automatically display the earliest, latest, and slack times for all the activities. A Gantt chart is displayed, and this chart shows the critical path and slack time for the activities.

Sensitivity Analysis and Project Management During any project, the time required to complete an activity can vary from the projected or ex- pected time. If the activity is on the critical path, the total project completion time will change, as discussed previously. In addition to having an impact on the total project completion time, there is an impact on the earliest start, earliest finish, latest start, latest finish, and slack times for other activities. The exact impact depends on the relationship among the various activities.

In previous sections, we define an immediate predecessor activity as an activity that comes immediately before a given activity. In general, a predecessor activity is one that must be com- pleted before the given activity can be started. Consider activity G (install air pollution device) for the General Foundry example. As seen previously, this activity is on the critical path. Prede- cessor activities are A, B, C, D, and E. All of these activities must be completed before activity G can be started. A successor activity is an activity that can be started only after the given activity is finished. Activity H is the only successor activity for activity G. A parallel activity is an activ- ity that does not directly depend on the given activity. Again consider activity G. Are there any parallel activities for this activity? Looking at the network for General Foundry, it can be seen that activity F is a parallel activity of activity G.

After predecessor, successor, and parallel activities have been defined, we can explore the impact that an increase (decrease) in the activity time for a critical path activity would have on other activities in the network. The results are summarized in Table 11.4. If the time it takes to complete activity G increases, there will be an increase in the earliest start, earliest finish, latest start, and latest finish times for all successor activities. Because slack time is equal to the

The expected times, standard deviations, and variances are automatically calculated.

The Gantt chart shows the critical activities and the noncritical activities.

The Results table displays all the activities and their earliest, latest, and slack time times.

Input the three time estimates for each activity.

Enter the immediate predecessors.

PROGRAM 11.1B Excel QM Input Screen and Solution for general Foundry Example with Three Time Estimates

M11_REND3161_13_AIE_C11.indd 399 27/10/16 2:28 PM

400  CHAPTER 11 • PRojECT MAnAgEMEnT

latest finish time minus the earliest finish time (or the latest start time minus the earliest start time; LF - EF or LS - ES), there will be no change in the slack for successor activities. Because activity G is on the critical path, an increase in activity time will increase the total project competition time. This would mean that the latest finish, latest start, and slack times will also increase for all parallel activities. You can prove this to yourself by completing a backward pass through the network using a higher total project completion time. There are no changes for predecessor activities.

11.2 PERT/Cost

Although PERT is an excellent method of monitoring and controlling project length, it does not consider another very important factor, project cost. PERT/Cost is a modification of PERT that allows a manager to plan, schedule, monitor, and control cost, as well as time.

We begin this section by investigating how costs can be planned and scheduled. Then we see how costs can be monitored and controlled.

Planning and Scheduling Project Costs: Budgeting Process The overall approach in the budgeting process of a project is to determine how much is to be spent every week or month. This is accomplished as follows:

Four Steps of the Budgeting Process

1. Identify all costs associated with each of the activities. Then add these costs together to get one estimated cost or budget for each activity.

2. If you are dealing with a large project, several activities can be combined into larger work packages. A work package is simply a logical collection of activities. Since the General Foundry project we have been discussing is small, each activity will be a work package.

3. Convert the budgeted cost per activity into a cost per time period. To do this, we assume that the cost of completing any activity is spent at a uniform rate over time. Thus, if the budgeted cost for a given activity is $48,000 and the activity’s expected time is 4 weeks, the budgeted cost per week is $12,000 1+48,000>4 weeks).

4. Using the earliest and latest start times, find out how much money should be spent during each week or month to finish the project by the date desired.

BUDGETING FOR GENERAL FOUNDRY Let us apply this budgeting process to the General Foundry problem. The Gantt chart for this problem, shown in Figure 11.9, illustrates this process. In this chart, a horizontal bar shows when each activity will be performed, based on the earli- est times. To develop a budget schedule, we will determine how much will be spent on each activity during each week and add these amounts to the chart in place of the bars. Lester Harky has carefully computed the costs associated with each of his eight activities. He has also divided the total budget for each activity by the activity’s expected completion time to determine the weekly budget for the activity. The budget for activity A, for example, is $22,000 (see Table 11.5). Since its expected time (t) is 2 weeks, $11,000 is spent each week to complete the activity. Table 11.5 also provides two pieces of data we found earlier using PERT: the ES and LS for each activity.

Using PERT/Cost to plan, schedule, monitor, and control project cost helps accomplish the sixth and final step of PERT.

ACTIVITY TIME

SUCCESSOR ACTIVITY

PARALLEL ACTIVITY

PREDECESSOR ACTIVITY

Earliest start Increase (decrease) No change No change

Earliest finish Increase (decrease) No change No change

Latest start Increase (decrease) Increase (decrease) No change

Latest finish Increase (decrease) Increase (decrease) No change

Slack No change Increase (decrease) No change

TABLE 11.4 Impact of an Increase (Decrease) in an Activity Time for a Critical Path Activity

M11_REND3161_13_AIE_C11.indd 400 27/10/16 2:28 PM

11.2 PERT/CoST  401

Looking at the total of the budgeted activity costs, we see that the entire project will cost $308,000. Finding the weekly budget will help Harky determine how the project is progressing on a week-to-week basis.

The weekly budget for the project is developed from the data in Table 11.5. The earliest start time for activity A, for example, is 0. Because A takes 2 weeks to complete, its weekly budget of $11,000 should be spent in weeks 1 and 2. For activity B, the earliest start time is 0, the expected completion time is 3 weeks, and the budgeted cost per week is $10,000. Thus, $10,000 should be spent for activity B in each of weeks 1, 2, and 3. Using the earliest start time, we can find the exact weeks during which the budget for each activity should be spent. These weekly amounts can be summed for all activities to arrive at the weekly budget for the entire project. This is shown in Table 11.6. Notice the similarities between this chart and the Gantt chart shown in Figure 11.9.

Do you see how the weekly budget for the project (total per week) is determined in Table 11.6? The only two activities that can be performed during the first week are activities A and B because their earliest start times are 0. Thus, during the first week, a total of $21,000 should be spent. Because activities A and B are still being performed in the second week, a total of $21,000 should also be spent during that period. The earliest start time for activity C is at the end of week 2 1ES = 2 for activity C). Thus, $13,000 is spent on activity C in both week 3 and week 4. Because activity B is also being performed during week 3, the total budget in week 3 is $23,000. Similar computations are done for all activities to determine the total budget for the entire project for each week. Then these weekly totals can be added to determine the total amount that should be spent to date (total to date). This information is displayed in the bottom row of the table.

A budget is computed using ES.

A

B

C

D

E

F

G

H

14 1513121110987654321 Week

A ct

iv ity

FIGURE 11.9 gantt Chart for general Foundry Example

California needs Project Management for $25 Billion Water Project

The budget crunch in California has affected many lives. Amidst the turmoil, a new project is proposed to divert water from the Sacramento River via two enormous tunnels routed to the south- ern part of the state. The project would take 10 years to finish and is expected to have 50 years of useful life.

Advocates say the water project would improve the water quality, improve sustainability, increase earthquake robustness, minimize overall exports, and decrease demand from existing fish-killing water facilities in the southern part of California. The biggest challenge for the proposed massive double-tunnel, water diversion project will be the coordination of state and federal

agencies, the administration of the construction and excavation contractors, and the supervision of the overall expenses—in other words, the management of the project.

The state of California has estimated that building the two tunnels will cost $14.5 billion, the net present value of the operation and maintenance of the two tunnels over their 50-year useful life equates to $4.8 billion, and the ensuing habitat resto- ration will require another $4.1 billion. In this case, sound project management is not just a nicety—it is a necessity.

Source: Based on “California Plan to Overhaul Water System Hub to Cost $25 Billion,” Los Angeles Times, May 29, 2013, © Trevor S. Hale.

IN ACTION

M11_REND3161_13_AIE_C11.indd 401 27/10/16 2:28 PM

402  CHAPTER 11 • PRojECT MAnAgEMEnT

ACTIVITY

EARLIEST START

TIME, ES

LATEST START

TIME, LS

EXPECTED

TIME, t

TOTAL BUDGETED

COST ($)

BUDGETED COST PER WEEK ($)

A 0 0 2 22,000 11,000

B 0 1 3 30,000 10,000

C 2 2 2 26,000 13,000

D 3 4 4 48,000 12,000

E 4 4 4 56,000 14,000

F 4 10 3 30,000 10,000

G 8 8 5 80,000 16,000

H 13 13 2 16,000 8,000

Total 308,000

TABLE 11.5 Activity Cost for general Foundry, Inc.

TABLE 11.6 Budgeted Cost ($1,000s) for general Foundry, Inc., Using Earliest Start Times

WEEK

ACTIVITY 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 TOTAL

A 11 11 22

B 10 10 10 30

C 13 13 26

D 12 12 12 12 48

E 14 14 14 14 56

F 10 10 10 30

G 16 16 16 16 16 80

H 8 8 16

308

Total per week 21 21 23 25 36 36 36 14 16 16 16 16 16 8 8

Total to date 21 42 65 90 126 162 198 212 228 244 260 276 292 300 308

Those activities along the critical path must spend their budgets at the times shown in Table 11.6. The activities that are not on the critical path, however, can be started at a later date. This concept is embodied in the LS for each activity. Thus, if latest starting times are used, another budget can be obtained. This budget will delay the expenditure of funds until the last possible moment. The procedures for computing the budget when LS is used are the same as when ES is used. The results of the new computations are shown in Table 11.7.

Compare the budgets given in Tables 11.6 and 11.7. The amount that should be spent to date (total to date) for the budget in Table 11.7 is smaller in the first few weeks. This is because this budget is prepared using the latest start times. Thus, the budget in Table 11.7 shows the latest possible time that funds can be expended and still finish the project on time. The budget in Table 11.6 reveals the earliest possible time that funds can be expended. Therefore, a manager can choose any budget that falls between the budgets presented in these two tables. These two tables form feasible budget ranges. This concept is illustrated in Figure 11.10.

The budget ranges for General Foundry were established by plotting the total-to-date budgets for ES and LS. Lester Harky can use any budget between these feasible ranges and still com- plete the air pollution project on time. Budgets like the ones shown in Figure 11.10 are normally developed before the project is started. Then, as the project is being completed, funds expended should be monitored and controlled.

Although there are cash flow and money management advantages to delaying activities until their latest start times, such delays can create problems with finishing the project on schedule. If an activity is not started until its latest start time, there is no slack remaining.

Another budget is computed using LS.

M11_REND3161_13_AIE_C11.indd 402 27/10/16 2:28 PM

11.2 PERT/CoST  403

Any subsequent delays in this activity will delay the project. For this reason, it may not be desirable to schedule all activities to start at the latest start time.

Monitoring and Controlling Project Costs The purpose of monitoring and controlling project costs is to ensure that the project is progress- ing on schedule and that cost overruns are kept to a minimum. The status of the entire project should be checked periodically.

Lester Harky wants to know how his air pollution project is going. It is now the sixth week of the 15-week project. Activities A, B, and C have been finished. These activities incurred costs

Is the project on schedule and within its budget?

TABLE 11.7 Budgeted Cost ($1,000s) for general Foundry, Inc., Using Latest Start Times

ACTIVITY 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 TOTAL

A 11 11 22

B 10 10 10 30

C 13 13 26

D 12 12 12 12 48

E 14 14 14 14 56

F 10 10 10 30

G 16 16 16 16 16 80

H 8 8 16

308

Total per week 11 21 23 23 26 26 26 26 16 16 26 26 26 8 8

Total to date 11 32 55 78 104 130 156 182 198 214 240 266 292 300 308

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0

50,000

100,000

150,000

200,000

250,000

$300,000

Total Budgeted Cost

Budget Using Earliest Start Times, ES

Budget Using Latest Start Times, LS

Weeks

FIGURE 11.10 Budget Ranges for general Foundry

M11_REND3161_13_AIE_C11.indd 403 27/10/16 2:28 PM

404  CHAPTER 11 • PRojECT MAnAgEMEnT

of $20,000, $36,000, and $26,000, respectively. Activity D is only 10% completed, and so far the cost expended has been $6,000. Activity E is 20% completed with an incurred cost of $20,000, and activity F is 20% completed with an incurred cost of $4,000. Activities G and H have not been started. Is the air pollution project on schedule? What is the value of work completed? Are there any cost overruns?

In general, the project is still considered on schedule if the current week is less than the lat- est finish of all unfinished activities. The value of work completed, or the budgeted cost to date for any activity, can be computed as follows:

Value of work completed = 1Percentage of work completed2 * 1Total activity budget2 (11-8)

The activity difference is also of interest:

Activity difference = Actual cost - Value of work completed (11-9)

If an activity difference is negative, there is a cost underrun, but if the number is positive, there has been a cost overrun.

Table 11.8 provides this information for General Foundry. The second column contains the total budgeted cost (from Table 11.6), and the third column contains the percent of work com- pleted. With these data and the actual cost expended for each activity, we can compute the value of work completed and the overruns or underruns for every activity.

One way to measure the value of the work completed is to multiply the total budgeted cost times the percent of work completed for each activity.3 Activity D, for example, has a value of work completed of $4,800 1 = $48,000 times 10%). To determine the amount of overrun or un- derrun for any activity, the value of work completed is subtracted from the actual cost. These dif- ferences can be added to determine the overrun or underrun for the project. As you see, at week 6 there is a $12,000 cost overrun. Furthermore, the value of work completed is only $100,000, and the actual cost of the project to date is $112,000. How do these costs compare with the budgeted costs for week 6? If Harky had decided to use the budget for earliest start times (see Table 11.6), we can see that $162,000 should have been spent. Thus, the project is behind sched- ule, and there are cost overruns. Harky needs to move faster on this project to finish on time, and he must control future costs carefully to try to eliminate the current cost overrun of $12,000. To monitor and control costs, the budgeted amount, the value of work completed, and the actual costs should be computed periodically.

In the next section, we see how a project can be shortened by spending additional money. The technique is called crashing and is part of the critical path method (CPM).

Compute the value of work completed by multiplying budgeted cost times percent of completion.

TABLE 11.8 Monitoring and Controlling Budgeted Cost

ACTIVITY

TOTAL BUDGETED COST

($)

PERCENT WORK

COMPLETED

VALUE OF WORK COMPLETED

($)

ACTUAL COST

($)

ACTIVITY DIFFERENCE

($)

A 22,000 100 22,000 20,000 -2,000 B 30,000 100 30,000 36,000 6,000

C 26,000 100 26,000 26,000 0

D 48,000 10 4,800 6,000 1,200

E 56,000 20 11,200 20,000 8,800

F 30,000 20 6,000 4,000 -2,000 G 80,000 0 0 0 0

H 16,000 0 0 0 0

Total 100,000 112,000 12,000

Overrun

3The percentage of completion for each activity can be measured in other ways as well. For example, one might examine the ratio of labor hours expended to total labor hours estimated.

M11_REND3161_13_AIE_C11.indd 404 27/10/16 2:28 PM

11.3 PRojECT CRASHIng  405

11.3 Project Crashing

At times, projects have deadlines that may be impossible to meet using the normal procedures for completion of the project. By using overtime, working weekends, hiring extra workers, or using extra equipment, it may be possible to finish a project in less time than is normally required. How- ever, the cost of the project will usually increase as a result. When CPM was developed, the pos- sibility of reducing the project completion time was recognized; this process is called crashing.

When crashing a project, the normal time for each activity is used to find the critical path. The normal cost is the cost for completing the activity using normal procedures. If the project completion time using normal procedures meets the deadline that has been imposed, there is no problem. However, if the deadline is before the normal project completion time, some extraor- dinary measures must be taken. Another set of times and costs is then developed for each activ- ity. The crash time is the shortest possible activity time, and this requires the use of additional resources. The crash cost is the price of completing the activity in an earlier-than-normal time. If a project must be crashed, it is desirable to do this at the least additional cost.

Project crashing with CPM involves four steps:

Four Steps of Project Crashing

1. Find the normal critical path and identify the critical activities. 2. Compute the crash cost per week (or other time period) for all activities in the network.

This process uses the following formula:4

Crash cost>Time period = Crash cost - Normal cost Normal time - Crash time

(11-10)

3. Select the activity on the critical path with the smallest crash cost per week. Crash this activity to the maximum extent possible or to the point at which your desired deadline has been reached.

4. Check to be sure that the critical path you were crashing is still critical. Often, a reduction in activity time along the critical path causes a noncritical path or paths to become critical. If the critical path is still the longest path through the network, return to step 3. If not, find the new critical path and return to step 3.

Shortening a project is called crashing.

Small Companies Utilize Project Management in Five Phases

Recently, small companies have incorporated project manage- ment tools into their workplaces. For small companies, proprietors and managers assign activities in the project to employees, in- cluding themselves. Researchers have identified five basic phases of a project to help small businesses. These five are conception, planning and design, execution, control, and closing.

Conception During conception, small business decision makers integrate their ideas and align them with the company’s goals. The decision to go forward with the project is made during this phase.

Planning and Design The second phase involves determining the tasks and milestones that need to happen for the project to be successful. It also involves assigning activities to departments and preparing the PERT network.

Execution Beginning at the project’s start is the execution phase. Managers direct employees to perform tasks and make note of their com- pletion times.

Control The control phase can overlap the execution phase above and in- volves ensuring deadlines and milestones are met on time and on budget. Resources may need to be reallocated during this phase.

Closing This phase is aptly named, as presentations are performed, analy- ses are finished, and reports are filed.

Source: Based on “Major Activities in Project Management Phases,” Houston Chronicle, May 21, 2013, © Trevor S. Hale.

IN ACTION

4This formula assumes that crash costs are linear. If they are not, adjustments must be made.

M11_REND3161_13_AIE_C11.indd 405 27/10/16 2:28 PM

406  CHAPTER 11 • PRojECT MAnAgEMEnT

General Foundry Example Suppose that General Foundry had been given 14 weeks instead of 16 weeks to install the new pollution control equipment or face a court-ordered shutdown. Or suppose that there was a bonus on the line for Lester if the equipment is installed in 12 weeks or less. As you recall, the length of Lester Harky’s critical path was 15 weeks. What can he do? We see that Harky cannot possibly meet the deadline unless he is able to shorten some of the activity times.

General Foundry’s normal and crash times and normal and crash costs are shown in Table 11.9. Note, for example, that activity B’s normal time is 3 weeks (this estimate was also used for PERT) and its crash time is 1 week. This means that the activity can be shortened by 2 weeks if extra resources are provided. The normal cost is $30,000, and the crash cost is $34,000. This implies that crashing activity B will cost General Foundry an additional $4,000. Crash costs are assumed to be linear. As shown in Figure 11.11, activity B’s crash cost per week is $2,000. Crash costs for all other activities can be computed in a similar fashion. Then steps 3 and 4 can be applied to reduce the project’s completion time.

TABLE 11.9 normal and Crash Data for general Foundry, Inc.

TIME (WEEKS) COST ($) CRASH COST PER WEEK ($)

CRITICAL PATH?ACTIVITY NORMAL CRASH NORMAL CRASH

A 2 1 22,000 23,000 1,000 Yes

B 3 1 30,000 34,000 2,000 No

C 2 1 26,000 27,000 1,000 Yes

D 4 3 48,000 49,000 1,000 No

E 4 2 56,000 58,000 1,000 Yes

F 3 2 30,000 30,500 500 No

G 5 2 80,000 86,000 2,000 Yes

H 2 1 16,000 19,000 3,000 Yes

10

$30,000

Activity Cost

$31,000

$32,000

$33,000

$34,000

2 3

Crash

Normal

Crash Cost/Week = Crash Cost – Normal Cost Normal Time – Crash Time

= $34,000 – $30,000 3 – 1

= $4,000 2 Weeks

= $2,000/Week

Time (Weeks)

Crash Time Normal Time

Normal Cost

Crash Cost

FIGURE 11.11 Crash and normal Times and Costs for Activity B

M11_REND3161_13_AIE_C11.indd 406 27/10/16 2:28 PM

11.3 PRojECT CRASHIng  407

Activities A, C, and E are on the critical path, and each has a minimum crash cost per week of $1,000. Harky can crash activity A by 1 week to reduce the project completion time to 14 weeks. The cost is an additional $1,000.

At this stage, there are two critical paths. The original critical path consists of activities A, C, E, G, and H, with a total completion time of 14 weeks. The new critical path consists of activities B, D, G, and H, also with a total completion time of 14 weeks. Any further crashing must be done to both critical paths. For example, if Harky wants to reduce the project completion time by an additional 2 weeks, both paths must be reduced. This can be done by reducing activity G, which is on both critical paths, by 2 weeks, for an additional cost of $2,000 per week. The total completion time would be 12 weeks, and the total crashing cost would be $5,000 ($1,000 to reduce activity A by 1 week and $4,000 to reduce activity G by 2 weeks).

For small networks, such as General Foundry’s, it is possible to use the four-step procedure to find the least cost of reducing the project completion dates. For larger networks, however, this approach is difficult and impractical, and more sophisticated techniques, such as linear program- ming, must be employed.

Project Crashing with Linear Programming Linear programming (see Chapters 7 and 8) is another approach to finding the best project crash- ing schedule. We illustrate its use on General Foundry’s network. The data needed are derived from Table 11.9 and Figure 11.12.

We begin by defining the decision variables. If X is the earliest finish time for an activity, then

XA = EF for activity A XB = EF for activity B XC = EF for activity C XD = EF for activity D XE = EF for activity E XF = EF for activity F XG = EF for activity G XH = EF for activity H

Xstart = start time for project (usually 0) Xfinish = earliest finish time for project

Although the starting node has a variable (Xstart) associated with it, this is not necessary, since it will be given a value of 0, and this could be used instead of the variable.

Y is defined as the number of weeks that each activity is crashed. YA is the number of weeks by which we will crash activity A, YB is the number of weeks by which we will activity B, and so on, up to YH.

There are now two critical paths.

The first step is to define decision variables for the linear program.

Start Finish

A

B

C

E

D

F

G

H

2

3

2

4

4

3

5

2

FIGURE 11.12 general Foundry’s network with Activity Times

M11_REND3161_13_AIE_C11.indd 407 27/10/16 2:28 PM

408  CHAPTER 11 • PRojECT MAnAgEMEnT

OBJECTIVE FUNCTION Since the objective is to minimize the cost of crashing the total project, our LP objective function is

Minimize crash cost = 1,000YA + 2,000YB + 1,000YC + 1,000YD + 1,000YE + 500YF + 2,000YG + 3,000YH

(These cost coefficients were drawn from the sixth column of Table 11.9.)

CRASH TIME CONSTRAINTS Constraints are required to ensure that each activity is not crashed more than its maximum allowable crash time. The maximum for each Y variable is the difference be- tween the normal time and the crash time (from Table 11.9):

YA … 1 YB … 2 YC … 1 YD … 1 YE … 2 YF … 1 YG … 3 YH … 1

PROJECT COMPLETION CONSTRAINT This constraint specifies that the last event must take place before the project deadline date. If Harky’s project must be crashed down to 12 weeks, then

Xfinish … 12

CONSTRAINTS DESCRIBING THE NETWORK The final set of constraints describes the structure of the network. Every activity will have one constraint for each of its predecessors. The form of these constraints is

Earliest finish time Ú Earliest finish time for predecessor + Expected activity time EF Ú EFpredecessor + 1t - Y2

or X Ú Xpredecessor + 1t - Y2 The activity time is given as t - Y, or the normal activity time minus the time saved by crashing. We know EF = ES + Activity time and ES = Largest EF of predecessors.

We begin by setting the start of the project to time zero: Xstart = 0.

For activity A,

XA Ú Xstart + 12 - YA2 or XA - Xstart + YA Ú 2

For activity B,

XB Ú Xstart + 13 - YB2 or XB - Xstart + YB Ú 3

For activity C,

XC Ú XA + 12 - YC2 or XC - XA + YC Ú 2

For activity D,

XD Ú XB + 14 - YD2 or XD - XB + YD Ú 4

The next step is to determine the objective function.

Crash constraints are determined next.

The final step is to determine event constraints.

M11_REND3161_13_AIE_C11.indd 408 27/10/16 2:28 PM

11.3 PRojECT CRASHIng  409

For activity E,

XE Ú XC + 14 - YE2 or XE - XC + YE Ú 4

For activity F,

XF Ú XC + 13 - YF2 or XF - XC + YF Ú 3

For activity G, we need two constraints, since there are two predecessors. The first constraint for activity G is

XG Ú XD + 15 - YG2 or XG - XD + YG Ú 5

The second constraint for activity G is

XG Ú XE + 15 - YG2 or XG - XE + YG Ú 5

For activity H, we need two constraints, since there are two predecessors. The first constraint for activity H is

XH Ú XF + 12 - YH2 or XH - XF + YH Ú 2

The second constraint for activity H is

XH Ú XG + (2 - YH) or XH - XG + YH Ú 2

To indicate the project is finished when activity H is finished, we have

Xfinish Ú XH

After adding nonnegativity constraints, this LP problem can be solved for the optimal Y values. This can be done with QM for Windows or Excel QM. Program 11.2 provides the Excel QM solution to this problem.

Activity A is crashed 1 week. Activity G is crashed 2 weeks.

The total cost for crashing the project by 3 weeks is $5,000.

PROGRAM 11.2 Solution to Crashing Problem via Solver in Excel

M11_REND3161_13_AIE_C11.indd 409 27/10/16 2:28 PM

410  CHAPTER 11 • PRojECT MAnAgEMEnT

11.4 Other Topics in Project Management

We have seen how to schedule a project and develop budget schedules. However, there are other things that are important and helpful to a project manager. We now briefly introduce these.

Subprojects For extremely large projects, an activity may be made up of several smaller subactivities. Each activity might be viewed as a smaller project or a subproject of the original project. The person in charge of the activity might wish to create a PERT/CPM chart for managing this subproject. Many software packages have the ability to include several levels of subprojects.

Milestones Major events in a project are often referred to as milestones. These are often reflected in Gantt charts and PERT charts to highlight the importance of reaching these events.

Resource Leveling In addition to managing the time and costs involved in a project, a manager must be concerned with the resources used in a project. These resources might be equipment or people. In planning a project (and often as part of the work breakdown structure), a manager must identify which resources are needed with each activity. For example, in a construction project there may be sev- eral activities requiring the use of heavy equipment such as a crane. If the construction company has only one such crane, then conflicts will occur if two activities requiring the use of this crane are scheduled for the same day. To alleviate problems such as this, resource leveling is employed. This means that one or more activities are moved from the earliest start time to another time (no later than the latest start time) so that the resource utilization is more evenly distributed over time. If the resources are construction crews, this is very beneficial in that the crews are kept busy and overtime is minimized.

Software There are numerous project management software packages on the market for both mainframe computers and personal computers. Some are hosted locally, while others are cloud-based. Some of them include Microsoft Project, Clarizen (cloud-based), OmniPlan, and OpenProj. They can be used to develop budget schedules, automatically adjust future start times based on the actual start times for prior activities, and level the resource utilization.

Good software for personal computers ranges in price from a few hundred dollars to several thousand dollars. Companies have paid several hundred thousand dollars for project manage- ment software and support because it helps management make better decisions and keep track of things that would otherwise be unmanageable.

The fundamentals of PERT and CPM are presented in this chapter. Both of these techniques are excellent for controlling large and complex projects.

PERT is probabilistic and allows three time estimates for each activity. These estimates are used to compute the project’s expected completion time, the variance of each project activity’s completion time, and the probability that the project will be completed by a given date. PERT>Cost, an extension of standard PERT, can be used to plan, schedule, monitor, and

control project costs. Using PERT/Cost, it is possible to determine if there are cost overruns or underruns at any point in time. It is also possible to determine whether the project is on schedule.

CPM, although similar to PERT, has the ability to crash projects by reducing their completion time through additional resource expenditures. Finally, we see that linear programming can also be used to crash a network by a desired amount at a minimum cost.

Summary

Glossary

Activity A time-consuming job or task that is a key subpart of the total project.

Activity-on-Arc (AOA) A network in which the activities are represented by arcs.

Activity-on-Node (AON) A network in which the activities are represented by nodes. This is the model illustrated in our book.

Activity Time Estimates Three time estimates that are used in determining the expected completion time and variance for an activity in a PERT network.

M11_REND3161_13_AIE_C11.indd 410 27/10/16 2:28 PM

KEY EQUATIonS  411

Backward Pass A procedure that moves from the end of the network to the beginning of the network. It is used in deter- mining the latest finish and latest start times.

Beta Probability Distribution A probability distribution that is often used in computing the expected activity completion times and variances in networks.

CPM Critical path method. A deterministic network tech- nique that is similar to PERT but allows for project crashing.

Crashing The process of reducing the total time that it takes to complete a project by expending additional funds.

Critical Path The series of activities that have zero slack. It is the longest time path through the network. A delay for any activity that is on the critical path will delay the com- pletion of the entire project.

Critical Path Analysis An analysis that determines the total project completion time, critical path for the project, slack time, ES, EF, LS, and LF for every activity.

Earliest Finish Time (EF) The earliest time that an activity can be finished without violation of precedence requirements.

Earliest Start Time (ES) The earliest time that an activity can start without violation of precedence requirements.

Event A point in time that marks the beginning or ending of an activity.

Expected Activity Time The average time that it should take to complete an activity. t = 1a + 4m + b2>6.

Forward Pass A procedure that moves from the beginning of a network to the end of the network. It is used in determin- ing the earliest activity start times and earliest finish times.

Gantt Chart A bar chart indicating when the activities (rep- resented by bars) in a project will be performed.

Immediate Predecessor An activity that must be completed before another activity can be started.

Latest Finish Time (LF) The latest time that an activity can be finished without delaying the entire project.

Latest Start Time (LS) The latest time that an activity can be started without delaying the entire project.

Milestone A major event in a project. Most Likely Time (m) The amount of time that you would

expect it would take to complete the activity. Network A graphical display of a project that contains both

activities and events. Optimistic Time (a) The shortest amount of time that could

be required to complete the activity. PERT Program evaluation and review technique. A network

technique that allows three time estimates for each activity in a project.

PERT/Cost A technique that allows a decision maker to plan, schedule, monitor, and control project cost, as well as project time.

Pessimistic Time (b) The greatest amount of time that could be required to complete the activity.

Resource Leveling The process of smoothing out the utiliza- tion of resources in a project.

Slack Time The amount of time that an activity can be delayed without delaying the entire project. Slack is equal to either the latest start time minus the earliest start time or the latest finish time minus the earliest finish time.

Variance of Activity Completion Time A measure of dispersion of the activity completion time. Variance =31b - a2>642.

Work Breakdown Structure (WBS) A list of the activities that must be performed in a project.

Key Equations

(11-1) t = a + 4m + b

6

Expected activity completion time.

(11-2) Variance = ab - a 6

b 2

Variance of activity completion time.

(11-3) EF = ES + t

Earliest finish time.

(11-4) LS = LF - t

Latest start time.

(11-5) Slack = LS - ES or Slack = LF - EF

Slack time in an activity.

(11-6) Project variance = g variances of activities on critical path

(11-7) Z = Due date - Expected date of completion

sT

Number of standard deviations the target date lies from the expected date, using the normal distribution.

(11-8) Value of work completed = 1Percentage of work completed2 * 1Total activity budget2

(11-9) Activity difference = Actual cost - Value of work completed

(11-10) Crash cost>Time period = Crash cost - Normal cost Normal time - Crash time

The cost in CPM of reducing an activity’s length per time period.

M11_REND3161_13_AIE_C11.indd 411 27/10/16 2:28 PM

412  CHAPTER 11 • PRojECT MAnAgEMEnT

Solved Problems

Solved Problem 11-1 To complete the wing assembly for an experimental aircraft, Scott DeWitte has laid out the major steps and seven activities involved. These activities have been labeled A through G in the following table, which also shows their estimated completion times (in weeks) and immediate predecessors. Determine the expected time and variance for each activity.

ACTIVITY

a

m

b

IMMEDIATE PREDECESSORS

A 1 2 3 —

B 2 3 4 —

C 4 5 6 A

D 8 9 10 B

E 2 5 8 C, D

F 4 5 6 B

G 1 2 3 E

Solution Although not required for this problem, a diagram of all the activities can be useful. A PERT diagram for the wing assembly is shown in Figure 11.13.

Finish

A

B

C

D

E G

F

Start

FIGURE 11.13 PERT Diagram for Scott DeWitte (Solved Problem 11-1)

Expected times and variances can be computed using the formulas presented in the chapter. The results are summarized in the following table:

ACTIVITY

EXPECTED TIME

(WEEKS)

VARIANCE

A 2 1�9 B 3 1�9 C 5 1�9 D 9 1�9 E 5 1

F 5 1�9 G 2 1�9

M11_REND3161_13_AIE_C11.indd 412 27/10/16 2:28 PM

SoLVED PRoBLEMS  413

Solved Problem 11-2 Referring to Solved Problem 11-1, now Scott would like to determine the critical path for the entire wing assembly project, as well as the expected completion time for the total project. In addition, he would like to determine the earliest and latest start and finish times and the slack times for all activities.

Solution The critical path, earliest start times, earliest finish times, latest start times, latest finish times, and slack times can be determined using the procedures outlined in the chapter. The results are shown in Figure 11.14 and are summarized in the following table:

ACTIVITY TIME

ACTIVITY ES EF LS LF SLACK

A 0 2 5 7 5

B 0 3 0 3 0

C 2 7 7 12 5

D 3 12 3 12 0

E 12 17 12 17 0

F 3 8 14 19 11

G 17 19 17 19 0

Expected project length = 19 weeks Variance of the critical path = 1.333

Standard deviation of the critical path = 1.155 weeks

Start Finish

F

A 2

0 2

5 7

C 5

2 7

7 12

E 5

12 17

12 17

G 2

17 19

17 19

5

D 9

3 12

3 12

3 8

14 19

B 3

0 3

0 3

FIGURE 11.14 Completed PERT Diagram for Scott DeWitte (Solved Problem 11.2)

The activities along the critical path are B, D, E, and G. These activities have zero slack, as shown in the table. The expected project completion time is 19 weeks. The earliest and latest start and finish times are shown in the table.

M11_REND3161_13_AIE_C11.indd 413 27/10/16 2:28 PM

414  CHAPTER 11 • PRojECT MAnAgEMEnT

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Network models such as PERT and CPM are used a. to plan large and complex projects. b. to schedule large and complex projects. c. to monitor large and complex projects. d. to control large and complex projects. e. for all of the above.

2. The primary difference between PERT and CPM is that a. PERT uses one time estimate. b. CPM has three time estimates. c. PERT has three time estimates. d. with CPM, it is assumed that all activities can be

performed at the same time. 3. The earliest start time for an activity is equal to

a. the largest EF of the immediate predecessors. b. the smallest EF of the immediate predecessors. c. the largest ES of the immediate predecessors. d. the smallest ES of the immediate predecessors.

4. The latest finish time for an activity is found during the backward pass through the network. The latest finish time is equal to a. the largest LF of the activities for which it is an

immediate predecessor. b. the smallest LF of the activities for which it is an

immediate predecessor. c. the largest LS of the activities for which it is an

immediate predecessor. d. the smallest LS of the activities for which it is an

immediate predecessor. 5. When PERT is used and probabilities are found, one

of the assumptions that is made is that a. all activities are on the critical path. b. activity times are independent. c. all activities have the same variance. d. the project variance is equal to the sum of the

variances of all activities in the project. e. all of the above.

6. In PERT, the time estimate b represents a. the most optimistic time. b. the most likely time. c. the most pessimistic time. d. the expected time. e. none of the above.

7. In PERT, slack time equals a. ES + t. b. LS - ES. c. 0. d. EF - ES. e. none of the above.

8. The standard deviation for the PERT project is approximately a. the square root of the sum of the variances along the

critical path. b. the sum of the critical path activity standard

deviations. c. the square root of the sum of the variances of the

project activities. d. all of the above. e. none of the above.

9. The critical path is a. the shortest path in a network. b. the longest path in a network. c. the path with the smallest variance. d. the path with the largest variance. e. none of the above.

10. If the project completion time is normally distributed and the due date for the project is greater than the expected completion time, then the probability that the project will be finished by the due date is a. less than 0.50. b. greater than 0.50. c. equal to 0.50. d. undeterminable without more information.

11. If activity A is not on the critical path, then the slack for A will equal a. LF - EF. b. EF - ES. c. 0. d. all of the above.

12. If a project is to be crashed at the minimum possible additional cost, then the first activity to be crashed must be a. on the critical path. b. the one with the shortest activity time. c. the one with the longest activity time. d. the one with the lowest cost.

13. activities are ones that will delay the entire project if they are late or delayed.

14. PERT stands for . 15. Project crashing can be performed using a

. 16. PERT can use three estimates for activity time. These

three estimates are , , and .

17. The latest start time minus the earliest start time is called the time for any activity.

18. The percent of project completed, value of work completed, and actual activity costs are used to ______________ projects.

M11_REND3161_13_AIE_C11.indd 414 27/10/16 2:28 PM

DISCUSSIon QUESTIonS AnD PRoBLEMS  415

Discussion Questions and Problems

Discussion Questions 11-1 What are some of the questions that can be answered

with PERT and CPM? 11-2 What are the major differences between PERT and

CPM? 11-3 What is an activity? What is an event? What is an

immediate predecessor? 11-4 Describe how expected activity times and variances

can be computed in a PERT network. 11-5 Briefly discuss what is meant by critical path anal-

ysis. What are critical path activities, and why are they important?

11-6 What are the earliest activity start time and latest activity start time? How are they computed?

11-7 Describe the meaning of slack and discuss how it can be determined.

11-8 How can we determine the probability that a project will be completed by a certain date? What assumptions are made in this computation?

11-9 Briefly describe PERT>Cost and how it is used. 11-10 What is crashing, and how is it done by hand? 11-11 Why is linear programming useful in CPM crashing?

Problems 11-12 Sid Davidson is the personnel director of Babson

and Willcount, a company that specializes in consulting and research. One of the training pro- grams that Sid is considering for the middle-level managers of Babson and Willcount is leadership training. Sid has listed a number of activities that must be completed before a training program of this nature could be conducted. The activities and immediate predecessors appear in the following table:

ACTIVITY IMMEDIATE PREDECESSORS

A —

B —

C —

D B

E A, D

F C

G E, F

Develop a network for this problem. 11-13 Sid Davidson was able to determine the activity

times for the leadership training program. He would like to determine the total project completion time

and the critical path(s). The activity times appear in the following table (see Problem 11-12):

ACTIVITY TIME (DAYS)

A 2

B 5

C 1

D 10

E 3

F 6

G 8

35

11-14 A political campaign manager must coordinate several activities in order to be prepared for an up- coming election. The following table describes the relationships among the activities that need to be completed, as well as the estimated times.

ACTIVITY

IMMEDIATE PREDECESSORS

TIME (WEEKS)

A — 4

B — 6

C A 3

D A 4

E B, C 8

F B 7

G D, E 2

H F 1

(a) Develop a project network for this problem. (b) Determine the ES, EF, LS, LF, and slack time

for each activity. Also determine the total proj- ect completion time and the critical path(s).

11-15 A marketing firm is developing a new Web-based media campaign for a client. The following table describes the relationships among the activities that need to be completed.

ACTIVITY

IMMEDIATE PREDECESSORS

TIME (DAYS)

A — 4

B A 6

C B 12

D B 11

E D 9

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel QM; and means the problem may be solved with QM for Windows and/or Excel.

M11_REND3161_13_AIE_C11.indd 415 27/10/16 2:28 PM

416  CHAPTER 11 • PRojECT MAnAgEMEnT

ACTIVITY

IMMEDIATE PREDECESSORS

TIME (DAYS)

F D 8

G D 10

H C 5

I C 7

J E, F, G 4

K H, I 9

(a) Develop a project network for this problem. (b) Determine the ES, EF, LS, LF, and slack time for

each activity. Also determine the total project com- pletion time and the critical path(s).

11-16 Jean Walker is making plans for spring break at the beaches in Florida. In applying techniques she learned in her quantitative methods class, she has identified the activities that are necessary to prepare for her trip. The following table lists the activities and the immediate predecessors. Draw the network for this project.

ACTIVITY IMMEDIATE PREDECESSORS

A —

B —

C A

D B

E C, D

F A

G E, F

11-17 The following are the activity times for the project in Problem 11-16. Find the earliest, latest, and slack times for each activity. Then find the critical path.

ACTIVITY TIME (DAYS)

A 3

B 7

C 4

D 2

E 5

F 6

G 3

11-18 The Laurenster Corporation is getting into the con- struction business. A list of activities and their optimistic, most likely, and pessimistic completion times are given in the following table for the next construction project.

ACTIVITY

DAYS IMMEDIATE

PREDECESSORSa m b

A 3 6 9 —

B 2 4 6 —

C 1 2 3 —

D 6 7 8 C

E 2 4 6 B, D

F 6 10 14 A, E

G 1 2 6 A, E

H 3 6 9 F

I 10 11 12 G

J 14 16 21 G

K 2 8 11 H, I

(a) Develop a project network for this problem. (b) Determine the expected duration and variance

for each activity. (c) Determine the ES, EF, LS, LF, and slack time

for each activity. Also determine the total proj- ect completion time and critical path(s).

(d) What is the probability that this job will finish in 38 days or less?

11-19 The Laurenster Corporation needs to set up an as- sembly line to produce a new product. The fol- lowing table describes the relationships among the activities that need to be completed for this product to be manufactured.

ACTIVITY

DAYS IMMEDIATE

PREDECESSORSa m b

A 3 6 6 —

B 5 8 11 A

C 5 6 10 A

D 1 2 6 B, C

E 7 11 15 D

F 7 9 14 D

G 6 8 10 D

H 3 4 8 F, G

I 3 5 7 E, F, H

(a) Develop a project network for this problem. (b) Determine the expected duration and variance

for each activity. (c) Determine the ES, EF, LS, LF, and slack time

for each activity. Also determine the total proj- ect completion time and the critical path(s).

(d) Determine the probability that the project will be completed in 34 days or less.

(e) Determine the probability that the project will take longer than 29 days.

M11_REND3161_13_AIE_C11.indd 416 27/10/16 2:28 PM

 417 DISCUSSIon QUESTIonS AnD PRoBLEMS  417

11-20 Monohan Machinery specializes in developing weed-harvesting equipment that is used to clear small lakes of weeds. George Monohan, president of Monohan Machinery, is convinced that harvest- ing weeds is far better than using chemicals to kill weeds. Chemicals cause pollution, and the weeds seem to grow faster after chemicals have been used. George is contemplating the construc- tion of a machine that would harvest weeds on narrow rivers and waterways. The activities that are necessary to build one of these experimen- tal weed-harvesting machines are listed in the following table. Construct a network for these activities.

ACTIVITY IMMEDIATE PREDECESSORS

A —

B —

C A

D A

E B

F B

G C, E

H D, F

11-21 After consulting with Butch Radner, George Mono- han was able to determine the activity times for con- structing the weed-harvesting machine to be used on narrow rivers. George would like to determine ES, EF, LS, LF, and slack time for each activity. The total project completion time and the critical path(s) should also be determined. (See Problem 11-20 for details.) The activity times are shown in the follow- ing table:

ACTIVITY TIME (WEEKS)

A 6

B 5

C 3

D 2

E 4

F 6

G 10

H 7

11-22 A project was planned using PERT with three time estimates. The expected completion time of the project was determined to be 40 weeks. The vari- ance of the critical path is 9.

(a) What is the probability that the project will be finished in 40 weeks or less?

(b) What is the probability that the project will take longer than 40 weeks?

(c) What is the probability that the project will be finished in 46 weeks or less?

(d) What is the probability that the project will take longer than 46 weeks?

(e) The project manager wishes to set the due date for the completion of the project so that there is a 90% chance of finishing on schedule. Thus, there would only be a 10% chance the proj- ect would take longer than this due date. What should this due date be?

11-23 Tom Schriber, the director of personnel of Manage- ment Resources, Inc., is in the process of designing a program that its customers can use in the job-finding process. Some of the activities include preparing resumés, writing letters, making appointments to see prospective employers, and researching companies and industries. The information on these activities is shown in the following table:

ACTIVITY

DAYS IMMEDIATE

PREDECESSORSa m b

A 8 10 12 —

B 6 7 9 —

C 3 3 4 —

D 10 20 30 A

E 6 7 8 C

F 9 10 11 B, D, E

G 6 7 10 B, D, E

H 14 15 16 F

I 10 11 13 F

J 6 7 8 G, H

K 4 7 8 I, J

L 1 2 4 G, H

(a) Construct a network for this problem. (b) Determine the expected time and variance for

each activity. (c) Determine ES, EF, LS, LF, and slack time for

each activity. (d) Determine the critical path(s) and project com-

pletion time. (e) Determine the probability that the project will

be finished in 70 days or less. (f) Determine the probability that the project will

be finished in 80 days or less. (g) Determine the probability that the project will

be finished in 90 days or less.

11-24 Using PERT, Ed Rose was able to determine that the expected project completion time for the construc- tion of a pleasure yacht is 21 months and the project variance is 4.

M11_REND3161_13_AIE_C11.indd 417 27/10/16 2:28 PM

418  CHAPTER 11 • PRojECT MAnAgEMEnT

(a) What is the probability that the project will be completed in 17 months or less?

(b) What is the probability that the project will be completed in 20 months or less?

(c) What is the probability that the project will be completed in 23 months or less?

(d) What is the probability that the project will be completed in 25 months or less?

11-25 The air pollution project discussed in the chap- ter has progressed over the past several weeks, and it is now the end of week 8. Lester Harky would like to know the value of the work completed, the amount of any cost overruns or underruns for the project, and the extent to which the project is ahead of or behind schedule by developing a table like Table 11.8. The revised cost figures are shown in the following table:

ACTIVITY

PERCENT COMPLETE

ACTUAL COST ($)

A 100 20,000

B 100 36,000

C 100 26,000

D 100 44,000

E 50 25,000

F 60 15,000

G 10 5,000

H 10 1,000

11-26 Fred Ridgeway has been given the responsibility of managing a training and development program. He knows the earliest start time, the latest start time, and the total cost for each activity. This information is given in the following table:

ACTIVITY

ES

LS

t

TOTAL COST ($1,000s)

A 0 0 6 10

B 1 4 2 14

C 3 3 7 5

D 4 9 3 6

E 6 6 10 14

F 14 15 11 13

G 12 18 2 4

H 14 14 11 6

I 18 21 6 18

J 18 19 4 12

K 22 22 14 10

L 22 23 8 16

M 18 24 6 18

(a) Using earliest start times, determine Fred’s total monthly budget.

(b) Using latest start times, determine Fred’s total monthly budget.

11-27 General Foundry’s project crashing data are shown in Table 11.9. Crash this project to 13 weeks using CPM. What is the final time for each activity after crashing?

11-28 Bowman Builders manufactures steel storage sheds for commercial use. Joe Bowman, president of Bow- man Builders, is contemplating producing sheds for home use. The activities necessary to build an experimental model and related data are given in the following table:

ACTIVITY

NORMAL

TIME

CRASH

TIME

NORMAL

COST

($)

CRASH

COST

($)

IMMEDIATE

PREDECESSORS

A 3 2 1,000 1,600 —

B 2 1 2,000 2,700 —

C 1 1 300 300 —

D 7 3 1,300 1,600 A

E 6 3 850 1,000 B

F 2 1 4,000 5,000 C

G 4 2 1,500 2,000 D, E

(a) What is the project completion date? (b) Formulate an LP problem to crash this project to

10 weeks.

11-29 The Bender Construction Co. is involved in con- structing municipal buildings and other structures that are used primarily by city and state munici- palities. This requires developing legal documents, drafting feasibility studies, obtaining bond rat- ings, and so forth. Recently, Bender was given a request to submit a proposal for the construction of a municipal building. The first step is to develop legal documents and to perform all steps necessary before the construction contract is signed. This requires that more than 20 separate activities be completed. These activities, their immediate pre- decessors, and their time requirements are given in Table 11.10.

As you can see, optimistic (a), most likely (m), and pessimistic (b) time estimates have been given for all of the activities described in the table. Using the data, determine the total project completion time for this preliminary step, the critical path(s), and the slack time for all activities involved.

11-30 Getting a degree from a college or university can be a long and difficult task. Certain courses must be completed before other courses may be taken. De- velop a network diagram in which every activity is a particular course that must be taken for a given degree program. The immediate predecessors will

M11_REND3161_13_AIE_C11.indd 418 27/10/16 2:28 PM

 419 DISCUSSIon QUESTIonS AnD PRoBLEMS  419

TABLE 11.10 Data for Problem 11-29, Bender Construction Company

WEEKS

ACTIVITY a m b DESCRIPTION OF ACTIVITY IMMEDIATE PREDECESSORS

1 1 4 5 Draft of legal documents —

2 2 3 4 Preparation of financial statements —

3 3 4 5 Draft of history —

4 7 8 9 Draft demand portion of feasibility study —

5 4 4 5 Review and approval of legal documents 1

6 1 2 4 Review and approval of history 3

7 4 5 6 Review of feasibility study 4

8 1 2 4 Draft final financial portion of feasibility study 7

9 3 4 4 Draft facts relevant to the bond transaction 5

10 1 1 2 Review and approval of financial statements 2

11 18 20 26 Receive firm price of project —

12 1 2 3 Review and completion of financial portion of feasibility study

8

13 1 1 2 Completion of draft statement 6, 9, 10, 11, 12

14 .10 .14 .16 All material sent to bond rating services 13

15 .2 .3 .4 Statement printed and distributed to all interested parties

14

16 1 1 2 Presentation to bond rating services 14

17 1 2 3 Bond rating received 16

18 3 5 7 Marketing of bonds 15, 17

19 .1 .1 .2 Purchase contract executed 18

20 .1 .14 .16 Final statement authorized and completed 19

21 2 3 6 Purchase contract 19

22 .1 .1 .2 Bond proceeds available 20

23 0 .2 .2 Sign construction contract 21, 22

be course prerequisites. Don’t forget to include all university, college, and departmental course re- quirements. Then try to group these courses into semesters or quarters for your particular school. How long do you think it will take you to graduate? Which courses, if not taken in the proper sequence, could delay your graduation?

11-31 Dream Team Productions was in the final design phases of its new film, Killer Worms, to be re- leased next summer. Market Wise, the firm hired to coordinate the release of Killer Worms toys, identified 16 critical tasks to be completed before the release of the film. These tasks are shown in the following table:

ACTIVITY

IMMEDIATE

PREDECESSORS

OPTIMISTIC

TIME

MOST

LIKELY

TIME

PESSIMISTIC

TIME

Task 1 — 1 2 4

Task 2 — 3 3.5 4

Task 3 — 10 12 13

Task 4 — 4 5 7

Task 5 — 2 4 5

Task 6 Task 1 6 7 8

Task 7 Task 2 2 4 5.5

Task 8 Task 3 5 7.7 9

Task 9 Task 3 9.9 10 12

Task 10 Task 3 2 4 5

Task 11 Task 4 2 4 6

Task 12 Task 5 2 4 6

Task 13 Tasks 6, 7, 8 5 6 6.5

Task 14 Tasks 10, 11, 12 1 1.1 2

Task 15 Tasks 9, 13 5 7 8

Task 16 Task 14 5 7 9

M11_REND3161_13_AIE_C11.indd 419 27/10/16 2:28 PM

420  CHAPTER 11 • PRojECT MAnAgEMEnT

(a) How many weeks in advance of the film release should Market Wise start its marketing cam- paign? What are the critical path activities?

(b) If tasks 9 and 10 were not necessary, what im- pact would this have on the critical path and the number of weeks needed to complete the mar- keting campaign?

11-32 The estimated times (in weeks) and immediate pre- decessors for the activities in a project are given in the following table. Assume that the activity times are independent.

ACTIVITY IMMEDIATE

PREDECESSORS

WEEKS

a m b

A — 9 10 11

B — 4 10 16

C A 9 10 11

D B 5 8 11

(a) Calculate the expected time and variance for each activity.

(b) What is the expected completion time of the critical path? What is the expected completion time of the other path in the network?

(c) What is the variance of the critical path? What is the variance of the other path in the network?

(d) If the time to complete path A–C is normally distributed, what is the probability that this path will be finished in 22 weeks or less?

(e) If the time to complete path B–D is normally distributed, what is the probability that this path will be finished in 22 weeks or less?

(f) Explain why the probability that the critical path will be finished in 22 weeks or less is not necessarily the probability that the project will be finished in 22 weeks or less.

11-33 The following costs have been estimated for the ac- tivities in a project:

ACTIVITY

IMMEDIATE PREDECESSORS

TIME (WEEKS)

COST ($)

A — 8 8,000

B — 4 12,000

C A 3 6,000

D B 5 15,000

E C, D 6 9,000

F C, D 5 10,000

G F 3 6,000

(a) Develop a cost schedule based on earliest start times.

(b) Develop a cost schedule based on latest start times.

(c) Suppose that it has been determined that the $6,000 for activity G is not evenly spread over the 3 weeks. Instead, the cost for the first week is $4,000, and the cost is $1,000 per week for each of the last 2 weeks. Modify the cost sched- ule based on earliest start times to reflect this situation.

11-34 The Scott Corey accounting firm is installing a new computer system. Several things must be done to make sure the system works properly before all the accounts are put into the new system. The following table provides information about this project. How long will it take to install the system? What is the critical path?

ACTIVITY

IMMEDIATE PREDECESSORS

TIME (WEEKS)

A — 3 B — 4 C A 6 D B 2 E A 5 F C 2 G D, E 4 H F, G 5

11-35 The managing partner of the Scott Corey account- ing firm (see Problem 11-34) has decided that the system must be up and running in 16 weeks. Con- sequently, information about crashing the project was put together and is shown in the following table:

ACTIVITY

IMMEDIATE

PREDECESSORS

NORMAL

TIME

(WEEKS)

CRASH

TIME

(WEEKS)

NORMAL

COST

($)

CRASH

COST ($)

A — 3 2 8,000 9,800

B — 4 3 9,000 10,000

C A 6 4 12,000 15,000

D B 2 1 15,000 15,500

E A 5 3 5,000 8,700

F C 2 1 7,500 9,000

G D, E 4 2 8,000 9,400

H F, G 5 3 5,000 6,600

(a) If the project is to be finished in 16 weeks, which activity or activities should be crashed to do this at the least additional cost? What is the total cost of this?

M11_REND3161_13_AIE_C11.indd 420 27/10/16 2:28 PM

 421 DISCUSSIon QUESTIonS AnD PRoBLEMS  421

(b) List all the paths in this network. After the crashing in part (a) has been done, what is the time required for each path? If the proj- ect completion time must be reduced another week so that the total time is 15 weeks, which activity or activities should be crashed? Solve this by inspection. Note that it is sometimes better to crash an activity that is not the least cost for crashing if it is on several paths rather than to crash several activities on separate paths when there is more than one critical path.

11-36 The L. O. Gystics Corporation is in need of a new regional distribution center. The planning for this project is in the early stages, but the activities have been identified, along with their predecessors and their activity times in weeks. The table below pro- vides this information. Develop a linear program that could be used to determine the length of the critical path (i.e., the minimum time required to complete the project). Solve this linear program to find the critical path and the time required to com- plete the project.

ACTIVITY

IMMEDIATE PREDECESSORS

TIME (WEEKS)

A — 4

B — 8

C A 5

D B 11

E A, B 7

F C, E 10

G D 16

H F 6

11-37 The Laurenster Corporation needs to perform the tasks in the following list. Develop the associated PERT network diagram, and determine the proba- bility that the project will be complete in 16 weeks or less.

ACTIVITY

IMMEDIATE

PREDECESSORS

OPTIMISTIC

TIME

MOST

LIKELY

TIME

PESSIMISTIC

TIME

A 2 3 4 B 4 6 8 C 2 5 8 D A 3 4 5 E B 6 7 8 F C 4 7 10 G A 1 5 9 H B 2 5 8 I C 3 5 7 J D, G 2 2 2 K E, H 4 4 4 L F, I 3 3 3

11-38 The Laurenster Corporation has determined the client will pay it a $10,000 bonus if it completes the project in Problem 11-37 in 14 weeks or less. The associated normal times and costs as well as the crash times and costs are shown below.

ACTIVITY

NORMAL

TIME

CRASH TIME

NORMAL COST

($)

CRASH COST

($)

A 3 2 600 1,200 B 6 4 1,200 2,400 C 5 2 1,200 2,400 D 4 3 1,200 1,800 E 7 6 1,200 1,800 F 7 4 1,200 3,000 G 5 1 2,400 4,800 H 5 2 1,200 3,000 I 5 3 1,800 2,400 J 2 2 300 300 K 4 4 300 300 L 3 3 300 300

Considering the costs involved to crash the project, determine if the Laurenster Corporation should crash the project to 14 weeks to receive the bonus.

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 11-39 to 11-46.

Internet Homework Problems

M11_REND3161_13_AIE_C11.indd 421 27/10/16 2:28 PM

422  CHAPTER 11 • PRojECT MAnAgEMEnT

After six months of study, much political arm wrestling, and some serious financial analysis, Dr. Martin Starr, president of Southwestern University, had reached a decision. To the delight of its students and to the disappointment of its athletic boosters, SWU would not be relocating to a new football site but would expand the capacity at its on-campus stadium.

Adding 21,000 seats, including dozens of luxury skyboxes, would not please everyone. The influential football coach, Billy Bob Taylor, had long argued the need for a first-class stadium, one with built-in dormitory rooms for his players and a palatial office appropriate for the coach of a future NCAA champion team. But the decision was made, and everyone, including the coach, would learn to live with it.

The job now was to get construction going immediately af- ter the current season ended. This would allow exactly 270 days until the upcoming season opening game. The contractor, Hill Construction (Bob Hill being an alumnus, of course), signed the contract. Bob Hill looked at the tasks his engineers had outlined and looked President Starr in the eye. “I guarantee the team will be able to take the field on schedule next year,” he said with a sense of confidence. “I sure hope so,” replied Starr. “The con- tract penalty of $10,000 per day for running late is nothing

compared to what Coach Billy Bob Taylor will do to you if our opening game with Penn State is delayed or cancelled.” Hill, sweating slightly, did not respond. In football-crazy Texas, Hill Construction’s name would be mud if the 270-day target were missed.

Back in his office, Hill again reviewed the data. (See Table 11.11, and note that optimistic time estimates can be used as crash times.) He then gathered his foremen. “People, if we’re not 75% sure we’ll finish this stadium in less than 270 days, I want this project crashed! Give me the cost figures for a target date of 250 days—also for 240 days. I want to be early, not just on time!”

Discussion Question 1. Develop a network drawing for Hill Construction, and

determine the critical path(s). How long is the project expected to take?

2. What is the probability of finishing in 270 days? 3. If it were necessary to crash to 250 or 240 days, how

would Hill do so, and at what costs? As noted in the case, assume that optimistic time estimates can be used as crash times.

Case Study

Southwestern University Stadium Construction

TABLE 11.11 Southwestern University Stadium Project

TIME (DAYS)

ACTIVITY

DESCRIPTION

IMMEDIATE

PREDECESSORS

OPTIMISTIC

MOST

LIKELY

PESSIMISTIC

CRASH COST/ DAY($)

A Bonding, insurance, tax structuring — 20 30 40 1,500

B Foundation, concrete footings for boxes

A 20 65 80 3,500

C Upgrading skyboxes, stadium seating

A 50 60 100 4,000

D Upgrading walkways, stairwells, elevators

C 30 50 100 1,900

E Interior wiring, lathes B 25 30 35 9,500

F Inspection approvals E 1 1 1 0

G Plumbing D, E 25 30 35 2,500

H Painting G 10 20 30 2,000

I Hardware/air conditioning/metal workings

H 20 25 60 2,000

J Tile/carpeting/windows H 8 10 12 6,000

K Inspection J 1 1 1 0

L Final detail work/cleanup I, K 20 25 60 4,500

Source: HEIZER, JAY; RENDER, BARRY, OPERATIONS MANAGEMENT, 6th ed., © 2001. Reprinted and Electronically reproduced by permission of Pearson Education, Inc., New York, NY.

M11_REND3161_13_AIE_C11.indd 422 27/10/16 2:28 PM

 423 CASE STUDY  423

Dr. Adinombe Watage, deputy director of the Family Planning Research Center in Nigeria’s Over-the-River Province, was assigned the task of organizing and training five teams of field workers to perform educational and outreach activities as part of a large project to demonstrate acceptance of a new method of birth control. These workers already had training in family planning education but must receive specific training regarding the new method of contraception. Two types of materials must also be prepared: (1) those for use in training the workers and (2) those for distribution in the field. Training faculty must be brought in and arrangements made for transportation and accommodations for the participants.

Dr. Watage first called a meeting of his office staff. Together they identified the activities that must be carried out, their necessary sequences, and the time that they would require. Their results are displayed in Table 11.12.

Louis Odaga, the chief clerk, noted that the project had to be completed in 60 days. Whipping out his solar-powered

calculator, he added up the time needed. It came to 94 days. “An impossible task, then,” he noted. “No,” Dr. Watage replied, “some of these tasks can go forward in parallel.” “Be careful, though,” warned Mr. Oglagadu, the chief nurse, “there aren’t that many of us to go around. There are only 10 of us in this office.”

“I can check whether we have enough heads and hands once I have tentatively scheduled the activities,” Dr. Watage responded. “If the schedule is too tight, I have permission from the Pathminder Fund to spend some funds to speed it up, just so long as I can prove that it can be done at the least cost necessary. Can you help me prove that? Here are the costs for the activities with the elapsed time that we planned and the costs and times if we shorten them to an absolute minimum.” Those data are given in Table 11.13.

Source: Family Planning Research Center of Nigeria by Curtis P. McLaughlin. © by Curtis P. McLaughlin. Reprinted by permission of Curtis P. McLaughlin.

Case Study

Family Planning Research Center of Nigeria

TABLE 11.12 Family Planning Research Center Activities

ACTIVITY MUST FOLLOW TIME (DAYS) STAFFING NEEDED

A. Identify faculty — 5 2

B. Arrange transport — 7 3

C. Identify materials — 5 2

D. Arrange accommodations A 3 1

E. Identify team A 7 4

F. Bring in team B, E 2 1

G. Transport faculty A, B 3 2

H. Print materials C 10 6

I. Deliver materials H 7 3

J. Train team D, F, G, I 15 0

K. Do fieldwork J 30 0

TABLE 11.13 Family Planning Research Center Costs

ACTIVITY

NORMAL MINIMUM AVERAGE COST

PER DAY SAVED ($)TIME COST ($) TIME COST ($)

A. Identify faculty 5 400 2 700 100

B. Arrange transport 7 1,000 4 1,450 150

C. Identify materials 5 400 3 500 50

D. Arrange accommodations 3 2,500 1 3,000 250

E. Identify team 7 400 4 850 150

F. Bring in team 2 1,000 1 2,000 1,000

G. Transport faculty 3 1,500 2 2,000 500

H. Print materials 10 3,000 5 4,000 200

I. Deliver materials 7 200 2 600 80

J. Train team 15 5,000 10 7,000 400

K. Do fieldwork 30 10,000 20 14,000 400

M11_REND3161_13_AIE_C11.indd 423 27/10/16 2:28 PM

424  CHAPTER 11 • PRojECT MAnAgEMEnT

Discussion Question 1. Some of the tasks in this project can be done in parallel.

Prepare a diagram showing the required network of tasks, and define the critical path. What is the length of the proj- ect without crashing?

2. At this point, can the project be done given the personnel constraint of 10 persons?

3. If the critical path is longer than 60 days, what is the least amount that Dr. Watage can spend and still achieve this schedule objective? How can he prove to the Pathminder Fund that this is the minimum-cost alternative?

Source: Professor Curtis P. McLaughlin, Kenan-Flagler Business School, University of North Carolina at Chapel Hill.

See our Internet home page, at www.pearsonhighered.com/render, for these additional case studies: (1) Alpha Beta Gamma Record: This case involves publishing a monthly magazine for a

fraternity. (2) Bay Community Hospital: This case involves the acquisition and installation of equipment to

be used in a new medical procedure. (3) Cranston Construction Company: This case involves the construction of a new building at a

university. (4) Haygood Brothers Construction Company: This case involves planning the construction of

a house. (5) Shale Oil Company: This case involves planning the shutdown of a petrochemical plant for

routine maintenance.

Internet Case Studies

Bibliography

Ahuja, V., and V. Thiruvengadam. “Project Scheduling and Monitoring: Cur- rent Research Status,” Construction Innovation 4, 1 (2004): 19–31.

Elton, Jeffrey, and Justin Roe. “Bringing Discipline to Project Management,” Harvard Business Review 76 (March–April 1998): 153–159.

Griffith, Andrew F. “Scheduling Practices and Project Success,” Cost Engi­ neering 48, 9 (2006): 24–30.

Herroelen, Willy, and Roel Leus. “Project Scheduling Under Uncertainty: Survey and Research Potentials,” European Journal of Operational Research 165, 2 (2005): 289–306.

Jorgensen, Trond, and Stein W. Wallace. “Improving Project Cost Estimation by Taking into Account Managerial Flexibility,” European Journal of Operational Research 127, 2 (2000): 239–251.

Lancaster, John, and Mustafa Ozbayrak. “Evolutionary Algorithms Applied to Project Scheduling Problems—A Survey of the State-of-the-Art,” Inter­ national Journal of Production Research 45, 2 (2007): 425–450.

Lu, Ming, and Heng Li. “Resource-Activity Critical-Path Method for Con- struction Planning,” Journal of Construction Engineering & Manage­ ment 129, 4 (2003): 412–420.

Mantel, Samuel J., Jack R. Meredith, Scott M. Shafer, and Margaret M. Sut- ton. Project Management in Practice. New York: John Wiley & Sons, Inc., 2001.

Premachandra, I. M. “An Approximation of the Activity Duration Distribu- tion in PERT,” Computers and Operations Research 28, 5 (April 2001): 443–452.

Sander, Wayne. “The Project Manager’s Guide,” Quality Progress (January 1998): 109.

Vaziri, Kabeh, Paul G. Carr, and Linda K. Nozick. “Project Planning for Con- struction Under Uncertainty with Limited Resources,” Journal of Con­ struction Engineering & Management 133, 4 (2007): 268–276.

Walker, Edward D. II “Introducing Project Management Concepts Using a Jewelry Store Robbery,” Decision Sciences Journal of Innovative Educa­ tion 2, 1 (2004): 65–69.

Appendix 11.1: Project Management with QM for Windows

PERT is one of the most popular project management tech- niques. In this chapter, we explore the General Foundry, Inc., example. When expected times and variances have been com- puted for each activity, we can use the data to determine slack, the critical path, and the total project completion time. Program 11.3A shows the QM for Windows input screen for the General Foundry problem. By selecting immediate predecessor list as

the type of network, the data can be input without even con- structing the network. The method indicated is for three time estimates, although this can be changed to a single time estimate, crashing, or cost budgeting. Program 11.3B provides the output for the General Foundry problem. The critical path consists of the activities with zero slack.

M11_REND3161_13_AIE_C11.indd 424 27/10/16 2:28 PM

 425 APPEnDIX 11.1: PRojECT MAnAgEMEnT WITH QM FoR WInDoWS  425

In addition to basic project management, QM for Windows allows for project crashing, in which additional resources are used to reduce project completion time. Program 11.4A shows the input screen for the General Foundry data from Table 11.9. The output is shown in Program 11.4B. This indicates that the normal time is 15 weeks, but the project may be finished in 7 weeks if necessary; it may be finished in any number of weeks between 7 and 15. Selecting Windows—Crash Schedule pro- vides additional information regarding these other times.

Monitoring and controlling projects is always an important aspect of project management. In this chapter, we demonstrate how to construct budgets using the earliest and latest start times. Programs 11.5 and 11.6 show how QM for Windows can be used to develop budgets using earliest and latest starting times for a project. The data come from the General Foundry example in Tables 11.6 and 11.7.

PROGRAM 11.3A QM for Windows Input Screen for general Foundry, Inc.

PROGRAM 11.3B QM for Windows Solution Screen for general Foundry, Inc.

PROGRAM 11.4A QM for Windows Input Screen for Crashing general Foundry Example

M11_REND3161_13_AIE_C11.indd 425 27/10/16 2:28 PM

426  CHAPTER 11 • PRojECT MAnAgEMEnT

PROGRAM 11.4B QM for Windows output Screen for Crashing general Foundry Example

PROGRAM 11.5 QM for Windows for Budgeting with Earliest Start Times for general Foundry

PROGRAM 11.6 QM for Windows for Budgeting with Latest Start Times for general Foundry

M11_REND3161_13_AIE_C11.indd 426 27/10/16 2:28 PM

 427

12.5 Analyze a variety of operating characteristics of waiting lines for single channel models with deterministic service times and infinite calling populations.

12.6 Analyze a variety of operating characteristics of waiting lines for single channel models with exponential service times and finite calling populations.

12.7 Understand Little’s Flow Equations.

12.8 Understand the need for simulation for more complex waiting line models.

12.1 Describe the trade-off curves for cost-of-waiting time and cost of service.

12.2 Describe the basic queuing system configurations and the three parts of a queuing system: the calling population, the queue itself, and the service facility.

12.3 Analyze a variety of operating characteristics of waiting lines for single channel models with exponential service times and infinite calling populations.

12.4 Analyze a variety of operating characteristics of waiting lines for multi-channel models with exponential service times and infinite calling populations.

After completing this chapter, students will be able to:

Waiting Lines and Queuing Theory Models

LEARNING OBJECTIVES

12 CHAPTER

T he study of waiting lines, called queuing theory, is one of the oldest and most widely used quantitative analysis techniques. Waiting lines are an everyday occurrence, affecting people shopping for groceries, buying gasoline, making a bank deposit, or waiting on the telephone for the first available customer service agent to answer. Queues,1 another term for waiting lines, may also take the form of machines waiting to be repaired, trucks in line to be unloaded, or airplanes lined up on a runway waiting for permission to take off. The three basic components of a queuing process are arrivals, service facilities, and the actual waiting line.

In this chapter, we discuss how analytical models of waiting lines can help managers evalu- ate the cost and effectiveness of service systems. We begin with a look at waiting line costs and then describe the characteristics of waiting lines and the underlying mathematical assumptions used to develop queuing models. We also provide the equations needed to compute the operating characteristics of a service system and show examples of how they are used. Later in the chapter,

1The word queue is pronounced like the letter Q—that is, “kew.”

M12_REND3161_13_AIE_C12.indd 427 28/10/16 11:20 AM

428  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

you will see how to save computational time by applying queuing tables and by running waiting- line computer programs.

12.1 Waiting Line Costs

Most waiting line problems are centered on the question of finding the ideal level of services that a firm should provide. Supermarkets must decide how many cash register checkout positions should be opened. Gasoline stations must decide how many pumps should be opened and how many attendants should be on duty. Manufacturing plants must determine the optimal number of mechanics to have on duty each shift to repair machines that break down. Banks must decide how many teller windows to keep open to serve customers during various hours of the day. In most cases, this level of service is an option over which management has control. An extra teller, for example, can be borrowed from another chore or can be hired and trained quickly if demand warrants it. This may not always be the case, though. A plant may not be able to locate or hire skilled mechanics to repair sophisticated electronic machinery.

When an organization does have control, its objective is usually to find a happy medium between two extremes. On the one hand, a firm can retain a large staff and provide many service facilities. This may result in excellent customer service, with seldom more than one or two cus- tomers in a queue. Customers are kept happy with the quick response and appreciate the conve- nience. This, however, can become expensive.

The other extreme is to have the minimum possible number of checkout lines, gas pumps, or teller windows open. This keeps the service cost down but may result in customer dissatisfac- tion. How many times would you return to a large discount department store that had only one cash register open during the day you shop? As the average length of the queue increases and poor service results, customers and goodwill may be lost.

Most managers recognize the trade-off that must take place between the cost of providing good service and the cost of customer waiting time. They want queues that are short enough so that customers don’t become unhappy and either storm out without buying or buy but never return. But they are willing to allow some waiting in line if it is balanced by a significant savings in service costs.

One means of evaluating a service facility is thus to look at a total expected cost, a concept illustrated in Figure 12.1. Total expected cost is the sum of expected service costs plus expected waiting costs.

Service costs are seen to increase as a firm attempts to raise its level of service. For example, if three teams of stevedores, instead of two, are employed to unload a cargo ship, service costs are increased by the additional price of wages. As service improves in speed, however, the cost of time spent waiting in lines decreases. This waiting cost may reflect lost productivity of workers while their tools or machines are awaiting repairs or may simply be an estimate of the costs of customers lost because of poor service and long queues.

Three Rivers Shipping Company Example As an illustration, let’s look at the case of the Three Rivers Shipping Company. Three Rivers runs a huge docking facility located on the Ohio River near Pittsburgh. Approximately five ships arrive to unload their cargoes of steel and ore during every 12-hour work shift. Each hour that a ship sits idle in line waiting to be unloaded costs the firm a great deal of money, about $1,000 per hour. From experience, management estimates that if one team of stevedores is on duty to

One of the goals of queuing analysis is finding the best level of service for an organization.

Managers must deal with the trade-off between the cost of providing good service and the cost of customer waiting time. The latter may be hard to quantify.

Queuing theory had its beginning in the research work of a Danish engineer named A. K. Erlang. In 1909, Erlang experi- mented with fluctuating demand in telephone traffic. Eight years

later, he published a report addressing the delays in automatic dialing equipment. At the end of World War II, Erlang’s early work was extended to more general problems and to business applica- tions of waiting lines.

How Queuing Models BeganHISTORY

Total expected cost is the sum of service plus waiting costs.

M12_REND3161_13_AIE_C12.indd 428 28/10/16 11:20 AM

12.2 CHARACTERisTiCs oF A QUEUing sysTEM  429

handle the unloading work, each ship will wait an average of 7 hours to be unloaded. If two teams are working, the average waiting time drops to 4 hours; for three teams, it’s 3 hours; and for four teams of stevedores, it’s only 2 hours. But each additional team of stevedores is also an expensive proposition, due to union contracts.

Three Rivers’ superintendent would like to determine the optimal number of teams of ste- vedores to have on duty each shift. The objective is to minimize the total expected costs. This analysis is summarized in Table 12.1. To minimize the sum of service costs and waiting costs, the firm makes the decision to employ two teams of stevedores each shift.

12.2 Characteristics of a Queuing System

In this section, we take a look at the three parts of a queuing system: (1) the arrivals or inputs to the system (sometimes referred to as the calling population), (2) the queue or the waiting line itself, and (3) the service facility. These three components have certain characteristics that must be examined before mathematical queuing models can be developed.

Arrival Characteristics The input source that generates arrivals or customers for the service system has three major characteristics. It is important to consider the size of the calling population, the pattern of arriv- als at the queuing system, and the behavior of the arrivals.

* Optimal Service Level

C os

t Service Level

Cost of Waiting Time

Cost of Providing Service

Total Expected Cost

FIGURE 12.1 Queuing Costs and service Levels

The goal is to find the service level that minimizes total expected cost.

TABLE 12.1 Three Rivers shipping Company Waiting Line Cost Analysis

NUMBER OF TEAMS OF STEVEDORES WORKING

1 2 3 4

(a) Average number of ships arriving per shift 5 5 5 5

(b) Average time each ship waits to be unloaded (hours) 7 4 3 2

(c) Total ship hours lost per shift 1a * b2 35 20 15 10 (d) Estimated cost per hour of idle ship time $1,000 $1,000 $1,000 $1,000

(e) Value of ship’s lost time or waiting cost 1c * d2 $35,000 $20,000 $15,000 $10,000 (f) Stevedore team salary,* or service cost $6,000 $12,000 $18,000 $24,000

(g) Total expected cost (e + f) $41,000 $32,000 $33,000 $34,000 Optimal cost

* Stevedore team salaries are computed as the number of people in a typical team (assumed to be 50) times the number of hours each person works per day (12 hours) times an hourly salary of $10 per hour. If two teams are employed, the rate is just doubled.

M12_REND3161_13_AIE_C12.indd 429 28/10/16 11:20 AM

430  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

SIZE OF THE CALLING POPULATION Population sizes are considered to be either unlimited (essen- tially infinite) or limited (finite). When the number of customers or arrivals on hand at any given moment is just a small portion of potential arrivals, the calling population is considered unlim- ited. For practical purposes, examples of unlimited populations include cars arriving at a high- way tollbooth, shoppers arriving at a supermarket, and students arriving to register for classes at a large university. Most queuing models assume such an infinite calling population. When this is not the case, modeling becomes much more complex. An example of a finite population is a shop with only eight machines that might break down and require service.

PATTERN OF ARRIVALS AT THE SYSTEM Customers either arrive at a service facility according to some known schedule (e.g., one patient every 15 minutes or one student for advising every half hour) or arrive randomly. Arrivals are considered random when they are independent of one another and their occurrence cannot be predicted exactly. Frequently in queuing problems, the number of arrivals per unit of time can be estimated by a probability distribution known as the Poisson distribution. See Section 2.11 for details about this distribution.

BEHAVIOR OF THE ARRIVALS Most queuing models assume that an arriving customer is a patient customer. Patient customers are people or machines that wait in the queue until they are served and do not switch between lines. Unfortunately, life and quantitative analysis are complicated by the fact that people have been known to balk or renege. Balking refers to customers who refuse to join the waiting line because it is too long to suit their needs or inter- ests. Reneging customers are those who enter the queue but then become impatient and leave without completing their transaction. Actually, both of these situations just serve to accentu- ate the need for queuing theory and waiting line analysis. How many times have you seen a shopper with a basket full of groceries, including perishables such as milk, frozen food, or meats, simply abandon the shopping cart before checking out because the line was too long? This expensive occurrence for the store makes managers acutely aware of the importance of service-level decisions.

Waiting Line Characteristics The waiting line itself is the second component of a queuing system. The length of a line can be either limited or unlimited. A queue is said to have limited queue length when it cannot, by the law of physical restrictions, increase to an infinite length. This may be the case in a small restaurant that has only 10 tables and can serve no more than 50 diners an evening. Analytic queuing models are treated in this chapter under an assumption of unlimited queue length. A queue is unlimited when its size is unrestricted, as in the case of the tollbooth serving arriving automobiles.

A second waiting line characteristic deals with queue discipline. This refers to the rule by which customers in the line are to receive service. Most systems use a queue discipline known as the first-in, first-out (FIFO) rule. In a hospital emergency room or an express checkout line at a supermarket, however, various assigned priorities may preempt FIFO. Patients who are critically injured will move ahead in treatment priority over patients with broken fingers or noses. Shop- pers with fewer than 10 items may be allowed to enter the express checkout queue but are then treated as first come, first served. Computer programming runs are another example of queu- ing systems that operate under priority scheduling. In most large companies, when computer- produced paychecks are due out on a specific date, the payroll program has highest priority over other runs.2

Service Facility Characteristics The third part of any queuing system is the service facility. It is important to examine two basic properties: (1) the configuration of the service system and (2) the pattern of service times.

Unlimited (or infinite) calling populations are assumed for most queuing models.

Arrivals are random when they are independent of one another and cannot be predicted exactly.

The concepts of balking and reneging.

The models in this chapter assume unlimited queue length.

Most queuing models use the FIFO rule. This is obviously not appropriate in all service systems, especially those dealing with emergencies.

2The term FIFS (first in, first served) is often used in place of FIFO. Another discipline, LIFS (last in, first served), is common when material is stacked or piled and the items on top are used first.

M12_REND3161_13_AIE_C12.indd 430 28/10/16 11:20 AM

12.2 CHARACTERisTiCs oF A QUEUing sysTEM  431

BASIC QUEUING SYSTEM CONFIGURATIONS Service systems are usually classified in terms of their number of channels, or number of servers, and their number of phases, or number of service stops that must be made. A single-channel system, with one server, is typified by the drive-in bank that has only one open teller or by the type of drive-through fast-food restaurant that has become so popular in the United States. If, on the other hand, the bank had several tellers on duty and each customer waited in one common line for the first available teller, we would have a multichannel system at work. Many banks today are multichannel service systems, as are most large barber shops and many airline ticket counters.

A single-phase system is one in which the customer receives service from only one station and then exits the system. A fast-food restaurant in which the person who takes your order also brings you the food and takes your money is a single-phase system. So is a driver’s license agency in which the person taking your application also grades your test and collects the license fee. But if the restaurant requires you to place your order at one station, pay at a second, and pick up the food at a third service stop, it becomes a multiphase system. Similarly, if the driver’s license agency is large or busy, you will probably have to wait in a line to complete the application (the first service stop), then queue again to have the test graded (the second service stop), and finally go to a third service counter to pay the fee. To help you relate the concepts of channels and phases, Figure 12.2 presents four possible configurations.

SERVICE TIME DISTRIBUTION Service patterns are like arrival patterns in that they can be either constant or random. If service time is constant, it takes the same amount of time to take care of each customer. This is the case in a machine-performed service operation such as an automatic car wash. More often, service times are randomly distributed. In many cases, it can be assumed that random service times are described by the negative exponential probability distribution. See Section 2.10 for details about this distribution.

The exponential distribution is important to the process of building mathematical queuing models because many of the models’ theoretical underpinnings are based on the assumption of Poisson arrivals and exponential services. Before they are applied, however, the quantitative analyst can and should observe, collect, and plot service time data to determine if they fit the exponential distribution.

Identifying Models Using Kendall Notation D. G. Kendall developed a notation that has been widely accepted for specifying the pattern of arrivals, the service time distribution, and the number of channels in a queuing model. This nota- tion is often seen in software for queuing models. The basic three-symbol Kendall notation is in the form

Arrival distribution>Service time distribution>Number of service channels open where specific letters are used to represent probability distributions. The following letters are commonly used in Kendall notation:

M = Poisson distribution for number of occurrences 1or exponential times2 D = constant 1deterministic2 rate G = general distribution with mean and variance known

Thus, a single-channel model with Poisson arrivals and exponential service times would be represented by

M>M>1 When a second channel is added, we would have

M>M>2 If there are m distinct service channels in the queuing system with Poisson arrivals and exponen- tial service times, the Kendall notation would be M>M>m. A three-channel system with Poisson arrivals and constant service time would be identified as M>D>3. A four-channel system with Poisson arrivals and service times that are normally distributed would be identified as M>G>4.

The number of service channels in a queuing system is the number of servers.

Single-phase means the customer receives service at only one station before leaving the system. Multiphase implies two or more stops before leaving the system.

Service times often follow the negative exponential distribution.

It is important to confirm that the queuing assumptions of Poisson arrivals and exponential services are valid before applying the model.

An M/M/2 model has Poisson arrivals, exponential service times, and two channels.

M12_REND3161_13_AIE_C12.indd 431 28/10/16 11:20 AM

432  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

There is a more detailed notation with additional terms that indicate the maximum number in the system and the population size. When these are omitted, it is assumed there is no limit to the queue length or the population size. Most of the models we study here will have those properties.

Multichannel, Multiphase System

Multichannel, Single-Phase System

Single-Channel, Multiphase System

Single-Channel, Single-Phase System

Arrivals

Arrivals

Arrivals

Arrivals Departures After Service

After

Service

Departures

Departures After Service

Departures After Service

Queue

Queue

Queue

Queue

Service Facility

Type 1 Service Facility

Type 2 Service Facility

Service Facility

1

Service Facility

2

Service Facility

3

Type 1 Service Facility

1

Type 2 Service Facility

1

Type 1 Service Facility

2

Type 2 Service Facility

2

FIGURE 12.2 Four Basic Queuing system Configurations

M12_REND3161_13_AIE_C12.indd 432 28/10/16 11:20 AM

12.2 CHARACTERisTiCs oF A QUEUing sysTEM  433

slow Down the ski Lift to get shorter Lines

At a small, five-lift ski resort, management was worried that lift lines were getting too long. While this is sometimes a nice problem to have because it means business is booming, it is a problem that can backfire. If word spreads that a ski resort’s lift lines are too long, customers may choose to ski elsewhere, where lines are shorter.

Because building new ski lifts requires significant finan- cial investment, management decided to hire an external con- sultant with queuing system experience to study the problem. After several weeks of investigating the problem, collecting data, and measuring the length of the lift lines at various times, the consultant presented recommendations to the ski resort’s management.

Surprisingly, instead of building new ski lifts, the consul- tant proposed that management slow down its five ski lifts at the resort to half their current speed and double the number of chairs on each of the lifts. This meant, for example, that instead of 40 feet between lift chairs, there would be only 20 feet between lift chairs, but because they were moving more slowly, there was still the same amount of time for customers to board the lift. So if a particular lift previously took 4 minutes to get to the top, it would now take 8 minutes. It was reasoned that skiers wouldn’t notice the difference in time because they were on the lifts and enjoying the view on the way to the top; this proved to be a valid assumption. Moreover, at any given time, twice as many people could actually be on the ski lifts, and fewer people were in the lift lines. The problem was solved!

IN ACTION

Defining the Problem In 2002, the Centers for Disease Control and Prevention began to require that public health departments create plans for smallpox vaccinations. A county must be prepared to vaccinate every person in an infected area in a few days. This was of particular concern after the terrorist attack of September 11, 2001.

Developing a Model Queuing models for capacity planning and discrete event simulation models were developed through a joint effort of the Montgomery County (Maryland) Public Health Service and the University of Maryland, College Park.

Acquiring Input Data Data were collected on the time required for the vaccinations to occur or for medicine to be dispensed. Clinical exercises were used for this purpose.

Developing a Solution The models indicate the number of staff members needed to achieve specific capacities to avoid conges- tion in the clinics.

Testing the Solution The smallpox vaccination plan was tested using a simulation of a mock vaccination clinic in a full-scale exercise involving residents going through the clinic. This highlighted the need for modifications in a few areas. A computer simulation model was then developed for additional testing.

Analyzing the Results The results of the capacity planning and queuing model provide very good estimates of the true perfor- mance of the system. Clinic planners and managers can quickly estimate capacity and congestion as the situation develops.

Implementing the Results The results of this study are available on a website for public health professionals to download and use. The guidelines include suggestions for workstation operations. Improvements to the process are continuing.

Source: Based on Kay Aaby et al., “Montgomery County’s Public Health Service Operations Research to Plan Emergency Mass Dispensing and Vaccination Clinics,” Interfaces 36, 6 (November–December 2006): 569–579, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Montgomery County’s Public Health services

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M12_REND3161_13_AIE_C12.indd 433 28/10/16 11:20 AM

434  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

12.3 Single-Channel Queuing Model with Poisson Arrivals and Exponential Service Times (M/M /1)

In this section, we present an analytical approach to determine important measures of perfor- mance in a typical service system. After these numeric measures have been computed, it will be possible to add in cost data and begin to make decisions that balance desirable service levels with waiting line service costs.

Assumptions of the Model The single-channel, single-phase model considered here is one of the most widely used and sim- plest queuing models. It involves assuming that seven conditions exist:

1. Arrivals are served on a FIFO basis. 2. Every arrival waits to be served, regardless of the length of the line; that is, there is no

balking or reneging. 3. Arrivals are independent of preceding arrivals, but the average number of arrivals (the ar-

rival rate) does not change over time. 4. Arrivals are described by a Poisson probability distribution and come from an infinite or

very large population. 5. Service times also vary from one customer to the next and are independent of one another,

but their average rate is known. 6. Service times occur according to the negative exponential probability distribution. 7. The average service rate is greater than the average arrival rate.

When these seven conditions are met, we can develop a series of equations that define the queue’s operating characteristics. The mathematics used to derive each equation is rather complex and outside the scope of this book, so we will just present the resulting formulas here.

Queuing Equations We let

l = mean number of arrivals per time period m = mean number of people or items served per time period

When determining the arrival rate 1l2 and the service rate 1m2, the same time period must be used. For example, if l is the average number of arrivals per hour, then m must indicate the aver- age number that could be served per hour.

The queuing equations follow.

1. The average number of customers or units in the system, L—that is, the number in line plus the number being served:

L = l

m - l (12-1)

2. The average time a customer spends in the system, W—that is, the time spent in line plus the time spent being served:

W = 1

m - l (12-2)

3. The average number of customers in the queue, Lq:

Lq = l2

m1m - l2 (12-3)

4. The average time a customer spends waiting in the queue, Wq:

Wq = l

m1m - l2 (12-4)

These seven assumptions must be met if the single-channel, single- phase model is to be applied.

These seven queuing equations for the single-channel, single-phase model describe the important operating characteristics of the service system.

M12_REND3161_13_AIE_C12.indd 434 28/10/16 11:20 AM

12.3 singLE-CHAnnEL QUEUing MoDEL WiTH Poisson ARRiVALs AnD EXPonEnTiAL sERViCE TiMEs (M/M /1)  435

5. The utilization factor for the system, r (the Greek lowercase letter rho)—that is, the prob- ability that the service facility is being used:

r = l

m (12-5)

6. The percent idle time, P0—that is, the probability that no one is in the system:

P0 = 1 - l

m (12-6)

7. The probability that the number of customers in the system is greater than k, Pn 7 k:

Pn 7 k = alm b k + 1

(12-7)

Arnold’s Muffler Shop Case We now apply these formulas to the case of Arnold’s Muffler Shop in New Orleans. Arnold’s mechanic, Reid Blank, is able to install new mufflers at an average rate of three per hour, or about one every 20 minutes. Customers needing this service arrive at the shop on the average of two per hour. Larry Arnold, the shop owner, studied queuing models in an MBA program and feels that all seven of the conditions for a single-channel model are met. He proceeds to calcu- late the numerical values of the preceding operating characteristics:

l = 2 cars arriving per hour

m = 3 cars serviced per hour

L = l

m - l =

2

3 - 2 =

2

1 = 2 cars in the system on the average

W = 1

m - l =

1

3 - 2 = 1 hour that an average car spends in the system

Lq = l2

m1m - l2 = 22

313 - 22 = 4

3112 = 4

3 = 1.33 cars waiting in line on the average

Wq = l

m1m - l2 = 2

313 - 22 = 2

3 hour = 40 minutes = average waiting time per car

Note that W and Wq are in hours, since l was defined as the number of arrivals per hour.

r = l

m =

2

3 = 0.67 = percentage of time mechanic is busy, or the probability

that the server is busy

P0 = 1 - l

m = 1 -

2

3 = 0.33 = probability that there are 0 cars in the system

Probability of More Than k Cars in the System

k Pn+k = 12�32k+1 0 0.667 Note that this is equal to 1 - P0 = 1 - 0.33 = 0.667. 1 0.444

2 0.296

3 0.198 This implies that there is a 19.8% chance that more than 3 cars are in the system.

4 0.132

5 0.088

6 0.058

7 0.039

M12_REND3161_13_AIE_C12.indd 435 28/10/16 11:20 AM

436  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

USING EXCEL QM ON THE ARNOLD’S MUFFLER SHOP QUEUE To use Excel QM for this problem, from the Excel QM menu, select Waiting Lines - Single Channel (M/M/1). When the spreadsheet appears, enter the arrival rate (2) and service rate (3). All the operating characteristics will automatically be computed, as demonstrated in Program 12.1.

INTRODUCING COSTS INTO THE MODEL Now that the characteristics of the queuing system have been computed, Arnold decides to do an economic analysis of their impact. The waiting line model was valuable in predicting potential waiting times, queue lengths, idle times, and so on. But it did not identify optimal decisions or consider cost factors. As stated earlier, the solution to a queuing problem may require management to make a trade-off between the increased cost of providing better service and the decreased waiting cost derived from providing that service. These two costs are called the waiting cost and the service cost.

The total service cost is

Total service cost = 1Number of channels21Cost per channel2 Total service cost = mCs (12-8)

where m = number of channels Cs = service cost (labor cost) of each channel

The waiting cost when the waiting time cost is based on time in the system is

Total waiting cost = 1Total time spent waiting by all arrivals21Cost of waiting2 = 1Number of arrivals21Average wait per arrival2Cw

so

Total waiting cost = 1lW2Cw (12-9) If the waiting time cost is based on time in the queue, this becomes

Total waiting cost = 1lWq2Cw (12-10) These costs are based on whatever time units (often hours) are used in determining l. Adding the total service cost to the total waiting cost, we have the total cost of the queuing system. When the waiting cost is based on the time in the system, this is

Total cost = Total service cost + Total waiting cost Total cost = mCs + lWCw (12-11)

When the waiting cost is based on time in the queue, the total cost is

Total cost = mCs + lWqCw (12-12)

Conducting an economic analysis is the next step. It permits cost factors to be included.

PROGRAM 12.1 Excel QM solution for Arnold’s Muffler shop

M12_REND3161_13_AIE_C12.indd 436 28/10/16 11:20 AM

12.3 singLE-CHAnnEL QUEUing MoDEL WiTH Poisson ARRiVALs AnD EXPonEnTiAL sERViCE TiMEs (M/M /1)  437

At times, we may wish to determine the daily cost, and then we simply find the total number of arrivals per day. Let us consider the situation for Arnold’s Muffler Shop.

Arnold estimates that the cost of customer waiting time, in terms of customer dissatisfaction and lost goodwill, is $50 per hour of time spent waiting in line. (After customers’ cars are actu- ally being serviced on the rack, customers don’t seem to mind waiting.) Because on the average a car has a 2�3 hour wait and there are approximately 16 cars serviced per day (2 per hour times 8 working hours per day), the total number of hours that customers spend waiting for mufflers to be installed each day is 2�3 * 16 = 32�3, or 10 2�3 hours. Hence, in this case,

Total daily waiting cost = 18 hours per day2lWqCw = 18212212�321$502 = $533.33 The only other cost that Larry Arnold can identify in this queuing situation is the pay rate of Reid Blank, the mechanic. Blank is paid $15 per hour:

Total daily service cost = 18 hours per day2mCs = 81121$152 = $120 The total daily cost of the system as it is currently configured is the total of the waiting cost and the service cost, which gives us

Total daily cost of the queuing system = $533.33 + $120 = $653.33

Now comes a decision. Arnold finds out through the muffler business grapevine that the Rusty Muffler, a cross-town competitor, employs a mechanic named Jimmy Smith who can efficiently install new mufflers at the rate of four per hour. Larry Arnold contacts Smith and inquires as to his interest in switching employers. Smith says that he would consider leaving the Rusty Muffler but only if he were paid a $20 per hour salary. Arnold, being a crafty businessman, decides that it may be worthwhile to fire Blank and replace him with the speedier but more expensive Smith.

He first recomputes all the operating characteristics using a new service rate of four muf- flers per hour:

l = 2 cars arriving per hour m = 4 cars serviced per hour

L = l

m - l =

2

4 - 2 = 1 car in the system on the average

W = 1

m - l =

1

4 - 2 =

1

2 hour in the system on the average

Lq = l2

m1m - l2 = 22

414 - 22 = 4

8 =

1

2 car waiting in line on the average

Wq = l

m1m - l2 = 2

414 - 22 = 2

8 =

1

4 hour = 15 minutes average waiting time

per car in the queue

r = l

m =

2

4 = 0.5 = percentage of time mechanic is busy

P0 = 1 - l

m = 1 - 0.5 = 0.5 = probability that there are 0 cars in the system

Customer waiting time is often considered the most important factor.

Waiting cost plus service cost equal total cost.

Probability of More Than k Cars in the System

k Pn+k = 12�42k+1 0 0.500

1 0.250

2 0.125

3 0.062

4 0.031

5 0.016

6 0.008

7 0.004

M12_REND3161_13_AIE_C12.indd 437 28/10/16 11:20 AM

438  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

It is quite evident that Smith’s speed will result in considerably shorter queues and waiting times. For example, a customer would now spend an average of 1�2 hour in the system and 1�4 hour waiting in the queue, as opposed to 1 hour in the system and 2�3 hour in the queue with Blank as mechanic. The total daily waiting time cost with Smith as the mechanic will be

Total daily waiting cost = 18 hours per day2lWqCw = 182122a14 b1$502 = $200 per day

Notice that the total time spent waiting for the 16 customers per day is now

116 cars per day2 * 11�4 hour per car2 = 4 hours instead of 10.67 hours with Blank. Thus, the waiting is much less than half of what it was, even though the service rate only changed from three per hour to four per hour.

The service cost will go up due to the higher salary, but the overall cost will decrease, as we see here:

Service cost of Smith = 8 hours>day * $20>hour = $160 per day Total expected cost = Waiting cost + Service cost = $200 + $160

= $360 per day

Because the total daily expected cost with Blank as mechanic was $653.33, Arnold may very well decide to hire Smith and reduce costs by $653.33 - $360 = $293.33 per day.

Enhancing the Queuing Environment Although reducing the waiting time is an important factor in reducing the waiting time cost of a queuing system, a manager might find other ways to reduce this cost. The total waiting time cost is based on the total amount of time spent waiting (based on W or Wq) and the cost of waiting 1Cw2. Reducing either of these will reduce the overall cost of waiting. Enhancing the queuing environment by making the wait less unpleasant may reduce Cw, as customers will not be as upset by having to wait. There are magazines in the waiting room of doctors’ offices for patients to read while waiting. There are tabloids on display by the checkout lines in grocery stores, and customers read the headlines to pass time while waiting. Music is often played while telephone callers are placed on hold. At major amusement parks, there are video screens and televisions in some of the queue lines to make the wait more interesting. For some of these, the waiting line is so entertaining that it is almost an attraction itself.

All of these things are designed to keep the customer busy and to enhance the conditions surrounding the waiting so that it appears that time is passing more quickly than it actually is. Consequently, the cost of waiting 1Cw2 becomes lower, and the total cost of the queuing system is reduced. Sometimes, reducing the total cost in this way is easier than reducing the total cost

Here is a comparison of total costs using the two different mechanics.

Ambulances in Chile Evaluate and improve Performance Metrics Through Queuing Theory

Researchers in Chile turned to queuing theory to evaluate and improve ambulance services. They investigated the key perfor- mance indicators that are of value to an ambulance company manager (e.g., number of ambulances deployed, ambulance base locations, operating costs) and the key performance indicators that are of value to a customer (e.g., waiting time until service, queue prioritization system).

The somewhat surprising result that the researchers brought to light was that seemingly simple metrics such as waiting time

in queue, Wq, were of the most value for ambulance operations. Reducing wait times saves the ambulance company money in gasoline and transportation costs, and, more importantly, it can save lives for its customers. In other words, sometimes simpler is better.

Source: Based on Marcos Singer and Patricio Donoso, “Assessing an Ambu- lance Service with Queuing Theory,” Computers & Operations Research 35, 8 (2008): 2549–2560, © Trevor S. Hale.

IN ACTION

M12_REND3161_13_AIE_C12.indd 438 28/10/16 11:20 AM

12.4 MULTiCHAnnEL QUEUing MoDEL WiTH Poisson ARRiVALs AnD EXPonEnTiAL sERViCE TiMEs (M ∕M ∕m)  439

by lowering W or Wq. In the case of Arnold’s Muffler Shop, Arnold might consider remodeling the waiting room and putting in a television so customers feel more comfortable while waiting for their cars to be serviced.

12.4 Multichannel Queuing Model with Poisson Arrivals and Exponential Service Times (M ∕M ∕m)

The next logical step is to look at a multichannel queuing system, in which two or more servers or channels are available to handle arriving customers. Let us still assume that customers await- ing service form one single line and then proceed to the first available server. An example of such a multichannel, single-phase waiting line is found in many banks today. A common line is formed and the customer at the head of the line proceeds to the first free teller. (Refer to Figure 12.2 for a typical multichannel configuration.)

The multiple-channel system presented here again assumes that arrivals follow a Poisson probability distribution and that service times are distributed exponentially. Service is first come, first served, and all servers are assumed to perform at the same rate. Other assumptions listed earlier for the single-channel model apply as well.

Equations for the Multichannel Queuing Model If we let

m = number of channels open,

l = average arrival rate, and

m = average service rate at each channel,

the following formulas may be used in the waiting line analysis:

1. The probability that there are zero customers or units in the system:

P0 = 1

c a n=m - 1

n=0 1

n! al m b

n

d + 1 m!

al m b

m mm

mm - l

for mm 7 l (12-13)

2. The average number of customers or units in the system:

L = lm1l>m2m

1m - 12!1mm - l22P0 + l

m (12-14)

3. The average time a unit spends in the waiting line and being serviced (that is, in the system):

W = m1l>m2m

1m - 12!1mm - l22P0 + 1 m

= L

l (12-15)

4. The average number of customers or units in line waiting for service:

Lq = L - l

m (12-16)

5. The average time a customer or unit spends in the queue waiting for service:

Wq = W - 1 m

= Lq

l (12-17)

6. Utilization rate:

r = l

mm (12-18)

The multichannel model also assumes Poisson arrivals and exponential service times.

M12_REND3161_13_AIE_C12.indd 439 28/10/16 11:20 AM

440  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

These equations are obviously more complex than the ones used in the single-channel model, yet they are used in exactly the same fashion and provide the same type of information as did the simpler model.

Arnold’s Muffler Shop Revisited For an application of the multichannel queuing model, let’s return to the case of Arnold’s Muff ler Shop. Earlier, Larry Arnold examined two options. He could retain his current mechanic, Reid Blank, at a total expected cost of $653 per day, or he could fire Blank and hire a slightly more expensive but faster worker named Jimmy Smith. With Smith on board, service system costs could be reduced to $360 per day.

A third option is now explored. Arnold finds that at minimal after-tax cost he can open a second garage bay in which mufflers can be installed. Instead of firing his first mechanic, Blank, he would hire a second worker. The new mechanic would be expected to install mufflers at the same rate as Blank—about m = 3 per hour. Customers, who would still arrive at the rate of l = 2 per hour, would wait in a single line until one of the two mechanics is free. To find out how this option compares with the old single-channel waiting line system, Arnold computes sev- eral operating characteristics for the m = 2 channel system:

P0 = 1

c a 1

n=0 1

n! a2

3 b

n

d + 1 2!

a2 3 b

2

a 2132 2132 - 2 b

= 1

1 + 2

3 +

1

2 a4

9 ba 6

6 - 2 b

= 1

1 + 2

3 +

1

3

= 1

2 = 0.5

= Probability of 0 cars in the system

L = a 1221321 2�322

1!32132 - 242 ba 1

2 b + 2

3 =

8�3 16

a1 2 b + 2

3 =

3

4 = 0.75

= Average number of cars in the system

W = L

l =

3�4 2

= 3

8 hour = 221�2 minutes

= Average time a car spends in the system

Lq = L - l

m =

3

4 -

2

3 =

1

12 = 0.083

= Average number of cars in the queue

Wq = Lq

l =

0.083

2 = 0.0417 hour = 2.5 minutes

= Average time a car spends in the queue

These data are compared with earlier operating characteristics in Table 12.2. The increased ser- vice from opening a second channel has a dramatic effect on almost all characteristics. In par- ticular, time spent waiting in line drops from 40 minutes with only Blank or 15 minutes with only Smith down to only 2.5 minutes! Similarly, the average number of cars in the queue falls to 0.083 (about 1�12 of a car).3 But does this mean that a second bay should be opened?

The muffler shop considers opening a second muffler service channel that operates at the same speed as the first one.

3You might note that adding a second mechanic does not just cut queue waiting time and length in half but makes them even smaller. This is because of the random arrival and service processes. When there is only one mechanic and two customers arrive within a minute of each other, the second will have a long wait. The fact that the mechanic may have been idle for 30 to 40 minutes before they both arrive does not change this average waiting time. Thus, single-channel models often have higher wait times relative to multichannel models.

Dramatically lower waiting time results from opening the second service bay.

M12_REND3161_13_AIE_C12.indd 440 28/10/16 11:20 AM

12.4 MULTICHANNEL QUEUING MODEL WITH POISSON ARRIVALS AND EXPONENTIAL SERVICE TIMES (M ∕M ∕m)  441

To complete his economic analysis, Arnold assumes that the second mechanic would be paid the same as the current one, Blank—that is, $15 per hour. The daily waiting cost now will be

Total daily waiting cost = 18 hours per day2lWqCw = 18212210.041721$502 = $33.36 Notice that the total waiting time for the 16 cars per day is 116 cars>day2 * 10.0415 hour>car2 = 0.664 hours per day instead of the 10.67 hours with only one mechanic.

The service cost is doubled, as there are two mechanics, so this is

Total daily service cost = 18 hours per day2mCs = 1821221$152 = $240 The total daily cost of the system as it is currently configured is the total of the waiting cost and the service cost, which is

Total daily cost of the queuing system = $33.20 + $240 = $273.20

As you recall, the total cost with just Blank as mechanic was found to be $653 per day. The total cost with just Smith was just $360. Opening a second service bay will save about $380 per day compared to the current system, and it will save about $87 per day compared to the system with the faster mechanic. Thus, because the after-tax cost of a second bay is very low, Arnold’s deci- sion is to open a second service bay and hire a second worker who is paid the same as Blank. This may have additional benefits because word may spread about the very short waits at Arnold’s Muffler Shop, and this may increase the number of customers who choose to use Arnold’s.

USING EXCEL QM FOR ANALYSIS OF ARNOLD’S MULTICHANNEL QUEUING MODEL To use Excel QM for this problem, from the Excel QM menu, select Waiting Lines - Multiple Channel Model (M/M/s). When the spreadsheet appears, enter the arrival rate (2), service rate (3), and number of servers (2). Once these are entered, the solution shown in Program 12.2 will be displayed.

TABLE 12.2 Effect of Service Level on Arnold’s Operating Characteristics

LEVEL OF SERVICE

OPERATING CHARACTERISTIC

ONE MECHANIC

(REID BLANK) M = 3

TWO MECHANICS M = 3 FOR EACH

ONE FAST MECHANIC

(JIMMY SMITH) M = 4

Probability that the system is empty 1P02 0.33 0.50 0.50 Average number of cars in the system 1L2 2 cars 0.75 car 1 car Average time spent in the system 1W2 60 minutes 22.5 minutes 30 minutes Average number of cars in the queue 1Lq2 1.33 cars 0.083 car 0.50 car Average time spent in the queue 1Wq2 40 minutes 2.5 minutes 15 minutes

Enter the arrival rate, service rate, and number of servers (channels).

PROGRAM 12.2 Excel QM Solution for Arnold’s Muffler Multichannel Example

M12_REND3161_13_AIE_C12.indd 441 31/10/16 2:46 PM

442  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

12.5 Constant Service Time Model (M ,D , 1) Some service systems have constant service times instead of exponentially distributed times. When customers or equipment are processed according to a fixed cycle, as in the case of an automatic car wash or an amusement park ride, constant service rates are appropriate. Because constant rates are certain, the values for Lq, Wq, L, and W are always less than they would be in the models we have just discussed, which have variable service times. As a matter of fact, both the average queue length and the average waiting time in the queue are halved with the constant service rate model.

Equations for the Constant Service Time Model Constant service model formulas follow:

1. Average length of the queue:

Lq = l2

2m1m - l2 (12-19)

2. Average waiting time in the queue:

Wq = l

2m1m - l2 (12-20)

3. Average number of customers in the system:

L = Lq + l

m (12-21)

4. Average time in the system:

W = Wq + 1 m

(12-22)

Constant service rates speed the process compared to exponentially distributed service times with the same value of m.

Queuing at the Polls

The long lines at the polls in recent presidential elections have caused some concern. In 2000, some voters in Florida waited in line over 2 hours to cast their ballots. The final tally favored the winner by 527 votes of the almost 6 million votes cast in that state. Some voters growing tired of waiting and simply leaving the line without voting may have affected the outcome. A change of 0.01% could have caused different results. In 2004, there were reports of voters in Ohio waiting in line 10 hours to vote. If as few as 19 potential voters at each precinct in the 12 largest counties in Ohio got tired of waiting and left without voting, the outcome of the election may have been different. There were obvious problems with the number of machines available in some of the precincts. One precinct needed 13 machines but had only 2. Inexplicably, there were 68 voting machines in warehouses that were not even used. Other states had some long lines as well.

The basic problem stems from not having enough voting ma- chines in many of the precincts, although some precincts had suf- ficient machines and no problems. Why was there such a problem

in some of the voting precincts? Part of the reason is related to poor forecasting of the voter turnout in various precincts. What- ever the cause, the misallocation of voting machines among the precincts seems to be a major cause of the long lines in the national elections. Queuing models can help provide a scientific way to analyze the needs and anticipate the voting lines based on the number of machines provided.

The basic voting precinct can be modeled as a multi- channel queuing system. By evaluating a range of values for the forecast number of voters at different times of the day, a determination can be made on how long the lines will be, based on the number of voting machines available. While there still could be some lines if the state does not have enough voting machines to meet the anticipated need, the proper distribution of these machines will help to keep the waiting times reasonable.

Source: Based on Alexander S. Belenky and Richard C. Larson, “To Queue or Not to Queue,” OR/MS Today 33, 3 (June 2006): 30–34, © Trevor S. Hale.

IN ACTION

M12_REND3161_13_AIE_C12.indd 442 28/10/16 11:20 AM

12.6 FiniTE PoPULATion MoDEL (M/M/1 WiTH FiniTE soURCE)  443

Garcia-Golding Recycling, Inc. Garcia-Golding Recycling, Inc., collects and compacts aluminum cans and glass bottles in New York City. Its truck drivers, who arrive to unload these materials for recycling, currently wait an average of 15 minutes before emptying their loads. The cost of the driver and truck time wasted while in queue is valued at $60 per hour. A new automated compactor can be purchased that will process truck loads at a constant rate of 12 trucks per hour (i.e., 5 minutes per truck). Trucks arrive according to a Poisson distribution at an average rate of 8 per hour. If the new compactor is put in use, its cost will be amortized at a rate of $3 per truck unloaded. A summer intern from a local college did the following analysis to evaluate the costs versus benefits of the purchase:

Current waiting cost>trip = 11�4 hour waiting now21$60>hour cost2 = $15>trip

New system: l = 8 trucks>hour arriving m = 12 trucks>hour served

Average waiting time in queue = Wq = l

2m1m - l2 = 8

21122112 - 82 =

1

12 hour

Waiting cost>trip with new compactor = 11�12 hour wait21$60>hour cost2 = $5>trip Savings with new equipment = $15 1current system2 - $5 1new system2

= $10>trip Cost of new equipment amortized = $3>trip

Net savings = $7>trip

USING EXCEL QM FOR GARCIA-GOLDING’S CONSTANT SERVICE TIME MODEL To use Excel QM for this problem, from the Excel QM menu, select Waiting Lines - Constant Service Time Model (M/D/1). When the spreadsheet appears, enter the arrival rate (8) and the service rate (12). Once these are entered, the solution shown in Program 12.3 will be displayed.

12.6 Finite Population Model (M ,M ,1 with Finite Source) When there is a limited population of potential customers for a service facility, we need to con- sider a different queuing model. This model would be used, for example, if you were considering equipment repairs in a factory that has five machines, if you were in charge of maintenance for a fleet of 10 commuter airplanes, or if you ran a hospital ward that has 20 beds. The limited popu- lation model permits any number of repair people (servers) to be considered.

The reason this model differs from the three earlier queuing models is that there is now a dependent relationship between the length of the queue and the arrival rate. To illustrate the extreme situation, if your factory had five machines and all were broken and awaiting repair, the arrival rate would drop to zero. In general, as the waiting line becomes longer in the limited population model, the arrival rate of customers or machines drops lower.

Cost analysis for the recycling example.

PROGRAM 12.3 Excel QM solution for Constant service Time Model for garcia-golding Recycling Example

M12_REND3161_13_AIE_C12.indd 443 28/10/16 11:20 AM

444  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

In this section, we describe a finite calling population model that has the following assumptions:

1. There is only one server. 2. The population of units seeking service is finite.4

3. Arrivals follow a Poisson distribution, and service times are exponentially distributed. 4. Customers are served on a first-come, first-served basis.

Equations for the Finite Population Model Using

l = mean arrival rate, m = mean service rate, and N = size of the population,

the operating characteristics for the finite population model with a single channel or server on duty are as follows:

1. Probability that the system is empty:

P0 = 1

a N

n=0

N!

1N - n2!a l

m b

n (12-23)

2. Average length of the queue:

Lq = N - a l + m

l b11 - P02 (12-24)

3. Average number of customers (units) in the system:

L = Lq + 11 - P02 (12-25) 4. Average waiting time in the queue:

Wq = Lq

1N - L2l (12-26)

5. Average time in the system:

W = Wq + 1 m

(12-27)

6. Probability of n units in the system:

Pn = N!

1N - n2! a l

m b

n

P0 for n = 0, 1, c, N (12-28)

Department of Commerce Example Past records indicate that each of the five high-speed “page” printers at the U.S. Department of Commerce, in Washington, D.C., needs repair after about 20 hours of use. Breakdowns have been determined to be Poisson distributed. The one technician on duty can service a printer in an average of 2 hours, following an exponential distribution.

To compute the system’s operation characteristics, we first note that the mean arrival rate is l = 1�20 = 0.05 printer/hour. The mean service rate is m = 1�2 = 0.50 printer/hour. Then

1. P0 = 1

a 5

n=0

5!

15 - n2! a 0.05

0.5 b

n = 0.564 (we leave these calculations for you to confirm)

4Although there is no definite number that we can use to divide finite from infinite populations, the general rule of thumb is this: if the number in the queue is a significant proportion of the calling population, use a finite queuing model. Finite Queuing Tables, by L. G. Peck and R. N. Hazelwood (New York: John Wiley & Sons, Inc., 1958), eliminates much of the mathematics involved in computing the operating characteristics for such a model.

1. P0 = 1

a 5

n=0

5!

15 - n2! a 0.05

0.5 b

n = 0.564

M12_REND3161_13_AIE_C12.indd 444 28/10/16 11:20 AM

2. Lq = 5 - a0.05 + 0.50.05 b11 - P02 = 5 - 111211 - 0.5642 = 5 - 4.8 = 0.2 printer

3. L = 0.2 + 11 - 0.5642 = 0.64 printer

4. Wq = 0.2

15 - 0.64210.052 = 0.2

0.22 = 0.91 hour

5. W = 0.91 + 1

0.50 = 2.91 hours

If printer downtime costs $120 per hour and the technician is paid $25 per hour, we can also compute the total cost per hour:

Total hourly cost = 1Average number of printers down21Cost per downtime hour2 + Cost per technician hour

= 10.6421$1202 + $25 = $76.80 + $25.00 = $101.80

SOLVING THE DEPARTMENT OF COMMERCE FINITE POPULATION MODEL WITH EXCEL QM To use Excel QM for this problem, from the Excel QM menu, select Waiting Lines - Limited Population Model (M/M/s). When the spreadsheet appears, enter the arrival rate (8), service rate (12), number of servers, and population size. Once these are entered, the solution shown in Program 12.4 will be displayed. Additional output is also available.

12.7 Some General Operating Characteristic Relationships

Certain relationships exist among specific operating characteristics for any queuing system in a steady state. A steady state condition exists when a queuing system is in its normal stabilized operating condition, usually after an initial or transient state that may occur (e.g., having cus- tomers waiting at the door when a business opens in the morning). Both the arrival rate and the service rate should be stable in steady state. John D. C. Little is credited with the first two of these relationships, and hence they are called Little’s Flow Equations:

L = lW 1or W = L>l2 (12-29) Lq = lWq 1or Wq = Lq>l2 (12-30)

A third condition that must always be met is Average time in system = Average time waiting in queue + Average time receiving service

W = Wq + 1>m (12-31) The advantage of these formulas is that once one of these four characteristics is known, the other characteristics can easily be found. This is important because for certain queuing models, one of these may be much easier to determine than the others. These are applicable to all of the queuing systems discussed in this chapter except the finite population model.

12.7 soME gEnERAL oPERATing CHARACTERisTiC RELATionsHiPs  445

PROGRAM 12.4 Excel QM solution for Finite Population Model for Department of Commerce Example

A steady state is the normal operating condition of the queuing system.

A queuing system is in a transient state before the steady state is reached.

M12_REND3161_13_AIE_C12.indd 445 28/10/16 11:21 AM

446  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

12.8 More Complex Queuing Models and the Use of Simulation

Many practical waiting line problems that occur in production and operations service systems have characteristics like those of Arnold’s Muffler Shop, Garcia-Golding Recycling Inc., and the Department of Commerce. This is true when the situation calls for single- or multichannel waiting lines, with Poisson arrivals and exponential or constant service times, an infinite calling population, and FIFO service.

Often, however, variations of this specific case are present in an analysis. Service times in an automobile repair shop, for example, tend to follow the normal probability distribution instead of the exponential. A college registration system in which seniors have first choice of courses and hours over all other students is an example of a first-come, first-served model with a preemptive priority queue discipline. A physical examination for military recruits is an example of a multiphase system—one that differs from the single-phase models discussed in this chapter. A recruit first lines up to have blood drawn at one station, then waits to take an eye exam at the next station, talks to a psychiatrist at the third, and is examined by a doctor for medical problems at the fourth. At each phase, the recruit must enter another queue and wait for his or her turn.

Models to handle these cases have been developed by operations researchers. The com- putations for the resulting mathematical formulations are somewhat more complex than the ones covered in this chapter,5 and many real-world queuing applications are too complex to be modeled analytically at all. When this happens, quantitative analysts usually turn to computer simulation.

Simulation, the topic of Chapter 13, is a technique in which random numbers are used to draw inferences about probability distributions (such as arrivals and services). Using this approach, many hours, days, or months of data can be developed by a computer in a few seconds. This allows analysis of controllable factors, such as adding another service channel without actually doing so physically. Basically, whenever a standard analytical queuing model provides only a poor approximation of the actual service system, it is wise to develop a simula- tion model instead.

More sophisticated models exist to handle variations of basic assumptions, but when even these do not apply, we can turn to computer simulation, the topic of Chapter 13.

5Often, the qualitative results of queuing models are as useful as the quantitative results. Results show that it is inher- ently more efficient to pool resources, use central dispatching, and provide single multiple-server systems rather than multiple single-server systems.

Waiting lines and service systems are important parts of the business world. In this chapter, we describe several common queuing situations and present mathematical models for ana- lyzing waiting lines following certain assumptions. Those as- sumptions are that (1) arrivals come from an infinite or very large population, (2) arrivals are Poisson distributed, (3) arriv- als are treated on a FIFO basis and do not balk or renege, (4) service times follow the negative exponential distribution or are constant, and (5) the average service rate is faster than the average arrival rate.

The models illustrated in this chapter are for single-chan- nel, single-phase and multichannel, single-phase problems. After a series of operating characteristics is computed, total ex- pected costs are studied. As shown graphically in Figure 12.1,

total cost is the sum of the cost of providing service and the cost of waiting time.

Key operating characteristics for a system are shown to be (1) utilization rate, (2) percent idle time, (3) average time spent in the system and waiting in the queue, (4) average number of customers in the system and in the queue, and (5) probabilities of various numbers of customers in the system.

The chapter emphasizes that a variety of queuing models exists that do not meet all of the assumptions of the traditional models. In these cases, we use more complex mathematical models or turn to a technique called computer simulation. The application of simulation to problems of queuing systems, in- ventory control, machine breakdown, and other quantitative analysis situations is the topic discussed in Chapter 13.

Summary

M12_REND3161_13_AIE_C12.indd 446 28/10/16 11:21 AM

KEy EQUATions  447

Glossary

Balking The case in which arriving customers refuse to join the waiting line.

Calling Population The population of items from which arrivals at the queuing system come.

FIFO A queue discipline (meaning first-in, first-out) in which the customers are served in strict order of arrival.

Kendall Notation A method of classifying queuing systems based on the distribution of arrivals, the distribution of service times, and the number of service channels.

Limited, or Finite, Population A case in which the number of customers in the system is a significant proportion of the calling population.

Limited Queue Length A waiting line that cannot increase beyond a specific size.

Little’s Flow Equations A set of relationships that exist for any queuing system in a steady state.

Multichannel Queuing System A system that has more than one service facility, all fed by the same single queue.

Multiphase System A system in which service is received from more than one station, one after the other.

Negative Exponential Probability Distribution A probabil- ity distribution that is often used to describe random service times in a service system.

Operating Characteristics Descriptive characteristics of a queuing system, including the average number of customers in a line and in the system, average time spent in the system and waiting in the queue, and percent idle time.

Poisson Distribution A probability distribution that is often used to describe random arrivals in a queue.

Queue Discipline The rule by which customers in a line receive service.

Queuing Theory The mathematical study of waiting lines or queues.

Reneging The case in which customers enter a queue but then leave before being serviced.

Service Cost The cost of providing a particular level of service. Single-Channel Queuing System A system with one service

facility fed by one queue. Single-Phase System A queuing system in which service is

received at only one station. Steady State The normal, stabilized operating condition of a

queuing system. Transient State The initial condition of a queuing system

before a steady state is reached. Unlimited, or Infinite, Population A calling population

that is very large relative to the number of customers currently in the system.

Unlimited Queue Length A queue that can increase to an infinite size.

Utilization Factor (R) The proportion of the time that ser- vice facilities are in use.

Waiting Cost The cost to the firm of having customers or objects waiting to be serviced in the queue or in the system.

Waiting Line (Queue) One or more customers or objects waiting to be served.

Key Equations

l = mean number of arrivals per time period m = mean number of people or items served per

time period

Equations 12-1 through 12-7 describe operating characteris- tics in single-channel models that have Poisson arrival and exponential service rates.

(12-1) L = Average number of units 1customers2 in the system

= l

m - l

(12-2) W = Average time a unit spends in the system 1Waiting time + Service time2 =

1

m - l

(12-3) Lq = Average number of units in the queue

= l2

m1m - l2

(12-4) Wq = Average time a unit spends waiting in the queue

= l

m1m - l2

(12-5) r = Utilization factor for the system = l

m

(12-6) P0 = Probability of 0 units in the system 1i.e., the service unit is idle2 = 1 -

l

m

(12-7) Pn 7 k = Probability of more than k units in the system

= al m b

k + 1

Equations 12-8 through 12-12 are used for finding the costs of a queuing system.

(12-8) Total service cost = mCs where m = number of channels Cs = service cost 1labor cost2 of each channel

M12_REND3161_13_AIE_C12.indd 447 28/10/16 11:21 AM

448  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

(12-9) Total waiting cost = 1lW2Cw where Cw = cost of waiting Waiting time cost based on time in the system.

(12-10) Total waiting cost = 1lWq2Cw Waiting time cost based on time in the queue.

(12-11) Total cost = mCs + lWCw Waiting time cost based on time in the system.

(12-12) Total cost = mCs + lWqCw Waiting time cost based on time in the queue.

Equations 12-13 through 12-18 describe operating characteris- tics in multichannel models that have Poisson arrival and expo- nential service rates, where m = the number of open channels.

(12-13) P0 = 1

c a n=m-1

n=0 1

n! al m b

n

d + 1 m!

al m b

m mm

mm - l

for mm 7 l Probability that there are no people or units in the system.

(12-14) L = lm1l>m2m

1m - 12!1mm - l22 P0 + l

m

Average number of people or units in the system.

(12-15) W = m1l>m2m

1m - 12!1mm - l22 P0 + 1 m

= L

l

Average time a unit spends in the waiting line or being serviced (that is, in the system).

(12-16) Lq = L - l

m

Average number of people or units in line waiting for service.

(12-17) Wq = W - 1 m

= Lq

l

Average time a person or unit spends in the queue waiting for service.

(12-18) r = l

mm

Utilization rate.

Equations 12-19 through 12-22 describe operating character- istics in single-channel models that have Poisson arrival and constant service rates.

(12-19) Lq = l2

2m1m - l2 Average length of the queue.

(12-20) Wq = l

2m1m - l2 Average waiting time in the queue.

(12-21) L = Lq + l

m

Average number of units in the system.

(12-22) W = Wq + 1 m

Average waiting time in the system.

Equations 12-23 through 12-28 describe operating characteris- tics in single-channel models that have Poisson arrival and expo- nential service rates and a finite calling population.

(12-23) P0 = 1

a N

n=0

N!

1N - n2!a l

m b

n

Probability that the system is empty.

(12-24) Lq = N - a l + m

l b11 - P02

Average length of the queue.

(12-25) L = Lq + 11 - P02 Average number of units in the system.

(12-26) Wq = Lq

1N - L2l Average waiting time in the queue.

(12-27) W = Wq + 1 m

Average time in the system.

(12-28) Pn = N!

1N - n2!a l

m b

n

P0 for n = 0, 1, c, N

Probability of n units in the system.

Equations 12-29 to 12-30 are Little’s Flow Equations, which can be used when a steady state condition exists. Equation 12-31 is an assumption that must be met in order for steady state con- ditions to exist.

(12-29) L = lW

(12-30) Lq = lWq

(12-31) W = Wq + 1>m

M12_REND3161_13_AIE_C12.indd 448 28/10/16 11:21 AM

Solved Problems

Solved Problem 12-1 The Maitland Furniture store gets an average of 50 customers per shift. The manager of Maitland wants to calculate whether she should hire 1, 2, 3, or 4 salespeople. She has determined that average waiting times will be 7 minutes with 1 salesperson, 4 minutes with 2 salespeople, 3 minutes with 3 salespeople, and 2 minutes with 4 salespeople. She has estimated the cost per minute that customers wait at $1. The cost per salesperson per shift (including benefits) is $70.

How many salespeople should be hired?

Solution The manager’s calculations are as follows:

NUMBER OF SALESPEOPLE

1 2 3 4

(a) Average number of customers per shift 50 50 50 50

(b) Average waiting time per customer (minutes) 7 4 3 2

(c) Total waiting time per shift 1a * b2 (minutes) 350 200 150 100 (d) Cost per minute of waiting time (estimated) $1.00 $1.00 $1.00 $1.00

(e) Value of lost time 1c * d2 per shift $ 350 $ 200 $ 150 $ 100 (f) Salary cost per shift $ 70 $ 140 $ 210 $ 280

(g) Total cost per shift $ 420 $ 340 $ 360 $ 380

Because the minimum total cost per shift relates to 2 salespeople, the manager’s optimum strategy is to hire 2 salespeople.

Solved Problem 12-2 Marty Schatz owns and manages a chili dog and soft drink store near the campus. Although Marty can service 30 customers per hour on the average 1m2, he gets only 20 customers per hour 1l2. Because Marty could wait on 50% more customers than actually visit his store, it doesn’t make sense to him that he should have any waiting lines.

Marty hires you to examine the situation and to determine some characteristics of his queue. After looking into the problem, you find this to be an M>M>1 system. What are your findings?

Solution

L = l

m - l =

20

30 - 20 = 2 customers in the system on the average

W = 1

m - l =

1

30 - 20 = 0.1 hour 16 minutes2 = average time the customer spends in

the total system

Lq = l2

m1m - l2 = 202

30130 - 202 = 1.33 customers waiting for service in line on the average

wq = l

m1m - l2 = 20

30130 - 202 = 1�15 hour = 14 minutes2 = average waiting time of a customer in the queue awaiting service

r = l

m =

20

30 = 0.67 = Percentage of the time that Marty is busy waiting on customers

P0 = 1 - l

m = 1 - r = 0.33 = Probability that there are no customers in the system

1being waited on or waiting in the queue2 at any given time

soLVED PRoBLEMs  449

M12_REND3161_13_AIE_C12.indd 449 28/10/16 11:21 AM

450  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

Probability of k or More Customers Waiting in Line and/or Being Waited On

k pn+k = a l

m b

k+1

0 0.667

1 0.444

2 0.296

3 0.198

Solved Problem 12-3 Refer to Solved Problem 12-2. Marty agreed that these figures seemed to represent his approximate business situation. You are quite surprised at the length of the lines and elicit from him an estimated value of the customer’s waiting time (in the queue, not being waited on) at 10 cents per minute. Dur- ing the 12 hours that he is open he gets 112 * 202 = 240 customers. The average customer is in a queue 4 minutes, so the total customer waiting time is 1240 * 4 minutes2 = 960 minutes. The value of 960 minutes is 1$0.1021960 minutes2 = $96. You tell Marty that not only is 10 cents per minute quite conservative but also he could probably save most of that $96 of customer ill will if he hired another salesclerk. After much haggling, Marty agrees to provide you with all the chili dogs you can eat during a weeklong period in exchange for your analysis of the results of having two clerks wait on the customers.

Assuming that Marty hires one additional salesclerk whose service rate equals Marty’s rate, com- plete the analysis.

Solution With two people working, the system now has two channels, or m = 2. The computations yield

P0 = 1

a n=m-1

n=0 1

n! c 20 30

d n

d + 1 2! c 20 30

d 2

c 21302 21302 - 20 d

= 1

11212>320 + 11212>321 + 11>2214>9216>42 = 0.5 = probability of no customers in the system

L = c 12021302120>302 2

12 - 12!3122130 - 20242 d 0.5 + 20

30 = 0.75 customer in the system on the average

W = L

l =

3>4 20

= 3

80 hour = 2.25 minutes = average time the customer spends in the total system

Lq = L - l

m =

3

4 -

20

30 =

1

12 = 0.083 customer waiting for service in line on the average

Wq = Lq

l =

1�2 20

= 1

240 hour =

1

4 minute = Average waiting time of a customer in the queue

itself 1not being serviced2 r =

l

mm =

20

21302 = 1

3 = 0.33 = Utilization rate

You now have 1240 customers2 * 11>240 hour2 = 1 hour total customer waiting time per day. Total cost of 60 minutes of customer waiting time = 160 minutes21$0.10 per minute2 = $6

Now you are ready to point out to Marty that the hiring of one additional clerk will save $96 - $6 = $90 of customer ill will per 12-hour shift. Marty responds that the hiring should also reduce the number of people who look at the line and leave as well as those who get tired of waiting in line and leave. You tell Marty that you are ready for two chili dogs, extra hot.

M12_REND3161_13_AIE_C12.indd 450 28/10/16 11:21 AM

Solved Problem 12-4 Vacation Inns is a chain of hotels operating in the southwestern part of the United States. The com- pany uses a toll-free telephone number to take reservations for any of its hotels. The average time to handle each call is 3 minutes, and an average of 12 calls are received per hour. The probability distri- bution that describes the arrivals is unknown. Over a period of time, it is determined that the average caller spends 6 minutes either on hold or receiving service. Find the average time in the queue, the average time in the system, the average number in the queue, and the average number in the system.

Solution The probability distributions are unknown, but we are given the average time in the system (6 minutes). Thus, we can use Little’s Flow Equations:

W = 6 minutes = 6>60 hour = 0.1 hour l = 12 per hour m = 60>3 = 20 per hour

Average time in queue = Wq = W - 1>m = 0.1 - 1>20 = 0.1 - 0.05 = 0.05 hour Average number in system = L = lW = 1210.12 = 1.2 callers Average number in queue = Lq = lWq = 1210.052 = 0.6 caller

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Most systems use the queue discipline known as the FIFO rule. a. True b. False

2. Before using exponential distributions to build queuing models, the quantitative analyst should determine if the service time data fit the distribution. a. True b. False

3. In a multichannel, single-phase queuing system, the arrival will pass through at least two different service facilities. a. True b. False

4. Which of the following is not an assumption in M>M>1 models? a. Arrivals come from an infinite or very large

population. b. Arrivals are Poisson distributed. c. Arrivals are treated on a FIFO basis and do not balk or

renege. d. Service times follow the exponential distribution. e. The average arrival rate is faster than the average

service rate. 5. A queuing system described as M>D>2 would have

a. exponential service times. b. two queues. c. constant service times. d. constant arrival rates.

6. Cars enter the drive-through of a fast-food restaurant to place an order, and then they proceed to pay for the food and pick up the order. This is an example of a. a multichannel system. b. a multiphase system. c. a multiqueue system. d. none of the above.

7. The utilization factor for a system is defined as a. the mean number of people served divided by the

mean number of arrivals per time period. b. the average time a customer spends waiting in a queue. c. the proportion of the time the service facilities are in use. d. the percentage of idle time. e. none of the above.

8. Which of the following would not have a FIFO queue discipline? a. fast-food restaurant b. post office c. checkout line at grocery store d. emergency room at a hospital

9. A company has one computer technician who is responsible for repairs on the company’s 20 computers. As a computer breaks, the technician is called to make the repair. If the repairperson is busy, the machine must wait to be repaired. This is an example of a. a multichannel system. b. a finite population system. c. a constant service rate system. d. a multiphase system.

sELF-TEsT  451

M12_REND3161_13_AIE_C12.indd 451 28/10/16 11:21 AM

452  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

10. In performing a cost analysis of a queuing system, the waiting time cost 1Cw2 is sometimes based on the time in the queue and sometimes based on the time in the system. The waiting cost should be based on time in the system for which of the following situations? a. waiting in line to ride an amusement park ride b. waiting to discuss a medical problem with a doctor c. waiting for a picture and an autograph from a

rock star d. waiting for a computer to be fixed so it can be placed

back in service 11. Customers enter the waiting line at a cafeteria on a

first-come, first-served basis. The arrival rate follows a Poisson distribution, and service times follow an exponential distribution. If the average number of arrivals

is 6 per minute and the average service rate of a single server is 10 per minute, what is the average number of customers in the system? a. 0.6 b. 0.9 c. 1.5 d. 0.25 e. none of the above

12. In the standard queuing model, we assume that the queue discipline is .

13. The service time in the M>M>1 queuing model is assumed to be .

14. When managers find standard queuing formulas inadequate or the mathematics unsolvable, they often resort to to obtain their solutions.

Discussion Questions and Problems

Discussion Questions 12-1 What is the waiting line problem? What are the com-

ponents in a waiting line system? 12-2 What are the assumptions underlying common queu-

ing models? 12-3 Describe the important operating characteristics of a

queuing system. 12-4 Why must the service rate be greater than the arrival

rate in a single-channel queuing system? 12-5 Briefly describe three situations in which the FIFO

discipline rule is not applicable in queuing analysis. 12-6 Provide examples of four situations in which there is

a limited, or finite, population. 12-7 What are the components of the following systems?

Draw and explain the configuration of each.

(a) Barbershop (b) Car wash (c) Laundromat (d) Small grocery store

12-8 Give an example of a situation in which the wait- ing time cost would be based on waiting time in the queue. Give an example of a situation in which the waiting time cost would be based on waiting time in the system.

12-9 Do you think the Poisson distribution, which assumes independent arrivals, is a good estimation of arrival rates in the following queuing systems? Defend your position in each case.

(a) Cafeteria in your school (b) Barbershop (c) Hardware store (d) Dentist’s office (e) College class (f) Movie theater

Problems 12-10 The Schmedley Discount Department Store has

approximately 300 customers shopping in its store between 9 a.m. and 5 p.m. on Saturdays. In deciding how many cash registers to keep open each Saturday, Schmedley’s manager considers two factors: cus- tomer waiting time (and the associated waiting cost) and the service costs of employing additional check- out clerks. Checkout clerks are paid an average of $8 per hour. When only one is on duty, the waiting time per customer is about 10 minutes (or 1�6 hour); when two clerks are on duty, the average checkout time is 6 minutes per person; 4 minutes when three clerks are working; and 3 minutes when four clerks are on duty.

Schmedley’s management has conducted cus- tomer satisfaction surveys and has been able to es- timate that the store suffers approximately $10 in lost sales and goodwill for every hour of customer time spent waiting in checkout lines. Using the in- formation provided, determine the optimal number

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M12_REND3161_13_AIE_C12.indd 452 28/10/16 11:21 AM

DisCUssion QUEsTions AnD PRoBLEMs  453

of clerks to have on duty each Saturday to minimize the store’s total expected cost.

12-11 The Rockwell Electronics Corporation retains a service crew to repair machine breakdowns that oc- cur on an average of l = 3 per day (approximately Poisson in nature).

The crew can service an average of m = 8 machines per day, with a repair time distribution that resembles the exponential distribution.

(a) What is the utilization rate of this service sys- tem?

(b) What is the average downtime for a machine that is broken?

(c) How many machines are waiting to be serviced at any given time?

(d) What is the probability that more than one machine is in the system? Probability that more than two are broken and waiting to be repaired or being serviced? More than three? More than four?

12-12 From historical data, Harry’s Car Wash estimates that dirty cars arrive at the rate of 10 per hour all day Saturday. With a crew working the wash line, Harry figures that cars can be cleaned at the rate of one every 5 minutes. One car at a time is cleaned in this example of a single-channel wait- ing line.

Assuming Poisson arrivals and exponential service times, find the

(a) average number of cars in line. (b) average time a car waits before it is washed. (c) average time a car spends in the service system. (d) utilization rate of the car wash. (e) probability that no cars are in the system.

12-13 Mike Dreskin manages a large Los Angeles movie theater complex called Cinema I, II, III, and IV. Each of the four auditoriums plays a different film; the schedule is set so that starting times are stag- gered to avoid the large crowds that would occur if all four movies started at the same time. The the- ater has a single ticket booth and a cashier who can maintain an average service rate of 280 movie pa- trons per hour. Service times are assumed to follow an exponential distribution. Arrivals on a typically active day are Poisson distributed and average 210 per hour.

To determine the efficiency of the current ticket operation, Mike wishes to examine several queue operating characteristics.

(a) Find the average number of moviegoers waiting in line to purchase a ticket.

(b) What percentage of the time is the cashier busy? (c) What is the average time that a customer spends

in the system? (d) What is the average time spent waiting in line to

get to the ticket window? (e) What is the probability that there are more than

two people in the system? More than three peo- ple? More than four?

12-14 A university cafeteria line in the student center is a self-serve facility in which students select the food items they want and then form a single line to pay the cashier. Students arrive at the cashier at a rate of about four per minute according to a Poisson dis- tribution. The single cashier ringing up sales takes about 12 seconds per customer, following an expo- nential distribution.

(a) What is the probability that there are more than two students in the system? More than three students? More than four?

(b) What is the probability that the system is empty? (c) How long will the average student have to wait

before reaching the cashier? (d) What is the expected number of students in the

queue? (e) What is the average number in the system? (f) If a second cashier is added (who works at the

same pace), how will the operating character- istics computed in parts (b), (c), (d), and (e) change? Assume that customers wait in a single line and go to the first available cashier.

12-15 The wheat harvesting season in the American Mid- west is short, and most farmers deliver their truckloads of wheat to a giant central storage bin within a 2-week span. Because of this, wheat-filled trucks waiting to unload and return to the fields have been known to back up for a block at the receiving bin. The central bin is owned cooperatively, and it is to every farmer’s benefit to make the unloading/storage process as efficient as possible. The cost of grain deterioration caused by unloading delays, the cost of truck rental, and idle driver time are significant concerns to the cooperative members. Although farmers have dif- ficulty quantifying crop damage, it is easy to assign a waiting and unloading cost for truck and driver of $18 per hour. The storage bin is open and operated 16 hours per day, 7 days per week, during the harvest season and is capable of unloading 35 trucks per hour according to an exponential distribution. Full trucks arrive all day long (during the hours the bin is open) at a rate of about 30 per hour, following a Poisson pattern.

To help the cooperative get a handle on the problem of lost time while trucks are waiting in line or unloading at the bin, find the

(a) average number of trucks in the unloading system. (b) average time per truck in the system.

M12_REND3161_13_AIE_C12.indd 453 28/10/16 11:21 AM

454  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

(c) utilization rate for the bin area. (d) probability that there are more than three trucks

in the system at any given time. (e) total daily cost to the farmers of having their

trucks tied up in the unloading process.

The cooperative, as mentioned, uses the storage bin only two weeks per year. Farmers estimate that en- larging the bin would cut unloading costs by 50% next year. It will cost $9,000 to do so during the off- season. Would it be worth the cooperative’s while to enlarge the storage area?

12-16 Ashley’s Department Store in Kansas City maintains a successful catalog sales department in which a clerk takes orders by telephone. If the clerk is occu- pied on one line, incoming phone calls to the catalog department are answered automatically by a record- ing machine and asked to wait. As soon as the clerk is free, the party that has waited the longest is trans- ferred and answered first. Calls come in at a rate of about 12 per hour. The clerk is capable of taking an order in an average of 4 minutes. Calls tend to fol- low a Poisson distribution, and service times tend to be exponential. The clerk is paid $10 per hour, but because of lost goodwill and sales, Ashley’s loses about $50 per hour of customer time spent waiting for the clerk to take an order.

(a) What is the average time that catalog customers must wait before their calls are transferred to the order clerk?

(b) What is the average number of callers waiting to place an order?

(c) Ashley’s is considering adding a second clerk to take calls. The store would pay that person the same $10 per hour. Should it hire another clerk? Explain.

12-17 Automobiles arrive at the drive-through window at a post office at the rate of four every 10 minutes. The average service time is 2 minutes. The Poisson dis- tribution is appropriate for the arrival rate and ser- vice times are exponentially distributed.

(a) What is the average time a car is in the system? (b) What is the average number of cars in the system? (c) What is the average time cars spend waiting to

receive service? (d) What is the average number of cars in line be-

hind the customer receiving service? (e) What is the probability that there are no cars at

the window? (f) What percentage of the time is the postal clerk

busy? (g) What is the probability that there are exactly two

cars in the system?

12-18 For the post office in Problem 12-17, a second drive- through window is being considered. A single line

would be formed, and as a car reached the front of the line it would go to the next available clerk. The clerk at the new window works at the same rate as the current one.

(a) What is the average time a car is in the system? (b) What is the average number of cars in the system? (c) What is the average time cars spend waiting to

receive service? (d) What is the average number of cars in line

behind the customer receiving service? (e) What is the probability that there are no cars in

the system? (f) What percentage of the time are the clerks busy? (g) What is the probability that there are exactly two

cars in the system?

12-19 Juhn and Sons Wholesale Fruit Distributors employs one worker whose job is to load fruit on outgoing company trucks. Trucks arrive at the loading gate at an average of 24 per day, or 3 per hour, according to a Poisson distribution. The worker loads them at a rate of 4 per hour, following approximately the expo- nential distribution in service times.

Determine the operating characteristics of this loading gate problem. What is the probability that there will be more than three trucks either being loaded or waiting? Discuss the results of your queu- ing model computation.

12-20 Juhn believes that adding a second fruit loader will substantially improve the firm’s efficiency. He estimates that a two-person crew, still acting like a single-server system, at the loading gate will double the loading rate from 4 trucks per hour to 8 trucks per hour. Analyze the effect on the queue of such a change and compare the results with those found in Problem 12-19.

12-21 Truck drivers working for Juhn and Sons (see Prob- lems 12-19 and 12-20) are paid a salary of $20 per hour on average. Fruit loaders receive about $12 per hour. Truck drivers waiting in the queue or at the loading gate are drawing a salary but are produc- tively idle and unable to generate revenue during that time. What would be the hourly cost savings to the firm associated with employing two loaders in- stead of one?

12-22 Juhn (of Problem 12-19) is considering building a second platform or gate to speed the process of load- ing the fruit trucks. This, he thinks, will be even more efficient than simply hiring another loader to help out the first platform (as in Problem 12-20).

Assume that each worker at each platform will be able to load 4 trucks per hour and that trucks will continue to arrive at the rate of 3 per hour. Find the waiting line’s new operating conditions. Is this new approach indeed speedier than the other two considered?

M12_REND3161_13_AIE_C12.indd 454 28/10/16 11:21 AM

DisCUssion QUEsTions AnD PRoBLEMs  455

12-23 Bill First, general manager of Worthmore Depart- ment Store, has estimated that every hour of cus- tomer time spent waiting in line for a sales clerk to become available costs the store $100 in lost sales and goodwill. Customers arrive at the checkout counter at the rate of 30 per hour, and the average service time is 3 minutes. The Poisson distribution describes the arrivals, and the service times are ex- ponentially distributed. The number of sales clerks can be 2, 3, or 4, with each one working at the same rate. Bill estimates the salary and benefits for each clerk to be $10 per hour. The store is open 10 hours per day.

(a) Find the average time in the line if 2, 3, and 4 clerks are used.

(b) What is the total time spent waiting in line each day if 2, 3, and 4 clerks are used?

(c) Calculate the total of the daily waiting cost and the daily service cost if 2, 3, and 4 clerks are used. What is the minimum total daily cost?

12-24 Billy’s Bank is the only bank in a small town in Arkansas. On a typical Friday, an average of 10 customers per hour arrives at the bank to transact business. There is one single teller at the bank, and the average time required to transact business is 4 minutes. It is assumed that service times can be described by the exponential distribution. Although this is the only bank in town, some people in the town have begun using the bank in a neighboring town about 20 miles away. If a single teller at Billy’s is used, find

(a) the average time in the line. (b) the average number in the line. (c) the average time in the system. (d) the average number in the system. (e) the probability that the bank is empty.

12-25 Refer to the Billy’s Bank situation in Problem 12-24. Billy is considering adding a second teller (who would work at the same rate as the first) to reduce the waiting time for customers, and he assumes that this will cut the waiting time in half. A single line would be used, and the customer at the front of the line would go to the first available bank teller. If a second teller is added, find

(a) the average time in the line. (b) the average number in the line. (c) the average time in the system. (d) the average number in the system. (e) the probability that the bank is empty.

12-26 For the Billy’s Bank situation in Problems 12-24 and 12-25, the salary and benefits for a teller would be $12 per hour. The bank is open 8 hours each day. It has been estimated that the waiting time cost is $25 per hour in the line.

(a) How many customers would enter the bank on a typical day?

(b) How much total time would the customers spend waiting in line during the entire day if one teller was used? What is the total daily waiting time cost?

(c) How much total time would the customers spend waiting in line during the entire day if two tellers were used? What is the total daily waiting time cost?

(d) If Billy wishes to minimize the total wait- ing time and personnel cost, how many tellers should be used?

12-27 Customers arrive at an automated coffee vending machine at a rate of 4 per minute, following a Pois- son distribution. The coffee machine dispenses a cup of coffee in exactly 10 seconds.

(a) What is the average number of people waiting in line?

(b) What is the average number in the system? (c) How long does the average person wait in line

before receiving service?

12-28 The average number of customers in the system in the single-channel, single-phase model described in Section 12.4 is

L = l

m - l

Show that for m = 1 server, the multichannel queu- ing model in Section 12.5,

L = lmal

m b

m

1m - 12!1mm - l22 P0 + l

m

is identical to the single-channel system. Note that the formula for P0 (Equation 12-13) must be utilized in this highly algebraic exercise.

12-29 One mechanic services five drilling machines for a steel plate manufacturer. Machines break down on an average of once every 6 working days, and break- downs tend to follow a Poisson distribution. The mechanic can handle an average of one repair job per day. Repairs follow an exponential distribution.

(a) How many machines are waiting for service, on average?

(b) How many are in the system, on average? (c) How many drills are in running order, on aver-

age? (d) What is the average waiting time in the queue? (e) What is the average wait in the system?

12-30 A technician monitors a group of five computers that run an automated manufacturing facility. It takes an average of 15 minutes (exponentially distributed) to

M12_REND3161_13_AIE_C12.indd 455 28/10/16 11:21 AM

456  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

adjust a computer that develops a problem. The com- puters run for an average of 85 minutes (Poisson dis- tributed) without requiring adjustments. What is the

(a) average number of computers waiting for adjustment?

(b) average number of computers not in working order?

(c) probability the system is empty? (d) average time in the queue? (e) average time in the system?

12-31 The typical subway station in Washington, D.C., has six turnstiles, each of which can be controlled by the station manager to be used for either entrance or exit control—but never for both. The manager must de- cide at different times of the day just how many turn- stiles to use for entering passengers and how many to be set up to allow exiting passengers.

At the Washington College Station, passengers enter the station at a rate of about 84 per minute between the hours of 7 and 9 a.m. Passengers exit- ing trains at the stop reach the exit turnstile area at a rate of about 48 per minute during the same morning rush hours. Each turnstile can allow an average of 30 passengers per minute to enter or exit.

Arrival and service times have been thought to follow Poisson and exponential distributions, respectively. Assume riders form a common queue at both entry and exit turnstile areas and proceed to the first empty turnstile.

The Washington College Station manager does not want the average passenger at his station to have to wait in a turnstile line for more than 6 seconds, nor does he want more than 8 people in any queue at any average time.

(a) How many turnstiles should be opened in each direction every morning?

(b) Discuss the assumptions underlying the solution of this problem using queuing theory.

12-32 The Clear Brook High School band is holding a car wash as a fund-raiser to buy new equipment. The average time to wash a car is 4 minutes, and the time is exponentially distributed. Cars arrive at a rate of one every 5 minutes (or 12 per hour), and the num- ber of arrivals per time period is described by the Poisson distribution.

(a) What is the average time for cars waiting in the line?

(b) What is the average number of cars in the line? (c) What is the average number of cars in the

system? (d) What is the average time in the system? (e) What is the probability there are more than three

cars in the system?

12-33 When additional band members arrived to help at the car wash (see Problem 12-32), it was decided that two cars should be washed at a time instead of just the one. Both work crews would work at the same rate.

(a) What is the average time for cars waiting in the line?

(b) What is the average number of cars in the line? (c) What is the average number of cars in the

system? (d) What is the average time in the system?

12-34 Upon arrival at the Sunkist Gate at Naval Base Ven- tura County in Port Hueneme, California, there are two security guards, each assigned to one of the two vehicular lanes that lead up to the gate, to check the identification (i.e., the military Common Access Cards) of people in the vehicles going onto the base. In the morning, when the gate is the busiest, cars ar- rive every 12 seconds and randomly get into one of the two clearly marked “No-Lane-Change” lanes. Once a car is at the head of its particular line, it takes the guard about 20 seconds, on the average, to check the IDs of everyone in every car. Usually, that means just one person. However, some people carpool, and there may be as many as six or seven in any particu- lar vehicle. Given that the vehicular arrivals follow a Poisson distribution and the time to check IDs fol- lows a negative exponential distribution, determine the average number of cars and the average waiting time in each of the queues.

12-35 Ye Olde Creamery, a popular ice cream store on campus, has one line for its tasty treats. Students arrive at the Creamery about one every minute. Be- cause of the new automated “Wave N Pay” payment system, it only takes about 40 seconds, on the aver- age, to place and then pay for an order, as students need only hold their cell phones over the “Wave N Pay” device and the system automatically deducts the cost of the ice cream cone from their account. However, the “Wave N Pay” system is finicky and is often off-line, causing students to pay with cash. This causes the average order and pay times to dou- ble and a long line to form, forcing Ye Olde Cream- ery to open another order and pay station. Having two order and pay stations open (with just one line) costs the Creamery an extra $12.00 an hour, while upgrading the “Wave N Pay” system to never go off- line would cost $1,200. Assuming Poisson arrivals and negative exponential service times, compare the operation of Ye Olde Creamery with the two different configurations. Given the additional costs involved, what should the management of Ye Olde Creamery do?

12-36 An operator processes jobs on a first-come, first- served basis. The jobs have Poisson arrival rates,

M12_REND3161_13_AIE_C12.indd 456 28/10/16 11:21 AM

with an average of 6 minutes between arrivals. The objective is to process these jobs so that they spend no more than 8 minutes, on average, in the system. How fast does the operator have to process jobs, on average, to meet this objective?

12-37 During peak times, the entry gate at a large amusement park experiences an average arrival of 500 customers per minute, according to a Poisson dis- tribution. The average customer requires 4 seconds to be processed through the entry gate. The park’s goal is to keep the waiting time less than 5 seconds. How many entry gates are necessary to meet this goal?

12-38 Fetterolf's Barber Shop is a popular haircutting place near the campus of Penn State. Four barbers work full-time and spend an average of 15 minutes on each customer. Customers arrive all day long, at an average rate of 12 per hour. When they enter, they take a number to wait for the first available barber. Arrivals tend to follow the Poisson distribution, and service times are exponentially distributed.

(a) What is the probability that the shop is empty? (b) What is the average number of customers in the

barbershop? (c) What is the average time spent in the shop? (d) What is the average time that a customer spends

waiting to be called to a chair? (e) What is the average number of customers wait-

ing to be served? (f) What is the shop’s utilization factor? (g) Mr. Fetterolf is thinking of adding a fifth barber.

How will this affect the utilization rate?

12-39 Mr. Fetterolf (see Problem 12-38) is considering changing the queuing characteristics of his shop. Instead of selecting a number for the first available barber, a customer will be able to select which bar- ber he or she prefers upon arrival. Assuming that this selection does not change while the customer is waiting for his or her barber to become available and that the requests for each of the four barbers are evenly distributed, answer the following:

(a) What is the average number of customers in the barbershop?

(b) What is the average time spent in the shop? (c) What is the average time a customer spends

waiting to be called to a chair? (d) What is the average number of customers wait-

ing to be served? (e) Explain why the results from Problems 12-38

and 12-39 differ.

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 12-40 to 12-44.

Internet Homework Problems

For more than 75 years, New England Foundry, Inc., has manufactured wood stoves for home use. In recent years, with increasing energy prices, George Mathison, president of New England Foundry, has seen sales triple. This dramatic increase in sales has made it even more difficult for George to maintain quality in all the wood stoves and related products.

Unlike other companies manufacturing wood stoves, New England Foundry is only in the business of making stoves and stove-related products. Their major products are the Warmglo I, the Warmglo II, the Warmglo III, and the Warmglo IV. The Warmglo I is the smallest wood stove, with a heat output of 30,000 Btu, and the Warmglo IV is the largest, with a heat out- put of 60,000 Btu. In addition, New England Foundry, Inc., pro- duces a large array of products that have been designed to be used with one of their four stoves, including warming shelves, surface thermometers, stovepipes, adaptors, stove gloves, triv- ets, mitten racks, andirons, chimneys, and heat shields. New

England Foundry also publishes a newsletter and several paper- back books on stove installation, stove operation, stove main- tenance, and wood sources. It is George’s belief that its wide assortment of products was a major contributor to the sales increases.

The Warmglo III outsells all the other stoves by a wide margin. The heat output and available accessories are ideal for the typical home. The Warmglo III also has a number of out- standing features that make it one of the most attractive and heat-efficient stoves on the market. Each Warmglo III has a ther- mostatically controlled primary air intake valve that allows the stove to adjust itself automatically to produce the correct heat output for varying weather conditions. A secondary air opening is used to increase the heat output in case of very cold weather. The internal stove parts produce a horizontal flame path for more efficient burning, and the output gases are forced to take an S-shaped path through the stove. The S-shaped path allows

Case Study

New England Foundry

CAsE sTUDy  457

M12_REND3161_13_AIE_C12.indd 457 28/10/16 11:21 AM

458  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

more complete combustion of the gases and better heat transfer from the fire and gases through the cast iron to the area to be heated. These features, along with the accessories, resulted in expanding sales and prompted George to build a new factory to manufacture Warmglo III stoves. An overview diagram of the factory is shown in Figure 12.3.

The new foundry uses the latest equipment, including a new Disamatic that helps in manufacturing stove parts. Regard- less of new equipment or procedures, casting operations have remained basically unchanged for hundreds of years. To begin with, a wooden pattern is made for every cast-iron piece in the stove. The wooden pattern is an exact duplication of the cast- iron piece that is to be manufactured. New England Foundry has all of its patterns made by Precision Patterns, Inc., and these patterns are stored in the pattern shop and maintenance room. Then a specially formulated sand is molded around the wooden pattern. There can be two or more sand molds for each pattern. Mixing the sand and making the molds are done in the molding room. When the wooden pattern is removed, the resulting sand molds form a negative image of the desired casting. Next, the molds are transported to the casting room, where molten iron is poured into the molds and allowed to cool. When the iron has solidified, the molds are moved into the cleaning, grinding, and preparation room. The molds are dumped into large vibrators that shake most of the sand from the casting. The rough castings are then subjected to both sandblasting to remove the rest of the sand and grinding to finish some of the surfaces of the castings. The castings are then painted with a special heat-resistant paint, assembled into workable stoves, and inspected for manufactur- ing defects that may have gone undetected thus far. Finally, the finished stoves are moved to storage and shipping, where they are packaged and shipped to the appropriate locations.

At present, the pattern shop and the maintenance depart- ment are located in the same room. One large counter is used by

both maintenance personnel to get tools and parts and by sand molders that need various patterns for the molding operation. Peter Nawler and Bob Bryan, who work behind the counter, are able to service a total of 10 people per hour (or about 5 per hour each). On the average, 4 people from maintenance and 3 people from the molding department arrive at the counter per hour. People from the molding department and from maintenance arrive randomly, and to be served they form a single line. Pete and Bob have always had a policy of first come, first served. Because of the location of the pattern shop and maintenance department, it takes about 3 minutes for a person from the main- tenance department to walk to the counter, and it takes about 1 minute for a person to walk from the molding department to the pattern and maintenance room.

After observing the operation of the pattern shop and maintenance room for several weeks, George decided to make some changes to the layout of the factory. An overview of these changes is shown in Figure 12.4.

Separating the maintenance shop from the pattern shop had a number of advantages. It would take people from the mainte- nance department only 1 minute instead of 3 to get to the new maintenance department counter. Using time and motion stud- ies, George was also able to determine that improving the layout of the maintenance department would allow Bob to serve 6 peo- ple from the maintenance department per hour, and improving the layout of the pattern department would allow Pete to serve 7 people from the molding shop per hour.

Discussion Question 1. How much time would the new layout save? 2. If maintenance personnel were paid $9.50 per hour and

molding personnel were paid $11.75 per hour, how much could be saved per hour with the new factory layout?

Cleaning, Grinding, and Preparation

Storage and Shipping

Casting Molding

Sand

Pattern Shop and Maintenance

FIGURE 12.3 overview of Factory

Cleaning, Grinding, and Preparation

Storage and Shipping

Casting

Maintenance

Molding Sand

Pattern Shop

FIGURE 12.4 overview of Factory After Changes

M12_REND3161_13_AIE_C12.indd 458 28/10/16 11:21 AM

BiBLiogRAPHy  459

Donna Shader, manager of the Winter Park Hotel, is consider- ing how to restructure the front desk to reach an optimum level of staff efficiency and guest service. At present, the hotel has five clerks on duty, each with a separate waiting line, during the peak check-in time of 3:00 p.m. to 5:00 p.m. Observation of arrivals during this time shows that an average of 90 guests arrive each hour (although there is no upward limit on the num- ber that could arrive at any given time). It takes an average of 3 minutes for each front-desk clerk to register each guest.

Donna is considering three plans for improving guest ser- vice by reducing the length of time guests spend waiting in line. The first proposal would designate one employee as a quick- service clerk for guests registering under corporate accounts, a market segment that fills about 30% of all occupied rooms. Because corporate guests are preregistered, their registration takes just 2 minutes. With these guests separated from the rest of the clientele, the average time for registering a typical guest would climb to 3.4 minutes. Under plan 1, noncorporate guests would choose any of the remaining four lines.

The second plan is to implement a single-line system. All guests could form a single waiting line to be served by which- ever of the five clerks became available. This option would

require sufficient lobby space for what could be a substantial queue.

The third proposal involves using an automatic teller machine (ATM) for check-ins. This ATM would provide ap- proximately the same service rate as a clerk would. Given that initial use of this technology might be minimal, Shader esti- mated that 20% of customers, primarily frequent guests, would be willing to use the machines. (This might be a conservative estimate if the guests perceive direct benefits from using the ATM, as bank customers do. Citibank reports that some 95% of its Manhattan customers use its ATMs.) Donna would set up a single queue for customers who prefer human check-in clerks. This would be served by the five clerks, although Donna is hopeful that the machine will allow a reduction to four.

Discussion Questions 1. Determine the average amount of time that a guest spends

checking in. How would this change under each of the stated options?

2. Which option do you recommend?

Case Study

Winter Park Hotel

See our Internet home page, at www.pearsonhighered.com/render, for this additional case study: Pantry Shopper. This case involves providing better service in a grocery store.

Internet Case Study

Bibliography

Baldwin, Rusty O., Nathaniel J. Davis IV, Scott F. Midkiff, and John E. Kobza. “Queueing Network Analysis: Concepts, Terminology, and Methods,” Journal of Systems & Software 66, 2 (2003): 99–118.

Barron, K. “Hurry Up and Wait,” Forbes, October 16, 2000, 158–164.

Cayirli, Tugba, and Emre Veral. “Outpatient Scheduling in Health Care: A Review of Literature,” Production and Operations Management 12, 4 (2003): 519–549.

Cooper, R. B. Introduction to Queuing Theory, 2nd ed. New York: Elsevier— North Holland, 1980.

de Bruin, Arnoud M., A. C. van Rossum, M. C. Visser, and G. M. Koole. “Modeling the Emergency Cardiac Inpatient Flow: An Application of Queuing Theory,” Health Care Management Science 10, 2 (2007): 125–137.

Derbala, Ali. “Priority Queuing in an Operating System,” Computers & Operations Research 32, 2 (2005): 229–238.

Grassmann, Winfried K. “Finding the Right Number of Servers in Real-World Queuing Systems,” Interfaces 18, 2 (March–April 1988): 94–104.

Janic, Milan. “Modeling Airport Congestion Charges,” Transportation Plan- ning & Technology 28, 1 (2005): 1–26.

Katz, K., B. Larson, and R. Larson. “Prescription for the Waiting-in-Line Blues,” Sloan Management Review 32 (Winter 1991): 44–53.

Koizumi, Naoru, Eri Kuno, and Tony E. Smith. “Modeling Patient Flows Using a Queuing Network with Blocking,” Health Care Management Science 8, 1 (2005): 49–60.

Larson, Richard C. “Perspectives on Queues: Social Justice and the Psychol- ogy of Queuing,” Operations Research 35, 6 (November–December 1987): 895–905.

Murtojärvi, Mika, J. Jarvinen, M. Johnsson, T. Leipala, and O. S. Nevalainen. “Determining the Proper Number and Price of Software Licenses,” IEEE Transactions on Software Engineering 33, 5 (2007): 305–315.

Prabhu, N. U. Foundations of Queuing Theory. Norwell, MA: Kluwer Aca- demic Publishers, 1997.

Regattieri, A., R. Gamberini, F. Lolli, and R. Manzini. “Designing Production and Service Systems Using Queuing Theory: Principles and Application to an Airport Passenger Security Screening System,” International Jour- nal of Services and Operations Management 6, 2 (2010): 206–225.

Tarko, A. P. “Random Queues in Signalized Road Networks,” Transportation Science 34, 4 (November 2000): 415–425.

M12_REND3161_13_AIE_C12.indd 459 28/10/16 11:21 AM

460  CHAPTER 12 • WAiTing LinEs AnD QUEUing THEoRy MoDELs

Appendix 12.1: Using QM for Windows

For all these problems, from the Module menu, select Waiting Lines and then select New to enter a new problem. Then select the type of model you want to use from the ones that appear.

This appendix illustrates the ease of use of QM for Win- dows in solving queuing problems. Program 12.5 represents the Arnold’s Muff ler Shop analysis with two servers. The only required inputs are selection of the proper model, a title, whether to include costs, the time units being used for arrival and service rates (hours in this example), the arrival rate (2 cars

per hour), the service rate (3 cars per hour), and the number of servers (2). Because the time units are specified as hours, W and Wq are given in hours, but they are also converted into minutes and seconds, as seen in Program 12.5.

Program 12.6 reflects a constant service time model, il- lustrated in the chapter by Garcia-Golding Recycling, Inc. The other queuing models can also be solved by QM for Windows, which additionally provides cost/economic analysis.

PROGRAM 12.5 Using QM for Windows to solve a Multichannel Queuing Model (Arnold Muffler shop Data)

PROGRAM 12.6 Using QM for Windows to solve a Constant service Time Model (garcia-golding Data)

M12_REND3161_13_AIE_C12.indd 460 28/10/16 11:21 AM

 461

13.4 Analyze a simulation model as applied to queuing theory.

13.5 Analyze a simulation model as applied to machine maintenance.

13.6 Understand the other two types of simulation models: operational gaming and systems simulation.

13.1 Explain the advantages and disadvantages of simulation.

13.2 Understand the five steps of conducting a Monte Carlo simulation.

13.3 Analyze a simulation model as applied to inventory control.

After completing this chapter, students will be able to:

Simulation Modeling

LEARNING OBJECTIVES

13 CHAPTER

W e are all aware to some extent of the importance of simulation models in our world. Boeing Corporation and Airbus Industries, for example, commonly build simulation models of their proposed jet aircraft and then test the aerodynamic properties of the models. Your local civil defense organization may carry out rescue and evacuation practices as it simulates the natural disaster conditions of a hurricane or tornado. The U.S. Army simulates enemy attacks and defense strategies in war games played on a computer. Business students take courses that use management games to simulate realistic competitive business situations. And thousands of business, government, and service organizations develop simulation models to assist in making decisions concerning inventory control, maintenance scheduling, plant layout, investments, and sales forecasting.

As a matter of fact, simulation is one of the most widely used quantitative analysis tools. Various surveys of the largest U.S. corporations reveal that over half use simulation in corporate planning.

Simulation sounds like it may be the solution to all management problems. This is, unfortu- nately, by no means true. Yet we think you may find it one of the most flexible and fascinating of the quantitative techniques in your studies. Let’s begin our discussion of simulation with a simple definition.

To simulate is to try to duplicate the features, appearance, and characteristics of a real sys- tem. In this chapter, we show how to simulate a business or management system by building a mathematical model that comes as close as possible to representing the reality of the system. We won’t build any physical models, as might be used in airplane wind tunnel simulation tests. But just as physical model airplanes are tested and modified under experimental conditions, our

M13_REND3161_13_AIE_C13.indd 461 28/10/16 11:23 AM

462  CHAPTER 13 • SiMUlATion ModEling

mathematical models are used to experiment and to estimate the effects of various actions. The idea behind simulation is to imitate a real-world situation mathematically, then to study its prop- erties and operating characteristics, and, finally, to draw conclusions and make action decisions based on the results of the simulation. In this way, the real-life system is not touched until the advantages and disadvantages of what may be a major policy decision are first measured on the system’s model.

Using simulation, a manager should (1) define a problem, (2) introduce the variables associ- ated with the problem, (3) construct a simulation model, (4) set up possible courses of action for testing, (5) run the simulation experiment, (6) consider the results (possibly deciding to modify the model or change data inputs), and (7) decide what course of action to take. These steps are illustrated in Figure 13.1.

The problems tackled by simulation can range from very simple to extremely complex, from bank teller lines to an analysis of the U.S. economy. Although very small simulations can be conducted by hand, effective use of this technique requires some automated means of calculation—namely, a computer. Even large-scale models, simulating perhaps years of business decisions, can be handled in a reasonable amount of time by computer. Though simulation is one of the oldest quantitative analysis tools (see the History box that follows), it was not until the introduction of computers in the mid-1940s and early 1950s that it became a practical means of solving management and military problems.

We begin this chapter with a presentation of the advantages and disadvantages of simula- tion. An explanation of the Monte Carlo method of simulation follows. Three sample simula- tions, in the areas of inventory control, queuing, and maintenance planning, are presented. Other simulation models besides the Monte Carlo approach are also discussed briefly. Finally, the im- portant role of computers in simulation is illustrated.

13.1 Advantages and Disadvantages of Simulation

Simulation is a tool that has become widely accepted by managers for several reasons:

1. It is relatively straightforward and flexible. It can be used to compare many different sce- narios side-by-side.

2. Recent advances in software make some simulation models very easy to develop. 3. It can be used to analyze large and complex real-world situations that cannot be solved by

conventional quantitative analysis models. For example, it may not be possible to build and solve a mathematical model of a city government system that incorporates important eco- nomic, social, environmental, and political factors. Simulation has been used successfully to model urban systems, hospitals, educational systems, national and state economies, and even world food systems.

The idea behind simulation is to imitate a real-world situation with a mathematical model that does not affect operations. The seven steps of simulation are illustrated in Figure 13.1.

The explosion of personal computers has created a wealth of computer simulation languages and broadened the use of simulation. Now, even spreadsheet software can be used to conduct fairly complex simulations.

These eight advantages of simulation make it one of the most widely used quantitative analysis techniques in corporate America.

FIGURE 13.1 Process of Simulation

Define Problem

Introduce Important Variables

Construct Simulation Model

Specify Values of Variables to Be Tested

Conduct the Simulation

Examine the Results

Select Best Course of Action

M13_REND3161_13_AIE_C13.indd 462 28/10/16 11:23 AM

13.2 MonTE CARlo SiMUlATion  463

4. Simulation allows what-if types of questions. Managers like to know in advance what options are attractive. With a computer, a manager can try out several policy decisions within a matter of minutes.

5. Simulations do not interfere with the real-world system. It may be too disruptive, for exam- ple, to experiment with new policies or ideas in a hospital, school, or manufacturing plant. With simulation, experiments are done with the model, not on the system itself.

6. Simulation allows us to study the interactive effect of individual components or variables to determine which ones are important.

7. “Time compression” is possible with simulation. The effect of ordering, advertising, or other policies over many months or years can be obtained by computer simulation in a short time.

8. Simulation allows for the inclusion of real-world complications that most quantitative anal- ysis models cannot permit. For example, some queuing models require exponential or Pois- son distributions; some inventory and network models require normality. But simulation can use any probability distribution that the user defines; it does not require any particular distribution.

The main disadvantages of simulation are as follows:

1. Good simulation models for complex situations can be very expensive. It is often a long, complicated process to develop a model. A corporate planning model, for example, may take months or even years to develop.

2. Simulation does not generate optimal solutions to problems as do other quantitative analy- sis techniques such as economic order quantity, linear programming, or PERT. It is a trial- and-error approach that can produce different solutions in repeated runs.

3. Managers must generate all of the conditions and constraints for solutions that they want to examine. The simulation model does not produce answers by itself.

4. Each simulation model is unique. Its solutions and inferences are not usually transferable to other problems.

13.2 Monte Carlo Simulation

When a system contains elements that exhibit chance in their behavior, the Monte Carlo method of simulation can be applied.

The basic idea in Monte Carlo simulation is to generate values for the variables making up the model being studied. There are a lot of variables in real-world systems that are probabilistic in nature and that we might want to simulate. A few examples of these variables follow:

1. Inventory demand on a daily or weekly basis 2. Lead time for inventory orders to arrive

The four disadvantages of simulation are its cost, trial-and- error nature, need to generate answers to tests, and uniqueness.

Variables we may want to simulate abound in business problems because very little in life is certain.

The history of simulation dates back over 5,000 years to Chinese war games called weich’i. Around 1780, the Prussians used simulation to help train their army. Since then, all major military powers have used war games to test out military strategies under simulated environments.

From military gaming arose a new concept called Monte Carlo simulation. It was developed during the 1940s as a quanti- tative analysis technique by Drs. John von Neumann, Stan Ulam, and Nicholas Metropolis at Los Alamos National Laboratory (LANL; see www.lanl.gov) to solve physics problems that were too complex or too expensive to solve by hand. The first applica- tion of Monte Carlo simulation was to study neutron behavior

in fissionable materials. Because their research at LANL was Top Secret, the scientists needed a code name for their new tool. The scientists came up with “Monte Carlo” because the behavior of the neutrons reminded them of a roulette wheel and Dr. Ulam’s uncle spent a lot of time gambling in Monte Carlo, Monaco.

With the advent and use of computers in the 1950s, simula- tion grew as a management tool. Specialized computer program- ming languages (e.g., GPSS and SIMSCRIPT) were developed in the 1960s to handle large-scale problems more effectively. In the 1980s, prewritten, object-oriented simulation programs came onto the scene that could handle situations ranging from weather forecasting to auto parts factory analysis to ski resort design. These programs had names like SLAM, SIMAN, and Witness.

SimulationHISTORY

M13_REND3161_13_AIE_C13.indd 463 28/10/16 11:23 AM

464  CHAPTER 13 • SiMUlATion ModEling

3. Times between machine breakdowns 4. Times between arrivals at a service facility 5. Service times 6. Times to complete project activities 7. Number of employees absent from work each day

Some of these variables, such as the daily demand and the number of employees absent, are discrete and must be integer valued. For example, the daily demand can be 0, 1, 2, 3, and so forth. But daily demand cannot be 4.7362 or any other noninteger value. Other variables, such as those related to time, are continuous and are not required to be integers because time can be any value. When selecting a method to generate values for the random variable, this characteristic of the random variable should be considered. Examples of both will be given in the following sections.

The basis of Monte Carlo simulation is experimentation on the chance (or probabilistic) elements through random sampling. The technique breaks down into five simple steps:

Five Steps of Monte Carlo Simulation

1. Establishing probability distributions for important input variables 2. Building a cumulative probability distribution for each variable in step 1 3. Establishing an interval of random numbers for each variable 4. Generating random numbers 5. Simulating a series of trials

We will examine each of these steps and illustrate them with the following example.

Harry’s Auto Tire Example Harry’s Auto Tire sells all types of tires, but a popular radial tire accounts for a large portion of Harry’s overall sales. Recognizing that inventory costs can be quite significant with this product, Harry wishes to determine a policy for managing this inventory. To see what the demand would look like over a period of time, he wishes to simulate the daily demand for a number of days.

Step 1: Establishing Probability Distributions. One common way to establish a probability dis- tribution for a given variable is to examine historical outcomes. The probability, or relative frequency, for each possible outcome of a variable is found by dividing the frequency of obser- vation by the total number of observations. The daily demand for radial tires at Harry’s Auto Tire over the past 200 days is shown in Table 13.1. We can convert these data to a probability dis- tribution, if we assume that past demand rates will hold in the future, by dividing each demand frequency by the total demand, 200.

The Monte Carlo method can be used with variables that are probabilistic.

To establish a probability distribution for tires, we assume that historical demand is a good indicator of future outcomes.

TABLE 13.1 Historical daily demand for Radial Tires at Harry’s Auto Tire and Probability distribution

DEMAND FOR TIRES FREQUENCY (DAYS) PROBABILITY OF

OCCURRENCE

0 10 10>200 = 0.05 1 20 20>200 = 0.10 2 40 40>200 = 0.20 3 60 60>200 = 0.30 4 40 40>200 = 0.20 5 30 30>200 = 0.15

200 200>200 = 1.00

M13_REND3161_13_AIE_C13.indd 464 28/10/16 11:23 AM

13.2 MonTE CARlo SiMUlATion  465

Probability distributions, we should note, need not be based solely on historical observa- tions. Often, managerial estimates based on judgment and experience are used to create a dis- tribution. Sometimes, a sample of sales, machine breakdowns, or service rates is used to create probabilities for those variables. And the distributions themselves can be either empirical, as in Table 13.1, or based on the commonly known normal, binomial, Poisson, or exponential patterns.

Step 2: Building a Cumulative Probability Distribution for Each Variable. The conversion from a regular probability distribution, such as in the right-hand column of Table 13.1, to a cumulative distribution is an easy job. A cumulative probability is the probability that a variable (demand) will be less than or equal to a particular value. A cumulative distribution lists all of the possible values and the probabilities. In Table 13.2, we see that the cumulative probability for each level of demand is the sum of the number in the probability column (middle column) and the previous cumulative probability (rightmost column). The cumulative probability, graphed in Figure 13.2, is used in step 3 to help assign random numbers.

Step 3: Setting Random Number Intervals. After we have established a cumulative probability distribution for each variable included in the simulation, we must assign a set of numbers to rep- resent each possible value or outcome. These are referred to as random number intervals. Ran- dom numbers are discussed in detail in step 4. Basically, a random number is a series of digits (say, two digits from 01, 02, …, 98, 99, 00) that have been selected by a totally random process.

If there is a 5% chance that demand for a product (such as Harry’s radial tires) is 0 units per day, we want 5% of the random numbers available to correspond to a demand of 0 units. If a total of 100 two-digit numbers is used in the simulation (think of them as being numbered chips in a bowl), we could assign a demand of 0 units to the first five random numbers: 01, 02, 03, 04, and 05.1 Then a simulated demand for 0 units would be created every time one of the numbers 01 to 05 was drawn. If there is also a 10% chance that demand for the same product is 1 unit per day, we could let the next 10 random numbers (06, 07, 08, 09, 10, 11, 12, 13, 14, and 15) repre- sent that demand—and so on for other demand levels.

In general, using the cumulative probability distribution computed and graphed in step 2, we can set the interval of random numbers for each level of demand in a very simple fashion. You will note in Table 13.3 that the interval selected to represent each possible daily demand is very closely related to the cumulative probability on its left. The top end of each interval is al- ways equal to the cumulative probability percentage.

Similarly, we can see in Figure 13.2 and in Table 13.3 that the length of each interval on the right corresponds to the probability of one of each of the possible daily demands. Hence, in as- signing random numbers to the daily demand for three radial tires, the range of the random num- ber interval (36 to 65) corresponds exactly to the probability (or proportion) of that outcome. A daily demand for three radial tires occurs 30% of the time. One of the 30 random numbers greater than 35 up to and including 65 is assigned to that event.

Step 4: Generating Random Numbers. Random numbers may be generated for simulation prob- lems in several ways. If the problem is very large and the process being studied involves thousands of simulation trials, computer programs are available to generate the random numbers needed.

Cumulative probabilities are found by summing all the previous probabilities up to the current demand.

The relation between intervals and cumulative probability is that the top end of each interval is equal to the cumulative probability percentage.

Random numbers can actually be assigned in many different ways—as long as they represent the correct proportion of the outcomes.

1Alternatively, we could have assigned the random numbers 00, 01, 02, 03, 04 to represent a demand of 0 units. The two digits 00 can be thought of as either 0 or 100. As long as 5 numbers out of 100 are assigned to the 0 demand, it doesn’t make any difference which 5 they are.

TABLE 13.2 Cumulative Probabilities for Radial Tires

DAILY DEMAND PROBABILITY CUMULATIVE PROBABILITY

0 0.05 0.05

1 0.10 0.15

2 0.20 0.35

3 0.30 0.65

4 0.20 0.85

5 0.15 1.00

M13_REND3161_13_AIE_C13.indd 465 28/10/16 11:23 AM

466  CHAPTER 13 • SiMUlATion ModEling

If the simulation is being done by hand, as in this book, the numbers may be selected spin- ning a roulette wheel that has 100 slots, by blindly grabbing numbered chips out of a hat, or by any method that allows you to make a random selection.2 The most commonly used means is to choose numbers from a table of random digits such as Table 13.4.

Table 13.4 was itself generated by a computer program. It has the characteristic that every digit or number in it has an equal chance of occurring. In a very large random number table, 10% of digits would be 1s, 10% 2s, 10% 3s, and so on. Because everything is random, we can select numbers from anywhere in the table to use in our simulation procedures in step 5.

Step 5: Simulating the Experiment. We can simulate outcomes of an experiment by simply selecting random numbers from Table 13.4. Beginning anywhere in the table, we note the interval in Table 13.3 or Figure 13.2 into which each number falls. For example, if the random number chosen is 81 and the interval 66 to 85 represents a daily demand for four tires, we select a demand of four tires.

There are several ways to pick random numbers—random number generators (which are a built-in feature in spreadsheets and many computer languages), tables (such as Table 13.4), a roulette wheel, and so on.

2One more method of generating random numbers is called the von Neumann midsquare method, developed in the 1940s. Here’s how it works: (1) select any arbitrary number with n digits (e.g., n = 4 digits), (2) square the number, and (3) extract the middle n digits as the next random number. As an example of a four-digit arbitrary number, use 3,614. The square of 3,614 is 13,060,996. The middle four digits of this new number are 0609. Thus, 0609 is the next random number, and steps 2 and 3 are repeated. The midsquare method is simple and easily programmed, but some- times the numbers repeat quickly and are not random. For example, try using the method starting with 6,100 as your first arbitrary number!

1.00

0.80

0.60

0.40

0.20

0.00 0 1 2 3 4 5

16 15 06 05 01

36 35

66 65

86 85

00

Represents 4 Tires Demanded

Represents 1 Tire Demanded

R an

do m

N um

be rs

C um

ul at

iv e

P ro

ba bi

lit y

Daily Demand for Radials

0.05

0.15

0.35

0.65

0.85

1.00

FIGURE 13.2 graphical Representation of the Cumulative Probability distribution for Radial Tires

TABLE 13.3 Assignment of Random number intervals for Harry’s Auto Tire

DAILY DEMAND PROBABILITY CUMULATIVE PROBABILITY

INTERVAL OF RANDOM

NUMBERS

0 0.05 0.05 01 to 05

1 0.10 0.15 06 to 15

2 0.20 0.35 16 to 35

3 0.30 0.65 36 to 65

4 0.20 0.85 66 to 85

5 0.15 1.00 86 to 00

M13_REND3161_13_AIE_C13.indd 466 28/10/16 11:23 AM

13.2 MonTE CARlo SiMUlATion  467

We now illustrate the concept further by simulating 10 days of demand for radial tires at Harry’s Auto Tire (see Table 13.5). We select the random numbers needed from Table 13.4, start- ing in the upper left-hand corner and continuing down the first column.

It is interesting to note that the average demand of 3.9 tires in this 10-day simulation dif- fers significantly from the expected daily demand, which we can compute from the data in Table 13.2:

Expected daily demand = a 5

i=0 1Probability of i tires2 * 1Demand of i tires2

= 10.052102 + 10.102112 + 10.202122 + 10.302132 + 10.202142 + 10.152152 = 2.95 tires

If this simulation were repeated hundreds or thousands of times, it is much more likely that the average simulated demand would be nearly the same as the expected demand.

Naturally, it would be risky to draw any hard and fast conclusions regarding the operation of a firm from only a short simulation. However, this simulation by hand demonstrates the impor- tant principles involved. It helps us to understand the process of Monte Carlo simulation that is used in computerized simulation models.

TABLE 13.4 Table of Random numbers

52 06 50 88 53 30 10 47 99 37 66 91 35 32 00 84 57 07

37 63 28 02 74 35 24 03 29 60 74 85 90 73 59 55 17 60

82 57 68 28 05 94 03 11 27 79 90 87 92 41 09 25 36 77

69 02 36 49 71 99 32 10 75 21 95 90 94 38 97 71 72 49

98 94 90 36 06 78 23 67 89 85 29 21 25 73 69 34 85 76

96 52 62 87 49 56 59 23 78 71 72 90 57 01 98 57 31 95

33 69 27 21 11 60 95 89 68 48 17 89 34 09 93 50 44 51

50 33 50 95 13 44 34 62 64 39 55 29 30 64 49 44 30 16

88 32 18 50 62 57 34 56 62 31 15 40 90 34 51 95 26 14

90 30 36 24 69 82 51 74 30 35 36 85 01 55 92 64 09 85

50 48 61 18 85 23 08 54 17 12 80 69 24 84 92 16 49 59

27 88 21 62 69 64 48 31 12 73 02 68 00 16 16 46 13 85

45 14 46 32 13 49 66 62 74 41 86 98 92 98 84 54 33 40

81 02 01 78 82 74 97 37 45 31 94 99 42 49 27 64 89 42

66 83 14 74 27 76 03 33 11 97 59 81 72 00 64 61 13 52

74 05 81 82 93 09 96 33 52 78 13 06 28 30 94 23 37 39

30 34 87 01 74 11 46 82 59 94 25 34 32 23 17 01 58 73

59 55 72 33 62 13 74 68 22 44 42 09 32 46 71 79 45 89

67 09 80 98 99 25 77 50 03 32 36 63 65 75 94 19 95 88

60 77 46 63 71 69 44 22 03 85 14 48 69 13 30 50 33 24

60 08 19 29 36 72 30 27 50 64 85 72 75 29 87 05 75 01

80 45 86 99 02 34 87 08 86 84 49 76 24 08 01 86 29 11

53 84 49 63 26 65 72 84 85 63 26 02 75 26 92 62 40 67

69 84 12 94 51 36 17 02 15 29 16 52 56 43 26 22 08 62

37 77 13 10 02 18 31 19 32 85 31 94 81 43 31 58 33 51

Source: Excerpts from A Million Random Digits with 100,000 Normal Deviates, The Free Press, 1955, © RAND Corporation. Reprinted with permission.

Simulated results can differ from analytical results in a short simulation.

M13_REND3161_13_AIE_C13.indd 467 28/10/16 11:23 AM

468  CHAPTER 13 • SiMUlATion ModEling

The simulation for Harry’s Auto Tire involved only one variable. The true power of simula- tion is seen when several random variables are involved and the situation is more complex. In Section 13.4, we see a simulation of an inventory problem in which both the demand and the lead time may vary.

As you might expect, the computer can be a very helpful tool in carrying out the tedious work in larger simulation undertakings. We now demonstrate how QM for Windows and Excel can both be used for simulation.

Using QM for Windows for Simulation Program 13.1 is a Monte Carlo simulation using the QM for Windows software. Inputs to this model are the possible values for the variable, the number of trials to be generated, and either the associated frequency or the probability for each value. If frequencies are input, QM for Windows will compute the probabilities, as well as the cumulative probability distribution. We see that the expected value (2.95) is computed mathematically, and we can compare the actual sample aver- age (2.87) with this. If another simulation is performed, the sample average may change.

Simulating gM’s onStar System to Evaluate Strategic Alternatives

General Motors (GM) has a two-way vehicle communication sys- tem, OnStar, that is the leader in the telematics business of provid- ing communications services to automobiles. Communication can be by an automated system (a virtual advisor) or with a human advi- sor via a cell-phone connection. This is used for such things as crash notification, navigation, Internet access, and traffic information. On- Star answers thousands of emergency calls each month, and many lives have been saved by providing a rapid emergency response.

In developing the new business model for OnStar, GM used an integrated simulation model to analyze the new telematics industry. Six factors were considered in this model—customer acquisition, customer choice, alliances, customer service, finan- cial dynamics, and societal results. The team responsible for this model reported that an aggressive strategy would be the best way to approach this new industry. This included installation of

OnStar in every GM vehicle and free first-year subscription ser- vice. This eliminated the high cost of dealer installation, but it car- ried with it a cost that was not recoverable if the buyer chose not to renew the OnStar subscription.

The implementation of this business strategy and subsequent growth progressed as indicated by the model. As of fall 2001, OnStar had an 80% market share with more than 2 million sub- scribers, and this number was growing rapidly. Update: As of the first quarter of 2013, OnStar is estimated to have over 6 million subscribers worldwide, revenues of $1.5 billion per year, and profit margins of over 30%.

Sources: Based on “A Multimethod Approach for Creating New Business Models: The General Motors OnStar Project,” Interfaces 32, 1 (January–February 2002): 20–34. Update based on General Motors quarterly earnings report released on May 2, 2013, © Trevor S. Hale.

IN ACTION

TABLE 13.5 Ten-day Simulation of demand for Radial Tires

DAY RANDOM NUMBER SIMULATED DAILY DEMAND

1 52 3

2 37 3

3 82 4

4 69 4

5 98 5

6 96 5

7 33 2

8 50 3

9 88 5

10 90 5

39 = total 10-day demand

3.9 = average daily demand for tires

M13_REND3161_13_AIE_C13.indd 468 28/10/16 11:23 AM

13.2 MonTE CARlo SiMUlATion  469

KEY FORMULAS

Copy H3:I3 to H4:I12 Copy C4:D4 to C5:D8

This is entered as an array. Highlight C16:C21, type this formula, then press Ctrl-Shift-Enter. Copy D17:E17 to D18:E21

PROGRAM 13.1 QM for Windows output Screen for Simulation of Harry’s Auto Tire Example

The expected value is calculated mathematically. This is the output for this

individual simulation run.

PROGRAM 13.2 Using Excel 2016 to Simulate Tire demand for Harry’s Auto Tire Shop

Simulation with Excel Spreadsheets The ability to generate random numbers and then “look up” these numbers in a table in order to associate them with a specific event makes spreadsheets excellent tools for conducting simula- tions. Program 13.2 illustrates an Excel simulation for Harry’s Auto Tire.

The RAND( ) function is used to generate a random number between 0 and 1. The VLOOKUP function looks up the random number in the leftmost column of the defined lookup table 1$C$3:$E$82. It moves downward through this column until it finds a cell that is bigger

M13_REND3161_13_AIE_C13.indd 469 28/10/16 11:23 AM

470  CHAPTER 13 • SiMUlATion ModEling

than the random number. It then goes to the previous row and gets the value from column E of the table.

In Program 13.2, for example, the first random number shown is 0.474807. Excel looked down the left-hand column of the lookup table 1$C$3:$E$82 of Program 13.2 until it found 0.65. From the previous row, it retrieved the value in column E, which is 3. Pressing the F9 function key recalculates the random numbers and the simulation.

The FREQUENCY function in Excel (column C in Program 13.2) is used to tabulate how often a value occurs in a set of data. This is an array function, so special procedures are required to enter it. First, highlight the entire range where this is to be located 1C16:C21 in this example2. Then enter the function, as illustrated in cell C16, and press Ctrl + Shift + Enter. This causes the formula to be entered as an array into all the cells that were highlighted 1cells C16:C212.

Many problems exist in which the variable to be simulated is normally distributed and thus is a continuous variable. A function 1NORMINV2 in Excel makes generating normal random numbers very easy, as seen in Program 13.3. The mean is 40 and the standard deviation is 5. The format is

= NORMINV 1probability, mean, standard_deviation2

Defining the Problem The world’s largest semiconductor manufacturer, Intel Corporation, has gross annual sales of over $50 billion. To stay competitive, Intel spends over $5 billion a year on new semiconductor fabrication equipment. Increasing lead times of fabrication equipment coupled with increasing variability in the global semiconductor chip market led to board room quandaries in capital equipment purchasing.

Developing a Model Analysts at Intel built a simulation model of the ordering, shipping, and installation of their capital equip- ment business process.

Acquiring Input Data These same analysts modeled and analyzed the current capital equipment procurement practices at Intel for several years.

Developing a Solution A two-mode simulation model was developed. The model was named the Dual Mode Equipment Proce- dure (DMEP).

Testing the Solution In the first mode of DMEP, capital equipment was procured according to standard contracts and standard lead times. In the second mode, new capital equipment is purchased at slightly higher costs but with reduced lead times. The idea was that the reduced lead times in equipment meant Intel would reap the benefits of being the first to market with new products.

Analyzing the Results The DMEP model integrated common forecasting techniques with Monte Carlo simulation to procure capi- tal equipment at higher costs but with shorter lead times, as outlined above.

Implementing the Results Once implemented and in place, the DMEP decision engine saved Intel Corporation hundreds of millions of dollars.

Source: Based on K. G. Kempf, F. Erhun, E. F. Hertzler, T. R. Rosenberg, and C. Peng, “Optimizing Capital Investment Decisions at Intel Corporation,” Interfaces 43, 1 (January–February 2013): 62–78, © Trevor S. Hale.

MODELING IN THE REAL WORLD Simulating Chips

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M13_REND3161_13_AIE_C13.indd 470 28/10/16 11:23 AM

13.3 SiMUlATion And invEnToRy AnAlySiS  471

In Program 13.3, the 200 simulated values for the normal random variable are generated in column A. A chart (cells C3:E19) was developed to show the distribution of the randomly generated numbers.

Excel QM has a simulation module that is very easy to use. When Simulation is selected from the Excel QM menu, an Initialization window opens, and you enter the number of catego- ries and the number of simulation trials you want to run. A spreadsheet will be developed, and you then enter the values and the frequencies, as shown in Program 13.4. The actual random numbers and their associated demand values are also displayed in the output, but they are not shown in Program 13.4.

PROGRAM 13.3 generating normal Random numbers in Excel 2016

PROGRAM 13.4 Excel QM Simulation of Harry’s Auto Tire Example

Enter the values and the frequencies here. The probabilities and simulation results will then appear.

13.3 Simulation and Inventory Analysis

In Chapter 6, we introduced the subject of “deterministic” inventory models. These commonly used models are based on the assumption that both product demand and reorder lead time are known, constant values. In many real-world inventory situations, though, demand and lead time are variables, and accurate analysis becomes extremely difficult to handle by any means other than simulation.

Simulation is useful when demand and lead time are probabilistic—in this case, inventory models like economic order quantity (in Chapter 6) can’t be used.

KEY FORMULAS

Copy A4 to A5:A203 Copy E4 to E5:E19

This is entered as an array. Highlight D4:D19, type this formula, then press Ctrl-Shift-Enter.

M13_REND3161_13_AIE_C13.indd 471 28/10/16 11:23 AM

472  CHAPTER 13 • SiMUlATion ModEling

In this section, we present an inventory problem with two decision variables and two proba- bilistic components. The owner of a hardware store would like to establish the order quantity and reorder point for a particular product that has probabilistic (uncertain) daily demand and reorder lead time. He wants to make a series of simulation runs, trying out various order quantities and reorder points, to minimize his total inventory cost for the item. Inventory costs in this case include ordering, holding, and stockout costs.

Simkin’s Hardware Store Mark Simkin, owner and general manager of Simkin Hardware, wants to find a good, low-cost inventory policy for one particular product: the Ace model electric drill. Due to the complexity of this situation, he has decided to use simulation to help with this. The first step in the simula- tion process seen in Figure 13.1 is to define the problem. Simkin specifies this to be finding a good inventory policy for the Ace electric drill.

In the second step of this process, Simkin identifies two types of variables: the controllable and uncontrollable inputs. The controllable inputs (or decision variables) are the order quantity and the reorder point. Simkin must specify the values that he wishes to consider. The other im- portant variables are the uncontrollable inputs: the fluctuating daily demand and the variable lead time. Monte Carlo simulation is used to simulate the values for both of these.

Daily demand for the Ace model drill is relatively low but subject to some variability. Over the past 300 days, Simkin has observed the sales shown in column 2 of Table 13.6. He converts this historical frequency data into a probability distribution for the variable daily demand (column 3). A cumulative probability distribution is formed in column 4. Finally, Simkin estab- lishes an interval of random numbers to represent each possible daily demand (column 5).

When Simkin places an order to replenish his inventory of Ace electric drills, there is a delivery lag of 1 to 3 days. This means that lead time can also be considered a probabilistic vari- able. The number of days it took to receive the past 50 orders is presented in Table 13.7. In a fashion similar to that for the demand variable, Simkin establishes a probability distribution for the lead time variable (column 3 of Table 13.7), computes the cumulative distribution (column 4), and assigns random number intervals for each possible time (column 5).

The third step in the simulation process is to develop the simulation model. A flow dia- gram, or flowchart, is helpful in the logical coding procedures for programming this simulation process (see Figure 13.3).

In flowcharts, special symbols are used to represent different parts of a simulation. The rectangular boxes represent actions that must be taken. The diamond-shaped figures represent branching points where the next step depends on the answer to the question in the diamond. The beginning and ending points of the simulation are represented as ovals or rounded rectangles.

The fourth step of this simulation is to specify the values of the variables that we wish to test. The first inventory policy that Simkin Hardware wants to simulate is an order quantity of 10

with a reorder point of 5. That is, every time the on-hand inventory level at the end of the day is 5 or less, Simkin will call his supplier and place an order for 10 more drills. If the lead time is 1 day, by the way, the order will not arrive the next morning but at the beginning of the following working day.

A delivery lag is the lead time in receiving an order—the time between when the order was placed and when it was received.

TABLE 13.6 Probabilities and Random number intervals for daily Ace drill demand

(1) DEMAND FOR

ACE DRILL

(2) FREQUENCY

(DAYS) (3)

PROBABILITY

(4) CUMULATIVE PROBABILITY

(5) INTERVAL OF

RANDOM NUMBERS

0 15 0.05 0.05 01 to 05

1 30 0.10 0.15 06 to 15

2 60 0.20 0.35 16 to 35

3 120 0.40 0.75 36 to 75

4 45 0.15 0.90 76 to 90

5 30 0.10 1.00 91 to 00

300 1.00

M13_REND3161_13_AIE_C13.indd 472 28/10/16 11:23 AM

13.3 SiMUlATion And invEnToRy AnAlySiS  473

TABLE 13.7 Probabilities and Random number intervals for Reor- der lead Time

(1) LEAD TIME

(DAYS)

(2) FREQUENCY

(ORDERS) (3)

PROBABILITY

(4) CUMULATIVE PROBABILITY

(5) RANDOM NUMBER

INTERVAL

1 10 0.20 0.20 01 to 20

2 25 0.50 0.70 21 to 70

3 15 0.30 1.00 71 to 00

50 1.00

FIGURE 13.3 Flow diagram for Simkin’s inventory Example

Begin day of simulation

Has order

arrived?

Select random number to generate today’s demand

Is demand greater than beginning

inventory ?

Compute ending inventory = Beginning inventory – Demand

Is ending inventory less than reorder

point?

Increase beginning inventory by quantity ordered

Record number of lost sales

Record ending inventory = 0

Has order been

placed that hasn’t arrived yet?

Have enough days

of this order policy been simulated?

Compute average ending inventory, average lost sales, average number of orders placed, and corresponding costs

Select random number to generate lead time

Place order

Yes

Yes

Yes

YesNo

No

Yes

No

No

No

Start

End

M13_REND3161_13_AIE_C13.indd 473 28/10/16 11:23 AM

474  CHAPTER 13 • SiMUlATion ModEling

The fifth step of the simulation process is to actually conduct the simulation, and the Monte Carlo method is used for this. The entire process is simulated for a 10-day period in Table 13.8. We can assume that the beginning inventory is 10 units on day 1. (Actually, it makes little dif- ference in a long simulation what the initial inventory level is. Since we would tend in real life to simulate hundreds or thousands of days, the beginning values would tend to be averaged out.) Random numbers for Simkin’s inventory problem are selected from the second column of Table 13.4.

Table 13.8 is filled in by proceeding one day (or line) at a time, working from left to right. It is a four-step process:

1. Begin each simulated day by checking whether any ordered inventory has just arrived (column 2). If it has, increase the current inventory (in column 3) by the quantity ordered (10 units, in this case).

2. Generate a daily demand from the demand probability distribution in Table 13.6 by select- ing a random number. This random number is recorded in column 4. The demand simu- lated is recorded in column 5.

3. Compute the ending inventory every day and record it in column 6. Ending inventory equals beginning inventory minus demand. If on-hand inventory is insufficient to meet the day’s demand, satisfy as much as possible and note the number of lost sales (in column 7).

4. Determine whether the day’s ending inventory has reached the reorder point (5 units). If it has and if there are no outstanding orders, place an order (column 8). Lead time for a new order is simulated by first choosing a random number from Table 13.4 and recording it in column 9. (We can continue down the same string of the random number table that we were using to generate numbers for the demand variable.) Finally, we convert this random number into a lead time by using the distribution set in Table 13.7.

Here is how we simulated the Simkin Hardware example.

TABLE 13.8 Simkin Hardware’s First inventory Simulation

ORDER QUANTITY = 10 UNITS REORDER POINT = 5 UNITS

(1) DAY

(2) UNITS

RECEIVED

(3) BEGINNING INVENTORY

(4) RANDOM NUMBER

(5) DEMAND

(6) ENDING

INVENTORY

(7) LOST SALES

(8) ORDER

(9) RANDOM NUMBER

(10) LEAD TIME

1 … 10 06 1 9 0 No

2 0 9 63 3 6 0 No

3 0 6 57 3 ○3 a 0 Yes ○02 b 1 4 0 3 ○94 c 5 0 2 Nod 5 ○10 e 10 52 3 7 0 No 6 0 7 69 3 4 0 Yes 33 2

7 0 4 32 2 2 0 No

8 0 2 30 2 0 0 No

9 ○10 f 10 48 3 7 0 No 10 0 7 88 4 3 0 Yes 14 1

Total 41 2

aThis is the first time inventory dropped below the reorder point of 5 drills. Because no prior order was outstanding, an order is placed. bThe random number 02 is generated to represent the first lead time. It was drawn from column 2 of Table 13.4 as the next number in the list being used. A separate column could have been used to draw lead time random numbers from if we had wanted to do so, but in this example we did not do so. cAgain, notice that the random number 02 was used for lead time (see footnote b), so the next number in the column is 94. dNo order is placed on day 4 because there is one outstanding from the previous day that has not yet arrived. eThe lead time for the first order placed is 1 day, but as noted in the text, an order does not arrive the next morning but at the beginning of the following work- ing day. Thus, the first order arrives at the start of day 5. fThis is the arrival of the order placed at the close of business on day 6. Fortunately for Simkin, no lost sales occurred during the 2-day lead time until the order arrived.

M13_REND3161_13_AIE_C13.indd 474 28/10/16 11:23 AM

13.3 SiMUlATion And invEnToRy AnAlySiS  475

Analyzing Simkin’s Inventory Costs Now that the simulation results have been generated, Simkin is ready to proceed to step 6 of this process—examining the results. Since the objective is to find a low-cost solution, Simkin must determine, given these results, what the costs would be. In doing this, Simkin finds some inter- esting results. The average daily ending inventory is

Average ending inventory = 41 total units

10 days = 4.1 units per day

We also note the average lost sales and number of orders placed per day:

Average lost sales = 2 sales lost

10 days = 0.2 unit per day

Average number of orders placed = 3 orders

10 days = 0.3 order per day

These data are useful in studying the inventory costs of the policy being simulated. Simkin Hardware is open for business 200 days per year. Simkin estimates that the cost of

placing each order for Ace drills is $10. The cost of holding a drill in stock is $6 per drill per year, which can also be viewed as 3 cents per drill per day (over a 200-day year). Finally, Simkin estimates that the cost of each shortage, or lost sale, is $8. What is Simkin’s total daily inventory cost for the ordering policy of order quantity Q = 10 and reorder point ROP = 5?

Let us examine the three cost components:

Daily order cost = 1Cost of placing one order2 * 1Number of orders placed per day2 = $10 per order * 0.3 order per day = $3

Daily holding cost = 1Cost of holding one unit for one day2 * 1Average ending inventory2 = $0.03 per unit per day * 4.1 units per day = $0.12

Daily stockout cost = 1Cost per lost sale2 * 1Average number of lost sales per day2 = $8 per lost sale * 0.2 lost sale per day = $1.60

Total daily inventory cost = Daily order cost + Daily holding cost + Daily stockout cost = $4.72

Thus, the total daily inventory cost for this simulation is $4.72. Annualizing this daily figure to a 200-day working year suggests that this inventory policy’s cost is approximately $944.

Once again we want to emphasize something very important. This simulation should be extended many more days before we draw any conclusions as to the cost of the inventory policy being tested. If a hand simulation is being conducted, 100 days would provide a better represen- tation. If a computer is doing the calculations, 1,000 days would be helpful in reaching accurate cost estimates.

Let’s say that Simkin does complete a 1,000-day simulation of the policy that order quantity = 10 drills, reorder point = 5 drills. Does this complete his analysis? The answer is no—this is just the beginning! We should now verify that the model is correct and validate that the model truly represents the situation on which it is based. As indicated in Figure 13.1, once the results of the model are examined, we may want to go back and modify the model that we have developed. If we are satisfied that the model performed as we expected, then we can specify other values of the variables. Simkin must now compare this potential strategy to other possibilities. For example, what about Q = 10, ROP = 4; or Q = 12, ROP = 6; or Q = 14, ROP = 5? Perhaps every combination of values of Q from 6 to 20 drills and ROP from 3 to 10 drills should be simulated. After simulating all reasonable combinations of order quantities and reorder points, Simkin would go to step 7 of the simulation process and probably select the pair that yields the lowest total inventory cost.

It is important to remember that the simulation should be conducted for many, many days before it is legitimate to draw any solid conclusions.

M13_REND3161_13_AIE_C13.indd 475 28/10/16 11:23 AM

476  CHAPTER 13 • SiMUlATion ModEling

13.4 Simulation of a Queuing Problem

An important area of simulation application has been in the analysis of waiting line problems. As mentioned earlier, the assumptions required for solving queuing problems analytically are quite restrictive. For most realistic queuing systems, simulation may actually be the only approach available. This section illustrates the simulation at a large unloading dock and its associated queue.

Port of New Orleans Fully loaded barges arrive at night in New Orleans following their long trips down the Missis- sippi River from industrial midwestern cities. The number of barges docking on any given night ranges from 0 to 5. The probability of 0, 1, 2, 3, 4, or 5 arrivals is displayed in Table 13.9. In the same table, we establish cumulative probabilities and corresponding random number intervals for each possible value.

A study by the dock superintendent reveals that because of the nature of their cargo, the number of barges unloaded also tends to vary from day to day. The superintendent provides information from which we can create a probability distribution for the variable daily unloading rate (see Table 13.10). As we just did for the arrival variable, we can set up an interval of random numbers for the unloading rates.

Barges are unloaded on a first-in, first-out basis. Any barges that are not unloaded the day of arrival must wait until the following day. Tying up a barge in dock is an expensive

Barge arrivals and unloading rates are both probabilistic variables. Unless they follow the queuing probability distributions of Chapter 12, we must turn to a simulation approach.

Federal Aviation Administration Uses Simulation to Solve Assignment Problem

The Federal Aviation Administration (FAA) is responsible for managing transportation in the air. This typically involves the as- signment of airline flights to particular air-traffic routes in real time. On the surface, this problem may seem rather mundane. However, as air traffic demand has grown in recent years, the number of available air-traffic routes has diminished at any given time. This can make the associated assignment problem very hard. Confounding the problem is the weather, as thunderstorms can wreak havoc on the availability of air-traffic routes at any given time.

In 2005, the FAA developed a simulation decision-making tool known as the Airspace Flow Program (AFP) at a total cost

of about $5 million. The AFP integrates upcoming and current flight data with impending storm weather data and simulates several different possible assignment decisions. All of these “look-ahead” simulations are then analyzed, allowing FAA decision makers to “pre-pick” a robust set of assignment solutions that minimize systemwide flight delays. The result is faster, more efficient flights for the traveler and hundreds of millions of dollars of annual savings for the airlines.

Source: Based on V. Sud, M. Tanino, J. Wetherly, M. Brennan, M. Lehky, K. Howard, and R. Oiesen, “Reducing Flight Delays Through Better Traffic Man- agement,” Interfaces 39, 1 (2009): 35–45, © Trevor S. Hale.

IN ACTION

TABLE 13.9 overnight Barge Arrival Rates and Random number intervals

NUMBER OF ARRIVALS PROBABILITY

CUMULATIVE PROBABILITY

RANDOM NUMBER INTERVAL

0 0.13 0.13 01 to 13

1 0.17 0.30 14 to 30

2 0.15 0.45 31 to 45

3 0.25 0.70 46 to 70

4 0.20 0.90 71 to 90

5 0.10 1.00 91 to 00

1.00

M13_REND3161_13_AIE_C13.indd 476 28/10/16 11:23 AM

13.4 SiMUlATion oF A QUEUing PRoBlEM  477

TABLE 13.11 Queuing Simulation of Port of new orleans Barge Unloadings

(1) DAY

(2) NUMBER DELAYED

FROM PREVIOUS DAY

(3) RANDOM NUMBER

(4) NUMBER

NIGHTLY ARRIVALS

(5) TOTAL TO BE UNLOADED

(6) RANDOM NUMBER

(7) NUMBER

UNLOADED

1 ○9 a 52 3 3 37 3 2 0 06 0 0 63 ○0 b 3 0 50 3 3 28 3

4 0 88 4 4 02 1

5 3 53 3 6 74 4

6 2 30 1 3 35 3

7 0 10 0 0 24 ○0 c 8 0 47 3 3 03 1

9 2 99 5 7 29 3

10 4 37 2 6 60 3

11 3 66 3 6 74 4

12 2 91 5 7 85 4

13 3 35 2 5 90 4

14 1 32 2 3 73 ○3 d 15 0 00 5 5 59 3

20 41 39

Total delays Total arrivals Total unloadings

aWe can begin with no delays from the previous day. In a long simulation, even if we started with 5 overnight delays, that initial condition would be averaged out. bThree barges could have been unloaded on day 2. But because there were no arrivals and no backlog existed, zero unloadings took place. cThe same situation as noted in footnote b takes place. dThis time 4 barges could have been unloaded, but since only 3 were in the queue, the number unloaded is recorded as 3.

TABLE 13.10 Unloading Rates and Random number intervals

DAILY UNLOADING RATE PROBABILITY

CUMULATIVE PROBABILITY

RANDOM NUMBER INTERVAL

1 0.05 0.05 01 to 05

2 0.15 0.20 06 to 20

3 0.50 0.70 21 to 70

4 0.20 0.90 71 to 90

5 0.10 1.00 91 to 00

1.00

proposition, and the superintendent cannot ignore the angry phone calls from barge line owners reminding him that “Time is money!” He decides that before going to the Port of New Orleans’s controller to request additional unloading crews, a simulation study of arrivals, unloadings, and delays should be conducted. A 100-day simulation would be ideal, but for purposes of illustration, the superintendent begins with a shorter 15-day analysis. Random numbers are drawn from the top row of Table 13.4 to generate daily arrival rates. They are drawn from the second row of Table 13.4 to create daily unloading rates. Table 13.11 shows the day-by-day port simulation.

M13_REND3161_13_AIE_C13.indd 477 28/10/16 11:23 AM

478  CHAPTER 13 • SiMUlATion ModEling

The superintendent will probably be interested in at least three useful and important pieces of information:

Average number of barges delayed to the next day = 20 delays

15 days

= 1.33 barges delayed per day

Average number of nightly arrivals = 41 arrivals

15 days = 2.73 arrivals

Average number of barges unloaded each day = 39 unloadings

15 days = 2.60 unloadings

When these data are analyzed in the context of delay costs, idle labor costs, and the cost of hiring extra unloading crews, it will be possible for the dock superintendent and port controller to make a better staffing decision. They may even elect to resimulate the process assuming different unloading rates that would correspond to increased crew sizes. Although simulation is a tool that cannot guarantee an optimal solution to problems such as this, it can be helpful in recreating a process and identifying good decision alternatives.

Using Excel to Simulate the Port of New Orleans Queuing Problem Excel has been used to simulate the Port of New Orleans example, and the results are shown in Program 13.5. The VLOOKUP function is used as it was used in previous Excel simula- tions. Ten days of operation were simulated, and the results are displayed in rows 4 to 13 of the spreadsheet.

Here are the simulation results regarding average barge delays, average nightly arrivals, and average unloadings.

PROGRAM 13.5 Excel 2016 Model for Port of new orleans Queuing Simulation

KEY FORMULAS

Copy C18:D18 to C19:D22 Copy I18:J18 to I19:J21

Copy B5:H5 to B6:H13

M13_REND3161_13_AIE_C13.indd 478 28/10/16 11:23 AM

13.5 SiMUlATion ModEl FoR A MAinTEnAnCE PoliCy  479

13.5 Simulation Model for a Maintenance Policy

Simulation is a valuable technique for analyzing various maintenance policies before actually implementing them. A firm can decide whether to add more maintenance staff based on ma- chine downtime costs and costs of additional labor. It can simulate replacing parts that have not yet failed in exploring ways to prevent future breakdowns. Many companies use computerized simulation models to decide if and when to shut down an entire plant for maintenance activities. This section provides an example of the value of simulation in setting maintenance policy.

Three Hills Power Company The Three Hills Power Company provides electricity to a large metropolitan area through a se- ries of almost 200 hydroelectric generators. Management recognizes that even a well-maintained generator will have periodic failures or breakdowns. Energy demands over the past 3 years have been consistently high, and the company is concerned over downtime of generators. It currently employs four highly skilled repairpersons at $30 per hour. Each works every fourth 8-hour shift. In this way, there is a repairperson on duty 24 hours a day, 7 days a week.

As expensive as the maintenance staff salaries are, breakdown expenses are even higher. For each hour that one of its generators is down, Three Hills loses approximately $75. This amount is the charge for reserve power that Three Hills must “borrow” from the neighboring utility company.

Stephanie Robbins has been assigned to conduct a management analysis of the breakdown problem. She determines that simulation is a workable tool because of the probabilistic nature of this problem. She decides her objective is to determine (1) the service maintenance cost, (2) the simulated machine breakdown cost, and (3) the total of these breakdown and maintenance costs (which gives the total cost of this system). Since the total downtime of the machines is needed to compute the breakdown cost, she must know when each machine breaks and when each machine returns to service. Therefore, a next-event-step simulation model must be used. In planning for this simulation, a flowchart, as seen in Figure 13.4, is developed.

Robbins identifies two important maintenance system components. First, the time between successive generator breakdowns varies historically from as little as 0.5 hour to as much as 3 hours. For the past 100 breakdowns, she tabulates the frequency of various times between machine failures (see Table 13.12). She also creates a probability distribution and assigns random number intervals to each expected time range.

Robbins then notes that the people who do repairs log their maintenance time in 1-hour time blocks. Because of the time it takes to reach a broken generator, repair times are generally rounded to 1, 2, or 3 hours. In Table 13.13, she performs a statistical analysis of past repair times, similar to that conducted for breakdown times.

Robbins begins conducting the simulation by selecting a series of random numbers to gen- erate simulated times between generator breakdowns and a second series to simulate repair times required. A simulation of 15 machine failures is presented in Table 13.14. We now examine the elements in the table, one column at a time.

COLUMN 1: BREAKDOWN NUMBER. This is the count of breakdowns as they occur, going from 1 to 15.

COLUMN 2: RANDOM NUMBER FOR BREAKDOWNS. This is a number used to simulate time between breakdowns. The numbers in this column have been selected from Table 13.4, from the second column from the right-hand side of the table.

COLUMN 3: TIME BETWEEN BREAKDOWNS. This number is generated from column 2 random numbers and the random number intervals defined in Table 13.12. The first random number, 57, falls in the interval 28 to 60, implying a time of 2 hours since the prior breakdown.

COLUMN 4: TIME OF BREAKDOWN. This converts the data in column 3 into an actual time of day for each breakdown. This simulation assumes that the first day begins at midnight (00:00 hours). Since the time between zero breakdowns and the first breakdown is 2 hours, the first recorded machine failure is at 02:00 on the clock. The second breakdown, you note, occurs 1.5 hours later, at a calculated clock time of 03:30 (or 3:30 a.m.).

COLUMN 5: TIME REPAIRPERSON IS FREE TO BEGIN REPAIR. This is 02:00 hours for the first breakdown if we assume that the repairperson began work at 00:00 hours and was not tied up from a previous generator failure. Before recording this time on the second and all subsequent lines, however,

Maintenance problems are an area in which simulation is widely used.

M13_REND3161_13_AIE_C13.indd 479 28/10/16 11:23 AM

480  CHAPTER 13 • SiMUlATion ModEling

we must check column 8 to see what time the repairperson finishes the previous job. Look, for example, at the seventh breakdown. The breakdown occurs at 15:00 hours (or 3:00 p.m.). But the repairperson does not complete the previous job, the sixth breakdown, until 16:00 hours. Hence, the entry in column 5 is 16:00 hours.

One further assumption is made to handle the fact that each repairperson works only an 8-hour shift: when each person is replaced by the next shift, he or she simply hands the tools over to the new worker. The new repairperson continues working on the same broken generator until the job is completed. There is no lost time and no overlap of workers. Hence, labor costs for each 24-hour day are exactly 24 hours * $30 per hour = $720.

COLUMN 6: RANDOM NUMBER FOR REPAIR TIME. This is a number selected from the rightmost column of Table 13.4. It helps simulate repair times.

FIGURE 13.4 Three Hills Flow diagram

Is repairperson free to begin

repair?

Enough breakdowns simulated?

Generate random number for repair time required

Compute time repair completed

Generate random number for “Time Between Breakdowns”

Wait until previous repair is completed

Compute downtime and comparative cost data

Compute hours of machine downtime = Time repair completed – Clock time of breakdown

Yes

Yes

No

No

Examine time previous repair ends

Record actual clock time of breakdown

Start

End

M13_REND3161_13_AIE_C13.indd 480 28/10/16 11:23 AM

13.5 SiMUlATion ModEl FoR A MAinTEnAnCE PoliCy  481

COLUMN 7: REPAIR TIME REQUIRED. This is generated from column 6’s random numbers and Table 13.13’s repair time distribution. The first random number, 07, represents a repair time of 1 hour, since it falls in the random number interval 01 to 28.

COLUMN 8: TIME REPAIR ENDS. This is the sum of the entry in column 5 (time repairperson is free to begin) plus the required repair time from column 7. Since the first repair begins at 02:00 and takes 1 hour to complete, the time repair ends is recorded in column 8 as 03:00.

COLUMN 9: NUMBER OF HOURS THE MACHINE IS DOWN. This is the difference between column 4 (time of breakdown) and column 8 (time repair ends). In the case of the first breakdown, that difference is 1 hour (03:00 minus 02:00). In the case of the tenth breakdown, the difference is 23:00 hours minus 19:30 hours, or 3.5 hours.

Cost Analysis of the Simulation The simulation of 15 generator breakdowns in Table 13.14 spans a time of 34 hours of operation. The clock began at 00:00 hours of day 1 and ran until the final repair at 10:00 hours of day 2.

The critical factor that interests Robbins is the total number of hours that generators are out of service (from column 9). This is computed to be 44 hours. She also notes that toward the end of the simulation period, a backlog is beginning to appear. The thirteenth breakdown occurred at 01:00 hours but could not be worked on until 04:00 hours. The fourteenth and fifteenth breakdowns experienced similar delays. Robbins is determined to write a computer program to carry out a few hundred more simulated breakdowns but first wants to analyze the data she has collected thus far.

She measures her objectives as follows:

Service maintenance cost = 34 hours of worker service time * $30 per hour = $1,020

Simulated machine breakdown cost = 44 total hours of breakdown * $75 lost per hour of downtime = $3,300

Total simulated maintenance cost of the current system = Service cost + Breakdown cost

= $1,020 + $3,300 = $4,320

TABLE 13.12 Time Between generator Breakdowns at Three Hills Power

TIME BETWEEN RECORDED MACHINE

FAILURES (HOURS)

NUMBER OF TIMES

OBSERVED PROBABILITY CUMULATIVE PROBABILITY

RANDOM NUMBER

INTERVAL

0.5 5 0.05 0.05 01 to 05

1.0 6 0.06 0.11 06 to 11

1.5 16 0.16 0.27 12 to 27

2.0 33 0.33 0.60 28 to 60

2.5 21 0.21 0.81 61 to 81

3.0 19 0.19 1.00 82 to 00

Total 100 1.00

TABLE 13.13 generator Repair Times Required

REPAIR TIME REQUIRED (HOURS)

NUMBER OF TIMES

OBSERVED PROBABILITY CUMULATIVE PROBABILITY

RANDOM NUMBER

INTERVAL

1 28 0.28 0.28 01 to 28

2 52 0.52 0.80 29 to 80

3 20 0.20 1.00 81 to 00

Total 100 1.00

M13_REND3161_13_AIE_C13.indd 481 28/10/16 11:23 AM

482  CHAPTER 13 • SiMUlATion ModEling

TA BL

E 13

.1 4

S im

ul at

io n

of g

en er

at or

B re

ak do

w ns

a nd

R ep

ai rs

(1 )

B R

E A

K D

O W

N

N U

M B

E R

(2 )

R

A N

D O

M

N U

M B

E R

F O

R

B R

E A

K D

O W

N S

(3 )

T

IM E

B E

T W

E E

N

B R

E A

K D

O W

N S

(H O

U R

S)

(4 )

T

IM E

O F

B

R E

A K

D O

W N

(5 )

T

IM E

R

E PA

IR P

E R

SO N

IS

F R

E E

T O

B E

G IN

T

H IS

R E

PA IR

(6 )

R

A N

D O

M

N U

M B

E R

F O

R

R E

PA IR

T IM

E

(7 )

R

E PA

IR T

IM E

R

E Q

U IR

E D

(H

O U

R S)

(8 )

T IM

E R

E PA

IR

E N

D S

(9 )

N

U M

B E

R

O F

H O

U R

S M

A C

H IN

E

D O

W N

1 57

2 02

:0 0

02 :0

0 07

1 03

:0 0

1

2 17

1. 5

03 :3

0 03

:3 0

60 2

05 :3

0 2

3 36

2 05

:3 0

05 :3

0 77

2 07

:3 0

2

4 72

2. 5

08 :0

0 08

:0 0

49 2

10 :0

0 2

5 85

3 11

:0 0

11 :0

0 76

2 13

:0 0

2

6 31

2 13

:0 0

13 :0

0 95

3 16

:0 0

3

7 44

2 15

:0 0

16 :0

0 51

2 18

:0 0

3

8 30

2 17

:0 0

18 :0

0 16

1 19

:0 0

2

9 26

1. 5

18 :3

0 19

:0 0

14 1

20 :0

0 1.

5

10 09

1 19

:3 0

20 :0

0 85

3 23

:0 0

3. 5

11 49

2 21

:3 0

23 :0

0 59

2 01

:0 0

3. 5

12 13

1. 5

23 :0

0 01

:0 0

85 3

04 :0

0 5

13 33

2 01

:0 0

04 :0

0 40

2 06

:0 0

5

14 89

3 04

:0 0

06 :0

0 42

2 08

:0 0

4

15 13

1. 5

05 :3

0 08

:0 0

52 2

10 :0

0 4.

5

To ta

l 4 4

M13_REND3161_13_AIE_C13.indd 482 28/10/16 11:23 AM

13.5 SiMUlATion ModEl FoR A MAinTEnAnCE PoliCy  483

A total cost of $4,320 is reasonable only when compared with other, more attractive or less attractive maintenance options. Should, for example, the Three Hills Power Company add a sec- ond full-time repairperson to each shift? Should it add just one more worker and let him or her come on duty every fourth shift to help catch up on any backlogs? These are two alternatives that Robbins may choose to consider through simulation. You can help by solving Problem 13.25 at the end of the chapter.

As mentioned at the outset of this section, simulation can also be used in other maintenance problems, including the analysis of preventive maintenance. Perhaps the Three Hills Power Company should consider strategies for replacing generator motors, valves, wiring, switches, and other miscellaneous parts that typically fail. It could (1) replace all parts of a certain type when one fails on any generator or (2) repair or replace all parts after a certain length of service based on an estimated average service life. This would again be done by setting probability distributions for failure rates, selecting random numbers, and simulating past failures and their associated costs.

BUILDING AN EXCEL SIMULATION MODEL FOR THREE HILLS POWER COMPANY Program 13.6 provides an Excel spreadsheet approach to simulating the Three Hills Power maintenance problem.

Miami’s Jackson Memorial Hospital, Florida’s largest hospital, with 1,576 inpatient beds, is also one of the finest hospitals in the United States. Department of Management Systems Engineering is constantly seeking ways of increasing hospital efficiency, and the construction of new operating rooms (ORs) prompted the development of a simulation of the existing 31 ORs.

The OR boundary includes the Holding Area and the Recovery Area, both of which were experiencing problems due to ineffective scheduling of OR services. A simulation study, modeled using the ARENA software package, sought to maximize the current use of OR rooms and staff. Inputs to the model included (1) the amount of time a patient waits in holding, (2) the specific process the patient undergoes, (3) the staff schedule, (4) room availability, and (5) time of day.

The first hurdle that the research team had to deal with at Jackson was the vast number of records to scour to extract data for the probabilistic simulation model. The second hurdle was the quality of the data. A thorough analysis of the records deter- mined which were good and which had to be discarded. In the end, Jackson’s carefully screened databases led to a good set of model inputs. The simulation model then successfully developed five measures of OR performance: (1) number of procedures a day, (2) average case time, (3) staff utilization, (4) room utiliza- tion, and (5) average waiting time in the holding area.

Source: Based on M. A. Centeno et al., “Challenges of Simulating Hospital Facilities,” in Proceedings of the 12th Annual Conference of the Production and Operations Management Society (Orlando, FL: Production and Operations Management Society, March 2001), 50, © Trevor S. Hale.

Simulating Jackson Memorial Hospital’s operating RoomsIN ACTION

PROGRAM 13.6 Excel 2016 Model for Three Hills Power Company Maintenance Problem

Preventive maintenance policies can also be simulated.

M13_REND3161_13_AIE_C13.indd 483 28/10/16 11:23 AM

484  CHAPTER 13 • SiMUlATion ModEling

KEY FORMULAS

Copy C18:E18 to C19:E22

Copy B5:H5 to B6:H13

13.6 Other Simulation Issues

Simulation is one of the most widely used tools in business. As we have seen in the earlier parts of this chapter, applications abound, as we are not restricted by the assumptions in some of the mathematical models discussed in earlier chapters. In this section, we look at a few other issues related to simulation, including some of the software tools available.

Two Other Types of Simulation Models Simulation models are often broken into three categories. The first, the Monte Carlo method just discussed, uses the concepts of probability distribution and random numbers to evaluate sys- tem responses to various policies. The other two categories are operational gaming and systems simulation. Although in theory the three methods are distinctly different, the growth of comput- erized simulation has tended to create a common basis in procedures and blur these differences.3

OPERATIONAL GAMING Operational gaming refers to simulation involving two or more competing players. The best examples are military games and business games. Both allow participants to match their management and decision-making skills in hypothetical situations of conflict.

Military games are used worldwide to train a nation’s top military officers, to test offensive and defensive strategies, and to examine the effectiveness of equipment and armies. Business games, first developed by the firm Booz Allen Hamilton in the 1950s, are popular with both executives and business students. They provide an opportunity to test business skills and decision-making ability in a competitive environment. The person or team that performs best in the simulated environment is rewarded by knowing that his or her company has been most successful in earning the largest profit, grabbing a high market share, or perhaps increasing the firm’s trading value on the stock exchange.

During each period of competition, be it a week, month, or quarter, teams respond to market conditions by coding their latest management decisions with respect to inventory, production, financing, investment, marketing, and research. The competitive business environment is simu- lated by computer, and a new printout summarizing current market conditions is presented to the players. This allows teams to simulate years of operating conditions in a matter of days, weeks, or a semester.

SYSTEMS SIMULATION Systems simulation is similar to business gaming in that it allows users to test various managerial policies and decisions to evaluate their effect on the operating environ- ment. This variation of simulation models the dynamics of large systems. Such systems include corporate operations,4 the national economy, a hospital, or a city government system.

In a corporate operating system, sales, production levels, marketing policies, investments, union contracts, utility rates, financing, and other factors are all related in a series of mathemati- cal equations that are examined by simulation. In a simulation of an urban government, systems

3Theoretically, random numbers are used only in Monte Carlo simulation. However, in some complex gaming or sys- tems simulation problems in which all relationships cannot be defined exactly, it may be necessary to use the probabil- ity concepts of the Monte Carlo method. 4This is sometimes referred to as industrial dynamics, a term coined by Jay Forrester. Forrester’s goal was to find a way “to show how policies, decisions, structure, and delays are interrelated to influence growth and stability” in industrial systems. See J. W. Forrester, Industrial Dynamics (Cambridge, MA: MIT Press, 1961).

M13_REND3161_13_AIE_C13.indd 484 28/10/16 11:23 AM

13.6 oTHER SiMUlATion iSSUES  485

simulation can be employed to evaluate the impact of tax increases, capital expenditures for roads and buildings, housing availability, new garbage routes, immigration and out-migration, locations of new schools or senior citizen centers, birth and death rates, and many more vital issues. Simulations of economic systems, often called econometric models, are used by govern- ment agencies, bankers, and large organizations to predict inflation rates, domestic and foreign money supplies, and unemployment levels. Inputs and outputs of a typical economic system simulation are illustrated in Figure 13.5.

The value of systems simulation lies in its allowance of what-if questions to test the effects of various policies. A corporate planning group, for example, can change the value of any input, such as an advertising budget, and examine the impact on sales, market share, or short-term costs. Simulation can also be used to evaluate different research and development projects or to determine long-range planning horizons.

Verification and Validation In the development of a simulation model, it is important that the model be checked to see that it is working properly and providing a good representation of the real-world situation. The verifi- cation process involves determining that the computer model is internally consistent and follow- ing the logic of the conceptual model.

Validation is the process of comparing a model to the real system that it represents to make sure that it is accurate. The assumptions of the model should be checked to see that the appropri- ate probability distribution is being used. An analysis of the inputs and outputs should be made to see that the results are reasonable. If we know what the actual outputs are for a specific set of inputs, we could use those inputs in the computer model to see that the outputs of the simulation are consistent with the real-world system.

It has been said that verification answers the question “Did we build the model right?” On the other hand, validation answers the question “Did we build the right model?” Only after we are convinced that the model is good should we feel comfortable in using the results.

Role of Computers in Simulation We recognize that computers are critical in simulating complex tasks. They can generate random numbers, simulate thousands of time periods in a matter of seconds or minutes, and provide management with reports that make decision making easier. As a matter of fact, a computer approach is almost a necessity for us to draw valid conclusions from a simulation. Because we require a very large number of simulations, it would be a real burden to rely on pencil and paper alone.

While general-purpose programming languages can be used for simulation, some special simulation software tools have been developed that make the simulation process much easier. Among the numerous tools available are Arena, ProModel, SIMUL8, ExtendSim, and Proof 5.5 In addition to these stand-alone tools, there are several Excel add-ins, such as @Risk, Crystal Ball, RiskSim, and XLSim, which can make simulating with Excel very easy.

Econometric models are huge simulations involving thousands of regression equations tied together by economic factors. They use what-if questions to test out various policies.

Verification relates to building the model right. Validation relates to building the right model.

FIGURE 13.5 inputs and outputs of a Typical Economic System Simulation

Income Tax Levels Corporate Tax Rates

Interest Rates Government Spending

Foreign Trade Policy

Inputs Model Outputs

Gross National Product Inflation Rates Unemployment Rates Monetary Supplies Population Growth Rates

Econometric Model (in Series of

Mathematical Equations)

5For a list of simulation software products, see James J. Swain. “Discrete Event Simulation Software Tools: A better reality,” OR/MS Today 40, 5 (October 2013): 48–59.

M13_REND3161_13_AIE_C13.indd 485 28/10/16 11:23 AM

486  CHAPTER 13 • SiMUlATion ModEling

Simulating a Tiger

What does it take to beat Tiger Woods, Jordan Speith, Rory McIlroy, or Jason Day on the golf course? Quantitative analysts studied that very question using a simulation model with Tiger Woods as the baseline.

The simulation model was quite extensive. It was essentially a simulation-based estimate of relative tournament difficulty. It included variables such as individual player skill, strength of the field (how good are the players at any particular tournament), and depth of the field (how many players are at any particular tournament), along with random variation in individual scoring.

The model noted that when Tiger Woods wins, he wins by an average of 2.84 strokes per tournament.

This difference suggested that Tiger Woods wasn’t just lucky and was, in fact, significantly better than everyone else in the field. Indeed, from the moment he became a professional golfer in 1996, he won 71 of the ensuing 239 PGA TOUR events that he entered. That’s a staggering 29.7% winning percentage!

Source: Based on R. A. Connolly and R. J. Rendleman, Jr., “What It Takes to Win on the PGA TOUR (If Your Name Is ‘Tiger’ or If It Isn’t),” Interfaces 42, 6 (November–December 2012): 554–576, © Trevor S. Hale.

IN ACTION

Summary

The purpose of this chapter is to discuss the concept and ap- proach of simulation as a problem-solving tool. Simulation involves building a mathematical model that attempts to de- scribe a real-world situation. The model’s goal is to incorpo- rate important variables and their interrelationships in such a way that we can study the impact of managerial changes on the total system. The approach has many advantages over other quantitative analysis techniques and is especially useful when a problem is too complex or difficult to solve by other means.

The Monte Carlo method of simulation is developed through the use of probability distributions and random num- bers. Random number intervals are established to represent

possible outcomes for each probabilistic variable in the model. Random numbers are then either selected from a random num- ber table or generated by computer to simulate variable out- comes. The simulation procedure is conducted for many time periods to evaluate the long-term impact of each policy value being studied. Monte Carlo simulation by hand is illustrated on problems of inventory control, queuing, and machine maintenance.

Operational gaming and systems simulation, two other categories of simulation, are also presented in this chapter. The chapter concludes with a discussion of the important role of the computer in the simulation process.

Glossary

Flow Diagram, or Flowchart A graphical means of present- ing the logic of a simulation model. It is a tool that helps in writing a simulation computer program.

Monte Carlo Simulation A simulation that experiments with probabilistic elements of a system by generating ran- dom numbers to create values for those elements.

Operational Gaming The use of simulation in competitive situations such as military games and business or manage- ment games.

Random Number A number whose digits are selected com- pletely at random.

Random Number Interval A range of random numbers as- signed to represent a possible simulation outcome.

Simulation A quantitative analysis technique that involves building a mathematical model that represents a real-world situation. The model is then experimented with to estimate the effects of various actions and decisions.

Simulation Software Tools Programming languages es- pecially designed to be efficient in handling simulation problems.

Systems Simulation Simulation that models the dynamics of large organizational or governmental systems.

Validation The process of comparing a model to the real system that it represents to make sure that it is accurate.

Verification The process of determining that the computer model is internally consistent and follows the logic of the conceptual model.

M13_REND3161_13_AIE_C13.indd 486 28/10/16 11:23 AM

Solved Problems

Solved Problem 13-1 Higgins Plumbing and Heating maintains a stock of 30-gallon hot water heaters that it sells to home- owners and installs for them. Owner Jerry Higgins likes the idea of having a large supply on hand to meet customer demand, but he also recognizes that it is expensive to do so. He examines hot water heater sales over the past 50 weeks and notes the following:

HOT WATER HEATER SALES PER WEEK

NUMBER OF WEEKS THIS NUMBER WAS SOLD

4 6

5 5

6 9

7 12

8 8

9 7

10 3

Total 50

a. If Higgins maintains a constant supply of 8 hot water heaters in any given week, how many times will he be out of stock during a 20-week simulation? We use random numbers from the seventh column of Table 13.4, beginning with the random number 10.

b. What is the average number of sales per week (including stockouts) over the 20-week period? c. Using an analytic nonsimulation technique, what is the expected number of sales per week? How

does this compare with the answer in part b?

Solution The variable of interest is the number of sales per week.

HEATER SALES PROBABILITY RANDOM NUMBER

INTERVALS

4 0.12 01 to 12

5 0.10 13 to 22

6 0.18 23 to 40

7 0.24 41 to 64

8 0.16 65 to 80

9 0.14 81 to 94

10 0.06 95 to 00

1.00

WEEK RANDOM NUMBER

SIMULATED SALES WEEK

RANDOM NUMBER

SIMULATED SALES

1 10 4 11 08 4

2 24 6 12 48 7

3 03 4 13 66 8

4 32 6 14 97 10

5 23 6 15 03 4

6 59 7 16 96 10

7 95 10 17 46 7

8 34 6 18 74 8

9 34 6 19 77 8

10 51 7 20 44 7

a.

SolvEd PRoBlEMS  487

M13_REND3161_13_AIE_C13.indd 487 28/10/16 11:23 AM

With a supply of 8 heaters, Higgins will be out of stock three times during the 20-week period (in weeks 7, 14, and 16).

b. Average sales by simulation = Total sales

20 weeks =

135

20 = 6.75 per week

c. Using expected value,

E1sales2 = 0.1214 heaters2 + 0.10152 + 0.18162 + 0.24172 + 0.16182 + 0.14192 + 0.061102 = 6.88 heaters

With a longer simulation, these two approaches will lead to even closer values.

Solved Problem 13-2 The manager of a bank in Greensboro, North Carolina, is attempting to determine how many tellers are needed at the drive-in window during peak times. As a general policy, the manager wishes to offer service such that average customer waiting time does not exceed 2 minutes. Given the existing service level, as shown in the following data, does the drive-in window meet this criterion?

DATA FOR SERVICE TIME

SERVICE TIME (MINUTES)

PROBABILITY (FREQUENCY)

CUMULATIVE PROBABILITY

RANDOM NUMBER INTERVAL

0 0.00 0.00 (impossible)

1.0 0.25 0.25 01 to 25

2.0 0.20 0.45 26 to 45

3.0 0.40 0.85 46 to 85

4.0 0.15 1.00 86 to 00

DATA FOR CUSTOMER ARRIVALS

TIME BETWEEN SUCCESSIVE

CUSTOMER ARRIVALS PROBABILITY (FREQUENCY)

CUMULATIVE PROBABILITY

RANDOM NUMBER

INTERVAL

0 0.10 0.10 01 to 10

1.0 0.35 0.45 11 to 45

2.0 0.25 0.70 46 to 70

3.0 0.15 0.85 71 to 85

4.0 0.10 0.95 86 to 95

5.0 0.05 1.00 96 to 00

Solution Average waiting time is a variable of concern.

488  CHAPTER 13 • SiMUlATion ModEling

M13_REND3161_13_AIE_C13.indd 488 28/10/16 11:23 AM

SElF-TEST  489

(1) CUSTOMER

NUMBER

(2) RANDOM NUMBER

(3) INTERVAL

TO ARRIVAL

(4) TIME OF ARRIVAL

(5) RANDOM NUMBER

(6) SERVICE

TIME

(7) START

SERVICE

(8) END

SERVICE

(9) WAIT TIME

(10) IDLE TIME

1 50 2 9:02 52 3 9:02 9:05 0 2

2 28 1 9:03 37 2 9:05 9:07 2 0

3 68 2 9:05 82 3 9:07 9:10 2 0

4 36 1 9:06 69 3 9:10 9:13 4 0

5 90 4 9:10 98 4 9:13 9:17 3 0

6 62 2 9:12 96 4 9:17 9:21 5 0

7 27 1 9:13 33 2 9:21 9:23 8 0

8 50 2 9:15 50 3 9:23 9:26 8 0

9 18 1 9:16 88 4 9:26 9:30 10 0

10 36 1 9:17 90 4 9:30 9:34 13 0

11 61 2 9:19 50 3 9:34 9:37 15 0

12 21 1 9:20 27 2 9:37 9:39 17 0

13 46 2 9:22 45 2 9:39 9:41 17 0

14 01 0 9:22 81 3 9:41 9:44 19 0

15 14 1 9:23 66 3 9:44 9:47 21 0

Read the data as in the following example for the first row:

Column 1: Number of customer.

Column 2: From third column of random number Table 13.4.

Column 3: Time interval corresponding to random number (random number of 50 implies a 2-minute interval).

Column 4: Starting at 9 a.m. the first arrival is at 9:02.

Column 5: From the first column of random number Table 13.4.

Column 6: Teller time corresponding to random number 52 is 3 minutes.

Column 7: Teller is available and can start at 9:02.

Column 8: Teller completes work at 9:05 19:02 + 0:032. Column 9: Wait time for customer is 0 as the teller was available.

Column 10: Idle time for the teller was 2 minutes (9:00 to 9:02).

The drive-in window clearly does not meet the manager’s criteria for an average wait time of 2 minutes. As a matter of fact, we can observe an increasing queue buildup after only a few customer simulations. This observation can be confirmed by expected value calculations on both arrival and service rates.

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Simulation is a technique usually reserved for studying only the simplest and most straightforward of problems. a. True b. False

2. A simulation model is designed to arrive at a single specific numerical answer to a given problem. a. True b. False

3. Simulation typically requires a familiarity with statistics to evaluate the results. a. True b. False

4. The verification process involves making sure that a. the model adequately represents the real-world

system. b. the model is internally consistent and logical. c. the correct random numbers are used. d. enough trial runs are simulated.

5. The validation process involves making sure that a. the model adequately represents the real-world

system. b. the model is internally consistent and logical. c. the correct random numbers are used. d. enough trial runs are simulated.

M13_REND3161_13_AIE_C13.indd 489 28/10/16 11:23 AM

490  CHAPTER 13 • SiMUlATion ModEling

6. Which of the following is an advantage of simulation? a. It allows time compression. b. It is always relatively simple and inexpensive. c. The results are usually transferable to other problems. d. It will always find the optimal solution to a problem.

7. Which of the following is a disadvantage of simulation? a. It is inexpensive even for the most complex problem. b. It always generates the optimal solution to a problem. c. The results are usually transferable to other problems. d. Managers must generate all of the conditions and con-

straints for solutions that they wish to examine. 8. A meteorologist was simulating the number of days

that rain would occur in a month. The random number interval from 01 to 30 was used to indicate that rain occurred on a particular day, and the interval 31–00 indicated that rain did not occur. What is the probability that rain did occur? a. 0.30 b. 0.31 c. 1.00 d. 0.70

9. Simulation is best thought of as a technique to a. give concrete numerical answers. b. increase understanding of a problem. c. provide rapid solutions to relatively simple problems. d. provide optimal solutions to complex problems.

10. When simulating the Monte Carlo experiment, the average simulated demand over the long run should approximate the a. real demand. b. expected demand. c. sample demand. d. daily demand.

11. The idea behind simulation is a. to imitate a real-world situation. b. to study the properties and operating characteristics of

a real-world situation.

c. to draw conclusions and make action decisions based on simulation results.

d. all of the above. 12. Using simulation for a queuing problem would be

appropriate if a. the arrival rate follows a Poisson distribution. b. the service rate is constant. c. the FIFO queue discipline is assumed. d. there is a 10% chance an arrival would leave before

receiving service. 13. A probability distribution has been developed, and

the probability of 2 arrivals in the next hour is 0.20. A random number interval is to be assigned to this. Which of the following would not be an appropriate interval? a. 01–20 b. 21–40 c. 00–20 d. 00–19 e. All of the above would be appropriate.

14. In a Monte Carlo simulation, a variable that we might want to simulate is a. lead time for inventory orders to arrive. b. time between machine breakdowns. c. time between arrivals at a service facility. d. number of employees absent from work each day. e. all of the above.

15. Use the following random numbers to simulate yes and no answers to 10 questions by starting in the first row and letting a. the double-digit numbers 00–49 represent yes and

50–99 represent no. b. the double-digit even numbers represent yes and the

odd numbers represent no. Random numbers: 52 06 50 88 53 30 10 47 99 37 66 91 35 32 00 84 57 00

Discussion Questions and Problems

Discussion Questions 13-1 What are the advantages and limitations of simula-

tion models? 13-2 Why might a manager be forced to use simulation

instead of an analytical model in dealing with a problem of

(a) inventory ordering policy? (b) ships docking in a port to unload? (c) bank teller service windows? (d) the U.S. economy? 13-3 What types of management problems can be solved

more easily by quantitative analysis techniques other than simulation?

13-4 What are the major steps in the simulation process? 13-5 What is Monte Carlo simulation? What principles

underlie its use, and what steps are followed in applying it?

13-6 List three ways in which random numbers may be generated for use in a simulation.

13-7 Discuss the concepts of verification and validation in simulation.

13-8 Give two examples of random variables that would be continuous and give two examples of random variables that would be discrete.

13-9 In the simulation of an order policy for drills at Simkin’s Hardware, would the results (Table 13.8) change significantly if a longer period were simu- lated? Why is the 10-day simulation valid or invalid?

13-10 Why is a computer necessary in conducting a real- world simulation?

13-11 What is operational gaming? What is systems simu- lation? Give examples of how each may be applied.

13-12 Do you think the application of simulation will increase strongly in the next 10 years? Why or why not?

M13_REND3161_13_AIE_C13.indd 490 28/10/16 11:23 AM

 491 diSCUSSion QUESTionS And PRoBlEMS  491

13-13 List five of the simulation software tools that are available today.

Problems The problems that follow involve simulations that are to be done by hand. You are aware that to obtain accurate and mean- ingful results, long periods must be simulated. This is usually handled by computer. If you are able to program some of the problems using a spreadsheet or QM for Windows, we suggest that you try to do so. If not, the hand simulations will still help you in understanding the simulation process. 13-14 Clark Property Management is responsible for the

maintenance, rental, and day-to-day operation of a large apartment complex on the east side of New Orleans. George Clark is especially concerned about the cost projections for replacing air conditioner compres- sors. He would like to simulate the number of com- pressor failures each year over the next 20 years. Using data from a similar apartment building he manages in a New Orleans suburb, Clark establishes the following table of relative frequency of failures during a year:

NUMBER OF A.C. COMPRESSOR FAILURES

PROBABILITY (RELATIVE FREQUENCY)

0 0.06

1 0.13

2 0.25

3 0.28

4 0.20

5 0.07

6 0.01

He decides to simulate the 20-year period by select- ing two-digit random numbers from the third column of Table 13.4, starting with the random number 50.

Conduct the simulation for Clark. Is it common to have three or more consecutive years of operation with two or fewer compressor failures per year?

13-15 The number of cars arriving per hour at Lundberg’s Car Wash during the past 200 hours of operation is observed to be the following:

NUMBER OF CARS ARRIVING FREQUENCY

3 or fewer 0

4 20

5 30

6 50

7 60

8 40

9 or more 0

Total 200

(a) Set up a probability and cumulative probability distribution for the variable of car arrivals.

(b) Establish random number intervals for the variable.

(c) Simulate 15 hours of car arrivals and compute the average number of arrivals per hour. Select the random numbers needed from the first col- umn of Table 13.4, beginning with the digits 52.

13-16 Compute the expected number of cars arriving in Prob- lem 13.15 using the expected value formula. Compare this with the results obtained in the simulation.

13-17 Refer to the data in Solved Problem 13.1, which deals with Higgins Plumbing and Heating. Higgins has now collected 100 weeks of data and finds the following distribution for sales:

HOT WATER HEATER SALES

PER WEEK

NUMBER OF WEEKS THIS

NUMBER WAS SOLD

3 2

4 9

5 10

6 15

7 25

8 12

9 12

10 10

11 5

(a) Resimulate the number of stockouts incurred over a 20-week period (assuming Higgins main- tains a constant supply of 8 heaters).

(b) Conduct this 20-week simulation two more times and compare your answers with those in part (a). Did they change significantly? Why or why not?

(c) What is the new expected number of sales per week?

13-18 An increase in the size of the barge-unloading crew at the Port of New Orleans (see Section 13.4) has resulted in a new probability distribution for daily unloading rates. In particular, Table 13.10 may be revised as shown here:

DAILY UNLOADING RATE PROBABILITY

1 0.03

2 0.12

3 0.40

4 0.28

5 0.12

6 0.05

Note: means the problem may be solved with QM for Windows; means

the problem may be solved with Excel; and means the problem may be solved with QM for Windows and/or Excel.

M13_REND3161_13_AIE_C13.indd 491 28/10/16 11:23 AM

492  CHAPTER 13 • SiMUlATion ModEling

(a) Resimulate 15 days of barge unloadings and compute the average number of barges delayed, average number of nightly arrivals, and aver- age number of barges unloaded each day. Draw random numbers from the leftmost value of the bottom row of Table 13.4 to generate daily arriv- als and from the second-from-the-bottom row to generate daily unloading rates.

(b) How do these simulated results compare with those in the chapter?

13-19 Every home football game for the past 8 years at Eastern State University has been sold out. The rev- enues from ticket sales are significant, but the sale of food, beverages, and souvenirs has contributed greatly to the overall profitability of the football program. One particular souvenir is the football pro- gram for each game. The number of programs sold at each game is described by the following probabil- ity distribution:

NUMBER (IN 100s) OF PROGRAMS SOLD PROBABILITY

23 0.15

24 0.22

25 0.24

26 0.21

27 0.18

Historically, Eastern has never sold fewer than 2,300 programs or more than 2,700 programs at one game. Each program costs $0.80 to produce and sells for $2.00. Any programs that are not sold are donated to a recycling center and do not produce any revenue.

(a) Simulate the sales of programs at 10 football games. Use the last column in the random num- ber table (Table 13.4) and begin at the top of the column.

(b) If the university decided to print 2,500 programs for each game, what would the average profits be for the 10 games simulated in part (a)?

(c) If the university decided to print 2,600 programs for each game, what would the average profits be for the 10 games simulated in part (a)?

13-20 Refer to Problem 13.19. Suppose the sale of football programs described by the probability distribution in that problem applies only to days when the weather is good. When poor weather occurs on the day of a football game, the crowd that attends the game is only half of capacity. When this occurs, the sales of programs decreases, and the total sales are given in the following table:

NUMBER (IN 100s) OF PROGRAMS SOLD PROBABILITY

12 0.25

13 0.24

14 0.19

15 0.17

16 0.15

Programs must be printed 2 days prior to game day. The university is trying to establish a policy for de- termining the number of programs to print based on the weather forecast.

(a) If the forecast is for a 20% chance of bad weather, simulate the weather for 10 games with this forecast. Use column 4 of Table 13.4.

(b) Simulate the demand for programs at 10 games in which the weather is bad. Use column 5 of the random number table (Table 13.4) and begin with the first number in the column.

(c) Beginning with a 20% chance of bad weather and an 80% chance of good weather, develop a flowchart that would be used to prepare a simu- lation of the demand for football programs for 10 games.

(d) Suppose there is a 20% chance of bad weather and the university has decided to print 2,500 pro- grams. Simulate the total profits that would be achieved for 10 football games.

13-21 Dumoor Appliance Center sells and services several brands of major appliances. Past sales for a particu- lar model of refrigerator have resulted in the follow- ing probability distribution for demand:

DEMAND PER WEEK 0 1 2 3 4

Probability 0.20 0.40 0.20 0.15 0.05

The lead time, in weeks, is described by the follow- ing distribution:

LEAD TIME (WEEKS) 1 2 3

Probability 0.15 0.35 0.50

Based on cost considerations as well as storage space, the company has decided to order 10 of these each time an order is placed. The holding cost is $1 per week for each unit that is left in inventory at the end of the week. The stockout cost has been set at $40 per stockout. The company has decided to place an order whenever there are only 2 refrigerators left at the end of the week. Simulate 10 weeks of operation for Dumoor Appliance, assuming there are

M13_REND3161_13_AIE_C13.indd 492 28/10/16 11:23 AM

 493 diSCUSSion QUESTionS And PRoBlEMS  493

currently 5 units in inventory. Determine what the weekly stockout cost and weekly holding cost would be for the problem.

13-22 Repeat the simulation in Problem 13.21, assuming that the reorder point is 4 units rather than 2. Com- pare the costs for these two situations.

13-23 Simkin’s Hardware Store simulated an inventory or- dering policy for Ace electric drills that involved an order quantity of 10 drills with a reorder point of 5. The first attempt to develop a cost-effective ordering strategy is illustrated in Table 13.8. The brief simula- tion resulted in a total daily inventory cost of $4.72. Simkin would now like to compare this strategy with one in which he orders 12 drills, with a reorder point of 6. Conduct a 10-day simulation for him and dis- cuss the cost implications.

13-24 Draw a flow diagram to represent the logic and steps of simulating barge arrivals and unloadings at the Port of New Orleans (see Section 13.4). For a re- fresher in flowcharts, see Figure 13.3.

13-25 Stephanie Robbins is the Three Hills Power Com- pany management analyst assigned to simulate maintenance costs. In Section 13.5, we describe the simulation of 15 generator breakdowns and the re- pair times required when one repairperson is on duty per shift. The total simulated maintenance cost of the current system is $4,320.

Robbins would now like to examine the relative cost-effectiveness of adding one more worker per shift. Each new repairperson would be paid $30 per hour, the same rate as the first is paid. The cost per breakdown hour is still $75. Robbins makes one vital assumption as she begins—that repair times with two workers will be exactly one- half the times required with only one repairperson on duty per shift. Table 13.13 can then be restated as follows:

REPAIR TIME REQUIRED (HOURS) PROBABILITY

0.5 0.28

1 0.52

1.5 0.20

1.00

(a) Simulate this proposed maintenance system change over a 15-generator breakdown period. Select the random numbers needed for time be- tween breakdowns from the second-from-the- bottom row of Table 13.4 (beginning with the number 69). Select random numbers for gener- ator repair times from the last row of the table (beginning with 37).

(b) Should Three Hills add a second repairperson each shift?

13-26 The Brennan Aircraft Division of TLN Enterprises operates a large number of computerized plotting machines. For the most part, the plotting devices are used to create line drawings of complex wing airfoils and fuselage part dimensions. The engineers operating the automated plotters are called loft lines engineers.

The computerized plotters consist of a minicom- puter system connected to a 4- by 5-foot flat table with a series of ink pens suspended above it. When a sheet of clear plastic or paper is properly placed on the table, the computer directs a series of horizontal and vertical pen movements until the desired figure is drawn.

The plotting machines are highly reliable, with the exception of the four sophisticated ink pens that are built in. The pens constantly clog and jam in a raised or lowered position. When this occurs, the plotter is unusable.

Currently, Brennan Aircraft replaces each pen as it fails. The service manager has, however, proposed re- placing all four pens every time one fails. This should cut down the frequency of plotter failures. At present, it takes one hour to replace one pen. All four pens could be replaced in two hours. The total cost of a plotter be- ing unusable is $50 per hour. Each pen costs $8.

If only one pen is replaced each time a clog or jam occurs, the following breakdown data are thought to be valid:

HOURS BETWEEN PLOTTER FAILURES IF ONE PEN IS REPLACED

DURING A REPAIR PROBABILITY

10 0.05

20 0.15

30 0.15

40 0.20

50 0.20

60 0.15

70 0.10

Based on the service manager’s estimates, if all four pens are replaced each time one pen fails, the prob- ability distribution between failures is as follows:

HOURS BETWEEN PLOTTER FAILURES IF ALL FOUR PENS ARE REPLACED

DURING A REPAIR PROBABILITY

100 0.15

110 0.25

120 0.35

130 0.20

140 0.05

M13_REND3161_13_AIE_C13.indd 493 28/10/16 11:23 AM

494  CHAPTER 13 • SiMUlATion ModEling

(a) Simulate Brennan Aircraft’s problem and deter- mine the best policy. Should the firm replace one pen or all four pens on a plotter each time a fail- ure occurs?

(b) Develop a second approach to solving this prob- lem, this time without simulation. Compare the results. How does it affect Brennan’s policy de- cision using simulation?

13-27 Dr. Mark Greenberg practices dentistry in Topeka, Kansas. Greenberg tries hard to schedule appoint- ments so that patients do not have to wait beyond their appointment time. His October 20 schedule is shown in the following table.

SCHEDULED APPOINTMENT AND TIME

EXPECTED TIME NEEDED

Adams 9:30 a.m. 15

Brown 9:45 a.m. 20

Crawford 10:15 a.m. 15

Dannon 10:30 a.m. 10

Erving 10:45 a.m. 30

Fink 11:15 a.m. 15

Graham 11:30 a.m. 20

Hinkel 11:45 a.m. 15

Unfortunately, not every patient arrives exactly on schedule, and expected times to examine patients are just that—expected. Some examinations take longer than expected, and some take less time.

Greenberg’s experience dictates the following:

(a) 20% of the patients will be 20 minutes early. (b) 10% of the patients will be 10 minutes early. (c) 40% of the patients will be on time. (d) 25% of the patients will be 10 minutes late. (e) 5% of the patients will be 20 minutes late.

He further estimates that

(a) 15% of the time he will finish in 20% less time than expected.

(b) 50% of the time he will finish in the expected time.

(c) 25% of the time he will finish in 20% more time than expected.

(d) 10% of the time he will finish in 40% more time than expected.

Dr. Greenberg has to leave at 12:15 p.m. on October 20 to catch a flight to a dental convention in New York. Assuming that he is ready to start his work- day at 9:30 a.m. and that patients are treated in order of their scheduled exam (even if one late patient ar- rives after an early one), will he be able to make the flight? Comment on this simulation.

13-28 The Pelnor Corporation is the nation’s largest manu- facturer of industrial-size washing machines. A main ingredient in the production process is 8- by 10-foot sheets of stainless steel. The steel is used for both interior washer drums and outer casings.

Steel is purchased weekly on a contractual ba- sis from the Smith-Layton Foundry, which, because of limited availability and lot sizing, can ship either 8,000 or 11,000 square feet of stainless steel each week. When Pelnor’s weekly order is placed, there is a 45% chance that 8,000 square feet will arrive and a 55% chance of receiving the larger size order.

Pelnor uses the stainless steel on a stochastic (nonconstant) basis. The probabilities of demand each week follow:

STEEL NEEDED PER WEEK (SQ FT) PROBABILITY

6,000 0.05

7,000 0.15

8,000 0.20

9,000 0.30

10,000 0.20

11,000 0.10

Pelnor has a capacity to store no more than 25,000 square feet of steel at any time. Because of the con- tract, orders must be placed each week regardless of the on-hand supply.

(a) Simulate stainless steel order arrivals and use for 20 weeks. (Begin the first week with a starting inventory of 0 stainless steel.) If an end-of-week inventory is ever negative, assume that back orders are permitted and fill the demand from the next arriving order.

(b) Should Pelnor add more storage area? If so, how much? If not, comment on the system.

13-29 Coleman Tucker, a neurology intern at Morgantown University (MU), has been having problems balanc- ing his checkbook. His monthly income is derived from a graduate research assistantship; however, he also makes extra money in most months by tutoring undergraduates in their introductory neurobiology course. His chances of various income levels are shown here (assume that this income is received at the beginning of each month):

MONTHLY INCOME PROBABILITY

$ 850 0.35

$ 900 0.25

$ 950 0.25

$1,000 0.15

M13_REND3161_13_AIE_C13.indd 494 28/10/16 11:23 AM

 495 diSCUSSion QUESTionS And PRoBlEMS  495

Tucker has expenditures that vary from month to month, and he estimates that they will follow this distribution:

MONTHLY EXPENSES PROBABILITY

$ 800 0.05

$ 900 0.20

$1,000 0.40

$1,100 0.35

Tucker begins his final year at MU with $1,500 in his checking account. Simulate the cash flow for 12 months and replicate your model N times to identify Tucker’s (a) ending balance at the end of the year and (b) probability that he will have a negative bal- ance in any month.

13-30 Brenda’s Bicycle and Surfboard Rentals leases quad-bikes each day from a supplier and rents them to customers who use them along Seawall Boule- vard in Galveston, Texas. Each day, Brenda leases 30 quad-bikes from her supplier at a cost of $4 per quad-bike. She then rents them to her customers for $15 per day. Rental demand follows the normal dis- tribution, with a mean of 30 quad-bikes and a stan- dard deviation of 6 quad-bikes. (In your model use integers for all demands.)

(a) Simulate this leasing policy for a month (30 days) of operation to calculate the total monthly profit. Replicate this calculation N times. What is the average monthly profit?

(b) Brenda would like to evaluate the average monthly profit if she leases 25, 30, 35, and 40 quad-bikes. What is your recommendation? Why?

13-31 Milwaukee’s General Hospital has an emergency room that is divided into six departments: (1) the ini- tial exam station, to treat minor problems or make diagnoses; (2) an x-ray department; (3) an operat- ing room; (4) a cast-fitting room; (5) an observation room for recovery and general observation before final diagnoses or release; and (6) an out-processing department where clerks check patients out and ar- range for payment or insurance forms.

The probabilities that a patient will go from one department to another are presented in the accompa- nying table.

(a) Simulate the trail followed by 10 emergency room patients. Proceed one patient at a time from each one’s entry at the initial exam station until he or she leaves through out-processing. You should be aware that a patient can enter the same department more than once.

(b) Using your simulation data, what are the chances that a patient enters the x-ray department twice?

Table for Problem 13.31 FROM TO PROBABILITY Initial exam at emergency room entrance X-ray department 0.45

Operating room 0.15

Observation room 0.10

Out-processing clerk 0.30

X-ray department Operating room 0.10

Cast-fitting room 0.25

Observation room 0.35

Out-processing clerk 0.30

Operating room Cast-fitting room 0.25

Observation room 0.70

Out-processing clerk 0.05

Cast-fitting room Observation room 0.55

X-ray department 0.05

Out-processing clerk 0.40

Observation room Operating room 0.15

X-ray department 0.15

Out-processing clerk 0.70

M13_REND3161_13_AIE_C13.indd 495 28/10/16 11:23 AM

496  CHAPTER 13 • SiMUlATion ModEling

13-32 Management of the First Syracuse Bank is con- cerned about a loss of customers at its main office downtown. One solution that has been proposed is to add one or more drive-through teller stations to make it easier for customers in cars to obtain quick service without parking. Chris Carlson, the bank president, thinks the bank should risk only the cost of installing one drive-through. He is informed by his staff that the cost (amortized over a 20-year pe- riod) of building a drive-through is $12,000 per year. It also costs $16,000 per year in wages and benefits to staff each new teller window.

The director of management analysis, Beth Shader, believes that the following two factors en- courage the immediate construction of two drive- through stations, however. According to a recent article in Banking Research magazine, customers who wait in long lines for drive-through teller ser- vice will cost banks an average of $1 per minute in loss of goodwill. Also, adding a second drive- through will cost an additional $16,000 in staffing, but amortized construction costs can be cut to a to- tal of $20,000 per year if two drive-throughs are in- stalled together instead of one at a time. To complete her analysis, Shader collected one month’s arrival and service rates at a competing downtown bank’s drive-through stations. These data are shown as ob- servation analyses 1 and 2 in the following tables.

(a) Simulate a 1-hour time period, from 1 p.m. to 2 p.m., for a single-teller drive-through.

(b) Simulate a 1-hour time period, from 1 p.m. to 2 p.m., for a single line of people waiting for the next available teller in a two-teller system.

(c) Conduct a cost analysis of the two options. As- sume that the bank is open 7 hours per day and 200 days per year.

OBSERVATION ANALYSIS 1: INTERARRIVAL TIMES FOR 1,000 OBSERVATIONS

TIME BETWEEN ARRIVALS (MINUTES)

NUMBER OF OCCURRENCES

1 200

2 250

3 300

4 150

5 100

OBSERVATION ANALYSIS 2: CUSTOMER SERVICE TIME FOR 1,000 CUSTOMERS

SERVICE TIME (MINUTES)

NUMBER OF OCCURRENCES

1 100

2 150

3 350

4 150

5 150

6 100

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems 13-33 to 13-39.

Internet Homework Problems

Alabama Airlines opened its doors in June 1995 as a commuter service with its headquarters and only hub located in Birming- ham. A product of airline deregulation, Alabama Air joined the growing number of successful short-haul, point-to-point airlines, including Lone Star, Comair, Atlantic Southeast, Skywest, and Business Express.

Alabama Air was started and managed by two former pilots, David Douglas (who had been with the defunct Eastern Airlines) and Savas Ozatalay (formerly with Pan Am). It acquired a fleet of 12 used prop-jet planes and the airport gates vacated by the 1994 downsizing of Delta Air Lines.

With business growing quickly, Douglas turned his atten- tion to Alabama Air’s toll-free reservations system. Between midnight and 6:00 a.m., only one telephone reservations agent had been on duty. The time between incoming calls during this period is distributed as shown in Table 13.15. Douglas carefully observed and timed the agent and estimated that the time taken to process passenger inquiries is distributed as shown in Table 13.16.

All customers calling Alabama Air go on hold and are served in the order of the calls unless the reservations agent is available for immediate service. Douglas is deciding whether a

Case Study

Alabama Airlines

M13_REND3161_13_AIE_C13.indd 496 28/10/16 11:23 AM

 497 CASE STUdy  497

Statewide Development Corporation has built a very large apartment complex in Gainesville, Florida. As part of the stu- dent-oriented marketing strategy that has been developed, it is stated that if any problems with plumbing or air conditioning are experienced, a maintenance person will begin working on the problem within 1 hour. If a tenant must wait more than 1 hour for the repairperson to arrive, a $10 deduction from the monthly rent will be made for each additional hour of time waiting. An answering machine will take the calls and record the time of the call if the maintenance person is busy. Past experience at other complexes has shown that during the week when most occupants are at school, there is little difficulty in meeting the 1-hour guarantee. However, it is observed that weekends have been particularly troublesome during the sum- mer months.

A study of the number of calls to the office on weekends concerning air conditioning and plumbing problems has re- sulted in the following distribution:

TIME BETWEEN CALLS (MINUTES) PROBABILITY

30 0.15

60 0.30

90 0.30

120 0.25

The time required to complete a service call varies according to the difficulty of the problem. Parts needed for most repairs are kept in a storage room at the complex. However, for certain types of unusual problems, a trip to a local supply house is nec- essary. If a part is available on site, the maintenance person fin- ishes one job before checking on the next complaint. If the part is not available on site and any other calls have been received, the maintenance person will stop by the other apartment(s) before going to the supply house. It takes approximately 1 hour

Case Study

Statewide Development Corporation

second agent should be on duty to cope with customer demand. To maintain customer satisfaction, Alabama Air does not want a customer on hold for more than 3 to 4 minutes and also wants to maintain a “high” operator utilization.

Further, the airline is planning a new TV advertising cam- paign. As a result, it expects an increase in toll-free-line phone inquiries. Based on similar campaigns in the past, the incoming call distribution from midnight to 6 a.m. is expected to be as shown in Table 13.17. (The same service time distribution will apply.)

TABLE 13.15 incoming Call distribution

TIME BETWEEN CALLS (MINUTES) PROBABILITY

1 0.11

2 0.21

3 0.22

4 0.20

5 0.16

6 0.10

TABLE 13.16 Service Time distribution

TIME TO PROCESS CUSTOMER INQUIRIES (MINUTES) PROBABILITY

1 0.20

2 0.19

3 0.18

4 0.17

5 0.13

6 0.10

7 0.03

TABLE 13.17 incoming Call distribution

TIME BETWEEN CALLS (MINUTES) PROBABILITY

1 0.22

2 0.25

3 0.19

4 0.15

5 0.12

6 0.07

Discussion Questions 1. What would you advise Alabama Air to do for the current

reservation system based on the original call distribution? Create a simulation model to investigate the scenario. De- scribe the model carefully and justify the duration of the simulation, assumptions, and measures of performance.

2. What are your recommendations regarding operator uti- lization and customer satisfaction if the airline proceeds with the advertising campaign?

Source: Professor Zbigniew H. Przasnyski, Loyola Marymount University, reprinted by permission.

M13_REND3161_13_AIE_C13.indd 497 28/10/16 11:23 AM

498  CHAPTER 13 • SiMUlATion ModEling

to drive to the supply house, pick up a part, and return to the apartment complex. Past records indicate that, on approximately 10% of all calls, a trip must be made to the supply house.

The time required to resolve a problem if the part is avail- able on site varies according to the following:

TIME FOR REPAIR (MINUTES) PROBABILITY

30 0.45

60 0.30

90 0.20

120 0.05

It takes approximately 30 minutes to diagnose difficult prob- lems for which parts are not on site. Once the part has been obtained from the supply house, it takes approximately 1 hour

to install the new part. If any new calls have been recorded while the maintenance person has been away picking up a new part, these new calls will wait until the new part has been installed.

The cost of salary and benefits for a maintenance person is $20 per hour. Management would like to determine whether two maintenance people should be working on weekends in- stead of just one. It can be assumed that each person works at the same rate.

Discussion Questions 1. Use simulation to help you analyze this problem. State

any assumptions that you are making about this situation to help clarify the problem.

2. On a typical weekend day, how many tenants would have to wait more than an hour, and how much money would the company have to credit these tenants?

FB Badpoore Aerospace makes carbon brake discs for large airplanes with a proprietary “cross weave” of the carbon fibers. The brake discs are 4 feet in diameter but weigh significantly less than conventional ceramic brake discs, making them attractive for airplane manufacturers, as well as commercial airliners.

Processing the discs at FB Badpoore requires heat treating the discs in a sequence of 12 electric, high pressure, indus- trial grade furnaces (simply called Furnace A, Furnace B, Furnace C, . . . , Furnace L), each of them fed with a propri- etary mixture of chemicals. All brake discs visit each of the 12 furnaces in the same order, Furnace A through Furnace L. Each of these furnaces follows its own very specific set of simultaneous temperature and pressure profiles. An example of one such profile is depicted in Figure 13.6. All profiles are 12 hours in duration.

All 12 furnaces are top loading. Additionally, each of them is cylindrical in shape, 15 feet in diameter, and about 10 feet in depth. They are arranged in an “egg-carton-like” array (six on one side and six on the other), loaded and unloaded via their top facing round ends by three overhead 10-ton bridge cranes, and located in part of the factory known as the furnace deck.

Each furnace can process seven stacks of 20 discs at a time. This equates to a batch size of 140 discs. Each batch is loaded onto a ceramic furnace shelf that is sturdy, round, and 14 feet in

diameter. The furnace deck is said to be fully loaded when all 12 furnaces are processing discs.

Loading and unloading the discs is a labor-intensive pro- cess requiring high-level coordination of the three overhead bridge cranes. Bridge crane Alpha (BC-A) serves the incom- ing area; furnaces A, B, K, and L; and the outgoing area, where discs are stored when they have finished processing in all 12 furnaces. Bridge crane Beta (BC-B) serves Furnaces C, D, I, and J, while bridge crane Gamma (BC-G) serves Furnaces E, F, G, and H. When discs travel within a service area, they are moved by the crane assigned to that area. When discs have to travel between service areas, they are first deposited in a waiting area before being moved into the next service area. For exam- ple, discs being moved from Furnace D to Furnace E would be unloaded from Furnace D by BC-B, which would deposit them in the waiting area. Then BC-G would pick up the batch and load it into (an already empty) Furnace E.

Due to energy restrictions by the local electric utility company, all furnace processing must be performed at night between 8:00 p.m. and 10:00 a.m. daily. This, in turn, requires all loading and unloading operations to be performed during the day. Indeed, the main shift is from 1:00 p.m. (allowing the discs to cool after processing and before unloading) and 9:00 p.m. (allowing the shift to end by starting up all 12 furnaces after 8:00 p.m.).

Case Study

FB Badpoore Aerospace

M13_REND3161_13_AIE_C13.indd 498 28/10/16 11:23 AM

 499 CASE STUdy  499

Each furnace has a known yield rate with no noticeable variation according to the following:

FURNACE A B C D E F G H I J K L

Yield 0.95 0.975 0.975 0.975 0.975 0.975 0.975 0.995 0.995 0.995 0.995 0.999

FIGURE 13.6 Temperature and Pressure Profile Example

Temperature (C°)

Pressure (kPa)

12 hours

That is to say, 1 in 20 batches fails at Furnace A and must be scrapped, whereas only 1 in 1,000 batches fails at Furnace L. As one might expect, upstream batch failures are very disruptive to the downstream operations. Scrapping batches causes down- stream furnaces to sit idle under the current “zero in queue” work in process (WIP) inventory policy as they wait for good batches to arrive from upstream operations.

Design, build, and perform a 1,000-day simulation model study of the system described above in Excel, incorporating the random number generator function, RAND(). Start your simu- lation with a fully loaded furnace deck.

Discussion Questions 1. Determine and comment on the overall yield (the num-

ber of batches that make it all the way through Furnace L divided by the number that started at Furnace A) of disc brakes at FB Badpoore.

2. Determine the utilization of Furnace L. 3. Suggest improvements to the system.

See our Internet home page, at www.pearsonhighered.com/render, for these additional case studies: (1) Abjar Transport Company: This case involves a trucking company in Saudi Arabia. (2) Biales Waste Disposal: Simulation is used to help a German company evaluate the profitability

of a customer in Italy. (3) Buffalo Alkali and Plastics: This case involves determining a good maintenance policy for a

soda ash plant.

Internet Case Studies

M13_REND3161_13_AIE_C13.indd 499 28/10/16 11:23 AM

500  CHAPTER 13 • SiMUlATion ModEling

Bibliography

Banks, Jerry, John S. Carson, Barry L. Nelson, and David M. Nicol. Discrete- Event System Simulation, 5e, Pearson, 2010.

Evans, J. R., and D. L. Olson. Introduction to Simulation and Risk Analysis, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2002.

Fishman, G. S., and V. G. Kulkarni. “Improving Monte Carlo Efficiency by Increasing Variance,” Management Science 38, 10 (October 1992): 1432–1444.

Fu, Michael C. “Optimization for Simulation: Theory vs. Practice,” INFORMS Journal on Computing 14, 3 (Summer 2002): 192–215.

Gass, Saul I., and Arjang A. Assad. “Model World: Tales from the Time Line—The Definition of OR and the Origins of Monte Carlo Simula- tion,” Interfaces 35, 5 (September–October 2005): 429–435.

Gavirneni, Srinagesh, Douglas J. Morrice, and Peter Mullarkey. “Simulation Helps Maxager Shorten Its Sales Cycle,” Interfaces 34, 2 (March–April 2004): 87–96.

Hartvigsen, David. SimQuick: Process Simulation with Excel, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2004.

Lee, Dong-Eun. “Probability of Project Completion Using Stochastic Project Scheduling Simulation,” Journal of Construction Engineering & Man- agement 131, 3 (2005): 310–318.

Melão, N., and M. Pidd. “Use of Business Process Simulation: A Survey of Practitioners,” Journal of the Operational Research Society 54, 1 (2003): 2–10.

Metropolis, N., and S. Ulam. “The Monte Carlo Method,” Journal of the American Statistical Association 44, 247 (1949): 335–341.

Pegden, C. D., R. E. Shannon, and R. P. Sadowski. Introduction to Simulation Using SIMAN. New York: McGraw-Hill, 1995.

Sabuncuoglu, Ihsan, and Ahmet Hatip. “The Turkish Army Uses Simulation to Model and Optimize Its Fuel-Supply System,” Interfaces 35, 6 (Novem- ber–December 2005): 474–482.

Smith, Jeffrey S. “Survey on the Use of Simulation for Manufacturing System Design and Operation,” Journal of Manufacturing Systems 22, 2 (2003): 157–171.

Terzi, Sergio, and Sergio Cavalieri. “Simulation in the Supply Chain Context: A Survey,” Computers in Industry 53, 1 (2004): 3–16.

Winston, Wayne L. Simulation Modeling Using @Risk. Pacific Grove, CA: Duxbury, 2001.

Zhang, H., C. M. Tam, and Jonathan J. Shi. “Simulation-Based Methodology for Project Scheduling,” Construction Management & Economics 20, 8 (2002): 667–668.

M13_REND3161_13_AIE_C13.indd 500 28/10/16 11:23 AM

 501

14.4 Put Markov analysis into practice for the operation of machines.

14.5 Recognize equilibrium conditions and steady state probabilities.

14.6 Understand the use of absorbing states and the fundamental matrix.

14.1 Recognize states of systems and their associated probabilities.

14.2 Compute long-term or steady-state conditions by using only the matrix of transition probabilities.

14.3 Understand the use of absorbing state analysis in predicting future states or conditions.

After completing this chapter, students will be able to:

Markov Analysis

LEARNING OBJECTIVES

14 CHAPTER

Markov analysis is a technique that deals with the probabilities of future occurrences by analyzing presently known probabilities.1 The technique has numerous applications in business, including analyzing market share, predicting bad debt, forecasting university enrollment, and determining whether a machine will break down in the future.

Markov analysis makes the assumption that the system starts in an initial state or condition. For example, two competing manufacturers might have 40% and 60% of the market sales, respec- tively, as initial states. Perhaps in 2 months the market shares for the two companies will change to 45% and 55% of the market, respectively. Predicting these future states involves knowing the system’s likelihood or probability of changing from one state to another. For a particular problem, these probabilities can be collected and placed in a matrix or table. This matrix of transition probabilities shows the likelihood that the system will change from one time period to the next. This is the Markov process, and it enables us to predict future states or conditions.

Like many other quantitative techniques, Markov analysis can be studied at any level of depth and sophistication. Fortunately, the major mathematical requirements are just that you know how to perform basic matrix manipulations and solve several equations with several un- knowns. If you are not familiar with these techniques, you may wish to review Module 5 (on the Companion Website for this book), which covers matrices and other useful mathematical tools, before you begin this chapter.

The matrix of transition probabilities shows the likelihood of change.

1The founder of the concept was A. A. Markov, whose studies of the sequence of experiments connected in a chain were used to describe the principle of Brownian motion delineated by Albert Einstein in 1905.

M14_REND3161_13_AIE_C14.indd 501 27/10/16 2:26 PM

502  CHAPTER 14 • MARkov AnAlysis

Because the level of this course prohibits a detailed study of Markov mathematics, we limit our discussion to Markov processes that follow four assumptions:

1. There are a limited or finite number of possible states.

2. The probability of changing states remains the same over time.

3. We can predict any future state from the previous state and the matrix of transition probabilities.

4. The size and makeup of the system (e.g., the total number of manufacturers and customers) do not change during the analysis.

14.1 States and State Probabilities

States are used to identify all possible conditions of a process or a system. For example, a ma- chine can be in one of two states at any point in time. It can be either functioning correctly or not functioning correctly. We can call the proper operation of the machine the first state, and we can call the incorrect functioning the second state. Indeed, it is possible to identify specific states for many processes or systems. If there are only three grocery stores in a small town, a resident can be a customer of any one of the three at any point in time. Therefore, there are three states corresponding to the three grocery stores. If students can take one of three specialties in the management area (let’s say management science, management information systems, or general management), each of these areas can be considered a state.

In Markov analysis, we also assume that the states are both collectively exhaustive and mu- tually exclusive. Collectively exhaustive means that we can list all of the possible states of a system or process. Our discussion of Markov analysis assumes that there is a finite number of states for any system. Mutually exclusive means that a system can be in only one state at any point in time. A student can be in only one of the three management specialty areas and not in two or more areas at the same time. It also means that a person can be a customer of only one of the three grocery stores at any point in time.

After the states have been identified, the next step is to determine the probability that the system is in each state. Individually, this probability is known as a state probability. Collec- tively, these state probabilities can be placed into a vector of state probabilities.

p1i2 = Vector of state probabilities for period i (14-1) = 1p1, p2, p3, c, pn2

where

n = number of states p1, p2, c, pn = probability of being in state1, state 2, c, state n

When we are dealing with only one item, such as one machine, it is possible to know with com- plete certainty what state this item is in. For example, if we are investigating only one machine, we may know that at this point in time the machine is functioning correctly. Then the vector of states can be represented as follows:

p112 = 11, 02

where

p112 = vector of states for the machine in period 1 p1 = 1 = probability of being in the first state p2 = 0 = probability of being in the second state

This shows that the probability the machine is functioning correctly, state 1, is 1 and the prob- ability that the machine is functioning incorrectly, state 2, is 0 for the first period. In most cases, however, we are dealing with more than one item.

There are four assumptions of Markov analysis.

Collectively exhaustive and mutually exclusive states are two additional assumptions of Markov analysis.

M14_REND3161_13_AIE_C14.indd 502 27/10/16 2:26 PM

14.1 sTATEs And sTATE PRobAbiliTiEs  503

The Vector of State Probabilities for Grocery Store Example Let’s look at the vector of states for people in the small town with the three grocery stores. There could be a total of 100,000 people that shop at the three grocery stores during any given month. Forty thousand people may be shopping at American Food Store, which will be called state 1; 30,000 people may be shopping at Food Mart, which will be called state 2; and 30,000 people may be shopping at Atlas Foods, which will be called state 3. The probability that a person will be shopping at one of these three grocery stores is as follows:

State 1—American Food Store: 40,000>100,000 = 0.40 = 40% State 2—Food Mart: 30,000>100,000 = 0.30 = 30% State 3—Atlas Foods: 30,000>100,000 = 0.30 = 30%

These probabilities can be placed in the vector of state probabilities:

p112 = 10.4, 0.3, 0.32 where

p112 = vector of state probabilities for the three grocery stores for period 1 p1 = 0.4 = probability that a person will shop at American Food Store, state 1 p2 = 0.3 = probability that a person will shop at Food Mart, state 2 p3 = 0.3 = probability that a person will shop at Atlas Foods, state 3

You should also notice that the probabilities in the vector of states for the three grocery stores represent the market shares for these three stores for the first period. Thus, American Food Store has 40%, Food Mart has 30%, and Atlas Foods has 30% of the market in period 1. When we are dealing with market shares, the market shares can be used in place of probability values.

Management of these three groceries should be interested in how the market shares change over time. Customers do not always remain with one store; they may go to a different store for their next purchase. In this example, a study has been performed to determine how loyal the customers have been. It is determined that 80% of the customers who shop at American Food Store one month will return to that store next month. However, of the other 20% of American’s customers, 10% will switch to Food Mart, and the other 10% will switch to Atlas Foods for their next purchase. For customers who shop this month at Food Mart, 70% will return, 10% will switch to American Food Store, and 20% will switch to Atlas Foods. Of the customers who shop this month at Atlas Foods, 60% will return, but 20% will go to American Food Store and 20% will switch to Food Mart.

Figure 14.1 provides a tree diagram to illustrate this situation. Notice that of the 40% mar- ket share for American Food Store this month, 32% 10.40 * 0.80 = 0.322 will return, 4% will

The vector of state probabilities represents market shares.

#1 0.32 = 0.4(0.8)

#2American Food Store #1 0.4

Food Mart #2 0.3

Atlas Foods #3 0.3

0.04 = 0.4(0.1)

0.04 = 0.4(0.1)#3

#1 0.03

#2 0.21

#3 0.06

#1 0.06

#2 0.06

#3 0.18

0.1

0.8

0.1

0.7

0.1

0.2

0.2

0.2

0.6

FIGURE 14.1 Tree diagram for Grocery store Example

M14_REND3161_13_AIE_C14.indd 503 27/10/16 2:26 PM

504  CHAPTER 14 • MARkov AnAlysis

shop at Food Mart, and 4% will shop at Atlas Foods. To find the market share for American next month, we can add this 32% of returning customers to the 3% that leave Food Mart to come to American and the 6% that leave Atlas Foods to come to American. Thus, American Food Store will have a 41% market share next month.

Although a tree diagram and the calculations just illustrated could be used to find the state probabilities for the next month and the month after that, the tree would soon get very large. Rather than using a tree diagram, it is easier to use a matrix of transition probabilities. A tran- sition probability is the probability of moving from one particular state to another particular state. A matrix of transition probabilities is used along with the current state probabilities to predict the future conditions.

14.2 Matrix of Transition Probabilities

The concept that allows us to get from a current state, such as market shares, to a future state is the matrix of transition probabilities. This is a matrix of conditional probabilities of being in a future state given a current state. The following definition is helpful:

Let Pij = conditional probability of being in state j in the future given the current state of i

For example, P12 is the probability of being in state 2 in the future given the event was in state 1 in the period before:

Let P = matrix of transition probabilities

P = D P11 P12 P13 g P1nP21 P22 P23 g P2nf f Pm1 Pmn

T (14-2) Individual Pij values are usually determined empirically. For example, if we have observed over time that 10% of the people currently shopping at store 1 (or state 1) will be shopping at store 2 (state 2) next period, then we know that P12 = 0.1 or 10%.

Transition Probabilities for Grocery Store Example We used historical data with the three grocery stores to determine what percentage of the custom- ers would switch each month. We put these transitional probabilities into the following matrix:

P = C0.8 0.1 0.10.1 0.7 0.2 0.2 0.2 0.6

S Recall that American Food Store represents state 1, Food Mart is state 2, and Atlas Foods is state 3. The meaning of these probabilities can be expressed in terms of the various states as follows:

Row 1

0.8 = P11 = probability of being in state 1 after being in state 1 the preceding period 0.1 = P12 = probability of being in state 2 after being in state 1 the preceding period 0.1 = P13 = probability of being in state 3 after being in state 1 the preceding period

Row 2

0.1 = P21 = probability of being in state 1 after being in state 2 the preceding period

0.7 = P22 = probability of being in state 2 after being in state 2 the preceding period

0.2 = P23 = probability of being in state 3 after being in state 2 the preceding period

Row 3

0.2 = P31 = probability of being in state 1 after being in state 3 the preceding period 0.2 = P32 = probability of being in state 2 after being in state 3 the preceding period 0.6 = P33 = probability of being in state 3 after being in state 3 the preceding period

The matrix of transition probabilities allows us to get from a current state to a future state.

M14_REND3161_13_AIE_C14.indd 504 27/10/16 2:26 PM

14.3 PREdiCTinG FUTURE MARkET sHAREs  505

Note that the three probabilities in the top row sum to 1. The probabilities for any row in a matrix of transition probabilities will also sum to 1.

After the state probabilities have been determined along with the matrix of transition prob- abilities, it is possible to predict future state probabilities.

14.3 Predicting Future Market Shares

One of the purposes of Markov analysis is to predict the future. Given the vector of state prob- abilities and the matrix of transition probabilities, it is not very difficult to determine the state probabilities at a future date. With this type of analysis, we are able to compute the probability that a person will be shopping at one of the grocery stores in the future. Because this probability is equivalent to market share, it is possible to determine future market shares for American Food Store, Food Mart, and Atlas Foods. When the current period is 0, calculating the state probabili- ties for the next period (period 1) can be accomplished as follows:

p112 = p102P (14-3) Furthermore, if we are in any period n, we can compute the state probabilities for period n + 1 as follows:

p1n + 12 = p1n2P (14-4) Equation 14-3 can be used to determine what the next period’s market shares will be for the gro- cery stores. The computations are

p112 = p102P

= 10.4, 0.3, 0.32C0.8 0.1 0.10.1 0.7 0.2 0.2 0.2 0.6

S = 310.4210.82 + 10.3210.12 + 10.3210.22, 10.4210.12

+ 10.3210.72 + 10.3210.22, 10.4210.12 + 10.3210.22 + 10.3210.624 = 10.41, 0.31, 0.282

As you can see, the market shares for American Food Store and Food Mart have increased, while the market share for Atlas Foods has decreased. Will this trend continue in the next period and the one after that? From Equation 14-4, we can derive a model that will tell us what the state probabilities will be in any time period in the future. Consider two time periods from now:

p122 = p112P Since we know that

p112 = p102P we have

p122 = 3p1124P = 3p102P4P = p102PP = p102P2

In general,

p1n2 = p102Pn (14-5) Thus, the state probabilities for n periods in the future can be obtained from the current state probabilities and the matrix of transition probabilities.

In the grocery store example, we saw that American Food Store and Food Mart had in- creased market shares in the next period, while Atlas Food had lost market share. Will Atlas eventually lose its entire market share? Or will all three groceries reach a stable condition? Although Equation 14-5 provides some help in determining this, it is better to discuss this in terms of equilibrium or steady state conditions. To help introduce the concept of equilibrium, we present a second application of Markov analysis: machine breakdowns.

The probability values for any row must sum to 1.

Computing future market shares.

M14_REND3161_13_AIE_C14.indd 505 27/10/16 2:26 PM

506  CHAPTER 14 • MARkov AnAlysis

14.4 Markov Analysis of Machine Operations

Paul Tolsky, owner of Tolsky Works, has recorded the operation of his milling machine for several years. Over the past 2 years, 80% of the time the milling machine functioned correctly during the current month if it had functioned correctly in the preceding month. This also means that only 20% of the time did the machine not function correctly for a given month when it was function- ing correctly during the preceding month. In addition, it has been observed that 90% of the time the machine remained incorrectly adjusted for any given month if it was incorrectly adjusted the preceding month. Only 10% of the time did the machine operate correctly in a given month when it did not operate correctly during the preceding month. In other words, this machine can correct itself when it has not been functioning correctly in the past, and this happens 10% of the time. These values can now be used to construct the matrix of transition probabilities. Again, state 1 is a situation in which the machine is functioning correctly, and state 2 is a situation in which the machine is not functioning correctly. The matrix of transition probabilities for this machine is

P = J0.8 0.2 0.1 0.9

R where

P11 = 0.8 = probability that the machine will be functioning correctly this month given it was functioning correctly last month

P12 = 0.2 = probability that the machine will not be functioning correctly this month given it was functioning correctly last month

P21 = 0.1 = probability that the machine will be functioning correctly this month given it was not functioning correctly last month

P22 = 0.9 = probability that the machine will not be functioning correctly this month given it was not functioning correctly last month

Look at this matrix for the machine. The two probabilities in the top row are the probabilities of functioning correctly and not functioning correctly given that the machine was functioning correctly in the last period. Because these are mutually exclusive and collectively exhaustive, the row probabilities again sum to 1.

What is the probability that Tolsky’s machine will be functioning correctly 1 month from now? What is the probability that the machine will be functioning correctly in 2 months? To an- swer these questions, we again apply Equation 14-3:

p112 = p102P

= 11, 02J0.8 0.2 0.1 0.9

R = 311210.82 + 10210.12, 11210.22 + 10210.924 = 10.8, 0.22

Therefore, the probability that the machine will be functioning correctly 1 month from now, given that it is now functioning correctly, is 0.80. The probability that it will not be functioning correctly in 1 month is 0.20. Now we can use these results to determine the probability that the machine will be functioning correctly 2 months from now. The analysis is exactly the same:

p122 = p112P

= 10.8, 0.22J0.8 0.2 0.1 0.9

R = 310.8210.82 + 10.2210.12, 10.8210.22 + 10.2210.924 = 10.66, 0.342

This means that 2 months from now there is a probability of 0.66 that the machine will still be functioning correctly. The probability that the machine will not be functioning correctly is 0.34. Of course, we could continue this analysis as many times as we want in computing state prob- abilities for future months.

The row probabilities must sum to 1 because the events are mutually exclusive and collectively exhaustive.

M14_REND3161_13_AIE_C14.indd 506 27/10/16 2:26 PM

14.5 EqUilibRiUM CondiTions  507

14.5 Equilibrium Conditions

Looking at the Tolsky machine example, it is easy to think that eventually all market shares or state probabilities will be either 0 or 1. This is usually not the case. Equilibrium share of the market values or probabilities are normally encountered. The probabilities are called steady- state probabilities or equilibrium probabilities.

One way to compute the equilibrium share of the market is to use Markov analysis for a large number of periods. It is possible to see if the future values are approaching a stable value. For example, it is possible to repeat Markov analysis for 15 periods for Tolsky’s machine. This is not too difficult to do by hand. The results for this computation appear in Table 14.1.

The machine starts off functioning correctly (in state 1) in the first period. In period 5, there is only a 0.4934 probability that the machine is still functioning correctly, and by period 10, this probability is only 0.360235. In period 15, the probability that the machine is still functioning correctly is about 0.34. The probability that the machine will be functioning correctly at a future period is decreasing—but it is decreasing at a decreasing rate. What would you expect in the long run? If we made these calculations for 100 periods, what would happen? Would there be an equilibrium in this case? If the answer is yes, what would it be? Looking at Table 14.1, it appears that there will be an equilibrium at 0.333333, or 1>3. But how can we be sure?

By definition, an equilibrium condition exists if the state probabilities or market shares do not change after a large number of periods. Thus, at equilibrium, the state probabilities for a future period must be the same as the state probabilities for the current period. This fact is the key to solving for the steady-state probabilities. This relationship can be expressed as follows:

From Equation 14-4, it is always true that

p1Next period2 = p1This period2P or

p1n + 12 = p1n2P At equilibrium, we know that

p1n + 12 = p1n2 Therefore, at equilibrium,

p1n + 12 = p1n2P = p1n2 So

p1n2 = p1n2P or, dropping the n term,

p = pP (14-6)

Equation 14-6 states that at equilibrium, the state probabilities for the next period are the same as the state probabilities for the current period. For Tolsky’s machine, this can be expressed as follows:

p = pP

1p1, p22 = 1p1, p22J0.8 0.20.1 0.9R Using matrix multiplication, we get

1p1, p22 = 31p1210.82 + 1p2210.12, 1p1210.22 + 1p2210.924 The first term on the left-hand side, p1, is equal to the first term on the right-hand side 1p1210.82 + 1p2210.12. In addition, the second term on the left-hand side, p2, is equal to the second term on the right-hand side 1p1210.22 + 1p2210.92. This gives us the following:

p1 = 0.8p1 + 0.1p2 (a)

p2 = 0.2p1 + 0.9p2 (b)

Equilibrium conditions exist if state probabilities do not change after a large number of periods.

At equilibrium, the state probabilities for the next period equal the state probabilities for this period.

M14_REND3161_13_AIE_C14.indd 507 27/10/16 2:26 PM

508  CHAPTER 14 • MARkov AnAlysis

We also know that the state probabilities—p1 and p2, in this case—must sum to 1. (Looking at Table 14.1, you note that p1 and p2 sum to 1 for all 15 periods.) We can express this property as follows:

p1 + p2 + Á + pn = 1 (c)

For Tolsky’s machine, we have

p1 + p2 = 1 (d)

Now, we have three equations for the machine (a, b, and d). We know that Equation d must hold. Thus, we can drop Equation a or Equation b and solve the remaining two equations for p1 and p2. It is necessary to drop one of the equations so that we end up with two unknowns and two equations. If we were solving for equilibrium conditions that involved three states, we would end up with four equations. Again, it would be necessary to drop one of the equations so that we end up with three equations and three unknowns. In general, when solving for equi- librium conditions, it will always be necessary to drop one of the equations such that the total number of equations is the same as the total number of variables for which we are solving. The reason that we can drop one of the equations is that they are interrelated mathematically. In other words, one of the equations is redundant in specifying the relationships among the various equilibrium equations.

Let us arbitrarily drop Equation a. Thus, we will be solving the following two equations:

p2 = 0.2p1 + 0.9p2 p1 + p2 = 1

Rearranging the first equation, we get

0.1p2 = 0.2p1

or

p2 = 2p1

Substituting this into Equation d, we have

p1 + p2 = 1

or

p1 + 2p1 = 1

TABLE 14.1 state Probabilities for the Machine Example for 15 Periods

PERIOD STATE 1 STATE 2

1 1.000000 0.000000

2 0.800000 0.200000

3 0.660000 0.340000

4 0.562000 0.438000

5 0.493400 0.506600

6 0.445380 0.554620

7 0.411766 0.588234

8 0.388236 0.611763

9 0.371765 0.628234

10 0.360235 0.639754

11 0.352165 0.647834

12 0.346515 0.653484

13 0.342560 0.657439

14 0.339792 0.660207

15 0.337854 0.662145

We drop one equation in solving for equilibrium conditions.

M14_REND3161_13_AIE_C14.indd 508 27/10/16 2:26 PM

14.5 EqUilibRiUM CondiTions  509

or

3p1 = 1 p1 = 1>3 = 0.33333333

Thus,

p2 = 2>3 = 0.66666667 Compare these results with Table 14.1. As you can see, the steady-state probability for state 1 is 0.33333333, and the equilibrium state probability for state 2 is 0.66666667. These values are what you would expect by looking at the tabled results. This analysis indicates that it is necessary to know only the matrix of transition probabilities in determining the equilibrium market shares. The initial values for the state probabilities or the market shares do not influence the equilibrium state probabilities. The analysis for determining equilibrium state probabilities or market shares is the same when there are more states. If there are three states (as in the grocery store example), we have to solve three equations for the three equilibrium states; if there are four states, we have to solve four simultaneous equations for the four unknown equilibrium values, and so on.

Initial-state probability values do not influence equilibrium conditions.

Defining the Problem Finnair, a major European airline, was experiencing very low customer loyalty. The company’s numbers for repeat business were much lower than industry averages.

Developing a Model Analysts at IBM tackled the problem using Markov analysis to model customer behavior. Three states of the system were identified, and each customer was listed as (1) an occasional flyer (OF), (2) a repeat purchaser (RP), or (3) a loyal customer (LC).

Acquiring Input Data Data were collected on each customer so that transition probabilities could be developed. These prob- abilities indicated the likelihood of a customer moving from one state to another. Most important were the probabilities of going from OF to RP and from RP to LC.

Testing the Solution The analysts built a tool called Customer Equity Loyalty Management (CELM). CELM tracked customer responses by customer type (OF, RP, and LC) and by the associated marketing efforts.

Analyzing the Results The results were nothing short of astounding. By targeting its marketing efforts based on the type of customer, Finnair was able to reduce its overall marketing costs by 20% while simultaneously increasing its customer response rate by over 10%.

Implementing the Results Finnair uses CELM as an integral part of its in-house frequent flyer program.

Source: Based on A. Labbi and C. Berrospi, “Optimizing Marketing Planning and Budgeting Using Markov Decision Processes: An Airline Case Study,” IBM Journal of Research and Development 51, 3 (2007): 421–431, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Airline Uses Markov Analysis to Reduce Marketing Costs

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the ProblemDeveloping

a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

Defining the Problem

M14_REND3161_13_AIE_C14.indd 509 27/10/16 2:26 PM

510  CHAPTER 14 • MARkov AnAlysis

You may wish to prove to yourself that the equilibrium states we have just computed are, in fact, equilibrium states. This can be done by multiplying the equilibrium states by the original matrix of transition probabilities. The results will be the same equilibrium states. Performing this analysis is also an excellent way to check your answers to end-of-chapter problems or examination questions.

14.6 Absorbing States and the Fundamental Matrix: Accounts Receivable Application

In the examples discussed thus far, we assume that it is possible for the process or system to go from one state to any other state between any two periods. In some cases, however, if you are in a state, you cannot go to another state in the future. In other words, when you are in a given state, you are “absorbed” by it, and you will remain in that state. Any state that has this property is called an absorbing state. An example of this is the accounts receivable application.

An accounts receivable system normally places debts or receivables from its customers into one of several categories or states, depending on how overdue the oldest unpaid bill is. Of course, the exact categories or states depend on the policy set by each company. Four typical states or categories for an accounts receivable application follow:

State 1 1p12: paid, all bills State 2 1p22: bad debt, overdue more than 3 months State 3 1p32: overdue less than 1 month State 4 1p42: overdue between 1 and 3 months At any given period—in this case, 1 month—a customer can be in one of these four states.2

For this example, it will be assumed that if the oldest unpaid bill is more then 3 months overdue, it is automatically placed in the bad debt category. Therefore, a customer can be paid in full (state 1), have the oldest unpaid bill overdue less than 1 month (state 3), have the oldest unpaid bill overdue between 1 and 3 months inclusive (state 4), or have the oldest unpaid bill overdue more than 3 months, which is a bad debt (state 2).

As in any other Markov process, we can set up a matrix of transition probabilities for these four states. This matrix will reflect the propensity of customers to move among the four accounts receivable categories from one month to the next. The probability of being in the paid category for any item or bill in a future month, given that a customer is in the paid category for a purchased item this month, is 100% or 1. It is impossible for a customer to completely pay for a product one month and to owe money on it in a future month. Another absorbing state is the bad debts state. If a bill is not paid in 3 months, we are assuming that the company will completely write it off and not try to collect it in the future. Thus, once a person is in the bad debt category, that person will remain in that category forever. For any absorbing state, the probability that a customer will be in this state in the future is 1, and the probability that a customer will be in any other state is 0.

These values will be placed in the matrix of transition probabilities. But before we con- struct this matrix, we need to know the future probabilities for the other two states—a debt that is less than 1 month old and a debt that is between 1 and 3 months old. For a person in the less- than-1-month category, there is a 0.60 probability of being in the paid category, a 0 probability of being in the bad debt category, a 0.20 probability of remaining in the less-than-1-month category, and a probability of 0.20 of being in the 1- to 3-month category in the next month. Note that there is a 0 probability of being in the bad debt category the next month because it is impossible to get from state 3, less than 1 month, to state 2, more than 3 months overdue, in just 1 month. For a person in the 1- to 3-month category, there is a 0.40 probability of being in the paid category, a 0.10 probability of being in the bad debt category, a 0.30 probability of be- ing in the less-than-1-month category, and a 0.20 probability of remaining in the 1- to 3-month category in the next month.

If you are in an absorbing state, you cannot go to another state in the future.

2You should also be aware that the four states can be placed in any order you choose. For example. It might seem more natural to order the states as follows:

1. Paid 2. Overdue less than 1 month 3. Overdue 1 to 3 months 4. Overdue more than 3 months; bad debt

This is perfectly legitimate, and the only reason this ordering is not used is to facilitate some matrix manipulations.

If a system is in an absorbing state now, the probability of being in an absorbing state in the future is 100%.

M14_REND3161_13_AIE_C14.indd 510 27/10/16 2:26 PM

14.6 AbsoRbinG sTATEs And THE FUndAMEnTAl MATRix: ACCoUnTs RECEivAblE APPliCATion  511

How can we get a probability of 0.30 of being in the 1- to 3-month category for one month and in the less-than-1-month category in the next month? Because these categories are deter- mined by the oldest unpaid bill, it is possible to pay one bill that is 1 to 3 months old and still have another bill that is less than 1 month old. In other words, any customer may have more than one outstanding bill at any point in time. With this information, it is then possible to construct the matrix of transition probabilities of the problem.

NEXT MONTH

THIS MONTH

PAID

BAD DEBT

<1 MONTH

1 TO 3 MONTHS

Paid 1 0 0 0

Bad debt 0 1 0 0

Less than 1 month 0.6 0 0.2 0.2

1 to 3 months 0.4 0.1 0.3 0.2

Thus,

P = ≥ 1 0 0 0

0 1 0 0

0.6 0 0.2 0.2

0.4 0.1 0.3 0.2

¥

If we know the fraction of the people in each of the four categories or states for any given period, we can determine the fraction of the people in each of these four states or categories for any fu- ture period. These fractions are placed in a vector of state probabilities and multiplied times the matrix of transition probabilities. This procedure was described in Section 14.4.

Even more interesting are the equilibrium conditions. Of course, in the long run, everyone will be in either the paid or the bad debt category. This is because the categories are absorbing states. But how many people, or how much money, will be in each of these categories? Knowing the total amount of money that will be in either the paid or the bad debt category will help a company man- age its bad debts and cash flow. This analysis requires the use of the fundamental matrix.

To obtain the fundamental matrix, it is necessary to partition the matrix of transition prob- abilities, P. This can be done as follows:

I 0 T T

P = ≥ 1 0 0 0

0 1 0 0

0.6 0 0.2 0.2

0.4 0.1 0.3 0.2

¥ (14-7)

c c A B

I = J1 0 0 1

R 0 = J0 0 0 0

R A = J0.6 0

0.4 0.1 R B = J0.2 0.2

0.3 0.2 R

where

I = an identity matrix (i.e., a matrix with 1s on the diagonal and 0s everyplace else) 0 = a matrix with all 0s

The fundamental matrix can be computed as follows:

F = 1I - B2-1 (14-8)

In the long run, everyone will be in either in the paid or the bad debt category.

F is the fundamental matrix.

M14_REND3161_13_AIE_C14.indd 511 27/10/16 2:26 PM

512  CHAPTER 14 • MARkov AnAlysis

In Equation 14-8, 1I - B2 means that we subtract the B matrix from the I matrix. The super- script -1 means that we take the inverse of the result of 1I - B2. Here is how we can compute the fundamental matrix for the accounts receivable application:

F = 1I - B2-1

or

F = a c1 0 0 1

d - c0.2 0.2 0.3 0.2

d b -1

Subtracting B from I, we get

F = c 0.8 -0.2 -0.3 0.8

d -1

Taking the inverse of a large matrix involves several steps, as described in Module 5 on the Companion Website for this book. Appendix 14.2 shows how this inverse can be found using Excel. However, for a matrix with two rows and two columns, the computations are relatively simple, as shown here.

The inverse of the matrix ca b c d

d is

c a b c d

d -1

= ≥ d r

-b r

-c r

a r

¥ (14-9)

where

r = ad - bc

To find the F matrix in the accounts receivable example, we first compute

r = ad - bc = 10.8210.82 - 1-0.221-0.32 = 0.64 - 0.06 = 0.58 With this, we have

F = c 0.8 -0.2 -0.3 0.8

d -1

= D 0.80.58 -1-0.220.58-1-0.32 0.58

0.8

0.58

T = c 1.38 0.34 0.52 1.38

d

Now we are in a position to use the fundamental matrix in computing the amount of bad debt money that we could expect in the long run. First, we need to multiply the fundamental matrix, F, times the A matrix. This is accomplished as follows:

FA = c1.38 0.34 0.52 1.38

d * c0.6 0 0.4 0.1

d

or

FA = c0.97 0.03 0.86 0.14

d

The new FA matrix has an important meaning. It indicates the probability that an amount in one of the nonabsorbing states will end up in one of the absorbing states. The top row of this matrix indicates the probabilities that an amount in the less-than-1-month category will end up in the paid and the bad debt categories. The probability that an amount that is less than 1 month overdue will be paid is 0.97, and the probability that an amount that is less than 1 month over- due will end up as a bad debt is 0.03. The second row has a similar interpretation for the other

The FA matrix indicates the probability that an amount will end up in an absorbing state.

M14_REND3161_13_AIE_C14.indd 512 27/10/16 2:26 PM

14.6 AbsoRbinG sTATEs And THE FUndAMEnTAl MATRix: ACCoUnTs RECEivAblE APPliCATion  513

nonabsorbing state, which is the 1- to 3-month category. Therefore, 0.86 is the probability that an amount that is 1 to 3 months overdue will eventually be paid, and 0.14 is the probability that an amount that is 1 to 3 months overdue will never be paid but will become a bad debt.

This matrix can be used in a number of ways. If we know the amounts of the less-than-1- month category and the 1- to 3-month category, we can determine the amount of money that will be paid and the amount of money that will become bad debt. We let the M matrix represent the amount of money that is in each of the nonabsorbing states:

M = 1M1, M2, M3, c, Mn2 where

n = number of nonabsorbing states M1 = amount in the first state or category M2 = amount in the second state or category Mn = amount in the nth state or category

Assume that there is $2,000 in the less-than-1-month category and $5,000 in the 1- to 3-month category. Then M would be represented as follows:

M = 12,000, 5,0002 The amount of money that will end up as being paid and the amount that will end up as bad

debt can be computed by multiplying the matrix M times the FA matrix that was computed previ- ously. Here are the computations:

Amount paid and amount in bad debt = MFA

= 12,000, 5,0002c0.97 0.03 0.86 0.14

d = 16,240, 7602

Thus, out of the total of $7,000 ($2,000 in the less-than-1-month category and $5,000 in the 1- to 3-month category), $6,240 will be eventually paid, and $760 will end up as bad debts.

The M matrix represents the money in the absorbing states— paid or bad debt.

Markovian volleyball!

Volleyball coaches turned to Markovian analysis to rank five ba- sic volleyball skills (passing, setting, digging, serving, and attack- ing) in high-level volleyball. In other words, the coaches wanted to know which skill had the highest probability of leading to a point on any given play, which skill had the second-highest prob- ability of leading to a point on any given play, and so on.

For an entire season, data were collected from all matches, and all individual skill performances (e.g., a serve) in each match were rated based on a simple rubric. For example, a set that was in perfect position (3–5 feet away from the net) was given 3 per- formance points, while a set that was 5–8 feet away from the net was given just 1 performance point. The end result of each skill (a point for the visiting team, the rally continued, or a point for the home team) was also recorded.

A rather large 36 * 36 transition matrix was developed, and a mix of empirical and Bayesian methods (see Chapter 2) were employed to arrive at the individual transition probabilities, Pij s. State transitions that were impossible (e.g., a perfectly posi- tioned set followed by a service error) were assigned a probability of zero.

The ensuing Markovian analysis led analysts to one over-arching conclusion: whereas the most important skills in men’s volleyball are (by a large margin over the others) serving and attacking, the most important skills in women’s volleyball are (again by a large margin over the others) passing, setting, and digging. Can you dig it?

Source: M. A. Miskin, G. W. Fellingham, and L. W. Florence, “Skill Impor- tance in Women’s Volleyball,” Journal of Quantitative Analysis in Sport 6 (2010): Article 5.

IN ACTION

M14_REND3161_13_AIE_C14.indd 513 27/10/16 2:26 PM

514  CHAPTER 14 • MARkov AnAlysis

Markov analysis can be very helpful in predicting future states. The equilibrium conditions are determined to indicate how the future will look if things continue as in the past. In this chapter, the existence of absorbing states was presented, and the equi- librium conditions were determined when one or more of these were present.

However, it is important to remember that the future con- ditions found using Markov analysis are based on the assump- tion that the transition probabilities do not change. When using Markov analysis to predict market shares, as in the grocery store example, it should be noted that companies are constantly trying to change these probabilities so that their own market shares increase. This was illustrated in the Modeling in the Real World vignette about Finnair, which was using Markov analysis to help measure its success in retaining customers. When one company succeeds in changing the transition prob- abilities, other companies will respond and try to move the probabilities in a direction more favorable to them. At times,

new companies enter the market, and this changes the dynam- ics (and probabilities) as well.

In the accounts receivable example on absorbing states, future revenues were predicted based on existing probabilities. However, things can certainly change due to factors that are controllable, as well as factors that are not controllable. The financial crisis throughout the United States in 2007–2009 is a good example of this. Some banks and other lending insti- tutions had been making loans that were less secure than the ones they had made in the past. Many mortgages, which were reliable sources of income for the banks when housing prices were rapidly rising, were becoming problematic when housing prices began to fall. The economy as a whole was in decline, and individuals who became unemployed were having trouble repaying their loans. Thus, the future conditions (and revenues) that were expected if probabilities did not change were never realized. It is important to remember the assumptions behind all these models.

Summary

Glossary

Absorbing State A state that, when entered, cannot be left. The probability of going from an absorbing state to any other state is 0.

Equilibrium Condition A condition that exists when the state probabilities for a future period are the same as the state probabilities for a previous period.

Fundamental Matrix A matrix that is the inverse of the I minus B matrix. It is needed to compute equilibrium condi- tions when absorbing states are involved.

Market Share The fraction of the population that shops at a particular store or market. When expressed as a fraction, market shares can be used in place of state probabilities.

Markov Analysis A type of analysis that allows us to predict the future by using the state probabilities and the matrix of transition probabilities.

Matrix of Transition Probabilities A matrix containing all transition probabilities for a certain process or system.

State Probability The probability of an event occurring at a point in time. An example is the probability that a person will be shopping at a given grocery store during a given month.

Steady-State Probability or Equilibrium Probability A state probability when the equilibrium condition has been reached.

Transition Probability The conditional probability that we will be in a future state given a current or existing state.

Vector of State Probabilities A collection or vector of all state probabilities for a given system or process. The vec- tor of state probabilities could be the initial state or a future state.

Key Equations

(14-1) p1i2 = 1p1, p2, p3, c , pn2 Vector of state probabilities for period i.

(14-2) P = D P11 P12 P13 g P1nP21 P22 P23 g P2nf f Pm1 Pmn

T Matrix of transition probabilities—that is, the probabil- ity of going from one state into another.

(14-3) p112 = p102P Formula for calculating the state 1 probabilities given state 0 data.

(14-4) p1n + 12 = p1n2P Formula for calculating the state probabilities for the period n + 1 if we are in period n.

(14-5) p1n2 = p102Pn

M14_REND3161_13_AIE_C14.indd 514 27/10/16 2:26 PM

solvEd PRoblEMs  515

Solved Problems

Solved Problem 14-1 George Walls, president of Bradley School, is concerned about declining enrollments. Bradley School is a technical college that specializes in training computer programmers and computer operators. Over the years, there has been a lot of competition among Bradley School, International Technology, and Career Academy. The three schools compete in providing education in the areas of programming, computer operations, and basic secretarial skills.

To gain a better understanding of which of these schools is emerging as a leader, George decided to conduct a survey. His survey looked at the number of students who transferred from one school to the other during their academic careers. On average, Bradley School was able to retain 65% of those students it originally enrolled. Twenty percent of the students originally enrolled transferred to Career Academy, and 15% transferred to International Technology. Career Academy had the highest reten- tion rate: 90% of its students remained at Career Academy for their full academic program. George estimated that about half the students who left Career Academy went to Bradley School, and the other half went to International Technology. International Technology was able to retain 80% of its students after they enrolled. Ten percent of the originally enrolled students transferred to Career Academy, and the other 10% enrolled in Bradley School.

Currently, Bradley School has 40% of the market. Career Academy, a much newer school, has 35% of the market. The remaining market share—25%—consists of students attending Interna- tional Technology. George would like to determine the market share for Bradley for the next year. What are the equilibrium market shares for Bradley School, International Technology, and Career Academy?

Solution The data for this problem are summarized as follows:

State 1 initial share = 0.40—Bradley School State 2 initial share = 0.35—Career Academy State 3 initial share = 0.25—International Technology

The transition matrix values are

TO

1 2 3

FROM BRADLEY CAREER INTERNATIONAL

1 BRADLEY 0.65 0.20 0.15

2 CAREER 0.05 0.90 0.05

3 INTERNATIONAL 0.10 0.10 0.80

Formula for computing the state probabilities for period n if we are in period 0.

(14-6) p = pP

Equilibrium state equation used to derive equilibrium probabilities.

(14-7) P = c I O A B

d

Partition of the matrix of transition for absorbing state analysis.

(14-8) F = 1I - B2-1 Fundamental matrix used in computing probabilities of ending up in an absorbing state.

(14-9) c a b c d

d -1

= ≥ d r

-b r

-c r

a r

¥ where r = ad - bc

Inverse of a matrix with 2 rows and 2 columns.

M14_REND3161_13_AIE_C14.indd 515 27/10/16 2:26 PM

516  CHAPTER 14 • MARkov AnAlysis

For George to determine market share for Bradley School for next year, he has to multiply the cur- rent market shares times the matrix of transition probabilities. Here is the overall structure of these calculations:

10.40 0.35 0.252 C0.65 0.20 0.150.05 0.90 0.05 0.10 0.10 0.80

S Thus, the market shares for Bradley School, International Technology, and Career Academy can be computed by multiplying the current market shares times the matrix of transition probabilities, as shown. The result will be a new matrix with three numbers, each representing the market share for one of the schools. The detailed matrix computations follow:

Market share for Bradley School = 10.40210.652 + 10.35210.052 + 10.25210.102 = 0.303

Market share for Career Academy = 10.40210.202 + 10.35210.902 + 10.25210.102 = 0.420

Market share for International Technology = 10.40210.152 + 10.35210.052 + 10.25210.802 = 0.278

Now George would like to compute the equilibrium market shares for the three schools. At equilibrium conditions, the future market share is equal to the existing or current market share times the matrix of transition probabilities. By letting the variable X represent various market shares for these three schools, it is possible to develop a general relationship that will allow us to compute equilibrium market shares.

Let X1 = market share for Bradley School X2 = market share for Career Academy X3 = market share for International Technology

At equilibrium,

1X1, X2, X32 = 1X1, X2, X32 C0.65 0.20 0.150.05 0.90 0.05 0.10 0.10 0.80

S The next step is to make the appropriate multiplications on the right-hand side of the equation. Doing this will allow us to obtain three equations with the three unknown X values. In addition, we know that the sum of the market shares for any particular period must equal 1. Thus, we are able to generate four equations, which are now summarized:

X1 = 0.65X1 + 0.05X2 + 0.10X3 X2 = 0.20X1 + 0.90X2 + 0.10X3 X3 = 0.15X1 + 0.05X2 + 0.80X3 X1 + X2 + X3 = 1

Because we have four equations and only three unknowns, we are able to delete one of the top three equations, which will give us three equations and three unknowns. These equations can then be solved using standard algebraic procedures to obtain the equilibrium market share values for Bradley School, International Technology, and Career Academy. The results of these calculations are shown in the following table:

SCHOOL MARKET SHARE

X1 (Bradley) 0.158

X2 (Career) 0.579

X3 (International) 0.263

M14_REND3161_13_AIE_C14.indd 516 27/10/16 2:26 PM

solvEd PRoblEMs  517

Solved Problem 14-2 Central State University administers computer competency examinations every year. These exams allow students to “test out” of the introductory computer class held at the university. Results of the exams can be placed in one of the following four states:

State 1: pass all of the computer exams and be exempt from the course State 2: do not pass all of the computer exams on the third attempt and be required to take the course State 3: fail the computer exams on the first attempt State 4: fail the computer exams on the second attempt

The course coordinator for the exams has noticed the following matrix of transition probabilities:

P = D1 0 0 00 1 0 0 0.8 0 0.1 0.1

0.2 0.2 0.4 0.2

T Currently, there are 200 students who did not pass all of the exams on the first attempt. In addition, there are 50 students who did not pass on the second attempt. In the long run, how many students will be exempted from the course by passing the exams? How many of the 250 students will be required to take the computer course?

Solution The transition matrix values are summarized as follows:

TO

FROM 1 2 3 4

1 1 0 0 0

2 0 1 0 0

3 0.8 0 0.1 0.1

4 0.2 0.2 0.4 0.2

The first step in determining how many students will be required to take the course and how many will be exempt from it is to partition the transition matrix into four matrices. These are the I, 0, A, and B matrices:

I = c1 0 0 1

d

0 = c0 0 0 0

d

A = c0.8 0 0.2 0.2

d

B = c0.1 0.1 0.4 0.2

d

The next step is to compute the fundamental matrix, which is represented by the letter F. This matrix is determined by subtracting the B matrix from the I matrix and taking the inverse of the result:

F = 1I - B2-1 = c 0.9 -0.1 -0.4 0.8

d -1

We first find

r = ad - bc = 10.9210.82 - 1-0.121-0.42 = 0.72 - 0.04 = 0.68

F = c 0.9 -0.1 -0.4 0.8

d -1

= D 0.80.68 -1-0.120.68-1-0.42 0.68

0.9

0.68

T = c 1.176 0.147 0.588 1.324

d

M14_REND3161_13_AIE_C14.indd 517 27/10/16 2:26 PM

518  CHAPTER 14 • MARkov AnAlysis

Now multiply the F matrix by the A matrix. This step is needed to determine how many students will be exempt from the course and how many will be required to take it. Multiplying the F matrix times the A matrix is fairly straightforward:

FA = c1.176 0.147 0.588 1.324

d c0.8 0 0.2 0.2

d

= c0.971 0.029 0.735 0.265

d

The final step is to multiply the results from the FA matrix by the M matrix, as shown here:

MFA = 1200 502c0.971 0.029 0.735 0.265

d = 1231 192

As you can see, the MFA matrix consists of two numbers. The number of students who will be exempt from the course is 231. The number of students who will eventually have to take the course is 19.

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. If the states in a system or process are such that the system can be in only one state at a time, then the states are a. collectively exhaustive. b. mutually exclusive. c. absorbing. d. disappearing.

2. The product of a vector of state probabilities and the matrix of transition probabilities is a. another vector of state probabilities. b. a meaningless mess. c. the inverse of the equilibrium state matrix. d. all of the above. e. none of the above.

3. In the long run, the state probabilities will be 0 and 1 a. in no instances. b. in all instances. c. in some instances.

4. To find equilibrium conditions, a. the first vector of state probabilities must be known. b. the matrix of transition probabilities is unnecessary. c. the general terms in the vector of state probabilities are

used on two occasions. d. the matrix of transition probabilities must be squared

before it is inverted. e. none of the above.

5. Which of the following is not one of the assumptions of Markov analysis? a. There is a limited number of possible states. b. There is a limited number of possible future periods. c. A future state can be predicted from the previous state

and the matrix of transition probabilities.

d. The size and makeup of the system do not change during the analysis.

e. All of the above are assumptions of Markov analysis. 6. In Markov analysis, the state probabilities must

a. sum to 1. b. be less than 0. c. be less than 0.01. d. be greater than 1. e. be greater than 0.01.

7. If the state probabilities do not change from one period to the next, then a. the system is in equilibrium. b. each state probability must equal 0. c. each state probability must equal 1. d. the system is in its fundamental state.

8. In the matrix of transition probabilities, a. the sum of the probabilities in each row will equal 1. b. the sum of the probabilities in each column will equal 1. c. there must be at least one 0 in each row. d. there must be at least one 0 in each column.

9. It is necessary to use the fundamental matrix a. to find the equilibrium conditions when there are no

absorbing states. b. to find the equilibrium conditions when there is one or

more absorbing states. c. to find the matrix of transition probabilities. d. to find the inverse of a matrix.

10. In Markov analysis, the allows us to get from a current state to a future state.

11. In Markov analysis, we assume that the state probabilities are both and .

12. The is the probability that the system is in a particular state.

M14_REND3161_13_AIE_C14.indd 518 27/10/16 2:26 PM

 519 disCUssion qUEsTions And PRoblEMs  519

Discussion Questions and Problems

Discussion Questions 14-1 List the assumptions that are made in Markov

analysis. 14-2 What are the vector of state probabilities and the ma-

trix of transition probabilities, and how can they be determined?

14-3 Describe how we can use Markov analysis to make future predictions.

14-4 What is an equilibrium condition? How do we know that we have an equilibrium condition, and how can we compute equilibrium conditions given the matrix of transition probabilities?

14-5 What is an absorbing state? Give several examples of absorbing states.

14-6 What is the fundamental matrix, and how is it used in determining equilibrium conditions?

Problems 14-7 Find the inverse of each of the following matrices:

(a) c 0.9 -0.1 -0.2 0.7

d

(b) c 0.8 -0.1 -0.3 0.9

d

(c) c 0.7 -0.2 -0.2 0.9

d

(d) c 0.8 -0.2 -0.1 0.7

d

14-8 Ray Cahnman is the proud owner of a 1955 sports car. On any given day, Ray never knows whether his car will start. Ninety percent of the time it will start if it started the previous morning, and 70% of the time it will not start if it did not start the previous morning.

(a) Construct the matrix of transition probabilities. (b) What is the probability that it will start tomor-

row if it started today? (c) What is the probability that it will start tomor-

row if it did not start today?

14-9 Alan Resnik, a friend of Ray Cahnman, bet Ray $5 that Ray’s car would not start 5 days from now (see Problem 14-8).

(a) What is the probability that it will not start 5 days from now if it started today?

(b) What is the probability that it will not start 5 days from now if it did not start today?

(c) What is the probability that it will start in the

long run if the matrix of transition probabilities does not change?

14-10 Over any given month, Dress-Rite loses 10% of its customers to Fashion, Inc., and 20% of its market to Luxury Living. But Fashion, Inc., loses 5% of its market to Dress-Rite and 10% of its market to Luxury Living each month; and Luxury Living loses 5% of its market to Fashion, Inc., and 5% of its mar- ket to Dress-Rite. At the present time, each of these clothing stores has an equal share of the market. What do you think the market shares will be next month? What will they be in 3 months?

14-11 Draw a tree diagram to illustrate what the market shares would be next month for Problem 14-10.

14-12 Goodeating Dog Chow Company produces a variety of brands of dog chow. One of their best values is the 50-pound bag of Goodeating Dog Chow. George Hamilton, president of Goodeating, uses a very old machine to load 50 pounds of Goodeating Chow automatically into each bag. Unfortunately, because the machine is old, it occasionally over- or under- fills the bags. When the machine is correctly placing 50 pounds of dog chow into each bag, there is a 0.10 probability that the machine will put only 49 pounds in each bag the following day, and there is a 0.20 probability that 51 pounds will be placed in each bag the next day. If the machine is currently placing 49 pounds of dog chow in each bag, there is a 0.30 probability that it will put 50 pounds in each bag tomorrow and a 0.20 probability that it will put 51 pounds in each bag tomorrow. In addition, if the ma- chine is placing 51 pounds in each bag today, there is a 0.40 probability that it will place 50 pounds in each bag tomorrow and a 0.10 probability that it will place 49 pounds in each bag tomorrow.

(a) If the machine is loading 50 pounds in each bag today, what is the probability that it will be plac- ing 50 pounds in each bag tomorrow?

(b) Resolve part (a) when the machine is placing only 49 pounds in each bag today.

(c) Resolve part (a) when the machine is placing 51 pounds in each bag today.

14-13 Resolve Problem 14-12 (Goodeating Dog Chow) for five periods.

14-14 The University of South Wisconsin has had steady en- rollments over the past 5 years. The school has its own bookstore, called University Book Store, but there are also three private bookstores in town: Bill’s Book Store, College Book Store, and Battle’s Book Store.

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M14_REND3161_13_AIE_C14.indd 519 27/10/16 2:26 PM

520  CHAPTER 14 • MARkov AnAlysis

The university is concerned about the large number of students who are switching to one of the private stores. As a result, South Wisconsin’s president, Andy Lange, has decided to give a student 3 hours of uni- versity credit to look into the problem. The following matrix of transition probabilities was obtained:

UNIVERSITY BILL’S COLLEGE BATTLE’S

UNIVERSITY 0.6 0.2 0.1 0.1

BILL’S 0 0.7 0.2 0.1

COLLEGE 0.1 0.1 0.8 0

BATTLE’S 0.05 0.05 0.1 0.8

At the present time, each of the four bookstores has an equal share of the market. What will the market shares be for the next period?

14-15 Andy Lange, president of the University of South Wisconsin, is concerned with the declining business at the University Book Store. (See Problem 14-14 for details.) The students tell him that the prices are simply too high. Andy, however, has decided not to lower the prices. If the same conditions exist, what long-run market shares can Andy expect for the four bookstores?

14-16 Hervis Rent-A-Car has three car rental locations in the greater Houston area: the Northside branch, the West End branch, and the Suburban branch. Custom- ers can rent a car at any of these places and return it to any of the others without any additional fees. However, this can create a problem for Hervis if too many cars are taken to the popular Northside branch. For planning purposes, Hervis would like to predict where the cars will eventually be. Past data indicate that 80% of the cars rented at the Northside branch will be returned there, and the rest will be evenly distributed between the other two. For the West End branch, about 70% of the cars rented there will be returned there, 20% will be returned to the Northside branch, and the rest will go to the Suburban branch. Of the cars rented at the Suburban branch, 60% are returned there, 25% are returned to the Northside branch, and the other 15% are dropped off at the West End branch. If there are currently 100 cars be- ing rented from the Northside branch, 80 from the West End branch, and 60 from the Suburban branch, how many of these will be dropped off at each of the car rental locations?

14-17 A study of accounts receivable at the A&W Depart- ment Store indicates that bills are current, 1 month overdue, 2 months overdue, written off as bad debts, or paid in full. Of those that are current, 80% are paid that month, and the rest become 1 month overdue. Of the 1 month-overdue bills, 90% are paid, and the rest become 2 months overdue. Those that are 2 months overdue will either be paid (85%) or be listed as bad debts. If the sales each month average $150,000,

determine how much the company expects to receive of this amount. How much will become bad debts?

14-18 The cellular phone industry is very competitive. Two companies in the greater Lubbock area, Horizon and Local Cellular, are constantly battling each other in an attempt to control the market. Each company has a 1-year service agreement. At the end of each year, some customers will renew, while some will switch to the other company. Horizon customers tend to be loyal, and 80% renew, while 20% switch. About 70% of the Local Cellular customers renew, and about 30% switch to Horizon. If there are currently 100,000 Horizon customers and 80,000 Local Cel- lular customers, how many would we expect each company to have next year?

14-19 The personal computer industry is very fast moving, and technology provides motivation for customers to upgrade with new computers every few years. Brand loyalty is very important, and companies try to do things to keep their customers happy. How- ever, some current customers will switch to a dif- ferent company. Three particular brands—Doorway, Bell, and Kumpaq—hold the major shares of the market. People who own Doorway computers will buy another Doorway 80% of the time, while the rest will switch to the other companies in equal pro- portions. Owners of Bell computers will buy Bell again 90% of the time, while 5% will buy Door- way and 5% will buy Kumpaq. About 70% of the Kumpaq owners will make Kumpaq their next pur- chase while 20% will buy Doorway and the rest will buy Bell. If each brand currently has 200,000 customers who plan to buy a new computer in the next year, how many computers of each type will be purchased?

14-20 In Section 14.6, we investigated an accounts receiv- able problem. How would the paid category and the bad debt category change with the following matrix of transition probabilities?

P = D1 0 0 00 1 0 0 0.7 0 0.2 0.1

0.4 0.2 0.2 0.2

T 14-21 Professor Green gives 2-month computer program-

ming courses during the summer term. Students must pass a number of exams to pass the course, and each student is given three chances to take the exams. The following states describe the possible situations that could occur:

1. State 1: pass all of the exams and pass the course

2. State 2: do not pass all of the exams by the third attempt and flunk the course

3. State 3: fail an exam in the first attempt 4. State 4: fail an exam in the second attempt

M14_REND3161_13_AIE_C14.indd 520 27/10/16 2:26 PM

 521 disCUssion qUEsTions And PRoblEMs  521

After observing several classes, Professor Green was able to obtain the following matrix of transition probabilities:

P = D1 0 0 00 1 0 0 0.6 0 0.1 0.3

0.3 0.3 0.2 0.2

T At the present time, there are 50 students who did

not pass all exams on the first attempt, and there are 30 students who did not pass all remaining exams on the second attempt. How many students in these two groups will pass the course, and how many will fail the course?

14-22 Hicourt Industries is a commercial printing out- fit in a medium-sized town in central Florida. Its only competitors are the Printing House and Gandy Printers. Last month, Hicourt Industries had ap- proximately 30% of the market for the printing busi- ness in the area. The Printing House had 50% of the market, and Gandy Printers had 20% of the market. The association of printers, a locally run associa- tion, had recently determined how well these three printers and smaller printing operations not involved in the commercial market were able to retain their customer base. Hicourt was the most successful in keeping its customers. Eighty percent of its custom- ers for any one month remained customers for the next month. The Printing House, on the other hand, had only a 70% retention rate. Gandy Printers was in the worst condition. Only 60% of the custom- ers for any one month remained with the firm. In 1 month, the market share had significantly changed. This was very exciting to George Hicourt, president of Hicourt Industries. This month, Hicourt Industries was able to obtain a 38% market share. The Print- ing House, on the other hand, lost market share. This month, it only had 42% of the market share. Gandy Printers remained the same; it kept its 20% of the market. Just looking at market share, George con- cluded that he was able to take 8% per month away from the Printing House. George estimated that in a few short months, he could basically run the Print- ing House out of business. His hope was to capture 80% of the total market, representing his original 30% along with the 50% share that the Printing House started off with. Will George be able to reach his goal? What do you think the long-term market shares will be for these three commercial printing operations? Will Hicourt Industries be able to run the Printing House completely out of business?

14-23 John Jones of Bayside Laundry has been providing cleaning and linen service for rental condominiums on the Gulf Coast for over 10 years. Currently, John is servicing 26 condominium developments. John’s two major competitors are Cleanco, which currently services 15 condominium developments, and Beach

Services, which performs laundry and cleaning ser- vices for 11 condominium developments.

Recently, John contacted Bay Bank about a loan to expand his business operations. To justify the loan, John has kept detailed records of his custom- ers and the customers that he received from his two major competitors. During the past year, he was able to keep 18 of his original 26 customers. During the same period, he was able to get 1 new customer from Cleanco and 2 new customers from Beach Services. Unfortunately, John lost 6 of his original customers to Cleanco and 2 of his original customers to Beach Services during the same year. John has learned that Cleanco has kept 80% of its current customers. He also knows that Beach Services will keep at least 50% of its customers. For John to get the loan from Bay Bank, he needs to show the loan officer that he will maintain an adequate share of the market. The officers of Bay Bank are concerned about the recent trends for market share, and they have decided not to give John a loan unless he will keep at least 35% of the market share in the long run. What types of equi- librium market shares can John expect? If you were an officer of Bay Bank, would you give John a loan?

14-24 Set up both the vector of state probabilities and the matrix of transition probabilities given the following information: • Store 1 currently has 40% of the market; store 2

currently has 60% of the market. • In each period, store 1 customers have an 80%

chance of returning and a 20% chance of switch- ing to store 2.

• In each period, store 2 customers have a 90% chance of returning and a 10% chance of switch- ing to store 1.

14-25 Find p122 for Problem 14-24. 14-26 Find the equilibrium conditions for Problem 14-24.

Explain what it means. 14-27 As a result of a recent survey of students at the Uni-

versity of South Wisconsin, it was determined that the university-owned bookstore currently has 40% of the market. (See Problem 14-14.) The other three bookstores—Bill’s, College, and Battle’s—split the remaining initial market share equally. Given these initial market shares and the same state probabilities, what are the market shares for the next period? What impact do the initial market shares have on each store for the next period? What is the impact on the steady-state market shares?

14-28 Sandy Sprunger is part owner in one of the largest quick-oil-change operations for a medium-sized city in the Midwest. Currently, the firm has 60% of the market. There are a total of 10 quick-lubri- cation shops in the area. After performing some basic marketing research, Sandy has been able to capture the initial probabilities, or market shares, along with the matrix of transition, which represents

M14_REND3161_13_AIE_C14.indd 521 27/10/16 2:26 PM

522  CHAPTER 14 • MARkov AnAlysis

probabilities that customers will switch from one quick-lubrication shop to another. These values are shown in the table above.

Initial probabilities, or market share, for shops 1 through 10 are 0.6, 0.1, 0.1, 0.1, 0.05, 0.01, 0.01, 0.01, 0.01, and 0.01.

(a) Given these data, determine market shares for the next period for each of the 10 shops.

(b) What are the equilibrium market shares? (c) Sandy believes that the original estimates for

market shares were wrong. She believes that shop 1 has 40% of the market and shop 2 has 30%. All other values are the same. If this is the case, what is the impact on market shares for next-period and equilibrium shares?

(d) A marketing consultant believes that shop 1 has tremendous appeal. She believes that this shop will retain 99% of its current market share; 1% may switch to shop 2. If the consultant is cor- rect, will shop 1 have 90% of the market in the long run?

14-29 During a recent trip to her favorite restaurant, Sandy (owner of shop 1) met Chris Talley (owner of shop 7)

(see Problem 14-28). After an enjoyable lunch, Sandy and Chris had a heated discussion about mar- ket share for the quick-oil-change operations in their city. Here is their conversation:

Sandy: My operation is so superior that after some- one changes oil at one of my shops, they will never do business with anyone else. On second thought,

maybe 1 person out of 100 will try your shop after visiting one of my shops. In a month, I will have 99% of the market, and you will have 1% of the market.

Chris: You have it completely reversed. In a month, I will have 99% of the market, and you will only have 1% of the market. In fact, I will treat you to a meal at a restaurant of your choice if you are right. If I am right, you will treat me to one of those big steaks at David’s Steak House. Do we have a deal?

Sandy: Yes! Get your checkbook or your credit card. You will have the privilege of paying for two very expensive meals at Anthony’s Seafood Restaurant. (a) Assume that Sandy is correct about customers

visiting one of her quick-oil-change shops. Will she win the bet with Chris?

(b) Assume that Chris is correct about customers visiting one of his quick-oil-change shops. Will he win the bet?

(c) Describe what will happen if both Sandy and Chris are correct about customers visiting their quick-oil-change operations.

14-30 The first quick-oil-change store in Problem 14-28 retains 73% of its market share. This represents a probability of 0.73 in the first row and first column of the matrix of transition probabilities. The other probability values in the first row are equally distrib- uted across the other stores (that is, 3% each). What impact does this have on the steady-state market shares for the quick-oil-change stores?

Data for Problem 14-28

TO

FROM 1 2 3 4 5 6 7 8 9 10

1 0.60 0.10 0.10 0.10 0.05 0.01 0.01 0.01 0.01 0.01

2 0.01 0.80 0.01 0.01 0.01 0.10 0.01 0.01 0.01 0.03

3 0.01 0.01 0.70 0.01 0.01 0.10 0.01 0.05 0.05 0.05

4 0.01 0.01 0.01 0.90 0.01 0.01 0.01 0.01 0.01 0.02

5 0.01 0.01 0.01 0.10 0.80 0.01 0.03 0.01 0.01 0.01

6 0.01 0.01 0.01 0.01 0.01 0.91 0.01 0.01 0.01 0.01

7 0.01 0.01 0.01 0.01 0.01 0.10 0.70 0.01 0.10 0.04

8 0.01 0.01 0.01 0.01 0.01 0.10 0.03 0.80 0.01 0.01

9 0.01 0.01 0.01 0.01 0.01 0.10 0.01 0.10 0.70 0.04

10 0.01 0.01 0.01 0.01 0.01 0.10 0.10 0.05 0.00 0.70

M14_REND3161_13_AIE_C14.indd 522 27/10/16 2:26 PM

 523 CAsE sTUdy  523

14-31 The following digraph represents the changes in weather from one day to the next in Erie, Pennsylvania.

Sunny Cloudy

0.6

0.3

0.7 0.4

Determine the associated transition matrix and the probability that it will be cloudy in 3 days given that it is cloudy today.

14-32 The following digraph represents the changes in weather from one day to the next in Lowell, Massachusetts.

Sunny

Rainy

Cloudy

0.2

0.3

0.5

0.4

0.1

0.6 0.4

0.5

Determine the associated transition matrix and the overall percentage of sunny days.

14-33 Lulu is a surfer who lives in Conway, South Carolina. Through experience, she has determined the transi- tion probabilities for surf conditions from any one day to the next at nearby North Myrtle Beach:

GOOD FAIR POOR

Good 0.9 0.05 0.05

Fair 0.7 0.2 0.1

Poor 0.5 0.3 0.2

Determine the equilibrium probabilities of good, fair, and poor surf conditions. What does this tell you about surfing conditions in general at North Myrtle Beach?

14-34 The hit Broadway musical Jefferson is playing at the Richard Rodgers Theatre. Its producers have determined that if it is sold out on any one night, then there is a 96% chance that it will be sold out on the next night. Moreover, if it is not sold out on any one night, then there is an 80% chance that it will be sold out on the next night. Determine the associated tran- sition probabilities matrix and the equilibrium prob- ability of selling out on any particular night.

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 14-35 to 14-38.

Internet Homework Problems

Jim Fox, an executive for Rentall Trucks, could not believe it. He had hired one of the town’s best law firms, Folley, Smith, and Christensen. Their fee for drawing up the legal contracts was over $50,000. Folley, Smith, and Christensen had omitted one important provision from the contracts, and this blunder would more than likely cost Rentall Trucks millions of dollars. For the hundredth time, Jim carefully reconstructed the situa- tion and pondered the inevitable.

Rentall Trucks was started by Robert (Bob) Renton more than 10 years ago. It specialized in renting trucks to businesses and private individuals. The company prospered, and Bob in- creased his net worth by millions of dollars. Bob was a legend

in the rental business and was known all over the world for his keen business abilities.

Only a year and a half ago, some of the executives of Rentall and some additional outside investors offered to buy Rentall from Bob. Bob was close to retirement, and the offer was unbelievable. His children and their children would be able to live in high style off the proceeds of the sale. Folley, Smith, and Christensen developed the contracts for the executives of Rentall and other investors, and the sale was made.

Being a perfectionist, it was only a matter of time until Bob was marching down to the Rentall headquarters, telling everyone the mistakes that Rentall was making and how to solve

Case Study

Rentall Trucks

M14_REND3161_13_AIE_C14.indd 523 27/10/16 2:26 PM

524  CHAPTER 14 • MARkov AnAlysis

some of their problems. Pete Rosen, president of Rentall, be- came extremely angry about Bob’s constant interference, and in a brief 10-minute meeting, Pete told Bob never to enter the Rentall offices again. It was at this time that Bob decided to re- read the contracts, and it was also at this time that Bob and his lawyer discovered that there was no clause in the contracts that prevented Bob from competing directly with Rentall.

The brief 10-minute meeting with Pete Rosen was the beginning of Rentran. In less than 6 months, Bob Renton had lured some of the key executives away from Rentall and into his new business, Rentran, which would compete directly with Rentall Trucks in every way. After a few months of operation, Bob estimated that Rentran had about 5% of the total national market for truck rentals. Rentall had about 80% of the market, and another company, National Rentals, had the remaining 15% of the market.

Rentall’s Jim Fox was in total shock. In a few months, Rentran had already captured 5% of the total market. At this rate, Rentran might completely dominate the market in a few short years. Pete Rosen even wondered if Rentall could main- tain 50% of the market in the long run. As a result of these concerns, Pete hired a marketing research firm that analyzed a random sample of truck rental customers. The sample con- sisted of 1,000 existing or potential customers. The marketing research firm was very careful to make sure that the sample represented the true market conditions. The sample, taken in August, consisted of 800 customers of Rentall, 60 customers of Rentran, and 140 customers of National. The same sample was then analyzed the next month to determine the customers’ pro- pensity to switch companies. Of the original Rentall customers, 200 switched to Rentran, and 80 switched to National. Rentran was able to retain 51 of their original customers. Three custom- ers switched to Rentall, and 6 customers switched to National. Finally, 14 customers switched from National to Rentall, and 35 customers switched from National to Rentran.

The board of directors meeting was only 2 weeks away, and there would be some difficult questions to answer: What hap- pened, and what can be done about Rentran? In Jim Fox’s opin- ion, nothing could be done about the costly omission made by Folley, Smith, and Christensen. The only solution was to take immediate corrective action that would curb Rentran’s ability to lure customers away from Rentall.

After a careful analysis of Rentran, Rentall, and the truck rental business in general, Jim concluded that immediate changes would be needed in three areas: rental policy, adver- tising, and product line. Regarding rental policy, a number of changes were needed to make truck rental both easier and faster. Rentall could implement many of the techniques used by Hertz and other car rental agencies. In addition, changes in the prod- uct line were needed. Rentall’s smaller trucks had to be more comfortable and easier to drive. Automatic transmissions, com- fortable bucket seats, air conditioners, smartphone connectiv- ity, and cruise control should be included. Although expensive and difficult to maintain, these items could make a significant difference in market shares. Finally, Jim knew that additional advertising was needed. The advertising had to be immediate and aggressive. Television and journal advertising had to be in- creased, and a good advertising company was needed. If these new changes were implemented now, there would be a good chance that Rentall would be able to maintain close to its 80% of the market. To confirm Jim’s perceptions, the same market- ing research firm was employed to analyze the effect of these changes, using the same sample of 1,000 customers.

The marketing research firm, Meyers Marketing Research, Inc., performed a pilot test on the sample of 1,000 customers. The results of the analysis revealed that Rentall would only lose 100 of its original customers to Rentran and 20 to National if the new policies were implemented. In addition, Rentall would pick up customers from both Rentran and National. It was es- timated that Rentall would now get 9 customers from Rentran and 28 customers from National.

Discussion Questions 1. What will the market shares be in 1 month if these

changes are made? If no changes are made? 2. What will the market shares be in 3 months with the

changes? 3. If market conditions remain the same, what market

share would Rentall have in the long run after making the changes? How does this compare with the market share that would result if the changes were not made?

See our Internet home page, at www.pearsonhighered.com/render, for these additional case studies: (1) St. Pierre Salt Company: This case involves the selection of centrifuges that are used to

separate recrystallized salt from brine solution. (2) University of Texas–Austin: This case involves doctoral students at different stages of their

graduate programs.

Internet Case Studies

M14_REND3161_13_AIE_C14.indd 524 27/10/16 2:26 PM

 525 APPEndix 14.1: MARkov AnAlysis WiTH qM FoR WindoWs  525

Bibliography

Aviv, Yossi, and Amit Pazgal. “A Partially Observed Markov Decision Process for Dynamic Pricing,” Management Science 51, 9 (September 2005): 1400–1416.

Çelikyurt, U., and S. Özekici. “Multiperiod Portfolio Optimization Models in Stochastic Markets Using the Mean–Variance Approach,” European Journal of Operational Research 179, 1 (2007): 186–202.

Deslauriers, Alexandre, Pierre L’Ecuyer, Juta Pichitlamken, Armann In- golfsson, and Athanassios N. Avramidis. “Markov Chain Models of a Telephone Call Center with Call Blending,” Computers & Operations Research 34, 6 (2007): 1616–1645.

Einstein, A. “Über die von der molekularkinetischen Theorie der Wärme geforderte Bewegung von in ruhenden Flüssigkeiten suspendierten Teilchen,” Annalen der Physik 322, 8 (1905): 549–560 (German).

Freedman, D. Markov Chains. San Francisco: Holden-Day, Inc., 1971.

Juneja, Sandeep, and Perwez Shahabuddin. “Fast Simulation of Markov Chains with Small Transition Probabilities,” Management Science 47, 4 (April 2001): 547–562.

Lim, Gino J., and Sumeet S Desai. “Markov Decision Process Approach for Multiple Objective Hazardous Material Transportation Route Selection

Problem,” International Journal of Operational Research 7, 4 (2010): 506–529.

Markov, A. A. “Investigation of a Noteworthy Case of Dependent Trials,” Izv. Ros. Akad. Nauk 1 (1907) (Russian).

Matalycki, M. A., and A. V. Pankow. “Research of Markov Queuing Network with Central System and Incomes,” Informatyka Teoretyczna i Stosowana 4, 7 (2004): 23–32.

Park, Yonil, and John L. Spouge. “Searching for Multiple Words in a Mar- kov Sequence,” INFORMS Journal on Computing 16, 4 (Fall 2004): 341–347.

Renault, Jérôme. “The Value of Markov Chain Games with Lack of Informa- tion on One Side,” Mathematics of Operations Research 31, 3 (August 2006): 490–512.

Tsao, H.-Y., P.-C. Lin, L. Pitt, and C. Campbell. “The Impact of Loyalty and Promotion Effects on Retention Rate,” Journal of the Operational Research Society 60, 5 (2009): 646–651.

Zhu, Quanxin, and Xianping Guo, “Markov Decision Processes with Variance Minimization: A New Condition and Approach,” Stochastic Analysis and Applications 25, 3 (2007): 577–592.

Appendix 14.1: Markov Analysis with QM for Windows

Markov analysis can be used for a variety of practical prob- lems, including determining market shares and equilibrium conditions and tracing patients through a medical system. The grocery store example is used to show how Markov analy- sis can be used to determine future market-share conditions.

Programs 14.1A and 14.1B reveal how QM for Windows is used to compute market share and equilibrium conditions. Note that the initial conditions and the ending market shares (prob- abilities) are also displayed.

Input the initial state probabilities here.

Input the number of transitions you want.

This is a matrix of transitions probabilities.

PROGRAM 14.1A qM for Windows input screen for Market share Example

These are the market shares after three periods.

These are the steady- state probabilities.

PROGRAM 14.1B qM for Windows output screen for Market share Example

M14_REND3161_13_AIE_C14.indd 525 27/10/16 2:26 PM

526  CHAPTER 14 • MARkov AnAlysis

If they are known, input the initial probabilities here.

Input the number of transitions here.

Click Solve to find the solution.

Input the transition probabilities here.

PROGRAM 14.2A qM for Windows input screen for Absorbing state Example

To see these matrices, select Window and then select Matrices.

PROGRAM 14.2B qM for Windows output screen for Absorbing state Example

Appendix 14.2: Markov Analysis with Excel

Performing the Markov analysis matrix operations is very easy with Excel, although the input process is different from most Excel operations. The two Excel functions that are most helpful with matrices are MMULT for matrix multiplication and MIN- VERSE for finding the inverse of the matrix. However, special procedures are used when these are entered in the spreadsheet. Matrix addition and subtraction are also easy in Excel using special procedures.

Using Excel to Predict Future Market Shares In using Markov analysis to predict future market shares or future states, matrices are multiplied. To multiply matrices in Excel, we use MMULT as follows:

1. Highlight all the cells that will contain the resulting matrix. 2. Type = MMULT(matrix1, matrix2), where matrix 1 and

matrix 2 are the cell ranges for the two matrices being multiplied.

Absorbing state analysis is also discussed in this chapter using a bill-paying example. Programs 14.2A and 14.2B show

how QM for Windows is used to compute the amount paid and the amount of bad debt using absorbing state analysis.

M14_REND3161_13_AIE_C14.indd 526 27/10/16 2:26 PM

APPEndix 14.2: MARkov AnAlysis WiTH ExCEl  527

3. Instead of just pressing Enter, hold down the Ctrl and Shift keys and then press Enter.

Pressing Ctrl + Shift + Enter is used to indicate that a matrix operation is being performed so that all cells in the matrix are changed accordingly.

Program 14.3A shows the formulas for the grocery store example from Section 14.2. We have entered the time period in column A for reference only, as we will be computing the state probabilities through time period 6. The state probabilities (cells B6 through D6) and the matrix of transition probabilities (cells E6 through G8) are entered as shown. We then use matrix

multiplication to find the state probabilities for the next period. Highlight cells B7, C7, and D7 (this is where the resulting ma- trix will be) and type = MMULT(B6:D6,E6:G8), as shown in the table. Then press Ctrl + Shift + Enter (all at one time), and this formula is put in each of the three cells that were high- lighted. When you have done this, Excel places { } around this formula in the box at the top of the screen (not shown). We then copy cells B7, C7, and D7 to rows 8 through 12, as shown. Pro- gram 14.3B shows the result and the state probabilities for the next six time periods.

Enter the current state probabilities in cells B6, C6, and D6.

The future state probabilities are calculated in rows 7 to 12.

This is the matrix of transition probabilities.

PROGRAM 14.3A Excel input and Formulas for Grocery store Example

PROGRAM 14.3B Excel output for Grocery store Example

Using Excel to Find the Fundamental Matrix and Absorbing States Excel can be used to find the fundamental matrix that is used to predict future conditions when absorbing states exist. The MINVERSE function is used in the accounts receivable exam- ple from Section 14.6 of this chapter. Program 14.4A shows the formulas, and Program 14.4B provides the results. Remember

that the entire range of the matrix (D12 through E13) is high- lighted before the MINVERSE function is entered. Also remember to press Ctrl + Shift + Enter all at once.

Matrix addition and subtraction can be handled in a fash- ion similar to the methods just described. In Program 14.4A, the I – B matrix was computed using a matrix method. First, we highlighted cells D9 through E10 (where the result is

M14_REND3161_13_AIE_C14.indd 527 27/10/16 2:26 PM

528  CHAPTER 14 • MARkov AnAlysis

to be). Then we typed the formula seen in these cells and pressed Ctrl + Shift + Enter (all at once), causing this formula

to be entered in each of these cells. Excel then computes the appropriate values, as shown in Program 14.4B.

This is the partitioned matrix of transition probabilities from Section 14.6.

This calculates the fundamental matrix F with the MINVERSE function.

This computes the FA matrix with the MMULT function.

PROGRAM 14.4A Excel input and Formulas for the Accounts Receivable Example

PROGRAM 14.4B Excel output for the Accounts Receivable Example

M14_REND3161_13_AIE_C14.indd 528 27/10/16 2:26 PM

 529

15.3 Develop two types of variable control charts: x and R

15.4 Develop two types of attribute control charts: p and c.

15.1 Define the quality of a product or service.

15.2 Understand the basic theoretical underpinnings of statistical quality control, including the central limit theorem, and interpret whether or not a process is in control.

After completing this chapter, students will be able to:

Statistical Quality Control

LEARNING OBJECTIVES

15 CHAPTER

F or almost every product or service, there is more than one organization trying to make a sale. Price may be a major issue in whether a sale is made or lost, but another factor is quality. In fact, quality is often the major issue, and poor quality can be very expensive for both the producing firm and the customer.

Consequently, firms employ quality management tactics. Quality management—or as it is more commonly called, quality control (QC)—is critical throughout the organization. One of the manager’s major roles is to ensure that his or her firm can deliver a quality product at the right place, at the right time, and at the right price. Quality is not just of concern for manufactured products either; it is also important in services, from banking to hospital care to education.

We begin this chapter with an attempt to define just what quality really is. Then we deal with the most important statistical methodology for quality management: statistical process control (SPC). SPC is the application of the statistical tools we discussed in Chapter 2 to control the processes that result in products or services.

15.1 Defining Quality and TQM

To some people, a high-quality product is one that is stronger, will last longer, is built heavier, and is, in general, more durable than other products. In some cases, this is a good definition of a quality product—but not always. A good circuit breaker, for example, is not one that lasts longer during periods of high current or voltage. So the quality of a product or service is the degree to which the product or service meets specifications. Increasingly, definitions of quality include an added emphasis on meeting the customer’s needs. As you can see in Table 15.1, the first and second definitions are similar to ours.

Statistical process control uses statistical and probability tools to help control processes and produce consistent goods and services.

The quality of a product or service is the degree to which the product or service meets specifications.

M15_REND3161_13_AIE_C15.indd 529 28/10/16 12:41 PM

530  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

Total quality management (TQM) refers to a quality emphasis that encompasses the en- tire organization, from supplier to customer. TQM emphasizes a commitment by management to have a companywide drive toward excellence in all aspects of the products and services that are important to the customer. Meeting the customer’s expectations requires an emphasis on TQM if the firm is to compete as a leader in world markets.

This emphasis on quality means that the company will seek continuous improvement in every aspect of the delivery of products and services.

Total quality management encompasses the whole organization.

TABLE 15.1 Several Definitions of Quality

“Quality is the degree to which a specific product conforms to a design or specification.”

H. L. Gilmore. “Product Conformance Cost,” Quality Progress 7, 6 (June 1974): 16. © 1974 American Society for Quality.

“Quality is the totality of features and characteristics of a product or service that bears on its ability to satisfy stated or implied needs.”

Ross Johnson and William O. Winchell. Production and Quality. Milwaukee, WI: American Society of Quality Control, 1989, p. 2. © 1989 American Society for Quality.

“Quality is fitness for use.”

J. M. Juran, ed. Quality Control Handbook, 3rd ed. New York: McGraw-Hill, 1974, p. 2. © 1974 McGraw-Hill.

“Quality is defined by the customer; customers want products and services that, throughout their lives, meet customers’ needs and expectations at a cost that represents value.”

Ford’s definition, as presented in William W. Scherkenbach. Deming’s Road to Continual Improvement. Knoxville, TN: SPC Press, 1991, p. 161. © 1991 SPC Press.

“Even though quality cannot be defined, you know what it is.”

R. M. Pirsig. Zen and the Art of Motorcycle Maintenance. New York: Bantam Books, 1974, p. 213. © 1974 Bantam Books.

In the early nineteenth century, an individual skilled artisan started and finished a whole product. With the Industrial Revolu- tion and the factory system, semiskilled workers, each making a small portion of the final product, became common. With this, responsibility for the quality of the final product tended to shift to supervisors, and pride of workmanship declined.

As organizations became larger in the twentieth century, in- spection became more technical and organized. Inspectors were often grouped together; their job was to make sure that bad lots were not shipped to customers. Starting in the 1920s, major sta- tistical QC tools were developed. W. Shewhart introduced control charts in 1924, and in 1930, H. F. Dodge and H. G. Romig designed acceptance sampling tables. Also at that time, the important role of QC in all areas of the company’s performance became recognized.

During and after World War II, the importance of qual- ity grew, often with the encouragement of the U.S. govern- ment. Companies recognized that more than just inspection was needed to make a quality product. Quality needed to be built into the production process.

After World War II, an American, W. Edwards Deming, went to Japan to teach statistical QC concepts to the devastated Jap- anese manufacturing sector. A second pioneer, J. M. Juran, fol- lowed Deming to Japan, stressing top management support and

involvement in the quality battle. In 1961, A. V. Feigenbaum wrote his classic book Total Quality Control, which delivered a fundamental message: Make it right the first time! In 1979, Philip Crosby published Quality Is Free, stressing the need for manage- ment and employee commitment to the battle against poor qual- ity. In 1988, the U.S. government presented its first awards for quality improvement. These are known as the Malcolm Baldrige National Quality Awards.

A method of quality management called Six Sigma was devel- oped in the electronics industry. The goal of Six Sigma is continu- ous improvement in performance to reduce and eliminate defects. Technically, to achieve Six Sigma quality, there would have to be fewer than 3.4 defects per million opportunities. This approach to quality has been credited with achieving significant cost savings for a number of companies. General Electric estimated savings of $12 billion over a 5-year period, and other firms have reported savings in the hundreds of millions of dollars.

Today, companies strive to be ISO 9000 certified, as this is an international quality standard that is recognized worldwide. ISO 9000 was developed by the International Organization for Stan- dardization (ISO), the world’s largest developer and publisher of international standards.

Source: Trevor S. Hale.

How Quality Control Has EvolvedHISTORY

M15_REND3161_13_AIE_C15.indd 530 28/10/16 12:41 PM

15.2 STATiSTiCAl PRoCESS ConTRol  531

15.2 Statistical Process Control

Statistical process control involves establishing standards, monitoring standards, taking mea- surements, and taking corrective action as a product or service is being produced. Samples of process outputs are examined; if they are within acceptable limits, the process is permitted to continue. If they fall outside certain specific ranges, the process is stopped and, typically, the as- signable cause is located and removed.

Control charts are graphs that show upper and lower limits for the process we want to con- trol. A control chart is a graphic presentation of data over time. Control charts are constructed in such a way that new data can quickly be compared with past performance. Upper and lower limits in a control chart can be in units of temperature, pressure, weight, length, and so on. We take samples of the process output and plot the averages of these samples on a chart that has the limits on it.

Figure 15.1 graphically reveals the useful information that can be portrayed in control charts. When the averages of the samples fall within the upper and lower control limits and no discernible pattern is present, the process is said to be in control; otherwise, the process is out of control or out of adjustment.

Variability in the Process All processes are subject to a certain degree of variability. Walter Shewhart of Bell Laboratories, while studying process data in the 1920s, made the distinction between the common and special causes of variation. The key is keeping variations under control. So we now look at how to build control charts that help managers and workers develop a process that is capable of producing within established limits.

BUILDING CONTROL CHARTS When building control charts, averages of small samples (often of five items or parts) are used, as opposed to data on individual parts. Individual pieces tend to be too erratic to make trends quickly visible. The purpose of control charts is to help distinguish be- tween natural variations and assignable variations.

Statistical process control helps set standards. It can also monitor, measure, and correct quality problems.

A control chart is a graphic way of presenting data over time.

Upper Control Limit

Target

Lower Control Limit

Upper Control

Target

Lower Control Limit

Upper Control

Target

Lower Control Limit Run of 5 below central line. Investigate for cause.

Trends in either direction 5 plots. Investigate for cause.

Erratic behavior. Investigate for cause.

Two plots near upper control. Investigate for cause.

Two plots near lower control. Investigate for cause.

Run of 5 above central line. Investigate for cause.

Normal behavior. One plot out above. Investigate for cause.

One plot out below. Investigate for cause.

FIGURE 15.1 Patterns to look for in Control Charts (Source: Bertrand L. Hansen, Quality Control: Theory and Applications, © 1964. Printed and electronically repro- duced by permission of Pearson Edu- cation, Inc., Upper Saddle River, New Jersey.)

M15_REND3161_13_AIE_C15.indd 531 28/10/16 12:41 PM

532  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

NATURAL VARIATIONS Natural variations affect almost every production or service process and are to be expected. These variations are random and uncontrollable. Natural variations are the many sources of variation within a process that is in statistical control. They behave like a constant system of chance causes. Although individual measured values are all different, as a group they form a pattern that can be described as a distribution. When these distributions are normal, they are characterized by two parameters:

1. Mean, m (the measure of central tendency—in this case, the average value) 2. Standard deviation, s (variation, an indication of the average amount by which the values

differ from the mean)

As long as the distribution (output precision) remains within specified limits, the process is said to be “in control,” and the modest variations are tolerated.

ASSIGNABLE VARIATIONS When a process is not in control, we must detect and eliminate special (assignable) causes of variation. These variations are not random and can be controlled when the cause of the variation is determined. Factors such as machine wear, misadjusted equipment, fatigued or untrained workers, or new batches of raw material are all potential sources of assign- able variations. Control charts such as those illustrated in Figure 15.1 help the manager pinpoint where a problem may lie.

The ability of a process to operate within statistical control is determined by the total varia- tion that comes from natural causes—the minimum variation that can be achieved after all as- signable causes have been eliminated. The objective of a process control system, then, is to provide a statistical signal when assignable causes of variation are present. Such a signal can quicken appropriate action to eliminate assignable causes.

15.3 Control Charts for Variables

Control charts for the mean, x, and the range, R, are used to monitor processes that are measured in continuous units. Examples of these would be weight, height, and volume. The x-chart (x-bar chart) tells us whether changes have occurred in the central tendency of a process. This might be due to such factors as tool wear, a gradual increase in temperature, a different method used on the second shift, or new and stronger materials. The R-chart values indicate that a gain or loss in uniformity has occurred. Such a change might be due to worn bearings, a loose tool part, an erratic flow of lubricants to a machine, or sloppiness on the part of a machine operator. The two types of charts go hand in hand when monitoring variables.

Bank of America Uses Statistics to Combat Pecuniary Corruption

Banks and similar financial institutions have good reason to help law enforcement fight fiscal improprieties. Debit card fraud alone costs the banking industry over $2.75 billion annually! In their fight against fraud, analysts at Bank of America use statisti- cal outlier analysis to help detect suspicious fiscal activities. Bank of America specifically targets money laundering and retail bank- ing fraud in its analysis. The company tracks characteristics such as where, when, and how much money is involved in each trans- action for every customer. Then it performs statistical analyses to see if the activity falls within usual activity boundaries for that particular customer. For you as a customer, that means nothing more than that the bank knows how much money you typically withdraw from an ATM and which ATM you normally use.

The bank analysts are on the lookout for outliers, which are unusual events that have a very small probability of occurring. For example, if you normally use one particular ATM and then use a different ATM, the transaction at the unusual location may raise a small flag, but the transaction would likely proceed without inter- ference. However, if you try to cash a very large third-party check at an out-of-state location, several flags will be raised, as this is very unusual behavior for you. The teller may require several forms of identification and then get approval from the branch manager before completing the transaction.

Source: Based on A. Sudjianto, S. Nair, M. Yuan, A. Zhang, D. Ker, and F. Cela-Díaz, “Statistical Methods for Fighting Financial Crimes,” Technometrics 52, 1 (2010): 5–19, © Trevor S. Hale.

IN ACTION

Natural variations are sources of variation in a process that is statistically in control.

Assignable variations in a process can be traced to a specific problem.

R-charts measure the range between the biggest (or heaviest) and smallest (or lightest) items in a random sample.

x-charts measure the central tendency of a process.

M15_REND3161_13_AIE_C15.indd 532 28/10/16 12:41 PM

15.3 ConTRol CHARTS FoR VARiABlES  533

The Central Limit Theorem The statistical foundation for x-charts is the central limit theorem. In general terms, this theorem states that, regardless of the distribution of the population of all parts or services, the distribution of xs (each of which is a mean of a sample drawn from the population) will tend to follow a normal curve as the sample size grows large. Fortunately, even if n is fairly small (say, 4 or 5), the distribution of the averages will still roughly follow a normal curve. The theorem also states that (1) the mean of the distribution of the x-s (called m

x) will equal the mean of the overall population (called m) and (2) the standard deviation of the sampling distribution, s

x, will be the population deviation, sx, divided by the square root of the sample size, n. In other words,

mx = m and sx = sx1n

Although there may be times when we may know mx (and m), often we must estimate this with the average of all the sample means (written as x).

Figure 15.2 shows three possible population distributions, each with its own mean, m, and standard deviation, sx. If a series of random samples (x1, x2, x3, x4, and so on), each of size n, is drawn from any one of these, the resulting distribution of xis will appear as in the bottom graph of that figure. Because this is a normal distribution (as discussed in Chapter 2), we can state that

1. 99.7% of the time, the sample averages will fall within{3sx of the population mean if the process has only random variations.

2. 95.5% of the time, the sample averages will fall within{2sx of the population mean if the process has only random variations.

If a point on the control chart falls outside the {3sx control limits, we are 99.7% sure that the process has changed. This is the theory behind control charts.

The central limit theorem says that the distribution of sample means will be approximately normally distributed.

Some Population Distributions

Normal Beta Uniform

Sampling Distribution of Sample Means (Always Normal)

m 5 (mean) sx 5 S.D.

m 5 (mean) sx 5 S.D.

m 5 (mean) sx 5 S.D.

99.7% of all x fall within ;3sx

95.5% of all x fall within ;2sx

23sx 22sx 21sx 5 m (mean)

11sx 12sx 13sx

Standard error 5 sx 5 sx n

mx

FIGURE 15.2 Population and Sampling Distributions

M15_REND3161_13_AIE_C15.indd 533 28/10/16 12:41 PM

534  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

Setting x _ -Chart Limits

If we know through historical data the standard deviation of the process population, sx, we can set upper and lower control limits by these formulas:

Upper control limit 1UCL2 = x + zsx (15-1) Lower control limit 1LCL2 = x - zsx (15-2) where

x = mean of the sample means z = number of normal standard deviations (2 for 95.5% confidence, 3 for 99.7%) sx = standard deviation of the sampling distribution of the sample means =

sx1n BOX-FILLING EXAMPLE Let us say that a large production lot of boxes of cornflakes is sampled every hour. To set control limits that include 99.7% of the sample means, 36 boxes are ran- domly selected and weighed. The standard deviation of the overall population of boxes is estimated, through analysis of old records, to be 2 ounces. The average mean of all samples

Defining the Problem The billing process at a medium-sized hospital were taking far too long. The long cycle times from care performed to payment received were identified as the root cause of missed payments, upset patients, and headaches for the accounts receivable department of the hospital.

Developing a Model Hospital managers turned to quality control analytics to reduce the cycle times. In particular, they looked to a Six Sigma technique known as Define-Measure-Analyze-Improve-Control (DMAIC).

Acquiring Input Data A project team was formed, and the members began to work on the problem. They first modeled the “as- is” business process of patient billing with a flowchart. This allowed the team to see where potential bot- tlenecks in the process were. Average times for each task in the flowchart were captured and examined.

Developing a Solution Team members developed alternative processes for some existing ones (e.g., email instead of hard copy), eliminated some existing procedures (e.g., deleting unnecessary approval signatures on forms), and re- designed the entire process from care performed to payment received.

Testing the Solution A critical path analysis was performed on the “as-is” billing process, as well as the newly designed “to-be” billing process. This allowed the team members to test their solution alongside the existing process.

Analyzing the Results The critical path analysis also led the team to identify a task within the process (i.e., price acquisition) that had no immediate predecessors but was the cause of many long billing cycles. The team was able to “move” this task to the beginning of the process.

Implementing the Results Hospital management installed the new business process. The result was a billing process that was an en- tire month shorter and saved the hospital some 390,000 euros annually.

Source: Based on M. Schoonhoven, C. Lubbers, and R. J. M. M. Does, “Quality Quandaries: Shortening the Throughput Time of a Hospital’s Billing Process,” Quality Engineering 25 (2013): 188–193, © Trevor S. Hale.

MODELING IN THE REAL WORLD

Hospital Uses Quality Control Analytics to improve Business Process

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

M15_REND3161_13_AIE_C15.indd 534 28/10/16 12:41 PM

15.3 ConTRol CHARTS FoR VARiABlES  535

taken is 16 ounces. We therefore have x = 16 ounces, sx = 2 ounces, n = 36, and z = 3. The control limits are

UCLx = x + zsx = 16 + 3 a 2136 b = 16 + 1 = 17 ounces LCLx = x - zsx = 16 - 3 a 2136 b = 16 - 1 = 15 ounces

If the process standard deviation is not available or is difficult to compute, which is usually the case, these equations become impractical. In practice, the calculation of control limits is based on the average range rather than on standard deviations. We can use the equations

UCLx = x + A2R (15-3)

LCLx = x - A2R (15-4)

where

R = average of the samples A2 = value found in Table 15.2 (which assumes that z = 3) x = mean of the sample means

USING EXCEL QM FOR BOX-FILLING EXAMPLE The upper and lower limits for this example can be found using Excel QM, as shown in Program 15.1. From the Excel QM menu, select

Control chart limits can be found using the range rather than the standard deviation.

TABLE 15.2 Factors for Computing Control Chart limits When z = 3

SAMPLE SIZE, N MEAN FACTOR, A2 UPPER RANGE, D4 LOWER RANGE, D3 2 1.880 3.268 0

3 1.023 2.574 0

4 0.729 2.282 0

5 0.577 2.114 0

6 0.483 2.004 0

7 0.419 1.924 0.076

8 0.373 1.864 0.136

9 0.337 1.816 0.184

10 0.308 1.777 0.223

12 0.266 1.716 0.284

14 0.235 1.671 0.329

16 0.212 1.636 0.364

18 0.194 1.608 0.392

20 0.180 1.586 0.414

25 0.153 1.541 0.459

Source: Reprinted, with permission, from Special Technical Publication 15-C, “Quality Control of Materials,” pp. 63 and 72, © American Society for Testing and Materials International, 100 Barr Harbor Drive, West Conshochocken, PA 19428.

Enter the sample size, the standard deviation, and the mean.

The UCL and the LCL are displayed here.

PROGRAM 15.1 Excel QM Solution for Box-Filling Example

M15_REND3161_13_AIE_C15.indd 535 28/10/16 12:41 PM

536  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

Quality Control and specify the X-Bar and R Charts option. Enter the number of samples (1) and select Standard Deviation in the initialization window. When the spreadsheet is initialized, enter the sample size (36), the standard deviation (2), and the mean of the sample (16). The upper and lower limits are immediately displayed.

SUPER COLA EXAMPLE Super Cola bottles soft drinks labeled “net weight 16 ounces.” An overall process average of 16.01 ounces has been found by taking several batches of samples, in which each sample contained five bottles. The average range of the process is 0.25 ounce. We want to determine the upper and lower control limits for averages for this process.

Looking in Table 15.2 for a sample size of 5 in the mean factor A2 column, we find the num- ber 0.577. Thus, the upper and lower control chart limits are

UCLx = x + A2R = 16.01 + 10.577210.252 = 16.01 + 0.144 = 16.154

LCLx = x - A2R = 16.01 - 0.144 = 15.866

The upper control limit is 16.154, and the lower control limit is 15.866.

USING EXCEL QM FOR SUPER COLA EXAMPLE The upper and lower limits for this example can be found using Excel QM, as shown in Program 15.2. From the Excel QM menu, select Quality Control and specify the X-Bar and R Charts option. Enter the number of samples (1) and select Range in the initialization window. The sample size (5) can be entered in this initialization window or in the spreadsheet. When the spreadsheet is initialized, enter the range (0.25) and the mean of the sample (16.01). The upper and lower limits are immediately displayed.

Setting Range Chart Limits We just determined the upper and lower control limits for the process average. In addition to being concerned with the process average, managers are interested in the dispersion or variability. Even though the process average is under control, the variability of the process may not be. For example, something may have worked itself loose in a piece of equipment. As a result, the aver- age of the samples may remain the same, but the variation within the samples could be entirely too large, and the x-bar charts could be unreliable. For this reason, it is necessary to find a con- trol chart for ranges in order to monitor the process variability. The theory behind the control charts for ranges is the same as for the process average. Limits are established that contain{3 standard deviations of the distribution for the average range R. With a few simplifying assump- tions, we can set the upper and lower control limits for ranges:

UCLR = D4R (15-5) LCLR = D3R (15-6)

Dispersion or variability is also important. The central tendency can be under control, but ranges can be out of control.

PROGRAM 15.2 Excel QM Solution for Super Cola Example

M15_REND3161_13_AIE_C15.indd 536 28/10/16 12:42 PM

15.4 ConTRol CHARTS FoR ATTRiBUTES  537

where

UCLR = upper control chart limit for the range LCLR = lower control chart limit for the range D4 and D3 = values from Table 15.2

RANGE EXAMPLE As an example, consider a process in which the average range is 53 pounds. If the sample size is five, we want to determine the upper and lower control chart limits.

Looking in Table 15.2 for a sample size of five, we find that D4 = 2.114 and D3 = 0. The range control chart limits are

UCLR = D4R = 12.1142153 pounds2 = 112.042 pounds

LCLR = D3R = 102153 pounds2 = 0

A summary of the steps used for creating and using control charts for the mean and the range follows.

Five Steps to Follow in Using x _ and R-Charts

1. Collect 20 to 25 samples of typically n = 4 or n = 5 each from a stable process, and com- pute the mean and range of each.

2. Compute the overall means 1x and R); set appropriate control limits, usually at the 99.7% level; and calculate the preliminary upper and lower control limits. If the process is not currently stable, use the desired mean, m, instead of x to calculate limits.

3. Graph the sample means and ranges on their respective control charts, and determine whether they fall outside the acceptable limits.

4. Investigate points or patterns that indicate the process is out of control. Try to find an assignable cause for the out-of-control condition, address it accordingly, and then resume the process.

5. Collect additional samples and, if necessary, revalidate the control limits using the new data.

15.4 Control Charts for Attributes

Control charts for x and R do not apply when we are sampling attributes, which are typically classified as defective or nondefective. Measuring defectives involves counting them (e.g., number of bad lightbulbs in a given lot or number of letters or data entry records typed with errors). There are two kinds of attribute control charts: (1) those that measure the percent defective in a sample, called p-charts, and (2) those that count the number of defects, called c-charts.

p-Charts p-charts are the principal means of controlling attributes. Although attributes that are either good or bad follow the binomial distribution, the normal distribution can be used to calculate p-chart limits when sample sizes are large. The procedure resembles the x-chart approach, which is also based on the central limit theorem.

The formulas for p-chart upper and lower control limits follow:

UCLp = p + zsp (15-7) LCLp = p - zsp (15-8)

Sampling attributes differ from sampling variables.

p-chart limits are based on the binomial distribution and are easy to compute.

M15_REND3161_13_AIE_C15.indd 537 28/10/16 12:42 PM

538  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

where

p = mean proportion or fraction defective in the sample z = number of standard deviations 1z = 2 for 95.5% limits; z = 3 for 99.7% limits2 sp = standard deviation of the sampling distribution

sp is estimated by snp, which is

snp = B p11 - p2n (15-9) where n is the size of each sample.

ARCO p-CHART EXAMPLE Using a popular database software package, data-entry clerks at ARCO key in thousands of insurance records each day. Samples of the work of 20 clerks are shown in the following table. One hundred records entered by each clerk were carefully examined to determine if they contained any errors; the fraction defective in each sample was then computed.

Safer Drinking Water Through SPC

Nitrate (NO3–) contamination levels of groundwater have risen to alarming levels in recent years. The United States Environmen- tal Protection Agency limits nitrate contamination levels to 45 mg per liter. Early detection of rising contamination levels is critical in providing safe drinking water.

An environmental research team utilized a statistical process control (SPC) chart to monitor nitrate levels in groundwater. In particular, the team used a special SPC chart known as an “au- toregressive integrated moving average” (ARIMA) chart. This chart integrates elements from the x-bar chart of this chapter, as well as moving averages, which were studied in Chapter 5 of this book.

After collecting data from several different aquifers, the re- searchers built the statistical process control charts and checked them for out-of-control conditions. The environmental research team paid careful attention to increasing trends of five points (one of the out-of-control conditions specified in Figure 15.1) on the control chart. Fortunately, no out-of-control conditions were identified. However, the team now had a tool that improved early detection of rising nitrate levels by several days. That’s a lot of water!

Source: Based on J. C. García-Díaz, “Monitoring and Forecasting Nitrate Concentration in the Ground Water Using Statistical Process Control and Time Series Analysis: A Case Study,” Stochastic Environmental Research and Risk Assessment 25 (2011): 331–339, © Trevor S. Hale.

IN ACTION

SAMPLE NUMBER

NUMBER OF ERRORS

FRACTION DEFECTIVE

SAMPLE NUMBER

NUMBER OF ERRORS

FRACTION DEFECTIVE

1 6 0.06 11 6 0.06

2 5 0.05 12 1 0.01

3 0 0.00 13 8 0.08

4 1 0.01 14 7 0.07

5 4 0.04 15 5 0.05

6 2 0.02 16 4 0.04

7 5 0.05 17 11 0.11

8 3 0.03 18 3 0.03

9 3 0.03 19 0 0.00

10 2 0.02 20 4 0.04

80

M15_REND3161_13_AIE_C15.indd 538 28/10/16 12:42 PM

15.4 ConTRol CHARTS FoR ATTRiBUTES  539

We want to set control limits that include 99.7% of the random variation in the entry process when it is in control. Thus, z = 3.

p = Total number of errors

Total number of records examined =

80

110021202 = 0.04

snp = B 10.04211 - 0.042100 = 0.02 (Note: 100 is the size of each sample = n)

UCLp = p + zsnp = 0.04 + 3(0.02) = 0.10

LCLp = p - zsnp = 0.04 - 3(0.02) = 0 (since we cannot have a negative percentage defective)

When we plot the control limits and the sample fraction defectives, we find that only one data-entry clerk (number 17) is out of control. The firm may wish to examine that person’s work a bit more closely to see whether a serious problem exists (see Figure 15.3).

USING EXCEL QM FOR p-CHARTS Excel QM can be used to develop the limits for a p-chart, deter- mine which samples exceed the limits, and develop the graph. Program 15.3 provides the output for the ARCO example, with the graph. To use Excel QM, from the Add-Ins tab select Excel QM. From the drop-down menu, select Quality Control and specify the p Charts option. Enter the number of samples (20), input a title if desired, and select Graph if you wish to view the p-chart. When the spreadsheet is initialized, enter the size of each sample (100) and the number of defects in each of the 20 samples. One of the 20 samples (sample number 17) is identified as a sample that exceeds the limits.

c-Charts In the ARCO example discussed previously, we counted the number of defective database re- cords entered. A defective record is one that was not exactly correct. A bad record may contain more than one defect, however. We use c-charts to control the number of defects per unit of output (or per insurance record, in this case).

Control charts for defects are helpful for monitoring processes in which a large number of potential errors can occur but the actual number that does occur is relatively small. Defects may be mistyped words in a newspaper, blemishes on a table, or missing pickles on a fast-food hamburger.

c-charts count the number of defects, whereas p-charts track the percentage defective.

FIGURE 15.3 p-Chart for Data Entry for ARCo

Fr ac

tio n

D ef

ec tiv

e

Sample Number

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.10 0.11 0.12

UCLp 5 0.10

p 5 0.04

LCLp 5 0.00

M15_REND3161_13_AIE_C15.indd 539 28/10/16 12:42 PM

540  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

The Poisson probability distribution, which has a variance equal to its mean, is the basis for c-charts. Since c is the mean number of defects per unit, the standard deviation is equal to 2c. To compute 99.7% control limits for c, we use the formula

c ± 32c (15-10) Here is an example.

RED TOP CAB COMPANY c-CHART EXAMPLE Red Top Cab Company receives several complaints per day about the behavior of its drivers. Over a 9-day period (in which days are the units of mea- sure), the owner received 3, 0, 8, 9, 6, 7, 4, 9, and calls from irate passengers, for a total of 54 complaints.

To compute 99.7% control limits, we take

c = 54

9 = 6 complaints per day

Thus,

UCLc = c + 32c = 6 + 316 = 6 + 312.452 = 13.35 LCLc = c - 32c = 6 - 316 = 6 - 312.452 = 0 (because we cannot have a negative control limit)

After the owner plotted a control chart summarizing these data and posted it prominently in the drivers’ locker room, the number of calls received dropped to an average of 3 per day. Can you explain why this may have occurred?

USING EXCEL QM FOR c-CHARTS Excel QM can be used to develop the limits for a c-chart, deter- mine which samples exceed the limits, and develop the graph. Program 15.4 provides the output for the Red Top Cab Company example, with the graph. To use Excel QM, from the Add-Ins tab select Excel QM. From the drop-down menu, select Quality Control and specify the c Charts option. Enter the number of samples (9 days, in this example), input a title if desired, and select Graph if you wish to view the c-chart. When the spreadsheet is initialized, enter the number of complaints (i.e., defects) in each of the 9 samples.

PROGRAM 15.3 Excel QM Solution for ARCo p-Chart Example

M15_REND3161_13_AIE_C15.indd 540 28/10/16 12:42 PM

KEy EQUATionS  541

PROGRAM 15.4 Excel QM Solution for Red Top Cab Company c-Chart Example

To the manager of a firm producing goods or services, quality is the degree to which the product meets specifications. Qual- ity control has become one of the most important precepts of business.

The expression “quality cannot be inspected into a prod- uct” is a central theme of organizations today. More and more world-class companies are following the ideas of total quality

management (TQM), which emphasizes the entire organiza- tion, from supplier to customer.

Statistical aspects of quality control date to the 1920s but are of special interest in our global marketplaces of this new century. Statistical process control tools described in this chap- ter include the x- and R-charts for variable sampling and the p- and c-charts for attribute sampling.

Summary

Glossary

Assignable Variations Variations in the production process that can be traced to specific causes.

c-Chart A quality control chart that is used to control the number of defects per unit of output.

Central Limit Theorem The theoretical foundation for x- charts. It states that, regardless of the distribution of the population of all parts or services, the distribution of xs will tend to follow a normal curve as the sample size grows.

Control Chart A graphic presentation of process data over time. Natural Variations Variabilities that affect almost every

production process to some degree and are to be expected; also known as common causes.

p-Chart A quality control chart that is used to control the percentage of defects.

Quality The degree to which a product or service meets the specifications set for it.

R-Chart A process control chart that tracks the range within a sample; indicates that a gain or loss of uniformity has occurred in a production process.

Total Quality Management (TQM) An emphasis on quality that encompasses the entire organization.

x-Chart A quality control chart for variables that indicates when changes occur in the central tendency of a production process.

Key Equations

(15-1) Upper control limit (UCL) = x + zsx Upper limit for an x-chart using standard deviations.

(15-2) Lower control limit (LCL) = x - zsx Lower control limit for an x-chart using standard deviations.

(15-3) UCL x = x + A2R

Upper control limit for an x-chart using tabled values and ranges.

(15-4) LCL x = x - A2R

Lower control limit for an x-chart using tabled values and ranges.

(15-5) UCLR = D4R

Upper control limit for a range chart.

(15-6) LCLR = D3R

Lower control limit for a range chart.

(15-7) UCLp = p + zsp Upper control limit for a p-chart.

(15-8) LCLp = p - zsp Lower control limit for a p-chart.

(15-9) snp = B p11 - p2n Estimated standard deviation of a binomial distribution.

(15-10) c ± 32c Upper and lower limits for a c-chart.

M15_REND3161_13_AIE_C15.indd 541 28/10/16 12:42 PM

542  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

Solved Problems

Solved Problem 15-1 The manufacturer of precision parts for drill presses produces round shafts for use in the construction of drill presses. The average diameter of a shaft is 0.56 inch. The inspection samples contain six shafts each. The average range of these samples is 0.006 inch. Determine the upper and lower control chart limits.

Solution The mean factor A2 from Table 15.2, where the sample size is six, is seen to be 0.483. With this factor, you can obtain the upper and lower control limits:

UCL x = 0.56 + 10.483210.0062 = 0.56 + 0.0029 = 0.5629

LCL x = 0.56 - 0.0029 = 0.5571

Solved Problem 15-2 Nocaf Drinks, Inc., a producer of decaffeinated coffee, bottles Nocaf. Each bottle should have a net weight of 4 ounces. The machine that fills the bottles with coffee is new, and the operations manager wants to make sure that it is properly adjusted. The operations manager takes a sample of n = 8 bottles and records the average and range in ounces for each sample. The data for several samples are given in the following table. Note that every sample consists of 8 bottles.

SAMPLE

SAMPLE RANGE

SAMPLE AVERAGE

SAMPLE

SAMPLE RANGE

SAMPLE AVERAGE

A 0.41 4.00 E 0.56 4.17

B 0.55 4.16 F 0.62 3.93

C 0.44 3.99 G 0.54 3.98

D 0.48 4.00 H 0.44 4.01

Is the machine properly adjusted and in control?

Solution We first find that x = 4.03 and R = 0.51. Then, using Table 15.2, we find

UCL x = x + A2R = 4.03 + 10.373210.512 = 4.22

LCL x = x - A2R = 4.03 - 10.373210.512 = 3.84

UCLR = D4R = 11.864210.512 = 0.95 LCLR = D3R = 10.136210.512 = 0.07

It appears that the process average and range are both in control.

Solved Problem 15-3 Crabill Electronics, Inc., makes resistors, and among the last 100 resistors inspected, the percentage defective has been 0.05. Determine the upper and lower limits for this process for 99.7% confidence.

Solution

UCLp = p + 3B p11 - p2n = 0.05 + 3B 10.05211 - 0.052100 = 0.05 + 310.02182 = 0.1154

LCLp = p - 3B p11 - p2n = 0.05 - 310.02182 = 0.05 - 0.0654 = 0 1since percent defective cannot be negative2

M15_REND3161_13_AIE_C15.indd 542 28/10/16 12:42 PM

DiSCUSSion QUESTionS AnD PRoBlEMS  543

Self-Test ●● Before taking the self-test, refer to the learning objectives at the beginning of the chapter, the notes in the margins, and the

glossary at the end of the chapter. ●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. The degree to which the product or service meets specifications is one definition of a. sigma. b. quality. c. range. d. process variability.

2. A control chart for monitoring processes in which values are measured in continuous units such as weight or volume is called a control chart for a. attributes. b. measurements. c. variables. d. quality.

3. The type of chart used to control the number of defects per unit of output is the a. x-chart. b. R-chart. c. p-chart. d. c-chart.

4. Control charts for attributes are a. p-charts. b. m-charts. c. R-charts. d. x-charts.

5. The Poisson distribution is often used with a. R-charts. b. p-charts. c. c-charts. d. x-charts.

6. A type of variability that indicates that a process is out of control is called a. natural variation. b. assignable variation. c. random variation. d. average variation.

7. A company is implementing a new quality control program. Items are sampled and classified as being defective or nondefective. The type of control chart that should be used is a. an R-chart. b. a control chart for variables. c. a control chart for attributes. d. a control limit chart.

8. After a control chart (for means) has been developed, samples are taken, and the average is computed for each sample. The process could be considered out of control if a. one of the sample means is above the upper control

limit. b. one of the sample means is below the lower control

limit. c. five consecutive sample means show a consistent trend

(either increasing or decreasing). d. all of the above are true.

9. A machine is supposed to fill soft drink cans to 12 ounces. It appears that although the average amount in the cans is about 12 ounces (based on sample means), there is a great deal of variability in each of the individual cans. The type of chart that would best detect this problem would be a. a p-chart. b. an R-chart. c. a c-chart. d. an attribute chart.

10. If a process has only random variations (it is in control), then 95.5% of the time the sample averages will fall within a. 1 standard deviation of the population mean. b. 2 standard deviations of the population mean. c. 3 standard deviations of the population mean. d. 4 standard deviations of the population mean.

Discussion Questions and Problems

Discussion Questions 15-1 Why is the central limit theorem so important in

quality control? 15-2 Why are x- and R-charts usually used hand in

hand? 15-3 Explain the difference between control charts for

variables and control charts for attributes.

15-4 Explain the difference between c-charts and p-charts. 15-5 When using a control chart, what are some patterns

that would indicate that the process is out of control? 15-6 What might cause a process to be out of control? 15-7 Explain why a process can be out of control even

though all the samples fall within the upper and lower control limits.

M15_REND3161_13_AIE_C15.indd 543 28/10/16 12:42 PM

544  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

Problems 15-8 Shader Storage Technologies produces refrigeration

units for food producers and retail food establish- ments. The overall average temperature that these units maintain is 46° Fahrenheit. The average range is 2° Fahrenheit. Samples of six are taken to monitor the process. Determine the upper and lower control chart limits for averages and ranges for these refrig- eration units.

15-9 When set at the standard position, Autopitch can throw baseballs toward a batter at an average speed of 60 mph. Autopitch devices are made for both ma- jor- and minor-league teams to help them improve their batting averages. Autopitch executives take samples of 10 Autopitch devices at a time to moni- tor these devices and to maintain the highest qual- ity. The average range is 3 mph. Using control-chart techniques, determine control-chart limits for aver- ages and ranges for Autopitch.

15-10 Zipper Products, Inc., produces granola cereal, granola bars, and other natural food products. Its natural granola cereal is sampled to ensure proper weight. Each sample contains eight boxes of cereal. The overall average for the samples is 17 ounces. The range is only 0.5 ounce. Determine the upper and lower control-chart limits for averages for the boxes of cereal.

15-11 Small boxes of NutraFlakes cereal are labeled “net weight 10 ounces.” Each hour, random samples of size n = 4 boxes are weighed to check process control. Five hours of observations yielded the following:

WEIGHT

TIME BOX 1 BOX 2 BOX 3 BOX 4

9 a.m. 9.8 10.4 9.9 10.3

10 a.m. 10.1 10.2 9.9 9.8

11 a.m. 9.9 10.5 10.3 10.1

Noon 9.7 9.8 10.3 10.2

1 p.m. 9.7 10.1 9.9 9.9

Using these data, construct limits for x- and R- charts. Is the process in control? What other steps should the QC department follow at this point?

15-12 Sampling four pieces of precision-cut wire (to be used in computer assembly) every hour for the past 24 hours has produced the following results:

HOUR x R HOUR x R

1 3.25″ 0.71″ 13 3.11″ 0.85″ 2 3.10 1.18 14 2.83 1.31

3 3.22 1.43 15 3.12 1.06

4 3.39 1.26 16 2.84 0.50

5 3.07 1.17 17 2.86 1.43

6 2.86 0.32 18 2.74 1.29

7 3.05 0.53 19 3.41 1.61

8 2.65 1.13 20 2.89 1.09

9 3.02 0.71 21 2.65 1.08

10 2.85 1.33 22 3.28 0.46

11 2.83 1.17 23 2.94 1.58

12 2.97 0.40 24 2.64 0.97

Develop appropriate control limits and determine whether there is any cause for concern in the cutting process.

15-13 Due to the poor quality of various semiconductor products used in their manufacturing process, Micro- laboratories has decided to develop a QC program. Because the semiconductor parts they get from sup- pliers are either good or defective, Milton Fisher has decided to develop control charts for attributes. The total number of semiconductors in every sample is 200. Furthermore, Milton would like to determine the upper and the lower control-chart limits for vari- ous values of the fraction defective (p) in the sample taken. To allow more f lexibility, he has decided to develop a table that lists values for p, UCL, and LCL. The values for p should range from 0.01 to 0.10, incrementing by 0.01 each time. What are the 10 UCLs and the LCLs for 99.7% confidence?

15-14 For the past two months, Suzan Shader has been concerned about machine number 5 at the West Fac- tory. To make sure that the machine is operating correctly, samples are taken, and the average and range for each sample are is computed. Each sample consists of 12 items produced from the machine. Recently, 12 samples were taken, and for each, the sample range and average were computed. The sam- ple range and sample average were 1.1 and 46 for the first sample, 1.31 and 45 for the second sample, 0.91 and 46 for the third sample, and 1.1 and 47 for the fourth sample. After the fourth sample, the sample averages increased. For the fifth sample, the range was 1.21, and the average was 48; for sample number 6, it was 0.82 and 47; for sample number 7, it was 0.86 and 50; and for the eighth sample, it was 1.11 and 49. After the eighth sample, the sample av- erage continued to increase, never getting below 50. For sample number 9, the range and average were

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel QM; and means the problem may be solved with QM for Windows and/or Excel QM.

M15_REND3161_13_AIE_C15.indd 544 28/10/16 12:42 PM

DiSCUSSion QUESTionS AnD PRoBlEMS  545

1.12 and 51; for sample number 10, they were 0.99 and 52; for sample number 11, they were 0.86 and 50; and for sample number 12, they were 1.2 and 52.

Although Suzan’s boss wasn’t overly concerned about the process, Suzan was. During installation, the supplier set a value of 47 for the process average, with an average range of 1.0. It was Suzan’s feeling that something was definitely wrong with machine number 5. Do you agree?

15-15 Kitty Products caters to the growing market for cat supplies, with a full line of products, ranging from litter to toys to flea powder. One of its newer prod- ucts, a tube of fluid that prevents hair balls in long- haired cats, is produced by an automated machine that is set to fill each tube with 63.5 grams of paste.

To keep this filling process under control, four tubes are pulled randomly from the assembly line every 4 hours. After several days, the data shown in the following table resulted.

SAMPLE NO. x

R

SAMPLE NO. x

R

SAMPLE NO. x

R

1 63.5 2.0 10 63.5 1.3 18 63.6 1.8

2 63.6 1.0 11 63.3 1.8 19 63.8 1.3

3 63.7 1.7 12 63.2 1.0 20 63.5 1.6

4 63.9 0.9 13 63.6 1.8 21 63.9 1.0

5 63.4 1.2 14 63.3 1.5 22 63.2 1.8

6 63.0 1.6 15 63.4 1.7 23 63.3 1.7

7 63.2 1.8 16 63.4 1.4 24 64.0 2.0

8 63.3 1.3 17 63.5 1.1 25 63.4 1.5

9 63.7 1.6

Set control limits for this process and graph the sam- ple data for both the x- and R-charts.

15-16 Colonel Electric is a large company that produces lightbulbs and other electrical products. One particu- lar lightbulb is supposed to have an average life of about 1,000 hours before it burns out. Periodically, the company will test five of these and measure the average time before these burn out. The following table gives the results of 10 such samples:

SAMPLE 1 2 3 4 5 6 7 8 9 10

Mean 979 1,087 1,080 934 1,072 1,007 952 986 1,063 958

Range 50 94 57 65 135 134 101 98 145 84

(a) What is the overall average of these means? What is the average range?

(b) What are the upper and lower control limits for a 99.7% control chart for the mean?

(c) Does this process appear to be in control? Explain.

15-17 For Problem 15-16, develop upper and lower control limits for the range. Do these samples indicate that the process is in control?

15-18 Kate Drew has been hand-painting wooden Christ- mas ornaments for several years. Recently, she has hired some friends to help her increase the volume of her business. In checking the quality of the work, she notices that some slight blemishes occasionally are apparent. A sample of 20 pieces of work resulted in the following number of blemishes on each piece: 0, 2, 1, 0, 0, 3, 2, 0, 4, 1, 2, 0, 0, 1, 2, 1, 0, 0, 0, 1. De- velop upper and lower control limits for the number of blemishes on each piece.

15-19 A new president at Big State University has made student satisfaction with the enrollment and registra- tion process one of her highest priorities. Students must see an advisor, sign up for classes, obtain a parking permit, pay tuition and fees, and buy text- books and other supplies. During one registration period, 10 students every hour are sampled and asked about satisfaction with each of these areas. Twelve different groups of students were sampled, and the number in each group who had at least one complaint is as follows: 0, 2, 1, 0, 0, 1, 3, 0, 1, 2, 2, 0.

Develop upper and lower control limits (99.7%) for the proportion of students with complaints.

15-20 Cybersecurity is an area of increasing concern. The National Security Agency (NSA) monitors the num- ber of hits at sensitive websites. When the number of hits is much larger than normal, there is cause for concern, and further investigation is warranted. For each of the past 12 months, the number of hits at one such website has been 181, 162, 172, 169, 185, 212, 190, 168, 190, 191, 197, and 204. Determine the upper and lower control limits (99.7%) for the associated c-chart. Using the upper control limit as your reference, at what point should the NSA take action?

15-21 V. S. Industries in Parkersburg, West Virginia, is a small manufacturer of military-grade hybrid mi- crocircuits. One of the many quality assurance procedures required by Military Standard 883 (MIL- STD-883) for hybrid microcircuits is known as non- destructive bond pull (method number 2023.7 in MIL-STD-883). The procedure involves pulling on a random sample of wires within the hybrid micro- circuit with a prespecified amount of force. If the wire tears, breaks, or separates in any way from the circuit, it fails the test and is considered defective and scrapped. In a recent batch of 1,000 devices, 13 failed the pull test. Determine upper and lower con- trol limits for the associated p-chart.

15-22 As noted in Problem 15-21, wire bond pull strengths for U.S. defense contractors are tested according to MIL-STD-883. In addition to nondestructive testing, destructive testing is also employed. A small poten- tiometer measures the grams of force necessary to

M15_REND3161_13_AIE_C15.indd 545 28/10/16 12:42 PM

546  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

either shear the wire in two or separate one of the two bonds from the underlying substrate. Ten sam- ples (n = 5 ) of V. S. Industries’ 1 mil diameter Au wire have shown these results for force: 2.1, 2.2, 2.6, 2.1, 2.5, 2.4, 2.3, 2.1, 2.4, and 2.6 grams. Determine 99.7% control limits for the associated x-bar and R-charts.

15-23 Every commercial airline pilot visually inspects his/ her airplane before flying. If the number of visible defects (known as marks) exceeds a certain pre- scribed limit, the pilot can call for maintenance, causing flight delays or even flight cancellations. Explain what kind of control chart could be used by the airline companies to monitor and control the number of marks on the plane.

See our Internet home page, at www.pearsonhighered.com/render, for additional homework problems, Problems 15-24 to 15-27.

Internet Homework Problems

See our Internet home page, at www.pearsonhighered.com/render, for this case study: Bayfield Mud Company. This case involves bags of mud-treating agents used in drilling for oil and natural gas.

Internet Case Studies

Bibliography

Crosby, P. B. Quality Is Free. New York: McGraw-Hill, 1979.

Deming, W. E. Out of the Crisis. Cambridge, MA: MIT Center for Advanced Engineering Study, 1986.

Foster, S. Thomas. Managing Quality, 4th ed. Upper Saddle River, NJ: Pearson, 2010.

Foster, S. Thomas. Managing Quality: Integrating the Supply Chain, 5th ed. Upper Saddle River, NJ: Pearson, 2013.

Goetsch, David, and Stanley Davis. Quality Management, 5th ed. Upper Saddle River, NJ: Pearson, 2013.

Juran, Joseph M., and A. Blanton Godfrey. Juran’s Quality Handbook, 5th ed. New York: McGraw-Hill, 1999.

Naveh, Eitan, and Miriam Erez. “Innovation and Attention to Detail in the Quality Improvement Paradigm,” Management Science 50, 11 (November 2004): 1576–1586.

Ravichandran, T. “Swiftness and Intensity of Administrative Innovation Adoption: An Empirical Study of TQM in Information Systems,” Decision Sciences 31, 3 (Summer 2000): 691–724.

Smith, Gerald. Statistical Process Control and Quality Improvement, 5th ed. Upper Saddle River, NJ: Pearson, 2004.

Summers, Donna. Quality, 5th ed. Upper Saddle River, NJ: Pearson, 2006.

Tarí, Juan José, José Francisco Molina, and Juan Luis Castejón. “The Rela- tionship Between Quality Management Practices and Their Effects on Quality Outcomes,” European Journal of Operational Research 183, 2 (December 2007): 483–501.

Wilson, Darryl D., and David A. Collier. “An Empirical Investigation of the Malcolm Baldrige National Quality Award Causal Model,” Decision Sciences 31, 2 (Spring 2000): 361–390.

Witte, Robert D. “Quality Control Defined,” Contract Management 47, 5 (May 2007): 51–53.

Zhu, Kaijie, Rachel Q. Zhang, and Fugee Tsung. “Pushing Quality Improve- ment Along Supply Chains,” Management Science 53, 3 (March 2007): 421–436.

M15_REND3161_13_AIE_C15.indd 546 28/10/16 12:42 PM

APPEnDix 15.1: USing QM FoR WinDoWS FoR SPC  547

Appendix 15.1: Using QM for Windows for SPC

The QM for Windows Quality Control module can compute most of the SPC control charts and limits introduced in this chapter. Once the module is selected, we select New and indi- cate which type of chart (p-chart, x-bar chart, or c-chart). Pro- gram 15.5A displays the different possible choices in QM for Windows. When the p-chart is selected for the ARCO exam- ple, the initialization window opens, as displayed in Program 15.5B. We enter a title and the number of samples (20 in this example) and then click OK. An input window opens, and we enter the 20 sample values (number of errors or defects in the

sample) and specify the sample size (100). We click Solve, and the output window opens, as illustrated in Program 15.5C. The original input data and the sample size are displayed, as are the results. While this problem has been set to use the three stan- dard deviation (sigma) limits, other values are possible. QM for Windows computes the average proportion 1p2, standard devi- ation, and upper and lower control limits. From this screen, we can select Window and select Control Chart to actually view the chart and look for patterns that might indicate that the pro- cess is out of control.

In the Quality Control module, select New and then select p-charts.

PROGRAM 15.5A Using p-Charts from the Quality Control Module in QM for Windows

Enter a title and specify the number of samples.

PROGRAM 15.5B QM for Windows initialization Window for p-Charts with ARCo insurance Records Example

M15_REND3161_13_AIE_C15.indd 547 28/10/16 12:42 PM

548  CHAPTER 15 • STATiSTiCAl QUAliTy ConTRol

Once the data have been input, put the number of defects in this column, and specify the size of each of the 20 samples. Then click Solve, and this final screen appears.

PROGRAM 15.5C QM for Windows Solution for ARCo insurance Records Example

M15_REND3161_13_AIE_C15.indd 548 28/10/16 12:42 PM

A. Areas Under the Standard Normal Curve

B. Binomial Probabilities

C. Values of e-l for Use in the Poisson Distribution

D. F Distribution Values

E. Using POM-QM for Windows

F. Using Excel QM and Excel Add-Ins

G. Solutions to Selected Problems

H. Solutions to Self-Tests

Appendices

Z01_REND3161_13_AIE_APP.indd 549 28/10/16 11:27 AM

550  APPENDICES

Appendix A: Areas Under the Standard Normal Curve

Example: To find the area under the normal curve, you must know how many standard deviations that point is to the right of the mean. Then the area under the normal curve can be read directly from the normal table. For example, the total area under the normal curve for a point that is 1.55 standard deviations to the right of the mean is 0.93943.

0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09

0.0 0.50000 0.50399 0.50798 0.51197 0.51595 0.51994 0.52392 0.52790 0.53188 0.53586

0.1 0.53983 0.54380 0.54776 0.55172 0.55567 0.55962 0.56356 0.56749 0.57142 0.57535

0.2 0.57926 0.58317 0.58706 0.59095 0.59483 0.59871 0.60257 0.60642 0.61026 0.61409

0.3 0.61791 0.62172 0.62552 0.62930 0.63307 0.63683 0.64058 0.64431 0.64803 0.65173

0.4 0.65542 0.65910 0.66276 0.66640 0.67003 0.67364 0.67724 0.68082 0.68439 0.68793

0.5 0.69146 0.69497 0.69847 0.70194 0.70540 0.70884 0.71226 0.71566 0.71904 0.72240

0.6 0.72575 0.72907 0.73237 0.73565 0.73891 0.74215 0.74537 0.74857 0.75175 0.75490

0.7 0.75804 0.76115 0.76424 0.76730 0.77035 0.77337 0.77637 0.77935 0.78230 0.78524

0.8 0.78814 0.79103 0.79389 0.79673 0.79955 0.80234 0.80511 0.80785 0.81057 0.81327

0.9 0.81594 0.81859 0.82121 0.82381 0.82639 0.82894 0.83147 0.83398 0.83646 0.83891

1.0 0.84134 0.84375 0.84614 0.84849 0.85083 0.85314 0.85543 0.85769 0.85993 0.86214

1.1 0.86433 0.86650 0.86864 0.87076 0.87286 0.87493 0.87698 0.87900 0.88100 0.88298

1.2 0.88493 0.88686 0.88877 0.89065 0.89251 0.89435 0.89617 0.89796 0.89973 0.90147

1.3 0.90320 0.90490 0.90658 0.90824 0.90988 0.91149 0.91309 0.91466 0.91621 0.91774

1.4 0.91924 0.92073 0.92220 0.92364 0.92507 0.92647 0.92785 0.92922 0.93056 0.93189

1.5 0.93319 0.93448 0.93574 0.93699 0.93822 0.93943 0.94062 0.94179 0.94295 0.94408

1.6 0.94520 0.94630 0.94738 0.94845 0.94950 0.95053 0.95154 0.95254 0.95352 0.95449

1.7 0.95543 0.95637 0.95728 0.95818 0.95907 0.95994 0.96080 0.96164 0.96246 0.96327

1.8 0.96407 0.96485 0.96562 0.96638 0.96712 0.96784 0.96856 0.96926 0.96995 0.97062

1.9 0.97128 0.97193 0.97257 0.97320 0.97381 0.97441 0.97500 0.97558 0.97615 0.97670

2.0 0.97725 0.97778 0.97831 0.97882 0.97932 0.97982 0.98030 0.98077 0.98124 0.98169

2.1 0.98214 0.98257 0.98300 0.98341 0.98382 0.98422 0.98461 0.98500 0.98537 0.98574

2.2 0.98610 0.98645 0.98679 0.98713 0.98745 0.98778 0.98809 0.98840 0.98870 0.98899

2.3 0.98928 0.98956 0.98983 0.99010 0.99036 0.99061 0.99086 0.99111 0.99134 0.99158

2.4 0.99180 0.99202 0.99224 0.99245 0.99266 0.99286 0.99305 0.99324 0.99343 0.99361

2.5 0.99379 0.99396 0.99413 0.99430 0.99446 0.99461 0.99477 0.99492 0.99506 0.99520

2.6 0.99534 0.99547 0.99560 0.99573 0.99585 0.99598 0.99609 0.99621 0.99632 0.99643

2.7 0.99653 0.99664 0.99674 0.99683 0.99693 0.99702 0.99711 0.99720 0.99728 0.99736

2.8 0.99744 0.99752 0.99760 0.99767 0.99774 0.99781 0.99788 0.99795 0.99801 0.99807

2.9 0.99813 0.99819 0.99825 0.99831 0.99836 0.99841 0.99846 0.99851 0.99856 0.99861

3.0 0.99865 0.99869 0.99874 0.99878 0.99882 0.99886 0.99889 0.99893 0.99896 0.99900

3.1 0.99903 0.99906 0.99910 0.99913 0.99916 0.99918 0.99921 0.99924 0.99926 0.99929

3.2 0.99931 0.99934 0.99936 0.99938 0.99940 0.99942 0.99944 0.99946 0.99948 0.99950

1.550 ZMean

1.55 Standard Deviations

Area is 0.93943

Z01_REND3161_13_AIE_APP.indd 550 28/10/16 11:27 AM

APPENDIx A: ArEAS UNDEr ThE STANDArD NOrMAl CUrVE  551

0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09

3.3 0.99952 0.99953 0.99955 0.99957 0.99958 0.99960 0.99961 0.99962 0.99964 0.99965

3.4 0.99966 0.99968 0.99969 0.99970 0.99971 0.99972 0.99973 0.99974 0.99975 0.99976

3.5 0.99977 0.99978 0.99978 0.99979 0.99980 0.99981 0.99981 0.99982 0.99983 0.99983

3.6 0.99984 0.99985 0.99985 0.99986 0.99986 0.99987 0.99987 0.99998 0.99988 0.99989

3.7 0.99989 0.99990 0.99990 0.99990 0.99991 0.99991 0.99992 0.99992 0.99992 0.99992

3.8 0.99993 0.99993 0.99993 0.99994 0.99994 0.99994 0.99994 0.99995 0.99995 0.99995

3.9 0.99995 0.99995 0.99996 0.99996 0.99996 0.99996 0.99996 0.99996 0.99997 0.99997

Z01_REND3161_13_AIE_APP.indd 551 28/10/16 11:27 AM

552  APPENDICES

Appendix B: Binomial Probabilities

Probability of exactly r successes in n trials

P

n r 0.05 0.10 0.15 0.20 0.25 0.30 0.35 0.40 0.45 0.50

1 0 0.9500 0.9000 0.8500 0.8000 0.7500 0.7000 0.6500 0.6000 0.5500 0.5000

1 0.0500 0.1000 0.1500 0.2000 0.2500 0.3000 0.3500 0.4000 0.4500 0.5000

2 0 0.9025 0.8100 0.7225 0.6400 0.5625 0.4900 0.4225 0.3600 0.3025 0.2500 1 0.0950 0.1800 0.2550 0.3200 0.3750 0.4200 0.4550 0.4800 0.4950 0.5000 2 0.0025 0.0100 0.0225 0.0400 0.0625 0.0900 0.1225 0.1600 0.2025 0.2500

3 0 0.8574 0.7290 0.6141 0.5120 0.4219 0.3430 0.2746 0.2160 0.1664 0.1250 1 0.1354 0.2430 0.3251 0.3840 0.4219 0.4410 0.4436 0.4320 0.4084 0.3750 2 0.0071 0.0270 0.0574 0.0960 0.1406 0.1890 0.2389 0.2880 0.3341 0.3750 3 0.0001 0.0010 0.0034 0.0080 0.0156 0.0270 0.0429 0.0640 0.0911 0.1250

4 0 0.8145 0.6561 0.5220 0.4096 0.3164 0.2401 0.1785 0.1296 0.0915 0.0625 1 0.1715 0.2916 0.3685 0.4096 0.4219 0.4116 0.3845 0.3456 0.2995 0.2500 2 0.0135 0.0486 0.0975 0.1536 0.2109 0.2646 0.3105 0.3456 0.3675 0.3750 3 0.0005 0.0036 0.0115 0.0256 0.0469 0.0756 0.1115 0.1536 0.2005 0.2500 4 0.0000 0.0001 0.0005 0.0016 0.0039 0.0081 0.0150 0.0256 0.0410 0.0625

5 0 0.7738 0.5905 0.4437 0.3277 0.2373 0.1681 0.1160 0.0778 0.0503 0.0313 1 0.2036 0.3281 0.3915 0.4096 0.3955 0.3602 0.3124 0.2592 0.2059 0.1563 2 0.0214 0.0729 0.1382 0.2048 0.2637 0.3087 0.3364 0.3456 0.3369 0.3125 3 0.0011 0.0081 0.0244 0.0512 0.0879 0.1323 0.1811 0.2304 0.2757 0.3125 4 0.0000 0.0005 0.0022 0.0064 0.0146 0.0284 0.0488 0.0768 0.1128 0.1563 5 0.0000 0.0000 0.0001 0.0003 0.0010 0.0024 0.0053 0.0102 0.0185 0.0313

6 0 0.7351 0.5314 0.3771 0.2621 0.1780 0.1176 0.0754 0.0467 0.0277 0.0156 1 0.2321 0.3543 0.3993 0.3932 0.3560 0.3025 0.2437 0.1866 0.1359 0.0938 2 0.0305 0.0984 0.1762 0.2458 0.2966 0.3241 0.3280 0.3110 0.2780 0.2344 3 0.0021 0.0146 0.0415 0.0819 0.1318 0.1852 0.2355 0.2765 0.3032 0.3125 4 0.0001 0.0012 0.0055 0.0154 0.0330 0.0595 0.0951 0.1382 0.1861 0.2344 5 0.0000 0.0001 0.0004 0.0015 0.0044 0.0102 0.0205 0.0369 0.0609 0.0938 6 0.0000 0.0000 0.0000 0.0001 0.0002 0.0007 0.0018 0.0041 0.0083 0.0156

7 0 0.6983 0.4783 0.3206 0.2097 0.1335 0.0824 0.0490 0.0280 0.0152 0.0078 1 0.2573 0.3720 0.3960 0.3670 0.3115 0.2471 0.1848 0.1306 0.0872 0.0547 2 0.0406 0.1240 0.2097 0.2753 0.3115 0.3177 0.2985 0.2613 0.2140 0.1641 3 0.0036 0.0230 0.0617 0.1147 0.1730 0.2269 0.2679 0.2903 0.2918 0.2734 4 0.0002 0.0026 0.0109 0.0287 0.0577 0.0972 0.1442 0.1935 0.2388 0.2734 5 0.0000 0.0002 0.0012 0.0043 0.0115 0.0250 0.0466 0.0774 0.1172 0.1641 6 0.0000 0.0000 0.0001 0.0004 0.0013 0.0036 0.0084 0.0172 0.0320 0.0547 7 0.0000 0.0000 0.0000 0.0000 0.0001 0.0002 0.0006 0.0016 0.0037 0.0078

8 0 0.6634 0.4305 0.2725 0.1678 0.1001 0.0576 0.0319 0.0168 0.0084 0.0039 1 0.2793 0.3826 0.3847 0.3355 0.2670 0.1977 0.1373 0.0896 0.0548 0.0313 2 0.0515 0.1488 0.2376 0.2936 0.3115 0.2965 0.2587 0.2090 0.1569 0.1094

Z01_REND3161_13_AIE_APP.indd 552 28/10/16 11:27 AM

APPENDIx B: BINOMIAl PrOBABIlITIES  553

P

n r 0.05 0.10 0.15 0.20 0.25 0.30 0.35 0.40 0.45 0.50

3 0.0054 0.0331 0.0839 0.1468 0.2076 0.2541 0.2786 0.2787 0.2568 0.2188 4 0.0004 0.0046 0.0185 0.0459 0.0865 0.1361 0.1875 0.2322 0.2627 0.2734 5 0.0000 0.0004 0.0026 0.0092 0.0231 0.0467 0.0808 0.1239 0.1719 0.2188 6 0.0000 0.0000 0.0002 0.0011 0.0038 0.0100 0.0217 0.0413 0.0703 0.1094 7 0.0000 0.0000 0.0000 0.0001 0.0004 0.0012 0.0033 0.0079 0.0164 0.0313 8 0.0000 0.0000 0.0000 0.0000 0.0000 0.0001 0.0002 0.0007 0.0017 0.0039

9 0 0.6302 0.3874 0.2316 0.1342 0.0751 0.0404 0.0207 0.0101 0.0046 0.0020 1 0.2985 0.3874 0.3679 0.3020 0.2253 0.1556 0.1004 0.0605 0.0339 0.0176 2 0.0629 0.1722 0.2597 0.3020 0.3003 0.2668 0.2162 0.1612 0.1110 0.0703 3 0.0077 0.0446 0.1069 0.1762 0.2336 0.2668 0.2716 0.2508 0.2119 0.1641 4 0.0006 0.0074 0.0283 0.0661 0.1168 0.1715 0.2194 0.2508 0.2600 0.2461 5 0.0000 0.0008 0.0050 0.0165 0.0389 0.0735 0.1181 0.1672 0.2128 0.2461 6 0.0000 0.0001 0.0006 0.0028 0.0087 0.0210 0.0424 0.0743 0.1160 0.1641 7 0.0000 0.0000 0.0000 0.0003 0.0012 0.0039 0.0098 0.0212 0.0407 0.0703 8 0.0000 0.0000 0.0000 0.0000 0.0001 0.0004 0.0013 0.0035 0.0083 0.0176 9 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0001 0.0003 0.0008 0.0020

10 0 0.5987 0.3487 0.1969 0.1074 0.0563 0.0282 0.0135 0.0060 0.0025 0.0010 1 0.3151 0.3874 0.3474 0.2684 0.1877 0.1211 0.0725 0.0403 0.0207 0.0098 2 0.0746 0.1937 0.2759 0.3020 0.2816 0.2335 0.1757 0.1209 0.0763 0.0439 3 0.0105 0.0574 0.1298 0.2013 0.2503 0.2668 0.2522 0.2150 0.1665 0.1172 4 0.0010 0.0112 0.0401 0.0881 0.1460 0.2001 0.2377 0.2508 0.2384 0.2051 5 0.0001 0.0015 0.0085 0.0264 0.0584 0.1029 0.1536 0.2007 0.2340 0.2461 6 0.0000 0.0001 0.0012 0.0055 0.0162 0.0368 0.0689 0.1115 0.1596 0.2051 7 0.0000 0.0000 0.0001 0.0008 0.0031 0.0090 0.0212 0.0425 0.0746 0.1172 8 0.0000 0.0000 0.0000 0.0001 0.0004 0.0014 0.0043 0.0106 0.0229 0.0439 9 0.0000 0.0000 0.0000 0.0000 0.0000 0.0001 0.0005 0.0016 0.0042 0.0098

10 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0001 0.0003 0.0010

15 0 0.4633 0.2059 0.0874 0.0352 0.0134 0.0047 0.0016 0.0005 0.0001 0.0000 1 0.3658 0.3432 0.2312 0.1319 0.0668 0.0305 0.0126 0.0047 0.0016 0.0005 2 0.1348 0.2669 0.2856 0.2309 0.1559 0.0916 0.0476 0.0219 0.0090 0.0032 3 0.0307 0.1285 0.2184 0.2501 0.2252 0.1700 0.1110 0.0634 0.0318 0.0139 4 0.0049 0.0428 0.1156 0.1876 0.2252 0.2186 0.1792 0.1268 0.0780 0.0417 5 0.0006 0.0105 0.0449 0.1032 0.1651 0.2061 0.2123 0.1859 0.1404 0.0916 6 0.0000 0.0019 0.0132 0.0430 0.0917 0.1472 0.1906 0.2066 0.1914 0.1527 7 0.0000 0.0003 0.0030 0.0138 0.0393 0.0811 0.1319 0.1771 0.2013 0.1964 8 0.0000 0.0000 0.0005 0.0035 0.0131 0.0348 0.0710 0.1181 0.1647 0.1964 9 0.0000 0.0000 0.0001 0.0007 0.0034 0.0116 0.0298 0.0612 0.1048 0.1527

10 0.0000 0.0000 0.0000 0.0001 0.0007 0.0030 0.0096 0.0245 0.0515 0.0916 11 0.0000 0.0000 0.0000 0.0000 0.0001 0.0006 0.0024 0.0074 0.0191 0.0417 12 0.0000 0.0000 0.0000 0.0000 0.0000 0.0001 0.0004 0.0016 0.0052 0.0139 13 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0001 0.0003 0.0010 0.0032 14 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0001 0.0005 15 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000

Z01_REND3161_13_AIE_APP.indd 553 28/10/16 11:27 AM

554  APPENDICES

P

n r 0.05 0.10 0.15 0.20 0.25 0.30 0.35 0.40 0.45 0.50

20 0 0.3585 0.1216 0.0388 0.0115 0.0032 0.0008 0.0002 0.0000 0.0000 0.0000 1 0.3774 0.2702 0.1368 0.0576 0.0211 0.0068 0.0020 0.0005 0.0001 0.0000 2 0.1887 0.2852 0.2293 0.1369 0.0669 0.0278 0.0100 0.0031 0.0008 0.0002 3 0.0596 0.1901 0.2428 0.2054 0.1339 0.0716 0.0323 0.0123 0.0040 0.0011 4 0.0133 0.0898 0.1821 0.2182 0.1897 0.1304 0.0738 0.0350 0.0139 0.0046 5 0.0022 0.0319 0.1028 0.1746 0.2023 0.1789 0.1272 0.0746 0.0365 0.0148 6 0.0003 0.0089 0.0454 0.1091 0.1686 0.1916 0.1712 0.1244 0.0746 0.0370

7 0.0000 0.0020 0.0160 0.0545 0.1124 0.1643 0.1844 0.1659 0.1221 0.0739

8 0.0000 0.0004 0.0046 0.0222 0.0609 0.1144 0.1614 0.1797 0.1623 0.1201

9 0.0000 0.0001 0.0011 0.0074 0.0271 0.0654 0.1158 0.1597 0.1771 0.1602

10 0.0000 0.0000 0.0002 0.0020 0.0099 0.0308 0.0686 0.1171 0.1593 0.1762

11 0.0000 0.0000 0.0000 0.0005 0.0030 0.0120 0.0336 0.0710 0.1185 0.1602

12 0.0000 0.0000 0.0000 0.0001 0.0008 0.0039 0.0136 0.0355 0.0727 0.1201

13 0.0000 0.0000 0.0000 0.0000 0.0002 0.0010 0.0045 0.0146 0.0366 0.0739

14 0.0000 0.0000 0.0000 0.0000 0.0000 0.0002 0.0012 0.0049 0.0150 0.0370

15 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0003 0.0013 0.0049 0.0148

16 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0003 0.0013 0.0046

17 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0002 0.0011

18 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0002

19 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000

20 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000

P n r 0.55 0.60 0.65 0.70 0.75 0.80 0.85 0.90 0.95

1 0 0.4500 0.4000 0.3500 0.3000 0.2500 0.2000 0.1500 0.1000 0.0500 1 0.5500 0.6000 0.6500 0.7000 0.7500 0.8000 0.8500 0.9000 0.9500

2 0 0.2025 0.1600 0.1225 0.0900 0.0625 0.0400 0.0225 0.0100 0.0025 1 0.4950 0.4800 0.4550 0.4200 0.3750 0.3200 0.2550 0.1800 0.0950 2 0.3025 0.3600 0.4225 0.4900 0.5625 0.6400 0.7225 0.8100 0.9025

3 0 0.0911 0.0640 0.0429 0.0270 0.0156 0.0080 0.0034 0.0010 0.0001 1 0.3341 0.2880 0.2389 0.1890 0.1406 0.0960 0.0574 0.0270 0.0071 2 0.4084 0.4320 0.4436 0.4410 0.4219 0.3840 0.3251 0.2430 0.1354 3 0.1664 0.2160 0.2746 0.3430 0.4219 0.5120 0.6141 0.7290 0.8574

4 0 0.0410 0.0256 0.0150 0.0081 0.0039 0.0016 0.0005 0.0001 0.0000 1 0.2005 0.1536 0.1115 0.0756 0.0469 0.0256 0.0115 0.0036 0.0005 2 0.3675 0.3456 0.3105 0.2646 0.2109 0.1536 0.0975 0.0486 0.0135 3 0.2995 0.3456 0.3845 0.4116 0.4219 0.4096 0.3685 0.2916 0.1715 4 0.0915 0.1296 0.1785 0.2401 0.3164 0.4096 0.5220 0.6561 0.8145

5 0 0.0185 0.0102 0.0053 0.0024 0.0010 0.0003 0.0001 0.0000 0.0000 1 0.1128 0.0768 0.0488 0.0283 0.0146 0.0064 0.0022 0.0004 0.0000 2 0.2757 0.2304 0.1811 0.1323 0.0879 0.0512 0.0244 0.0081 0.0011 3 0.3369 0.3456 0.3364 0.3087 0.2637 0.2048 0.1382 0.0729 0.0214 4 0.2059 0.2592 0.3124 0.3602 0.3955 0.4096 0.3915 0.3280 0.2036 5 0.0503 0.0778 0.1160 0.1681 0.2373 0.3277 0.4437 0.5905 0.7738

Z01_REND3161_13_AIE_APP.indd 554 28/10/16 11:27 AM

APPENDIx B: BINOMIAl PrOBABIlITIES  555

P n r 0.55 0.60 0.65 0.70 0.75 0.80 0.85 0.90 0.95

6 0 0.0083 0.0041 0.0018 0.0007 0.0002 0.0001 0.0000 0.0000 0.0000 1 0.0609 0.0369 0.0205 0.0102 0.0044 0.0015 0.0004 0.0001 0.0000 2 0.1861 0.1382 0.0951 0.0595 0.0330 0.0154 0.0055 0.0012 0.0001 3 0.3032 0.2765 0.2355 0.1852 0.1318 0.0819 0.0415 0.0146 0.0021 4 0.2780 0.3110 0.3280 0.3241 0.2966 0.2458 0.1762 0.0984 0.0305 5 0.1359 0.1866 0.2437 0.3025 0.3560 0.3932 0.3993 0.3543 0.2321 6 0.0277 0.0467 0.0754 0.1176 0.1780 0.2621 0.3771 0.5314 0.7351

7 0 0.0037 0.0016 0.0006 0.0002 0.0001 0.0000 0.0000 0.0000 0.0000 1 0.0320 0.0172 0.0084 0.0036 0.0013 0.0004 0.0001 0.0000 0.0000 2 0.1172 0.0774 0.0466 0.0250 0.0115 0.0043 0.0012 0.0002 0.0000 3 0.2388 0.1935 0.1442 0.0972 0.0577 0.0287 0.0109 0.0026 0.0002 4 0.2918 0.2903 0.2679 0.2269 0.1730 0.1147 0.0617 0.0230 0.0036 5 0.2140 0.2613 0.2985 0.3177 0.3115 0.2753 0.2097 0.1240 0.0406 6 0.0872 0.1306 0.1848 0.2471 0.3115 0.3670 0.3960 0.3720 0.2573 7 0.0152 0.0280 0.0490 0.0824 0.1335 0.2097 0.3206 0.4783 0.6983

8 0 0.0017 0.0007 0.0002 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000 1 0.0164 0.0079 0.0033 0.0012 0.0004 0.0001 0.0000 0.0000 0.0000 2 0.0703 0.0413 0.0217 0.0100 0.0038 0.0011 0.0002 0.0000 0.0000 3 0.1719 0.1239 0.0808 0.0467 0.0231 0.0092 0.0026 0.0004 0.0000 4 0.2627 0.2322 0.1875 0.1361 0.0865 0.0459 0.0185 0.0046 0.0004 5 0.2568 0.2787 0.2786 0.2541 0.2076 0.1468 0.0839 0.0331 0.0054 6 0.1569 0.2090 0.2587 0.2965 0.3115 0.2936 0.2376 0.1488 0.0515 7 0.0548 0.0896 0.1373 0.1977 0.2670 0.3355 0.3847 0.3826 0.2793 8 0.0084 0.0168 0.0319 0.0576 0.1001 0.1678 0.2725 0.4305 0.6634

9 0 0.0008 0.0003 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1 0.0083 0.0035 0.0013 0.0004 0.0001 0.0000 0.0000 0.0000 0.0000 2 0.0407 0.0212 0.0098 0.0039 0.0012 0.0003 0.0000 0.0000 0.0000 3 0.1160 0.0743 0.0424 0.0210 0.0087 0.0028 0.0006 0.0001 0.0000 4 0.2128 0.1672 0.1181 0.0735 0.0389 0.0165 0.0050 0.0008 0.0000 5 0.2600 0.2508 0.2194 0.1715 0.1168 0.0661 0.0283 0.0074 0.0006 6 0.2119 0.2508 0.2716 0.2668 0.2336 0.1762 0.1069 0.0446 0.0077 7 0.1110 0.1612 0.2162 0.2668 0.3003 0.3020 0.2597 0.1722 0.0629 8 0.0339 0.0605 0.1004 0.1556 0.2253 0.3020 0.3679 0.3874 0.2985 9 0.0046 0.0101 0.0207 0.0404 0.0751 0.1342 0.2316 0.3874 0.6302

10 0 0.0003 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1 0.0042 0.0016 0.0005 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000 2 0.0229 0.0106 0.0043 0.0014 0.0004 0.0001 0.0000 0.0000 0.0000 3 0.0746 0.0425 0.0212 0.0090 0.0031 0.0008 0.0001 0.0000 0.0000 4 0.1596 0.1115 0.0689 0.0368 0.0162 0.0055 0.0012 0.0001 0.0000 5 0.2340 0.2007 0.1536 0.1029 0.0584 0.0264 0.0085 0.0015 0.0001 6 0.2384 0.2508 0.2377 0.2001 0.1460 0.0881 0.0401 0.0112 0.0010 7 0.1665 0.2150 0.2522 0.2668 0.2503 0.2013 0.1298 0.0574 0.0105 8 0.0763 0.1209 0.1757 0.2335 0.2816 0.3020 0.2759 0.1937 0.0746 9 0.0207 0.0403 0.0725 0.1211 0.1877 0.2684 0.3474 0.3874 0.3151

10 0.0025 0.0060 0.0135 0.0282 0.0563 0.1074 0.1969 0.3487 0.5987

Z01_REND3161_13_AIE_APP.indd 555 28/10/16 11:27 AM

556  APPENDICES

P n r 0.55 0.60 0.65 0.70 0.75 0.80 0.85 0.90 0.95

15 0 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 2 0.0010 0.0003 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 3 0.0052 0.0016 0.0004 0.0001 0.0000 0.0000 0.0000 0.0000 0.0000 4 0.0191 0.0074 0.0024 0.0006 0.0001 0.0000 0.0000 0.0000 0.0000 5 0.0515 0.0245 0.0096 0.0030 0.0007 0.0001 0.0000 0.0000 0.0000 6 0.1048 0.0612 0.0298 0.0116 0.0034 0.0007 0.0001 0.0000 0.0000 7 0.1647 0.1181 0.0710 0.0348 0.0131 0.0035 0.0005 0.0000 0.0000 8 0.2013 0.1771 0.1319 0.0811 0.0393 0.0138 0.0030 0.0003 0.0000 9 0.1914 0.2066 0.1906 0.1472 0.0917 0.0430 0.0132 0.0019 0.0000

10 0.1404 0.1859 0.2123 0.2061 0.1651 0.1032 0.0449 0.0105 0.0006 11 0.0780 0.1268 0.1792 0.2186 0.2252 0.1876 0.1156 0.0428 0.0049 12 0.0318 0.0634 0.1110 0.1700 0.2252 0.2501 0.2184 0.1285 0.0307 13 0.0090 0.0219 0.0476 0.0916 0.1559 0.2309 0.2856 0.2669 0.1348 14 0.0016 0.0047 0.0126 0.0305 0.0668 0.1319 0.2312 0.3432 0.3658 15 0.0001 0.0005 0.0016 0.0047 0.0134 0.0352 0.0874 0.2059 0.4633

20 0 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 1 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 2 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 3 0.0002 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 4 0.0013 0.0003 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 5 0.0049 0.0013 0.0003 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 6 0.0150 0.0049 0.0012 0.0002 0.0000 0.0000 0.0000 0.0000 0.0000 7 0.0366 0.0146 0.0045 0.0010 0.0002 0.0000 0.0000 0.0000 0.0000 8 0.0727 0.0355 0.0136 0.0039 0.0008 0.0001 0.0000 0.0000 0.0000 9 0.1185 0.0710 0.0336 0.0120 0.0030 0.0005 0.0000 0.0000 0.0000

10 0.1593 0.1171 0.0686 0.0308 0.0099 0.0020 0.0002 0.0000 0.0000 11 0.1771 0.1597 0.1158 0.0654 0.0271 0.0074 0.0011 0.0001 0.0000 12 0.1623 0.1797 0.1614 0.1144 0.0609 0.0222 0.0046 0.0004 0.0000 13 0.1221 0.1659 0.1844 0.1643 0.1124 0.0545 0.0160 0.0020 0.0000 14 0.0746 0.1244 0.1712 0.1916 0.1686 0.1091 0.0454 0.0089 0.0003 15 0.0365 0.0746 0.1272 0.1789 0.2023 0.1746 0.1028 0.0319 0.0022 16 0.0139 0.0350 0.0738 0.1304 0.1897 0.2182 0.1821 0.0898 0.0133 17 0.0040 0.0123 0.0323 0.0716 0.1339 0.2054 0.2428 0.1901 0.0596 18 0.0008 0.0031 0.0100 0.0278 0.0669 0.1369 0.2293 0.2852 0.1887 19 0.0001 0.0005 0.0020 0.0068 0.0211 0.0576 0.1368 0.2702 0.3774 20 0.0000 0.0000 0.0002 0.0008 0.0032 0.0115 0.0388 0.1216 0.3585

Z01_REND3161_13_AIE_APP.indd 556 28/10/16 11:27 AM

APPENDIx C: VAlUES OF e-l FOr USE IN ThE POISSON DISTrIBUTION  557

Appendix C: Values of e−l for Use in the Poisson Distribution

l e-l l e-l

0.0 1.0000 3.1 0.0450

0.1 0.9048 3.2 0.0408

0.2 0.8187 3.3 0.0369

0.3 0.7408 3.4 0.0334

0.4 0.6703 3.5 0.0302

0.5 0.6065 3.6 0.0273

0.6 0.5488 3.7 0.0247

0.7 0.4966 3.8 0.0224

0.8 0.4493 3.9 0.0202

0.9 0.4066 4.0 0.0183

1.0 0.3679 4.1 0.0166

1.1 0.3329 4.2 0.0150

1.2 0.3012 4.3 0.0136

1.3 0.2725 4.4 0.0123

1.4 0.2466 4.5 0.0111

1.5 0.2231 4.6 0.0101

1.6 0.2019 4.7 0.0091

1.7 0.1827 4.8 0.0082

1.8 0.1653 4.9 0.0074

1.9 0.1496 5.0 0.0067

2.0 0.1353 5.1 0.0061

2.1 0.1225 5.2 0.0055

2.2 0.1108 5.3 0.0050

2.3 0.1003 5.4 0.0045

2.4 0.0907 5.5 0.0041

2.5 0.0821 5.6 0.0037

2.6 0.0743 5.7 0.0033

2.7 0.0672 5.8 0.0030

2.8 0.0608 5.9 0.0027

2.9 0.0550 6.0 0.0025

3.0 0.0498

Z01_REND3161_13_AIE_APP.indd 557 28/10/16 11:27 AM

558  APPENDICES Ap

pe nd

ix D

: F D

is tr

ib ut

io n

Va lu

es

F d

is tr

ib ut

io n

ta bl

e fo

r th

e up

pe r

5% p

ro ba

bi lit

y 1a

= 0.

05 2.

0. 05

F

df 1

df 2

1 2

3 4

5 6

7 8

9 10

12 15

20 24

30 12

0 ∞

1 16

1. 4

19 9.

5 21

5. 7

22 4.

6 23

0. 2

23 4.

0 23

6. 8

23 8.

9 24

0. 5

24 1.

9 24

3. 9

24 5.

9 24

8. 0

24 9.

0 25

0. 1

25 3.

3 25

4. 3

2 18

.5 1

19 .0

0 19

.1 6

19 .2

5 19

.3 0

19 .3

3 19

.3 5

19 .3

7 19

.3 8

19 .4

0 19

.4 1

19 .4

3 19

.4 5

19 .4

5 19

.4 6

19 .4

9 19

.5 0

3 10

.1 3

9. 55

9. 28

9. 12

9. 01

8. 94

8. 89

8. 85

8. 81

8. 79

8. 74

8. 70

8. 66

8. 64

8. 62

8. 55

8. 53

4 7.

71 6.

94 6.

59 6.

39 6.

26 6.

16 6.

09 6.

04 6.

00 5.

96 5.

91 5.

86 5.

80 5.

77 5.

75 5.

66 5.

63 5

6. 61

5. 79

5. 41

5. 19

5. 05

4. 95

4. 88

4. 82

4. 77

4. 74

4. 68

4. 62

4. 56

4. 53

4. 50

4. 40

4. 36

6 5.

99 5.

14 4.

76 4.

53 4.

39 4.

28 4.

21 4.

15 4.

10 4.

06 4.

00 3.

94 3.

87 3.

84 3.

81 3.

70 3.

67 7

5. 59

4. 74

4. 35

4. 12

3. 97

3. 87

3. 79

3. 73

3. 68

3. 64

3. 57

3. 51

3. 44

3. 41

3. 38

3. 27

3. 23

8 5.

32 4.

46 4.

07 3.

84 3.

69 3.

58 3.

50 3.

44 3.

39 3.

35 3.

28 3.

22 3.

15 3.

12 3.

08 2.

97 2.

93 9

5. 12

4. 26

3. 86

3. 63

3. 48

3. 37

3. 29

3. 23

3. 18

3. 14

3. 07

3. 01

2. 94

2. 90

2. 86

2. 75

2. 71

10 4.

96 4.

10 3.

71 3.

48 3.

33 3.

22 3.

14 3.

07 3.

02 2.

98 2.

91 2.

85 2.

77 2.

74 2.

70 2.

58 2.

54 11

4. 84

3. 98

3. 59

3. 36

3. 20

3. 09

3. 01

2. 95

2. 90

2. 85

2. 79

2. 72

2. 65

2. 61

2. 57

2. 45

2. 40

12 4.

75 3.

89 3.

49 3.

26 3.

11 3.

00 2.

91 2.

85 2.

80 2.

75 2.

69 2.

62 2.

54 2.

51 2.

47 2.

34 2.

30 13

4. 67

3. 81

3. 41

3. 18

3. 03

2. 92

2. 83

2. 77

2. 71

2. 67

2. 60

2. 53

2. 46

2. 42

2. 38

2. 25

2. 21

14 4.

60 3.

74 3.

34 3.

11 2.

96 2.

85 2.

76 2.

70 2.

65 2.

60 2.

53 2.

46 2.

39 2.

35 2.

31 2.

18 2.

13 15

4. 54

3. 68

3. 29

3. 06

2. 90

2. 79

2. 71

2. 64

2. 59

2. 54

2. 48

2. 40

2. 33

2. 29

2. 25

2. 11

2. 07

16 4.

49 3.

63 3.

24 3.

01 2.

85 2.

74 2.

66 2.

59 2.

54 2.

49 2.

42 2.

35 2.

28 2.

24 2.

19 2.

06 2.

01 17

4. 45

3. 59

3. 20

2. 96

2. 81

2. 70

2. 61

2. 55

2. 49

2. 45

2. 38

2. 31

2. 23

2. 19

2. 15

2. 01

1. 96

18 4.

41 3.

55 3.

16 2.

93 2.

77 2.

66 2.

58 2.

51 2.

46 2.

41 2.

34 2.

27 2.

19 2.

15 2.

11 1.

97 1.

92 19

4. 38

3. 52

3. 13

2. 90

2. 74

2. 63

2. 54

2. 48

2. 42

2. 38

2. 31

2. 23

2. 16

2. 11

2. 07

1. 93

1. 88

20 4.

35 3.

49 3.

10 2.

87 2.

71 2.

60 2.

51 2.

45 2.

39 2.

35 2.

28 2.

20 2.

12 2.

08 2.

04 1.

90 1.

84 24

4. 26

3. 40

3. 01

2. 78

2. 62

2. 51

2. 42

2. 36

2. 30

2. 25

2. 18

2. 11

2. 03

1. 98

1. 94

1. 79

1. 73

30 4.

17 3.

32 2.

92 2.

69 2.

53 2.

42 2.

33 2.

27 2.

21 2.

16 2.

09 2.

01 1.

93 1.

89 1.

84 1.

68 1.

62 40

4. 08

3. 23

2. 84

2. 61

2. 45

2. 34

2. 25

2. 18

2. 12

2. 08

2. 00

1. 92

1. 84

1. 79

1. 74

1. 58

1. 51

60 4.

00 3.

15 2.

76 2.

53 2.

37 2.

25 2.

17 2.

10 2.

04 1.

99 1.

92 1.

84 1.

75 1.

70 1.

65 1.

47 1.

39 12

0 3.

92 3.

07 2.

68 2.

45 2.

29 2.

18 2.

09 2.

02 1.

96 1.

91 1.

83 1.

75 1.

66 1.

61 1.

55 1.

35 1.

25 ∞

3. 84

3. 00

2. 60

2. 37

2. 21

2. 10

2. 01

1. 94

1. 88

1. 83

1. 75

1. 67

1. 57

1. 52

1. 46

1. 22

1. 00

Z01_REND3161_13_AIE_APP.indd 558 28/10/16 11:27 AM

APPENDIx D: F DISTrIBUTION VAlUES  559

F d

is tr

ib ut

io n

ta bl

e fo

r th

e up

pe r

1% p

ro ba

bi lit

y 1a

= 0.

01 2.

0. 01

F

df 1

df 2

1 2

3 4

5 6

7 8

9 10

12 15

20 24

30 12

0 ∞

1 40

52 50

00 54

03 56

25 57

64 58

59 59

28 59

82 60

22 .5

60 56

61 06

61 57

62 09

62 35

62 61

63 39

63 66

2 98

.5 0

99 .0

0 99

.1 7

99 .2

5 99

.3 0

99 .3

3 99

.3 6

99 .3

7 99

.3 9

99 .4

0 99

.4 2

99 .4

3 99

.4 5

99 .4

6 99

.4 7

99 .4

9 99

.5 0

3 34

.1 2

30 .8

2 29

.4 6

28 .7

1 28

.2 4

27 .9

1 27

.6 7

27 .4

9 27

.3 5

27 .2

3 27

.0 5

26 .8

7 26

.6 9

26 .6

0 26

.5 0

26 .2

2 26

.1 3

4 21

.2 0

18 .0

0 16

.6 9

15 .9

8 15

.5 2

15 .2

1 14

.9 8

14 .8

0 14

.6 6

14 .5

5 14

.3 7

14 .2

0 14

.0 2

13 .9

3 13

.8 4

13 .5

6 13

.4 6

5 16

.2 6

13 .2

7 12

.0 6

11 .3

9 10

.9 7

10 .6

7 10

.4 6

10 .2

9 10

.1 6

10 .0

5 9.

89 9.

72 9.

55 9.

47 9.

38 9.

11 9.

02

6 13

.7 5

10 .9

2 9.

78 9.

15 8.

75 8.

47 8.

26 8.

10 7.

98 7.

87 7.

72 7.

56 7.

40 7.

31 7.

23 6.

97 6.

88

7 12

.2 5

9. 55

8. 45

7. 85

7. 46

7. 19

6. 99

6. 84

6. 72

6. 62

6. 47

6. 31

6. 16

6. 07

5. 99

5. 74

5. 65

8 11

.2 6

8. 65

7. 59

7. 01

6. 63

6. 37

6. 18

6. 03

5. 91

5. 81

5. 67

5. 52

5. 36

5. 28

5. 20

4. 95

4. 86

9 10

.5 6

8. 02

6. 99

6. 42

6. 06

5. 80

5. 61

5. 47

5. 35

5. 26

5. 11

4. 96

4. 81

4. 73

4. 65

4. 40

4. 31

10 10

.0 4

7. 56

6. 55

5. 99

5. 64

5. 39

5. 20

5. 06

4. 94

4. 85

4. 71

4. 56

4. 41

4. 33

4. 25

4. 00

3. 91

11 9.

65 7.

21 6.

22 5.

67 5.

32 5.

07 4.

89 4.

74 4.

63 4.

54 4.

40 4.

25 4.

10 4.

02 3.

94 3.

69 3.

60

12 9.

33 6.

93 5.

95 5.

41 5.

06 4.

82 4.

64 4.

50 4.

39 4.

30 4.

16 4.

01 3.

86 3.

78 3.

70 3.

45 3.

36

13 9.

07 6.

70 5.

74 5.

21 4.

86 4.

62 4.

44 4.

30 4.

19 4.

10 3.

96 3.

82 3.

66 3.

59 3.

51 3.

25 3.

17

14 8.

86 6.

51 5.

56 5.

04 4.

69 4.

46 4.

28 4.

14 4.

03 3.

94 3.

80 3.

66 3.

51 3.

43 3.

35 3.

09 3.

00

15 8.

68 6.

36 5.

42 4.

89 4.

56 4.

32 4.

14 4.

00 3.

89 3.

80 3.

67 3.

52 3.

37 3.

29 3.

21 2.

96 2.

87

16 8.

53 6.

23 5.

29 4.

77 4.

44 4.

20 4.

03 3.

89 3.

78 3.

69 3.

55 3.

41 3.

26 3.

18 3.

10 2.

84 2.

75

17 8.

40 6.

11 5.

18 4.

67 4.

34 4.

10 3.

93 3.

79 3.

68 3.

59 3.

46 3.

31 3.

16 3.

08 3.

00 2.

75 2.

65

18 8.

29 6.

01 5.

09 4.

58 4.

25 4.

01 3.

84 3.

71 3.

60 3.

51 3.

37 3.

23 3.

08 3.

00 2.

92 2.

66 2.

57

19 8.

18 5.

93 5.

01 4.

50 4.

17 3.

94 3.

77 3.

63 3.

52 3.

43 3.

30 3.

15 3.

00 2.

92 2.

84 2.

58 2.

49

20 8.

10 5.

85 4.

94 4.

43 4.

10 3.

87 3.

70 3.

56 3.

46 3.

37 3.

23 3.

09 2.

94 2.

86 2.

78 2.

52 2.

42

24 7.

82 5.

61 4.

72 4.

22 3.

90 3.

67 3.

50 3.

36 3.

26 3.

17 3.

03 2.

89 2.

74 2.

66 2.

58 2.

31 2.

21

30 7.

56 5.

39 4.

51 4.

02 3.

70 3.

47 3.

30 3.

17 3.

07 2.

98 2.

84 2.

70 2.

55 2.

47 2.

39 2.

11 2.

01

40 7.

31 5.

18 4.

31 3.

83 3.

51 3.

29 3.

12 2.

99 2.

89 2.

80 2.

66 2.

52 2.

37 2.

29 2.

20 1.

92 1.

80

60 7.

08 4.

98 4.

13 3.

65 3.

34 3.

12 2.

95 2.

82 2.

72 2.

63 2.

50 2.

35 2.

20 2.

12 2.

03 1.

73 1.

60

12 0

6. 85

4. 79

3. 95

3. 48

3. 17

2. 96

2. 79

2. 66

2. 56

2. 47

2. 34

2. 19

2. 03

1. 95

1. 86

1. 53

1. 38

∞ 6.

63 4.

61 3.

78 3.

32 3.

02 2.

80 2.

64 2.

51 2.

41 2.

32 2.

18 2.

04 1.

88 1.

79 1.

70 1.

32 1.

00

Z01_REND3161_13_AIE_APP.indd 559 28/10/16 11:27 AM

560  APPENDICES

Appendix E: Using POM-QM for Windows

Welcome to POM-QM for Windows. Along with its companion Excel QM (see Appendix F), it makes available to you the most user-friendly software available for the field of quantitative analysis/quantitative methods (QA/QM). This software may also be used for the field of production/ operations management (POM). It is possible to display all of the modules, only the QM modules, or only the POM modules. Because this book is about quantitative methods, only the QM modules are shown throughout the textbook, and this software is referenced as QM for Windows. QM for Windows is a package that has been designed to help you to better learn and understand this field. The software can be used to either solve problems or check answers that have been derived by hand. You will find that this software is exceptionally friendly due to the following features:

●● Anyone familiar with any standard spreadsheet or word processor in Windows will easily be able to use QM for Windows. All modules have help screens that can be accessed at any time.

●● The screens for every module are consistent, so that when you become accustomed to using one module, you will have an easy time with the other modules.

●● The spreadsheet-type data editor allows full screen editing.

●● Files are opened and saved in the usual Windows fashion, and in addition, files are named by module, which makes it easy to find files saved previously.

●● It is easy to change from one solution method to another to compare methods and answers.

●● Graphs are easily displayed and printed.

Installing POM-QM for Windows Go to the Companion Website for this book to download and install the POM-QM for Windows software. Instructions are provided on how to download, install, and register the software.

After the installation and registration are complete, you will have a program group added to your Program Manager. The group will be called POM-QM for Windows 3. In addition, a shortcut to the program will be placed on the desktop. To use the QM for Windows program, double-click on the shortcut on the desktop or use Start, POM-QM for Windows 3, POM-QM for Windows.

When you use QM for Windows for the first time, you should select Help from the menu bar and then select PDF Manual or Word Manual to obtain complete instructions on using the software. Brief instructions will be provided in this appendix.

The first screen that is displayed in QM for Windows (see Program 1.1 in Chapter 1) contains the assorted components that are available on most screens. The top of that screen is the standard Windows title bar. Below the title bar is a standard Windows menu bar. The details of the eight menu options—File, Edit, View, Module, Format, Tools, Window, and Help—are explained in this appen- dix. Upon starting QM for Windows, some of the menu options such as Edit and Format may not be available. They will become available when a module is selected or when a problem is entered. Below the menu are two toolbars: a standard toolbar and a format toolbar. The toolbars contain standard shortcuts for several of the menu commands. If you move the mouse over the button for about two seconds, an explanation of the button will be displayed on the screen.

The next bar contains an instruction. There is always an instruction here trying to help you to figure out what to do or what to enter. Currently, the instruction indicates to select a module or open a file. When data are to be entered into the data table, this instruction will explain what type of data (integer, real, positive, etc.) are to be entered.

In Program 1.1 in Chapter 1, we show the module list after clicking on Module. We selected to show only the QM modules.

Creating a New Problem To enter a new problem, select Module to see the list of available techniques. Click the module you wish to use based on the type of problem to be solved. Next you either click the icon to enter a new problem or open a previously saved problem, or you select File and then New or Open. In some modules, when New is selected, there will be a menu of submodules. Where this is the case, one of these must be selected before the problem is entered.

The top line of the creation screen contains a text box in which the title of the problem can be entered. For many modules, it is necessary to enter the number of rows in the problem. Rows will

Solving a Problem There are several ways to solve a problem. The easiest way is to press the Solve button on the standard toolbar. Alternatively, the function key F9 may be used. Finally, if you press the Enter key after the last piece of data is entered, the problem will be solved. After solving a problem, to return to editing the data press the Edit button, which has replaced the Solve button on the standard toolbar, or use F9.

Z01_REND3161_13_AIE_APP.indd 560 28/10/16 11:27 AM

have different names depending on the modules. For example, in linear programming, rows are constraints, whereas in forecasting, rows are past periods. The number of rows can be chosen with either the scroll bar or the text box.

POM-QM for Windows has the capability to allow you different options for the default row and column names. Select one of the radio buttons to indicate which style of default naming should be used. In most modules, the row names are not used for computations, but you should be careful because in some modules (most notably, Project Management) the names might relate to precedences.

Many modules require you to enter the number of columns. This is given in the same way as the number of rows. All row and column names can be changed in the data table.

Some modules will have an extra option box, such as for choosing minimize or maximize or selecting whether distances are symmetric. Select one of these options. In most cases, this option can later be changed on the data screen.

When you are satisfied with your choices, click on the OK button or press the Enter key. At this point, a blank data screen will be displayed. Screens will differ from module to module.

Entering and Editing Data After a new data set has been created or an existing data set has been loaded, the data can be edited. Every entry is in a row and column position. You navigate through the spreadsheet using the cursor movement keys. These keys function in a regular way with one exception—the Enter key.

The instruction bar on the screen will contain a brief instruction describing what is to be done. There are essentially three types of cells in the data table. One type is a regular data cell into which you enter either a name or a number. A second type is a cell that cannot be changed. A third type is a cell that contains a drop-down box. For example, the signs in a linear programming constraint are chosen from this type of box. To see all of the options, press the box with the arrow.

There is one more aspect to the data screen that needs to be considered. Some modules need extra data above that in the table. In most of these cases, the data are contained in text/scrollbar combinations that appear on top of the data table.

Solution Displays At this point, you can press the Solve button to begin the solution process. A new screen will be displayed.

An important thing to notice is that there is more solution information available. This can be seen by the icons given at the bottom. Click on these to view the information. Alternatively, notice that the Window option in the main menu is now enabled. It is always enabled at solution time. Even if the icons are covered by a window, the Window option will always allow you to view the other solution windows.

Now that we have examined how to create and solve a problem, we explain all of the Menu options that are available.

File File contains the usual options that one finds in Windows: New As demonstrated before, this is chosen to begin a new problem/file.

Open This is used to open/load a previously saved file. File selection is the standard Windows common dialog type. Notice that the extension for files in the QM for Windows system is given by the first three letters of the module name. For example, all linear programming files have the exten- sion *.lin. When you go to the Open Dialog Box, the default value is for the program to look for files of the type in this module. This can be changed at the bottom left where it says “Files of Type.”

The names that are legal are standard file names. Case (upper or lower) does not matter. You may type them in as uppercase, lowercase, or mixed. In all of the examples, QM for Windows will add the three-letter extension to the end of the file name. For example, linear programming prob- lem will become linear programming problem.lin (assuming that it is indeed a linear programming problem).

Save Save will replace the file without asking you if you care about overwriting the previous ver- sion of this file. If you try to save and have not previously named the file, you will be asked to name this file.

Enter This key moves from cell to cell in the order from left to right, from top to bottom, skipping the first column (which usually contains names). Therefore, when entering a table of data, if you start at the upper left and work your way to the lower right row by row, this key is exceptionally useful.

Numerical Formatting Formatting is handled by the program automatically. For example, in most cases the number 1000 will automatically be formatted as 1,000. Do not type the comma. The program will prevent you from doing so!

Deleting Files It is not possible to delete a file using QM for Windows. Use the Windows file manager to do so.

APPENDIx E: USING POM-QM FOr WINDOWS  561

Z01_REND3161_13_AIE_APP.indd 561 28/10/16 11:27 AM

562  APPENDICES

Save as Save as will prompt you for a file name before saving. This option is very similar to the option to load a data file. When you choose this option, the Save As Dialog Box for Files will be displayed.

Save as Excel File Save as Excel File saves a file as an Excel file with both the data and the ap- propriate formulas for the solutions and is available for some but not all of the modules.

Save as HTML Save as HTML saves the tables as an HTML formatted file that can immediately be placed on the Internet.

Print Print will display a Print menu screen with four tabs. The Information tab allows you to select which of the output tables should be printed. The Page Header tab allows you to control the information displayed at the top of the page. The Layout tab controls the printing style. Information may be printed as plain ASCII text or as a table (grid) resembling the table on the screen. Try both types of printing and see which one you/your instructor prefers. The Print tab allows certain print settings to be changed.

Exit the Program The last option on the File menu is Exit. This will exit the program if you are on the data screen or exit the solution screen and return to the data screen if you are on the solution screen. This can also be achieved by pressing the Edit command button on the solution screen.

Edit The commands under Edit have three purposes. The first four commands are used to insert or delete rows or columns. The next command is used to copy an entry from one cell to all cells below it in the column. This is not often useful, but when it is useful, it saves a great deal of work. The last two entries can be used to copy the data table to other Windows programs.

View View has several options that enable you to customize the appearance of the screen. The toolbar can be displayed or not. The Instruction bar can be displayed at its default location above the data or below the data, as a floating window, or not at all. The status bar can be displayed or not.

Colors can be set to monochrome (black and white) or from this state to their original colors.

Module Module is shown in Chapter 1 as Program 1.1. The module selection contains a list of programs available with this book.

Format Format also has several options for the display. The colors for the entire screen can be set, and the font type and size for the table can be set. Zeros can be set to display as blanks rather than zeros. The problem title that is displayed in the data table and was created at the creation screen can be changed. The table can be squeezed or expanded. That is, the column widths can be decreased or increased. The input can be checked or not.

Tools The Tools menu option is an area available to annotate problems. If you want to write a note to yourself about the problem, select annotation; the note will be saved with the file if you save the file.

A calculator is available for simple calculations, including square root. There is a normal distri- bution calculator that can be used for finding confidence intervals and the like.

Window The Window menu option is enabled only at the solution screen. Additional output is available under Window. The type of output depends on the module being used.

Help The Help menu option provides information about the software in general, as well as about the indi- vidual modules. The first time you run POM-QM for Windows, you should select Help and choose Program Update to ensure that your software has the latest updates.

Help also contains a manual with further details about the program, a link to a program update, and a link for email support. If you send email, be sure to include the name of the program (POM-QM for Windows), the version of the program (from Help, About), the module in which the problem is occur- ring, and a detailed explanation of the problem, and to attach the data file for which the problem occurs.

A normal distribution calculator is found in the Tools menu option.

Z01_REND3161_13_AIE_APP.indd 562 28/10/16 11:27 AM

Appendix F: Using Excel QM and Excel Add-Ins

Excel QM Excel QM has been designed to help you to better learn and understand both quantitative analysis and Excel. Even though the software contains many modules and submodules, the screens for every module are consistent and easy to use. The modules are illustrated in Program 1.3.

Excel QM is an add-in to Excel, so you must have Excel on your PC. To install Excel QM, go to the Companion Website for instructions and the free download. An Excel QM icon will be placed on your desktop.

To run Excel QM, click the icon on the desktop, and Excel will start with the Excel QM add-in available. In addition to the usual Excel tabs, a tab for Excel QM will appear. Click this to see the Excel QM ribbon. There are two items on this ribbon that can be used to access the available tech- niques. The first way is to select By Chapter, which will show the techniques arranged by chapter number. The second way is to select Alphabetical, which will display the techniques in alphabeti- cal order. Using either of these, select the appropriate technique based on the problem you want to enter. A window will open for you to input information about the problem, such as the number of variables or the number of observations. When you click OK, a spreadsheet that has been initialized will appear. Instructions are included in a text box that appears just below the title that has been given to that problem. These instructions typically indicate what you must enter on the worksheet and, for certain methods, what other steps are necessary to obtain the final solution. For many of the modules, no further steps are necessary. For others, such as linear programming, Excel QM will have provided the inputs and made the necessary selections for the use of Solver.

Excel QM serves two purposes in the learning process. First, it can simply help you solve homework problems. You enter the appropriate data, and the program provides numerical solutions. QM for Windows operates on the same principle. But Excel QM allows for a second approach— that is, noting the Excel formulas used to develop solutions and modifying them to deal with a wider variety of problems. This “open” approach allows you to observe, understand, and even change the formulas underlying the Excel calculations, conveying Excel’s power as a quantitative analysis tool.

Technical Support for Excel QM If you have technical problems with either POM-QM for Windows or Excel QM that your instructor cannot answer, send an email to the address found at the www.prenhall.com/weiss website. If you send email, be sure to include the name of the program (POM-QM for Windows or Excel QM), the version of the program (from Help, About in POM-QM for Windows; from QM About in Excel QM), the module in which the problem is occurring, and a detailed explanation of the problem and attach the data file for which the problem occurs (if appropriate).

Activating Excel Add-Ins in Excel 2016 and 2013 Two important Excel add-ins are Solver and Analysis ToolPak. Both of these are a part of Excel but must be activated or loaded before you can use them the first time. To load these add-ins, follow these steps:

1. For Excel 2016 and 2013, click the File tab, click Options, and then click Add-Ins. 2. In the Manage box, select Excel Add-Ins and click Go. 3. Check the boxes next to Analysis ToolPak and Solver Add-In, and then click OK.

The Data tab now displays Solver and Data Analysis every time Excel is started. Instructions on using Data Analysis for regression are provided in Chapter 4.

APPENDIx F: USING ExCEl QM AND ExCEl ADD-INS  563

Z01_REND3161_13_AIE_APP.indd 563 28/10/16 11:27 AM

564  APPENDICES

Appendix G: Solutions to Selected Problems

Chapter 1

1-16 BEP = 5 units 1-18 BEP = 700 units 1-20 BEP = 160 per week; total revenue = $6,400 1-22 s = 45 1-24 (a) BEP = 25 (b) BEP = 18.333

Chapter 2

2-14 0.30 2-16 (a) 0.10 (b) 0.04 (c) 0.25 (d) 0.40 2-18 (a) 0.20 (b) 0.09 (c) 0.31 (d) Dependent 2-20 (a) 0.3 (b) 0.3 (c) 0.8 (d) 0.49 (e) 0.24 (f) 0.27 2-22 0.719 2-24 (a) 0.08 (b) 0.84 (c) 0.44 (d) 0.92 2-26 (a) 0.995 (b) 0.885 (c) Assumed events are

independent.

2-28 0.78 2-30 2.85 2-32 (a) 0.1172 (b) 0.0439 (c) 0.0098

(d) 0.0010 (e) 0.1719

2-34 0.328, 0.590 2-36 0.776 2-38 (a) 0.0548 (b) 0.6554 (c) 0.6554 (d) 0.2119 2-40 18,29.27 2-42 (a) 0.5 (b) 0.27425 (c) 48.2 2-44 0.7365 2-46 0.162

Chapter 3

3-18 Maximin criterion; Texan 3-20 (a) Stock market (b) $21,500 3-22 (b) CD 3-24 (b) Medium 3-26 8 cases 3-30 (b) Very large (c) Small (d) Very large (e) Very large 3-32 Minimax regret decision: option 2; minimum EOL

decision: option 2

3-34 -$0.526 3-36 Construct the clinic (EMV = 30,000). 3-40 Do not gather information; build quadplex. 3-42 0.533; 0.109 3-44 (c) Conduct the survey. If the survey is favorable,

produce razor; if not favorable, don’t produce razor.

3-46 (a) 0.923, 0.077, 0.25, 0.75 (b) 0.949, 0.051, 0.341, 0.659

3-48 Do not use study. Risk avoiders. 3-50 (a) Broad (b) Expressway (c) Risk avoider

Chapter 4

4-10 (b) SST = 29.5. SSE = 12. SSR = 17.5. Yn = 6 + 0.1X (c) Yn = 10

4-12 (a) Yn = 6 + 0.1X

4-16 (a) $149,542 (b) The model predicts the average price for a house this size. (c) Age, number of bedrooms, lot size (d) 0.3969

4-18 For X = 1200, Yn = 2.35; for X = 2400, Yn = 3.67 4-22 The model with just age is best because it has the high-

est r2 10.702. 4-24 Yn = 91,446.49 + 29.86X1 + 2,116.86X2 -

1,504.77X3 = 142,465.16. 4-26 The model with horsepower is

Yn = 53.87 - 0.269X1; r2 = 0.77. The model with weight is Yn = 57.53 - 0.01X2;

r2 = 0.73. 4-30 Yn = 77.190 + 0.047X 4-32 (a) Yn = 42.43 + 0.0004X

(b) Yn = -31.54 + 0.0058X

Chapter 5

5-16 MAD = 6.48 for 3-month moving average; MAD = 7.78 for 4-month moving average

5-18 Y = 2.22 + 1.05X 5-20 Forecast for year 12 is 11.789; MAD = 2.437. 5-23 Forecasts for year 6 are 565.6 and 581.4. 5-25 Forecast for year 6 is 555. 5-27 MAD = 5.6 for trend line; MAD = 74.56 for expo-

nential smoothing; MAD = 67 for moving average 5-29 (b) MAD = 2.60; RSFE = 5.11 at week 10 5-34 MAD = 3.34 5-38 F11 = 6.26; MAD = 0.58 for a = 0.8 is lowest. 5-40 270, 390, 189, 351

Chapter 6

6-20 (a) 20,000 (b) 50 (c) 50 6-22 $45 more; ROP = 4,000 6-24 8 million 6-26 28,284; 34,641; 40,000 6-28 (a) 10 (b) 324.92 (c) 6.5 days; 65 units

(d) Maximum = 259.94, average = 129.97 (e) 7.694 runs; (f) $192.35; $37,384.71 (g) 5

6-30 (a) Z = 2.05 (b) 3.075 (c) 23.075 (d) $4.61 6-32 Add 160 feet, $1,920 6-34 2,697 6-36 Take the discount. Cost = $49,912.50. 6-38 $4.50; $6.00; $7.50 6-46 Item 4 EOQ = 45 6-48 Order 200 units.

Chapter 7

7-14 40 air conditioners, 60 fans, profit = $1,900 7-16 175 radio ads, 10 TV ads 7-18 40 undergraduate, 20 graduate, $160,000 7-20 $20,000 petrochemical; $30,000 utility;

return = $4,200; risk = 6 7-22 X = 18.75, Y = 18.75, profit = $150 7-24 (1358.7, 1820.6), $3,179.30 7-26 (a) Profit = $2,375 (b) 25 barrels pruned, 62.5 barrels

regular (c) 25 acres pruned, 125 acres regular

Z01_REND3161_13_AIE_APP.indd 564 28/10/16 11:27 AM

APPENDIx G: SOlUTIONS TO SElECTED PrOBlEMS  565

7-28 (a) Yes (b) Doesn’t change 7-34 (a) 25 units product 1, 0 units product 2 (b) 25 units

of resource 1 are used, slack = 20; 75 units of resource 2 are used, slack = 12; 50 units of resource 3 are used, slack = 0; constraint 3 is binding and others are not. (c) 0, 0, and 25 (d) Resource 3; up to $25 (dual price) (e) Total profit would decrease by 5 (value of reduced cost).

7-36 24 coconuts, 12 skins; profit = 5,040 rupees 7-44 Use 7.5 lb of C-30, 15 lb of C-92, 0 lb of D-21, and 27.5

lb of E-11; cost = $3.35 per lb

Chapter 8

8-2 (b) $50,000 in LA bonds, $175,000 in Palmer Drugs, $25,000 in Happy Days

8-4 1.33 pounds of oat product per horse, 0 pounds of grain, 3.33 pounds of mineral product

8-6 6.875 TV ads; 10 radio ads; 9 billboard ads; 10 news- paper ads

8-8 Use 30 of the 5-month leases starting in March, 100 5-month leases starting in April, 170 5-month leases starting in May, 160 5-month leases starting in June, and 10 5-month leases starting in July.

8-10 Send 400 students from sector A to school B, 300 from A to school E, 500 from B to school B, 100 from C to school C, 800 from D to school C, and 400 from E to school E.

8-12 (b) 0.499 lb of ground meat, 0.173 lb of chicken, 0.105 lb of spinach, and 0.762 lb of potatoes; total cost = $1.75

8-14 13.7 trainees begin in August, and 72.2 begin in October.

Chapter 9

9-8 Des Moines to Albuquerque 200, Des Moines to Boston 50, Des Moines to Cleveland 50, Evansville to Boston 150, Ft. Lauderdale to Cleveland 250; cost = $3,200

9-10 5 units from Pineville to 3, 30 units from Oak Ridge to 2, 10 units from Oakville to 3, 30 units from Mapletown to 1; cost = $230; multiple optimal solutions

9-12 Total cost = $14,700 9-18 New Orleans’ cost is $20,000; Houston’s is $19,500, so

Houston should be selected.

9-20 Optimal cost using East St. Louis: $17,400; optimal cost using St. Louis: $17,250.

9-22 Job A12 to machine W, Job A15 to machine Z, Job B2 to machine Y, Job B9 to machine X; time = 50 hours

9-24 4,580 miles 9-26 Total rating = 335 9-28 Maximum total rating = 75.5 9-30 (a) $2,591,200 (b) $2,640,400 (c) $2,610,100 and

$2,572,100

9-34 200 on path 1–2–5–7–8, 200 on path 1–3–6–8, and 100 on path 1–4–8; = 500. This increases to 700 with the changes.

9-36 Total flow = 13 9-38 Shortest path is 1–3–7–11–14–16. Total distance is 74. 9-40 (a) 1,200 miles (b) 1,000 miles 9-42 Total distance = 40

Chapter 10 10-10 (a) 2 prime-time ads per week, 4.25 off-peak ads per

week, audience = 38,075 (b) 2 prime-time ads per week, 4 off-peak ads per week, audience = 36,800 (c) 4 prime-time ads per week, 1 off-peak ad per week, audience = 37,900

10-12 3 large posters and 4 small posters 10-16 (b) Build at Mt. Auburn, Mt. Adams, Norwood,

Covington, and Eden Park.

10-18 (a) X1 Ú X2 (b) X1 + X2 + X3 = 2 10-20 (b) 0 TV, 0.73 radio, 0 billboard, and 88.86 newspaper

ads

10-24 X1 = 15, X2 = 20 10-28 (b) 18.3 XJ6 and 10.8 XJ8; revenue = 70,420 10-30 0.333 in stock 1 and 0.667 in stock 2; variance = 0.102;

return = 0.09

Chapter 11

11-22 (a) 0.50 (b) 0.50 (c) 0.97725 (d) 0.02275 (e) 43.84

11-24 (a) 0.0228 (b) 0.3085 (c) 0.8413 (e) 0.9772 11-28 14 11-32 (b) Critical path A–C takes 20 weeks; path B–D takes

18 weeks (c) 0.222 for A–C; 5 for B–D (d) 1.00 (e) 0.963 (f) Path B–D has more variability and has a higher probability of exceeding 22 weeks.

11-38 Yes. The cost to crash is $2,200.

Chapter 12

12-10 Total costs for 1, 2, 3, and 4 clerks are $564, $428, $392, and $406, respectively.

12-12 (a) 4.167 cars (b) 0.4167 hours (c) 0.5 hours (d) 0.8333 (e) 0.1667

12-14 (a) 0.512, 0.410, 0.328 (b) 0.2 (c) 0.8 minutes (d) 3.2 (e) 4 (f) 0.429, 0.038 minutes, 0.15, 0.95

12-16 (a) 0.2687 hours (b) 3.2 (c) Yes; savings = $142.50 per hour.

12-18 (a) 0.0397 hours (b) 0.9524 (c) 0.006 hours (d) 0.1524 (e) 0.4286 (f) 0.4 (g) 0.137

12-20 With one person, L = 3, W = 1 hour, Lq = 2.25, and Wq = 0.75 hour. With two people, L = 0.6, W = 0.2 hour, Lq = 2.225, and Wq = 0.075 hour.

12-22 No 12-24 (a) 0.1333 hours (b) 1.333 (c) 0.2 hour (d) 2

(e) 0.333

12-26 (a) 80 customers per day (b) 10.66 hours, $266.50 (c) 0.664 hours, $16.60 (d) 2 tellers, $208.60

12-30 (a) 0.576 (b) 1.24 (c) 0.344 (d) 0.217 hours (e) 0.467 hours

12-32 (a) 0.27 hours (b) 3.2 (c) 4 (d) 0.33 hours (e) 0.4096

Chapter 13

13-14 No 13-16 Expected value is 6.35 (using formula). The average

number is 7 in Problem 13-15.

13-18 (b) Average number delayed = 0.40; average number of arrivals = 2.07

Z01_REND3161_13_AIE_APP.indd 565 28/10/16 11:27 AM

566  APPENDICES

13-26 (a) Cost/hour is generally more expensive replacing 1 pen each time.

(b) Expected cost/hour with 1 pen policy = $1.38 (or $58/breakdown); expected cost/hour with 4-pen policy = $1.12 (or $132/breakdown)

Chapter 14

14-8 (b) 90% (c) 30% 14-10 Next month, 4/15, 5/15, 6/15; three months, 0.1952,

0.3252, 0.4796

14-12 (a) 70% (b) 30% (c) 40% 14-14 25% for Battle’s; 18.75% for University; 26.25% for

Bill’s; 30% for College

14-16 111 at Northside, 75 at West End, and 54 at Suburban 14-18 Horizon will have 104,000 customers, and Local will

have 76,000.

14-20 New MFA = (5,645.16, 1,354.84) 14-22 50% Hicourt, 30% Printing House, and 20% Gandy 14-26 Store 1 will have one-third of the customers, and store

2 will have two-thirds.

Chapter 15

15-8 45.034 to 46.966 for x, 0 to 4.008 for R

15-10 16.814 to 17.187 for x, 0.068 to 0.932 for R

15-12 2.236 to 3.728 for x, 0 to 2.336 for R, in control

15-16 (a) 1011.8 for x and 96.3 for R (b) 956.23 to 1067.37 (c) Process is out of control.

15-18 LCL = 0, UCL = 4

Module 1

M1-4 Sun -0.80 M1-6 Lambda = 3.0445,

CI = 0.0223, RI = 0.58, CR = 0.0384 M1-8 Car 1, 0.4045 M1-10 University B has highest weighted average, 0.4995.

Module 2

M2-6 1–2–6–7, with a total distance of 10 miles M2-8 Shortest route is 1–2–6–7, with a total distance of

14 miles.

M2-10 Shortest route is 1–2–5–8–9, with a distance of 19 miles.

M2-12 4 units of item 1, 1 unit of item 2, and no units of items 3 and 4

M2-14 Ship 6 units of item 1, 1 unit of item 2, and 1 unit of item 3.

M2-16 The shortest route is 1–3–6–11–15–17–19–20.

Module 3

M3-6 (a) OL = $8(20,000 - X) for X … 20,000; OL = 0 otherwise (b) $0.5716 (c) $0.5716 (d) 99.99% (e) Print the book.

M3-8 (a) BEP = 1,500 (b) Expected profit = $8,000 M3-10 (a) OL = $10130 - X2 for X … 30; OL = 0

otherwise (b) EOL = $59.34 (c) EVPI = $59.34

M3-12 (a) Use new process. New EMV = $283,000. (b) Increase selling price. New EMV = $296,000.

M3-14 BEP = 4,955 M3-16 EVPI = $249.96 M3-18 EVPI = $51.24

Module 4

M4-8 Strategy for X: X2; strategy for Y: Y1; value of the game = 6

M4-10 X1 = 35>57; X2 = 22>57; Y1 = 32>57; Y2 = 25>57; value of game = 66.70

M4-12 (b) Q = 41>72, 1 - Q = 31>72, P = 55>72, 1 - P = 17>72

M4-14 Value of game = 9.33 M4-16 Saddle point exists. Shoe Town should invest $15,000

in advertising and Fancy Foot should invest $20,000 in advertising.

M4-18 Eliminate dominated strategy X2. Then Y3 is dominated and may be eliminated. The value of the game is 6.

M4-20 Always play strategy A14. $3 million.

Module 5

M5-8 X = -3>2; Y = 1>2; Z = 7>2

M5-16 £ -48>60 6>60 32>606>60 -12>60 6>60 12>60 6>60 -8>60

≥ M5-18 0X1 + 4X2 + 3X3 = 28; 1X1 + 2X2 + 2X3 = 16

Module 6

M6-6 (a) Y″ = 12X - 6 (b) Y″ = 80X3 + 12X (c) Y″ = 6>X4 (d) Y″ = 500>X6

M6-8 (a) Y″ = 30X4 - 1 (b) Y″ = 60X2 + 24 (c) Y″ = 24>X5 (d) Y″ = 250>X6

M6-10 X = 5 is point of inflection. M6-12 Q = 2,400, TR = 1,440,000 M6-14 P = 5.48

Module 7

M7-18 (b) 14X1 + 4X2 … 3,360; 10X1 + 12X2 … 9,600 (d) S1 = 3,360, S2 = 9,600 (e) X2 (f) S2 (g) 800 units of X2 (h) 1,200,000

M7-20 X1 = 2, X2 = 6, S1 = 0, S2 = 0, P = $36 M7-22 X1 = 14, X2 = 33, C = $221 M7-24 Unbounded M7-26 Degeneracy; X1 = 27, X2 = 5, X3 = 0, P = $177 M7-28 (a) Min. C = 9X1 + 15X2 X1 + 2X2 Ú 30 X1 + 4X2 Ú 40 (b) X1 = 0, X2 = 20, C = $300 M7-30 8 coffee tables, 2 bookcases, profit = 96 M7-34 (a) 7.5 to infinity (b) Negative infinity to $40

(c) $20 (d) $0

M7-36 (a) 18 Model 102, 4 Model H23 (b) S1 = slack time for soldering, S2 = slack time for inspection (c) Yes—shadow price is $4. (d) No—shadow price is less than $1.75.

Z01_REND3161_13_AIE_APP.indd 566 28/10/16 11:27 AM

APPENDIx G: SOlUTIONS TO SElECTED PrOBlEMS  567

M7-38 (a) Negative infinity to $6 for phosphate, $5 to infinity for potassium

(b) Basis won’t change, but X1, X2, and S2 will change. M7-40 Max P = 50 U1 + 4U2

12U1 + 1U2 … 120 20U1 + 3U2 … 250

Module 8

M8-16 Total cost is $230. M8-18 Total cost is $14,700. M8-20 Unbalanced; total cost = $5,310

M8-22 Total cost = $28,300 M8-24 Job A12 to machine W, Job A15 to machine Z, Job B2

to machine Y, Job B9 to machine X; time = 50 hours M8-26 4,580 miles and 6,040 miles, respectively. M8-28 Total = 86 M8-32 Total cars per hour = 5 M8-34 Total distance = 430 M8-41 (a) The shortest path is 1–3–7–11–14–16 with a distance

of 74. (b) The distance increases by 2.

M8-43 (a) 1,200 miles (b) 1,000 miles

Z01_REND3161_13_AIE_APP.indd 567 28/10/16 11:27 AM

568  APPENDICES

Chapter 1

1. c 2. d 3. b 4. b 5. c 6. c 7. d 8. c 9. d 10. a 11. a 12. c

Chapter 2

1. c 2. b 3. a 4. d 5. b 6. c 7. a 8. c 9. b 10. d 11. b 12. a 13. a 14. b 15. a

Chapter 3

1. b 2. c 3. c 4. a 5. c 6. b 7. a 8. c 9. a 10. d 11. b 12. c 13. c 14. a 15. c 16. b

Chapter 4

1. b 2. c 3. d 4. b 5. b

6. c 7. b 8. c 9. a 10. b 11. b 12. c

Chapter 5

1. b 2. a 3. d 4. c 5. b 6. b 7. d 8. b 9. d 10. b 11. c 12. d 13. b 14. c 15. b

Chapter 6

1. e 2. e 3. c 4. c 5. a 6. b 7. d 8. c 9. b 10. a 11. a 12. d 13. d 14. d

Chapter 7

1. b 2. a 3. b 4. c 5. a 6. b 7. c 8. c 9. b 10. c 11. a 12. a 13. a 14. a

Chapter 8

1. a 2. b 3. d 4. e 5. d 6. c

Chapter 9

1. d 2. b 3. c 4. b 5. d 6. b 7. b 8. d

Chapter 10

1. a 2. b 3. a 4. a 5. a 6. b 7. b 8. b 9. d 10. b 11. e

Chapter 11

1. e 2. c 3. a 4. d 5. b 6. c 7. b 8. a 9. b 10. b 11. a 12. a 13. Critical path (or critical) 14. program evaluation and review

technique 15. linear programming model 16. optimistic, most likely,

pessimistic 17. slack 18. monitor and control

Chapter 12

1. a 2. a

Appendix H: Solutions to Self-Tests

Z01_REND3161_13_AIE_APP.indd 568 28/10/16 11:27 AM

APPENDIx h: SOlUTIONS TO SElF-TESTS  569

3. b 4. e 5. c 6. b 7. c 8. d 9. b 10. d 11. c 12. first-come, first-served 13. negative exponentially

distributed 14. simulation

Chapter 13

1. b 2. b 3. a 4. b 5. a 6. a 7. d 8. a 9. b 10. b 11. d 12. d 13. c 14. e 15. (a) no, yes, no, no, no, yes, yes,

yes, no, yes (b) yes, yes, yes, yes, no, yes,

yes, no, no, no

Chapter 14

1. b 2. a 3. c 4. c 5. b 6. a 7. a 8. a 9. b 10. matrix of transition probabilities 11. collectively exhaustive, mutually

exclusive 12. vector of state probabilities

Chapter 15

1. b 2. c

3. d 4. a 5. c 6. b 7. c 8. d 9. b 10. b

Module 1

1. a 2. d 3. b 4. b 5. c 6. b 7. b 8. b

Module 2

1. c 2. b 3. e 4. c 5. b 6. a 7. c 8. e 9. a 10. a 11. c 12. c 13. b 14. b

Module 3

1. c 2. d 3. b 4. a 5. b 6. b 7. c

Module 4

1. b 2. a 3. c 4. b 5. b 6. b 7. a

Module 5

1. c 2. a 3. b 4. c 5. b 6. a 7. e 8. d

Module 6

1. a 2. d 3. a 4. b 5. c 6. d 7. d

Module 7

1. a 2. d 3. d 4. a 5. a 6. d 7. a 8. d 9. b 10. a 11. a 12. b 13. c 14. c 15. d 16. a 17. b

Module 8

1. c 2. b 3. b 4. a 5. b 6. b 7. a 8. b 9. a 10. b 11. b 12. b 13. b

Z01_REND3161_13_AIE_APP.indd 569 28/10/16 11:27 AM

This page intentionally left blank

0–1 (binary) variables, 363–368

A ABC analysis, 214 Absorbing states, 510–513 Acceptance sampling tables, 530 Accounting data, 14 Accounts receivable application, 510–513 Activities

cost to date for, 404 defining, 387, 388–389

Activity difference, 404 Activity-on-arc (AOA), 390 Activity-on-node (AON), 390 Activity times estimates, 391–392 Adaptive smoothing, 174 Additive rule, 25 Additive time-series models, 150 Additivity, 238 Airbus Industries simulation, 461 Airlines schedules maximizing profit, 369 Alabama Airlines, 496–497 Algorithms, 5, 309, 324 Alternate optimal solutions, 263–264, 300 Alternatives, 64, 238, 239

limiting the number of alternatives selected, 365 Ambulances, in Chile, 438 American Airlines

decision analysis, 90 revenue management, 308

American Food Store, 503–504 American Meteorological Society (AMS), 61 AMS. See American Meteorological Society (AMS) Analysis of variance (ANOVA) table, 122, 125 Analytic postoptimality method, 264–265 Andrew-Carter, Inc., 352–353 Annual carrying costs, 190, 194

production run model, 196 Annual holding cost, 197

calculating with safety stock, 207–208 Annual ordering costs, 190, 197 Annual setup costs, 197 ARCO p-charts, 538–539 Arcs, 320, 329, 330, 331, 332 Area of feasible solutions, 244 ARENA software, 483, 485 ARIMA. See Autoregressive integrated moving

average (ARIMA) chart Arnold’s Muffler Shop

exponential distribution, 47–48 multichannel queuing model, 440–441 single-channel queuing model, 435–438

Arrivals, characteristics of, 429–430 Aspen Technology, 269 Assignable variations, 531, 532

Assignment problems, 309, 319, 325–327, 363, 476 Assumptions, simplifying, 13–14, 15 Athens Olympic Games Organizing Committee

(ATHOC), 15 Atlas Foods, 503–504 @Risk, 485 Attributes, 537–541 Autoregressive integrated moving average (ARIMA)

chart, 538 Average inventory, 190, 193–194, 197 Average queue length, 442 Average waiting time, 442 Averaging techniques

exponential smoothing, 156–158, 160–162 moving averages, 154

B Backward pass, 394 Backwards stepwise procedure, 131 Bad decisions, 63 Bagwell Chemical Company, 361–362 Balking, 430, 434 Bank of America, 532 Bayes, Thomas, 28 Bayes’ Theorem

estimating probability values, 83–85 general form of, 28–29 probabilities and, 27–29

Bell Laboratories, 531 BEP. See Break-even point (BEP) Bernoulli process, 35–36 Best level of service, 428 Beta probability distribution, 391 Bias, 153 Bill of materials (BOM), 215 Binary variables, 129

modeling, 363–368 modeling with 0–1 variables, 363–368 regression models, 129–130

Binding constraint, 251 Binomial distribution, 35–38 Binomial formula and problem solving, 36 Binomial tables and problem solving, 37–38 Blake, Steve, 108–109 Blake Electronics, 108–109 Blending problems, 306–308 Boeing Corporation simulation, 461 BOM. See Bill of materials (BOM) Booz Allen Hamilton, 388, 484 Box filling example, 534–535

Excel QM for, 535–536 Brass Department Store quantity discount model, 202–203 Break-even point (BEP), 8, 9, 10, 11, 12 Brier, 39 Brown Manufacturing production run model, 198–199

Budgeting process, 400–404 four steps of, 400

Business analytics, 2–3, 74 Business games, 484 Business system simulation, 461–462

C Cable & Moore, 318 Cafe du Donut marginal analysis, 210–211 CALEB Technologies, 369 Calling population, 429, 430 Canadian Men’s Curling Championships, 39 Capital budgeting 0–1 (binary) variables, 364–365 Carnegie-Mellon University, 369 Carrying costs, 187, 189, 200

cost of capital, 188 insurance, 188 obsolescence, 188 salaries/wages for warehouse employees, 188 spoilage, 188 taxes, 188 theft, 188 warehouse costs, 188

Causal models, 148 Causation, 134 c-charts, 539–541

and Excel QM, 540–541 and Red Top Cab Company, 540

CELM. See Customer Equity Loyalty Management (CELM)

Centered moving averages (CMA), 166–167 Centers for Disease Control and Prevention, 433 Central limit theorem, 533 Central planning engine (CPE), 363 Central tendency of distribution, 32 Challenger space shuttle, 63 Charnes, A., 324, 368 Chase Manhattan Bank, 318 Clarizen software, 410 Classical method, of objective probability, 22–23 Cloud-based work environment, 395 CMA. See Centered moving averages (CMA) Coefficient of correlation, 116–117 Coefficient of determination, 116, 122 Coefficient of realism, 67, 74 Collectively exhaustive events, 23–24, 32, 502 Collectively exhaustive states, 502 Collinearity, 131 Communities of practice (CoPs), 320 Complete enumeration, 5 Complex queuing models, 446 Components and material structure tree, 215–216 Computational algorithm, 369 Computer

software and regression, 122–126

Index

Z10_REND3161_13_AIE_IND.indd 571 27/10/16 2:20 PM

572  INDEX

Computer languages and simulation, 462 Computers, 237

quantitative analysis role, 9–12 simulation, 446, 484–485

Conditional probabilities and decision trees, 78, 85 Conditional probability, 25, 26, 28, 78, 504 Conditional values, 64 Conflicting constraints, 261 Conflicting viewpoints in defining problems, 12–13 Constant service time model, 442–443 Constraints, 238, 239, 409

binding and nonbinding, 251 crash time, 408 dual price, 270 equations, 249 graphical representation, 241–245 greater-than-or-equal-to, 250–251 inequality, 242 left-hand side, 251 less-than-or-equal-to, 250–251 nonbinding, 251 redundant, 262–263 right-hand side, 251 right-hand-side values, 264, 269–271 solution points that satisfy, 242–243 transportation problems, 322

Consumer market survey, 148 Continental Airlines CrewSolver system, 369 Continuous probability distribution, 32

and continuous random variables, 34–35 Continuous random variables, 31, 34–35 Control charts, 530

attributes, 537–541 building, 531 c-charts, 539–541 defects, 539–540 patterns to look for, 531 QM for Windows, 547–548 R-chart, 532, 535, 537 variables, 532–537 x -chart (x-bar chart), 532–537

Controllable inputs, 472 Controllable variables, 4 Cooper, W. W., 324, 368 Corner point method, 248–250, 258–259 Corporate operating system simulation, 484–485 Correlation, 134 Cost analysis simulation, 481–484 Cost data, 400 Cost parameters, 7 Costs

fixed, 6, 8, 11, 18 planning and scheduling project costs, 400–403 project, 400–404 service, 428 single-channel queuing model, 436–438 variable, 6, 8, 11 waiting lines, 428

CPM. See Critical path method (CPM) Crashing, 405–409 Crash time, 405 CrewSolver system, 369 Criterion of realism, 67 Critical activities, 395 Critical path, 388, 392–395 Critical path method (CPM), 387–393 Crosby, Philip, 530 Crystal Ball, 485 CSX Transportation Inc. optimization models, 7 Cumulative probability distribution, 465, 472 Curling champions, probability assessments of, 39 Current state to future state, 504 Customer Equity Loyalty Management (CELM), 509 Cyclical (C) component of time-series, 150

D Daily unloading rate variable, 476 Dantzig, George D., 239 Data Analysis add-in, 11, 122

Data envelopment analysis (DEA), 309 Day, Jason, 486 Decision analysis utility theory, 86–91 Decision making

automating process, 2 centralized system, 191 under certainty, 65–69 decision trees, 77–82 group, 148 and minimization, 73–75 model, 64, 148 probability concepts and, 26–27 under risk, 65, 69–75 six steps in, 63–65 types of, 65 under uncertainty, 65, 66–69, 90 utility criterion, 88–91

Decision nodes, 77 Decision points, 77 Decisions, good and bad, 63 Decision table, 64, 65 Decision theory, 63

alternatives, 64, 65, 78 analyzing problems, 75–77 conditional probabilities, 78 decision making, 82 decision trees, 3, 77–82 expected monetary value (EMV), 69–70, 79–81 expected value of sample information (EVSI),

81–82 and Ford Motor Company, 63, 69 lottery ticket, 86 models, 64, 65 possible outcomes and alternatives, 64, 65, 78–81 posterior probabilities, 78 sample information efficiency, 82 sensitivity analysis, 72–73 sequential decisions, 78–82 state-of-nature nodes, 77

Decision tree analysis, 77–82 five steps of, 77

Decision variables, 4, 241, 328, 472. See also Controllable variables

Decomposition method, 167–170 software for, 170

Decoupling function, 186 Defects and control charts, 539–540 Define-Measure-Analyze-Improve-Control

(DMAIC), 534 Degrees of freedom, 44–46 Delivery lag, 472 Delivery time, 194 Delphi method, 23, 148 Demand, 190, 320, 323

dependent, 214–219 fluctuating, 155, 205, 472 inventory, 189 inventory modeling, 13–14 irregular, 187 lead time, 205–206 single time period, 209–214

Demand constraints, 320 Deming, W. Edwards, 530 Department of Agriculture, operations research, 12 Department of Commerce finite population model,

444–445 Dependent demand, 214–219 Dependent events, 26 Dependent selections and 0–1 (binary) variables, 365 Dependent variables, 111, 113, 128 Descriptive analytics, 2, 3 Deseasonalized data, 165 Destinations, 320, 322, 327, 330 Deterministic assumptions, 264 Deterministic models, 9 Deviation, 114, 115, 151. See also Errors, forecast Deviational variables, 369 Diet problem, 239, 305–306 Direct measurement, 5 Disaster response research, 5 Discrete distributions, 210

Discrete probability distribution, 32–34 Discrete random variables, 31, 32 Disney World forecasting, 175 “Distribution of a Product from Several Sources to

Numerous Locations, The” (Hitchcock), 324 Divisibility assumption, 238, 239 DMEP. See Dual Mode Equipment Procedure (DMEP) Dodge, H. F., 530 Drawing cards, 26 Drexel Corp., 295 Dual Mode Equipment Procedure (DMEP), 470 Dual price, 270 Dummy variables. See Binary variables DuPont, 388 Dynamic Car-Planning (DCP) system, 7

E Earliest finish time, 392, 393, 394 Earliest possible time, 402 Earliest start time, 392, 393, 400, 410 Econometric models, 485 Economic order quantity (EOQ), 189–194, 200, 471

assumptions of, 189, 191 formula, 191–192 without instantaneous receipt assumption,

196–199 Economic systems and simulation, 462, 463, 485 Efficiency of sample information, 82 Elimination method, 248 Empirical rule and normal distribution, 44, 45 Employee scheduling applications, 299–300 EMV. See Expected monetary value (EMV) Enterprise resource planning (ERP), 220–221 Enumeration and integer programming problems, 358 EOL. See Expected opportunity loss (EOL) Equally likely, 67, 68 Equilibrium conditions, 507–510, 514 Equilibrium probabilities, 505, 507 Equilibrium share, 507 Equilibrium states, 507, 509, 510 Erlang, A. K., 428 Errors, 113

with constant variance, 117 forecast, 151 independent, 117 with a mean of zero, 117 normally distributed, 117

Error variance, 119 Events, 25–27

and activities, 387 collectively exhaustive, 23–24, 32 constraints, 408 dependent and independent, 26–27 mutually exclusive, 23–24, 32 statistically independent, 26 union of, 25

Excel, 9–12 add-ins, 11, 485 for analysis of Arnold’s multichannel queuing

model, 441 on Arnold’s Muffler shop queue, 436 assignment problems, 327 binomial probabilities, 38 box filling example, 535–536 for the Brown Manufacturing Problem, 198–199 c-chart, 540–541 constant service time model, 443 Data Analysis add-in, 11, 122 decision theory problems, 75–77, 85 decomposition method, 170 developing regression model, 122–124, 133–134 to develop multiple regression model, 127, 128 to develop regression model, 170, 171 dummy variables and, 129, 130 economic order quantity (EOQ), 193 Excel 2016, 9, 11, 44, 46 Excel POM-QM, 9–12 Excel spreadsheets, 9–12, 34 F distribution, 46

Z10_REND3161_13_AIE_IND.indd 572 27/10/16 2:20 PM

INDEX  573

finding exponential probabilities, 48 finite population model, 445 forecasting, 158–160 Goal Seek, 11, 12 integer programming model, 361, 363 integer programming problems, 360 integer solutions, 305 labor planning solution, 301 linear programming (LP) problems, 251, 252–257 linear regression equation, 132–134 Markov analysis with, 526–528 maximal-flow problems, 331–332 mean, variance, and standard deviation, 34 minimal spanning tree problem, 336–337 minimization problems, 260–261 nonlinear relationship, 132 and payoff table problems, 75–77 p-chart, 539 and Poisson distribution, 49, 50 for Port of New Orleans simulation, 478 probability distribution of a continuous random

variable, 34 production run models, 198–199 program crashing, 409 program evaluation and review technique/ critical

path method (PERT/CPM), 398–399 quantity discount problems, 202–203 random numbers, generating, 471 regression calculations, 122, 123–124 regression line, 163–164 safety stock and reorder point, 208–209 shortest-route problems, 333–334 simulation, 469–471 simulation module, 471 Solver add-in, 11, 252–255 Solver and changes in right-hand-side values, 270–271 Solver and objective function coefficients change,

267–268 for the Sumco Pump Company example, 193 sum of squares error, 122 SUMPRODUCT function, 253 for Super Cola example, 536 and transportation problems, 321–322, 324–325 transshipment problems, 330 trend-adjusted exponential smoothing, 162 trend analysis, 163–164 used for normal probability distribution, 44 Whole Food Diet solution, 206

Excel QM box filling example, 535–536 c-charts and, 540–541 linear programming problems, 255–257 p-chart and, 539, 547

Executive Furniture Corporation, 320, 322 Expected activity time, 392, 394 Expected demand, 467 Expected monetary value (EMV), 69–70, 77, 78, 79,

80, 81 Expected opportunity loss (EOL), 71–72 Expected utility, 89 Expected value for activity completion times, 391 Expected value of perfect information (EVPI), 70–71, 75 Expected value of probability distribution, 32–33 Expected value of sample information (EVSI), 81–82 Expected value with perfect information (EVwPI), 70–71 Expenses, 6 Explanatory variable, 111 Exponential distribution, 35, 46–48, 49, 465 Exponential service times, 434–441 Exponential smoothing, 153, 156–158

and Midwestern Manufacturing, 161, 162 with trend model, 160–163

ExtendSim, 485 Extreme point, 248. See also Corner point method

F Facility location, 320

analysis, 323–325 supply-chain reliability, 337

Family Planning Research Center (Nigeria), 423–424 Favorable market (FM), 66, 68, 78, 79, 83 FB Badpoore Aerospace, 498–499 F distribution, 35, 119–122

degrees of freedom and, 44–46 Feasible region, 244, 245, 257, 268

corner points of, 248 Feasible solution, 244, 257, 263, 358 Federal Aviation Administration (FAA) simulation, 476 Feigenbaum, A. V., 530 Fifth Avenue Industries, 293–295 Financial applications, 300–305 Financial investment 0–1 (binary) variables, 367–368 Finite population model, 443–445

equations for, 444 Finnair, 509 First come, first served, 430 First-in, first-out (FIFO) rule, 14, 430, 434 Five steps of decision tree analysis, 77 Fixed-charge problem example, 366–367 Fixed costs, 6, 11, 18

feasible corner points and profits for, 249 Flair Furniture Company entering problem

data, 252 graphical solution approach, 241 linear programming (LP) problems, 239–241 LP problem solving using Excel QM, 255–257 LP problem solving using Excel’s Solver

Command, 252–255 QM for Windows, 251–252

Fix-It Shop example of LP for assignment problem, 325–327

Flair Furniture Company example of LP models, 240 linear programming example, 251–257

Flight safety and probability analysis, 30 Flowchart, 472 Flow diagram, 472 Focus group, 82 Food and beverages, 19–20 Food Mart, 503–504 Ford, 63

decision theory, 69 Forecasting, 3, 147

bias, 153 causal models, 148 centered moving averages, 166–167 combinations of weights, 155 decomposition method, 167–170 Disney World, 175 errors, 151 Excel and Excel QM, 158–160 exponential smoothing, 148, 160–162 inventory, 186 mean absolute deviation (MAD), 151–153, 154 mean absolute percent error (MAPE), 153 mean squared error (MSE), 152 measures of accuracy, 151–153, 154 models, 147–149, 160–164 monitoring and controlling, 172–174 monthly sales, 183 moving averages, 154 naïve model, 151 at NBC Universal, 172 purpose of, 147 qualitative models, 147–148 scatter diagrams, 150 time series, 149–150, 160, 163–167 time-series models, 149 tracking signals, 172–174 with trend, seasonal, and random variations,

167–172 types of, 147–149

Forecasts, 7 Fortune 100 firm inventory policy for service vehicles,

200, 210 Forward pass, 394 Forward stepwise procedure, 131 4-month moving average, 154 FREQUENCY function, 470 Frosty machine transshipment data, 328

F test, 119, 131, 134 Fundamental matrix, 510–513 Future market shares, 505 Future state from current state, 502

G Gantt charts, 388, 399, 400, 401, 410 Garbage in, garbage out, 4 Garcia-Golding Recycling, Inc., constant service time

model, 443 General Electric, 530 General Foundry Inc., 406–407

budgeting for, 400–404 example of PERT/CPM, 389, 391 and Excel QM, 399–400 and QM for Windows, 424–426 time estimates, 392, 393

General Motors, 468 Geographic information system (GIS), 362 The Glass Slipper, 183 Global Optimization (GO) Academy, 320 Global optimum, 373 Goal programming, 3, 357, 358, 368–372

Harrison Electric Company example, 369–372 selling advertising spots on NBC, 259 for tuberculosis drug allocation, 371 with weighted goals, 371–372

Goals hierarchy of importance, 368 multiple, 370–372 ranking with priority levels, 371 satisfices, 369 weighted, 371–372

Goal Seek, 11, 12 Goodman Shipping, 303–305 Greater-than-or-equal-to constraint, 250–251 Greenberg Motors, Inc., 295 Grocery stores, transition probabilities for, 503–504 Gross material requirements, 216–219

H Hardgrave Machine Company, 323–325 Harky, Lester, 389, 392, 395, 398, 408 Harrah’s Cherokee Casino, 310 Harris, Ford W., 189 Harrison Electric Company

goal programming, 369–372 integer programming, 358–361

Harry’s Auto Tire, Monte Carlo simulation, 464–468 Haynes Construction Company, 41–44 Hewlett Packard sales increment, 246 High Note Sound Company, 265, 267–268

and objective function coefficient change, 266 and QM for Windows and objective function

coefficient change, 266–267 Highway Corridor Analytical Program (HCAP), 362 Hill Construction, 422 Hinsdale Company safety stock, 205, 206–207 Hitchcock, F. L., 324 Holding costs, 13, 187, 188, 189–191, 197, 200 Holiday Meal Turkey Ranch minimization problems,

257–261 Hong Kong Bank of Commerce and Industry, 299–300 Horizontal axis, 112 Hurricane landfall location forecasts mean absolute

deviation (MAD), 152 Hurwicz criterion, 66, 67, 74

I IBM Systems and Technology Group, 363 ICT. See International City Trust (ICT) Immediate predecessors, 389, 390, 393, 395, 399 Implementing results, 6, 7, 15–16, 24 Incremental analysis, 209 Independent events, 26–27

Z10_REND3161_13_AIE_IND.indd 573 27/10/16 2:20 PM

574  INDEX

Independent variables, 111, 112, 126–128 Indicator variables, 129 Industrial dynamics, 484 Inequality constraints, 242 Infeasible solution, 244, 261 Infinite calling population, 430 Ingersoll Rand, 117 Ingredient blending applications, 305–308 Ingredient mix, 306–308 Input data, 3, 4–5, 6, 7, 14, 24, 188 Instantaneous inventory receipt assumption, 196–199 Integer programming, 238, 357, 358–363

and enumeration method, 358 and Excel spreadsheets, 360–361 and Harrison Electric Company, 358–361 integer programming problems, 305 limiting number of alternatives, 365 mathematical statement, 364 mixed-integer programming problems, 358,

360–363 and QM for Windows, 360–361 rounding off, 358 and U.S. Postal Service (USPS), 362 variables required integer values, 358 zero-one integer programming problems, 358

Integer values, 357, 358 Intel Corporation

inventory operations, 201 simulating chips, 470

Intercept, 113 Intermediate point, 327 International City Trust (ICT), 300–303 International Organization for Standardization (ISO),

530 Intersection, 25–27 Intervals and cumulative probability, 465 Inventory, 185

ABC analysis, 214 analysis and simulation, 471–475 annual carrying cost, 190 annual ordering cost, 190, 197 annual setup cost, 197 average, 190, 193, 197 average dollar value, 193–194 bill paying, 188 controlling levels, 186 cost analysis, 475 cost factors, 13, 187, 188 costs in the economic order quantity situation,

189–190 decisions, 187–189 decoupling function, 186 demand, 187, 190 dependent demand, 214–219 economic order quantity (EOQ), 189–194 forecasting, 147, 186 global levels, 201 how much to order, 187, 189–196, 215 inquiries, 188 inventory control, 186–187 inventory costs, 188, 193–194 irregular demand, 187 irregular supplies, 187 just-in-time inventory (JIT), 219–220 and labor storage, 187 lead time, 189, 194, 205–206 maximum inventory level, 197 optimal production quantity, 197 planning phase, 186 position, 194 processing/inspecting incoming, 188 purchase cost, 193–194 purchase orders, 188 purchasing department costs, 188 quantity discount models, 200–203 receipt of, 189 reorder point (ROP), 16, 194–196 risk management system, 199 safety stock, 187, 203–209 setup costs, 196 shortages, 186, 187

single-period inventory models, 209–214 stockouts, 186, 187 stored, 186 total cost, 191, 193 usage over time curve/model, 189 and U.S. Defense Logistics Agency, 199 when to order, 187, 194, 215

Inventory control, 235–236 Inventory models, 4, 13, 185, 187, 189, 192, 196,

200–201 single-period, 209–214

Inventory planning and control system, 185–186 importance of, 186–187

Inventory problem, 13, 472 Irregular supply and demand, 186, 187 ISO 9000 certified, 530 Isocost line approach minimization problems,

260–261, 263 Isoprofit line method, 245–248, 249, 250, 263

J Jackson Memorial Hospital’s operating rooms

simulation, 483 Jenny Wilson Realty model, 126–130 Joint probability, 25, 27–28, 29 Juran, J. M., 530 Jury of executive opinion, 148 Just-in-time inventory (JIT), 219–220

K Kanban, 219–220 Kantorovich, Leonid, 239 Karmarkar, Narendra, 239 Kelley, J. E., 388 Kendall, D. G., 431 Kendall notation, 431–432 Koopmans, Tjalling (T. C.), 239, 324

L Labor, 297, 302–303, 323

planning, 299–300 stored in inventory, 187

Labor unions, 323 Laplace criterion, 66, 67 Latest finish time, 393, 394, 395, 400 Latest start time, 393, 394, 395, 400, 402 Lauderdale Construction, 334–337 Law of addition for events not mutually exclusive,

29–30 Lead time, 189, 194, 205–206 Lead time variable, 471 Least-squares regression, 113, 163 Less-than-or-equal to constraint, 250–251 Limited calling population, 430 Limited queue length, 430 Linear constraints, 373 Linear objective function, 374 Linear programming (LP), 237–239, 248–250,

319–320 alternate optimal solutions, 263–264 alternative courses of action, 238, 239 applications, 289, 299–300, 308–309 assignment problem, 309, 319, 325–327 assumptions, 239, 357 beginning of, 239 certainty, 238, 239 conditions of certainty, 238, 239 constraints, 238, 239, 240, 241 corner point method, 248–250 data envelopment analysis (DEA), 309 defining decision variables, 240 deterministic assumptions, 264 divisibility assumption, 238, 239 employee scheduling applications, 299–300 Excel, 251, 252–257

facility location analysis, 323–325 feasible region, 244, 245 financial applications, 300–305 Flair Furniture Company example, 240–241 formulating, 239–241 fractional values, 238 graphical solution, 241–251 Hewlett Packard sales, 246 High Note Sound Company, 265–268 ingredient blending applications, 305–308 ingredient mix and blending problems, 306–308 integer programming, 238, 357, 358–363 isoprofit line method, 245–248 limitations, 357 and linear equations, 238 manufacturing applications, 293–299 marketing applications, 289–293 maximal-flow problem, 319, 330–332 minimal-spanning tree problem, 319, 320, 334 no feasible solution, 261 nonlinear programming, 357 nonnegative answers/variables, 238, 239 objective function, 238, 239, 369 optimal solution, 245–248 production mix, 293–295 production scheduling, 295–299 product mix problem, 239 project crashing, 407–409 properties of, 239 proportionality and additivity, 238 redundancy, 261, 262–263 requirements, 238–239 resources used to make products or services, 237 revenue management, 308–309, 310 sensitivity analysis, 264–271 shortest-route problem, 319, 320, 332–333 slack, 250–251 solution points satisfying constraints

simultaneously, 244 solving minimization problems, 257–261 special cases, 261–264 surplus, 250–251 and Swift & Company, 269 transportation problem, 309, 320–321, 326 transshipment problem, 309, 327–329 unboundedness, 261–262

Linear programming (LP) isoprofit line method, 250 Linear trends, 163 Little, John D. C., 445 Little’s Flow Equations, 445 Liver transplants in United States, 24 Local optimum, 373 Lockheed Martin Inc., 388 Logical method, of objective probability, 22–23 Logistics Management Institute (LMI), 199 Los Alamos Scientific Laboratory, 463 Low Knock Oil Company, 307–308, 309, 317

M Machine operations, and Markov analysis, 505, 506,

508 MAD. See Mean absolute deviation (MAD) Maintenance policy simulation model, 479–484 Malcolm Baldrige National Quality Awards, 530 Management science, 2, 3, 15 Management Sciences Associates (MSA), 291–293 Management system simulation, 462 Managing today’s energy supply chain, 188 Manufacturing applications

production mix, 293–295 production scheduling, 295–299

MAPE. See Mean absolute percent error (MAPE) Mapka Institute of Technology, 371 Marginal analysis, 210–214 Marginal loss (ML), 210 Marginal probability, 28, 29 Marginal profit (MP), 210 Marketing applications, 289–293 Marketing research, 291–293

Z10_REND3161_13_AIE_IND.indd 574 27/10/16 2:20 PM

INDEX  575

Market shares, 357, 501, 503, 504 Market values equilibrium share, 507 Markov analysis, 246

absorbing states, 510–513 accounts receivable application, 510–513 airline uses, 509 assumptions of, 502 equilibrium conditions, 507–510 with Excel, 526–528 fundamental matrix, 510–513 matrix of transition probabilities, 501, 504–505 predicting future market shares, 505 with QM for Windows, 525–526 reducing market costs, 509 states, 501–502 system starting in initial state or condition, 501 vector of state probabilities, 502–504 and volleyball skills, 513

Markovian volleyball, 513 Martin-Pullin Bicycle Corporation, 234 Massachusetts Institute of Technology (MIT), 302 Material cost, 187, 200 Material cost quantity discounts, 200 Material requirements planning (MRP), 214–219 Material structure tree, 215–216 Mathematical models, 4, 6, 8–9, 13, 14, 239, 461

advantages of, 9 categorized by risk, 9

Mathematical programming, 237, 357 Mathematics of probability, 22 Matrices, 501 Matrix of transition probabilities, 501, 504–505,

510–511 Maximal-flow technique, 319–320, 330–332 Maximax criterion, 66 Maximin criterion, 66 Maximum inventory level, 197 McIlroy, Rory, 486 Mean, 32–33, 34, 69

of binomial random variables, 38 Poisson distribution, 49 sales for product, 212 standard normal distribution, 38, 40, 43, 44

Mean absolute deviation (MAD), 151–153, 154 Mean absolute percent error (MAPE), 153 Mean squared error (MSE), 119, 152, 153, 163 Mean value, 69 Media selection, 289–291 MEIO. See Multi-echelon inventory optimization

(MEIO) system Melvin Lauderdale, 334 Metafuse, Inc., 395 Metropolis, Nicholas, 463 Mexicana Wire Winding, Inc., 286–287 Meyers Marketing Research, Inc., 524 Microsoft Corporation, 149 Microsoft Project, 410 Midwestern Manufacturing Company, 161

and exponential smoothing with trend forecasts, 162

and time observations, 164 Milestones, 410 Military games, 461, 463, 484 Minimal-spanning tree problem, 319, 320, 334–337 Minimax regret, 66, 67–69 Minimization problems, 257–261, 369 Mitigation, 5 Mixed-integer programming problems, 358, 360–363 Modeling, 4

0–1 (binary) variables, 363–368 real world, 6, 7, 24, 188, 246, 329, 362, 390, 433,

470 Models, 3, 6–12. See also specific models

building, 130–131 decision making, 64 deterministic, 9 developing, 4, 7, 13–14 for economic order quantity (EOQ), 192 inventory control, 185, 188 linear programming, 237 linear programming for transportation problems, 322

mathematical, 8–9 nonlinear regression, 133 probabilistic, 9 probability, 24 simulation, 461–462 spreadsheet, 9–12 testing, 119–121 transportation, 319–320, 322

Modified-distribution (MODI) method, 324 Monitoring solutions, 5–6

Monte Carlo simulation, 463–471, 474 QM for Windows for, 468–469 random numbers, 465–466, 474, 479, 480, 484

Monte Carlo simulation, 463–471 Montgomery County (Maryland) Public Health

Service, 433 Monthly sales, forecasting, 183 Most likely time, 391 Moving averages, 153

weighted, 154–156, 538 Multichannel queuing model, 439–441

equations for, 439–440 Multichannel system, 431, 432 Multicollinearity, 131, 134 Multi-echelon inventory optimization (MEIO) system,

201 Multiphase system, 431, 432 Multiple goals, 368 Multiple regression model, 126–129, 246

developing additive models, 150 evaluation, 127–128 multicollinearity, 131 with trend and seasonal components, 167, 170–172

Multiplicative time-series models, 150 Mutually exclusive events, 23–24, 32, 502 Mutually exclusive states, 502

N Naïve model, 151 NASA, 63, 384 National Academy of Sciences, 93 National Broadcasting Company (NBC), use of

linear, integer, and goal programming in selling advertising slots, 259

National Hurricane Center (NHC), 152 National Weather Service, 152 Natural variations, 531–532 NBC Universal and forecasting, 172 Negative exponential distribution, 46–48 Negative exponential probability distribution, 431 Net material requirements plan, 216–219 Network problems, 319–320

maximal-flow problem, 330–332 minimal-spanning tree problem, 334–337 shortest-route problem, 320, 332–333

Networks, 319–320 backward pass, 394 constraints, 408 forward pass, 394 program evaluation and review technique/critical

path method (PERT/CPM), 388, 390 New England Foundry, Inc., 457–458 NHC. See National Hurricane Center (NHC) Nodes, 320, 328, 330, 331, 332, 333, 334 Nonbinding constraints, 251, 265 Nonlinear constraints, 373–374 Nonlinear objective function, 373 Nonlinear programming (NLP), 3, 357, 358, 372–375 Nonlinear regression, 131–134 Nonnegative variables, 238, 239, 365 Nonnegativity constraints, 241, 409 Normal cost, 405 Normal curve, 38, 41, 533

area under, 40 Normal distribution, 32, 38–44

marginal analysis, 212–214 safety stock, 205

Normal probability distributions, 32, 38–44 Normal time, 405

NORMINV function, 470 Northeastern Airlines, 353 North-South Airline, 144 n-period moving average, 154

O Oakton River bridge, 385 Objective approach of probability, 22 Objective function, 238, 239, 249, 357, 373–375

coefficient changes, 266 linear programming (LP), 408

Objective probability, 22 Oil spills and operations research, 5 Olympic Games, 15 Omniplan software, 410 On-hand inventory, 195, 196 OnStar, strategic alternatives evaluation, 468 OpenProj software, 410 Operating characteristics, 434, 435

general relationships, 445 Operational gaming, 484 Operations research, 2, 5, 12, 16 Opinion polls, 23 Opportunity loss, 67, 71–72, 75 Opportunity loss table, 68, 69, 72, 75 Optimal integer solution, 358 Optimality analysis, 264. See also Sensitivity analysis Optimal planning, 239 Optimal production quantity

formula for, 197 Optimal solution, 245–248, 334 Optimistic criterion, 66, 67 Optimistic time, 391 “Optimum Utilization of the Transportation System”

(Koopmans), 324 OptSolver system, 369 Ordering costs, 13, 187, 188, 189, 190–191, 200 Order quantity, 472 Origins, 320 Outlier analysis, 532 Outliers, 532

P Package delivery, 320 Parallel activity, 399, 400 Parameters, 4, 7, 76

problem, 82 Parametric programming, 264. See also Sensitivity

analysis Parents and material structure tree, 215 Partitioning matrix of transition probabilities, 511 Payoff/cost table, 205 Payoff table, 64, 65, 75–77 p-chart, 537–539

and Excel QM, 539, 547 People, assigning projects to, 325–327 Percent of work completed, 404 Perfect information, 70–71, 74, 78, 82 PERT. See Program evaluation and review technique

(PERT); Program evaluation and review technique/critical path method (PERT/CPM)

PERT/cost, 400–404 PERT networks, 388 Pessimistic criterion, 66–67 Pessimistic time, 391 Physical models, 4, 461 Pilot plants, 4 Pittsburgh Pirates, 12 Planning phase, 186 Plutonium, 93 Poisson arrivals, 431, 434–439, 439–441 Poisson distribution, 35, 48–50, 430, 431, 439, 443

c-charts, 540 and Excel 2016, 50 formula for, 48–49

Polls, queuing, 442 POM-QM for Windows, 9–10

Z10_REND3161_13_AIE_IND.indd 575 27/10/16 2:20 PM

576  INDEX

Portfolio selection, 300–303 Port of Baltimore exponential smoothing, 157–158 Port of New Orleans simulation, 476–478

Excel for, 478 Posterior probabilities, 27–28, 29, 78, 83–85. See also

Conditional probabilities and decision trees Postoptimality analysis, 6, 264. See also Sensitivity

analysis Predecessor activity, 399, 400 Predicting future market shares, 505 Predictive analytics, 2 Predictor variable, 111 Preparedness, 5 Prescriptive analytics, 2 Presently known probabilities, 501 Present value, 364 Preventive maintenance simulation, 483 Prior probabilities, 27, 28, 29, 83, 84, 85 Pritchett’s Precious Time Pieces example, 8–9, 10–12 Pritsker Corp., 24 Probabilistic models, 9 Probabilities, 21–23

assessments of curling champions, 39 Bayes’ Theorem and, 27–29, 83–85 binomial distribution, 35–38 classical or logical method, 22–23 collectively exhaustive events and, 23–24 conditional, 25, 26, 78, 84–85 decision trees, 77–82 Empirical rule and, 44, 45 exponential distribution, 46–48 F distribution, 35, 44–46 flight safety and, 30 independent events, 26–27 intersections of events, 25–27 joint, 25, 27–28, 29, 84, 85 known/unknown in decision making, 65 marginal, 28 mathematics of, 22 mutually exclusive events and, 23–24 normal distribution, 32, 38–44 objective, 22 Poisson distribution, 35, 48–50, 434 posterior, 27–28, 29, 78, 83–85 prior, 27, 28, 29, 83–85 random variables, 30–31, 40 relative frequency approach, 24 relative frequency of demand, 22 revision, 27–30, 83–85 rules of, 22 simple, 22 sports and, 39 statistically dependent events, 26, 27–28 statistically independent events, 26 subjective, 22 table of normal curve areas, 39, 40 types of, 22–23 unions, 25 Venn diagrams and, 23–24

Probability analysis and flight safety, 30 Probability density function, 35, 38 Probability distributions, 14, 21, 31, 430, 472–473

binomial distribution, 35–38 central tendency, 32 continuous random variables, 34–35 discrete random variable, 32–34 expected value, 32–33 Kendall notation, 431–432 mean, 32–33 Monte Carlo simulation, 464–465 normal distribution, 39–44 variance, 33–34

Probability function, 35, 46 Problems, 12–15

and payoff tables, 75–77 quantitative analysis, 3, 4, 7, 9, 12–15 in using survey results, 85

Problem solving, 36–38 Process control system, 532 Processes, 531–537

assignable variations, 531, 532

average, 536 natural variations, 531–532 of simulation, 462 states, 501 variability, 531–532, 536

Processes dispersion, 536 Process Logistics Advanced Technical Optimization

(PLATO) project, 15 Procomp reorder point for chips, 195–196 Production costs, 323 Production mix, 293–295 Production/operations management (POM), 2, 9 Production process annual setup cost, 197 Production run model, 196–199 Production scheduling, 295–299 Product mix problem, 239, 265 Product quality, 529 Profit contribution, 239 Profit models, 6, 9 Program evaluation and review technique (PERT),

387–388, 389–392 Program evaluation and review technique/critical path

method (PERT/CPM) activity time estimates, 391–392 beta probability distribution, 391 critical path, 392–395 defining project and activities, 388–389 drawing network, 390 expected activity time, 392 General Foundry example, 389, 391 history of, 388 hospital customer service example, 390 immediate predecessor, 389 information provided by, 398 most likely time, 391 networks, 388, 390, 391 optimistic time, 391 pessimistic time, 391 probability of project completion, 395–398 project management, 399–400 projects in smaller activities or tasks, 389 questions answered by, 389 sensitivity analysis, 399–400 six steps of, 388 variance of activity completion time, 392

Programming, 237 Project costs

monitoring and controlling, 403–404 planning and scheduling, 400–403

Project crashing, 405–409 with linear programming, 407–409

Project Insight, 395 Project management, 410

five phases, 405 in officeless, cloud-based work environment, 395 QM for Windows, 424–426 sensitivity analysis, 399–400 and small companies, 405 and water project in California, 401

Project Phoenix, 269 Projects, 387–389

assigning people, 325–327 defining, 388–389 identifying activities, 387 probability of completion, 395–398 standard deviation, 397 weekly budget, 400–401

Project standard deviation, 397 Project variance, computing, 396 ProModel, 485 Proof 5, 485 Proportionality, 238, 239 Purchase cost, 187, 189, 193–194, 200 Purchase orders, 188 Pure integer programming problems, 358

Q QM for Windows, 9–12, 272

control charts, 547–548

decomposition method, 170 Flair Furniture linear programming example,

251–257 to forecast, 158–160 goal programming module, 372 integer programming model, 361–362 integer programming problems, 305,

360–361 inventory control, 235–236 linear programming (LP) problems,

251–252 with Markov analysis, 525–526 maximal-flow problem, 331 minimal spanning tree problem, 336–337 minimization problems, 260 Monte Carlo simulation, 468–469 and objective function coefficients changes,

266–267 and payoff table problems, 75, 76–77 program crashing, 409 queuing problems, 460 regression calculations, 122, 125–126 right-hand-side values changes, 270–271 and transportation module, 355–356 transportation problems, 321–322 trend analysis, 164

Quadratic programming problem, 373 Qualitative factors, 2 Qualitative forecasting techniques, 148 Qualitative models, 147–148 Quality, 529

definitions of, 529–530 Quality control (QC), 529

history of, 530 hospital uses, 534

Quality Is Free (Crosby), 530 Quality management, 529, 530 Quantifiable outcomes, 31 Quantitative analysis, 1–3, 153

approach, 3–6, 9, 12 computers and spreadsheet models role,

9–12 developing model, 6–9, 13–14 implementing results, 6 lack of commitment, 16 origin of, 3 possible problems in, 12–15 real-world, 6, 7 resistance to change, 16 techniques, listed, 3

Quantitative analysis/quantitative methods (QA/QM), 3–16

Quantitative causal models and regression analysis, 148

Quantitative models, 4, 5, 6–12, 13–14 forecasting, 148–149

Quantitative variables, 129 Quantity discount models, 200–203

total cost curve, 201 Quantity discounts, 186, 187, 189, 200–201 Queue discipline, 430 Queues, 427, 428 Queuing

environment, enhancing, 438–439 equations, 434–435 polls, 442

Queuing models, 427, 432 complex, 446 history of, 428

Queuing problems, 46 simulation, 476–478

Queuing system, 446 characteristics of, 429–433 configurations, 431, 432

Queuing theory, 48, 427, 438

R RAND function, 469 Random arrivals, 430, 440

Z10_REND3161_13_AIE_IND.indd 576 27/10/16 2:20 PM

INDEX  577

Random (R) component, of time-series, 150 Random errors, 113 Random numbers, 464, 469, 474, 479,

480, 484 generating, 465–466 generating in Excel, 471

Random variables, 30–31, 32, 33, 40 Random variations, 154, 167 Range charts, 536–537 Ranking goals with priority levels, 371 Raw data, 2 Raw materials, 187, 269 Ray Design, Inc., 332–334 R-charts, 532, 535, 537 Receipt of inventory, 189 Recovery, 5 Red Top Cab Company c-chart example,

540–541 Redundancy, 261, 262–263 Regression

calculations in formulas, 145–146 cautions and pitfall, 134–135 coefficients of, 119 computer software, 122–126 least squares, 113, 163 measuring fit of, 114–117 multiple regression model, 126–129 nonlinear, 131–134 as part of improvement initiative at Trane/Ingersoll

Rand, 117 relationship among variables, 111, 112, 113,

114–116 stepwise, 131 with trend and seasonal components, 167,

170–172 variance (ANOVA) table, 122

Regression analysis, 111, 112, 148, 153 cautions and pitfalls, 134–135

Regression equations, 113, 114, 116, 132, 133 Regression models, 117

assumptions of, 113, 117–119 binary variables, 129–130 building, 130–131 coefficient of correlation, 116–117 coefficient of determination, 116 dependent variable, 111, 113 dummy variables, 129–130 errors, assumptions about, 113, 117–119 estimating variance, 119 independent variable, 111, 112 nonlinear regression, 131–134 quantitative causal models, 148 scatter diagrams, 112 significant, 119–120 simple linear regression, 111, 113–114 statistical hypothesis test, 119–121 statistically significant, 130–131 testing for significance, 119–122 variables, 126–127

Relative frequency approach, 22, 23, 24 Remington Rand, 388 Reneging, 430, 434 Rentall trucks, 523–524 Reorder point (ROP), 16, 194–196, 472, 474 graphs, 195 Residual, 122 Resistance to change, 16 Resource leveling, 410 Resources

changes in, 269–270 constraints, 238, 239, 240 most effective use of, 238, 240 slack, 250 storing, 187 surplus, 250

Response, 5 Response variable, 111 Restrictions, 238 Results, 5, 14

analyzing, 6, 7, 15, 24, 188 implementing, 3, 6, 7, 15, 16, 188

Revenue management, 308–309, 310 Revised probability. See Posterior probabilities Revision probability, 27–30, 83–85 Risk analysis, 5 Risk avoider utility curve, 88 Risk management system, 199 Risk mathematical model categories, 9 Risk seeker utility curve, 88 RiskSim, 485 Romig, H. G., 530 Rules of probability, 22 Running sum of the forecast errors (RSFE), 172

S Safety stock, 14, 187, 203–209 Sales force composite, 148 Sampling, 5 Satisfices, 369 Scale models, 4 Scatter diagrams, 112, 150 Scatter plot. See Scatter diagrams Schank Marketing Research, 384 Schematic models, 4 SCO. See Supply-chain optimization (SCO) Seasonal adjustments, 164–167 Seasonal component of time-series, 149–150 Seasonal indexes, 164–167

with no trend, 165–166 with trend, 166–167

Seasonal variations, 164–167 Sensitivity analysis, 6, 9, 14, 15, 72–73, 194

decision trees, 82 input parameters values, 264 linear programming (LP) problems, 264–271 objective function coefficient changes,

266–268 project management, 399–400 resources or right-hand-side values changes,

269–270 technological coefficients changes, 268–269 trial-and-error approach, 264 what-if questions, 264

Sequential decisions, 78–82 Service costs, 428, 436–438 Service facility, 429

characteristics of, 430–431 Service level, 205 Service processes, 440 Service quality, 529 Service time distribution, 431 Service times, 464 Setup cost, 196 Shadow price, 270, 271 Shewhart, Walter, 530, 531 Shipping costs, 323 Shortages, 186, 187, 189 Shortest-route problem, 319, 320, 332–334 Significant regression model, 119–120 Simkin’s Hardware store, 472–475 Simon, Herbert A., 369 Simple linear regression, 111, 113–114 Simple probability, 22 Simplex algorithm, 239, 250, 369, 373 SIMUL8, 485 Simulated demand, 467 Simulating chips, 470 Simulation, 446, 461–463

advantages and disadvantages, 462–463 collecting data, 478 and complex queuing models, 446 computer languages, 462, 463 computers role in, 446, 485 controllable inputs, 472 corporate operating system, 484 cost analysis, 481–484 cumulative probability distribution, 465, 472 defining problem, 470 econometric models, 485 economic systems, 462, 485

with Excel spreadsheets, 469–471 Federal Aviation Administration (FAA), 476 flowchart, 472 Harry’s Auto Tire Monte Carlo sample,

464–468 history of, 463 inventory analysis, 471–475 issues, 484–486 lead time variable, 471 maintenance problems, 479–484 management system, 461 mathematical model, 461–462 Monte Carlo simulation, 463–471, 474 operational gaming, 484 physical models, 461 preventive maintenance, 483 probability distribution, 465, 472–473 queuing problem, 476–478 random numbers, 464, 465–466 results differing, 462 systems simulation, 484–485 and Tiger Woods, 486 uncontrollable inputs, 472 urban government, 484–485 validation, 485 variables, 463–464 verification, 485

Simulation model maintenance policy, 479–484

Simulation software tools, 485 Single-channel queuing model, 434–439 Single-channel system, 431 Single-period inventory models, 209–214 Single-phase system, 431, 432 Sink, 330, 331 Six Sigma, 530, 534 Six steps in decision making, 64 Ski lift slowing down to get shorter lines, 433 Slack, 250–251 Slack time, 395 Slope, 113 Smoothing constant, 156–157, 160–162 Software packages and project management, 410 Solutions

developing, 5, 6, 7, 9, 14, 24, 188 hard-to-understand mathematics, 14 implications of, 6 integer programming, 358, 360 only one answer limiting, 14 outdates, 13 sensitivity of, 6 stating problems as, 13–14 testing, 5–6, 7, 14–15, 24, 188

Solver add-in, 11, 252–255 changes in right-hand-side values, 270–271 changing cells, 260, 373 integer programming problems, 360 minimization problems, 260–261 objective function coefficients, 267–268,

373 preparing spreadsheet for, 252–253 project crashing, 409 solving method, 373 transportation problems, 321–322 transshipment problem, 330 usage, 253–255

Sources, 319, 320, 322, 323, 330 Southeast Airlines, 144 Southwestern University (SWU), 182

food and beverages at, 19–20 forecasting attendance at football games,

182 stadium construction, 422 traffic problems, 354

SPC. See Statistical process control (SPC) Special Projects Office of the U.S. Navy, 388 Special purpose algorithms, 309 Specific model, 4 Specific purchase cost, 200 Speith, Jordan, 486 Sports and probability, 39

Z10_REND3161_13_AIE_IND.indd 577 27/10/16 2:20 PM

578  INDEX

Spreadsheets for binomial probabilities, 38 entering problem data, 252–253 for exponential probabilities, 48 for the F distribution, 46 left-hand-side (LHS) of constraints formula,

252–253 for the Poisson distribution, 50 preparing for Solver, 252–253 quantitative analysis role, 9–12 for simulation, 469–471 value of objective function formula,

249, 252 SSE. See Sum of squares error (SSE) SSR. See Sum of squares regression (SSR) SST. See Sum of squares total (SST) Standard deviation, 3, 30, 34, 38, 40–41, 44, 119,

205–206, 397 Standard error of the estimate, 119 Standard gamble, 87 Standardized normal distribution function, 42 Standard normal curve, 533 Standard normal distribution, 40–41 Standard normal probability table,

and Haynes Construction Company example, 41–44

Standard normal table, 40–41, 43 Starting Right Corporation, 107 State-of-nature nodes, 77–78 State-of-nature points, 77 State probabilities, 501–502

calculating, 503–504 current period or next period, 505 equilibrium, 505, 507–510 vector of, 503–504

States, 501–502 accounts receivable application,

510–513 matrix of transition probabilities,

504–505, 510–511 steady state probability, 507

States of nature, 28, 64, 65 Statewide Development Corporation, 497–498 Statistical dependence and joint probability,

27–28 Statistical independence, 26 Statistically dependent events, 26, 27 Statistical process control (SPC), 529, 531–532

charts, 531 QM for Windows, 547–548 and safer drinking water, 538

Statistical quality control, 3 Steady state, 445 Steady state probabilities, 507, 509 Stepping-stone method, 324 Steps for the minimal-spanning tree techniques,

334 Stepwise regression, 131 Stigler, George, 239 Stillwater Associates, 395 Stockout cost, 187 Stockouts, 185, 186, 187, 189 Storing resources, 186, 187 Subjective approach of probability, 22, 23 Subjective probability, 22, 23 Subprojects, 410 Successor activity, 399, 400 Sugar cane moving in Cuba, 329 Sumco economic order quantity example (EOQ),

192–193 Sum of squares error (SSE), 115 Sum of squares regression (SSR), 115–116 Sum of squares residual, 122 Sum of squares total (SST), 115 Sumproduct function, 253 Super cola example and x-chart (x-bar chart),

536 Supply-chain disruption problem, 337 Supply-chain optimization (SCO), 363 Supply-chain reliability, 337, 363 Supply chains, 337

Supply constraints, 320 Surplus, 250–251 Survey results

favorable, 80, 82, 84 negative, 80, 84 problem in, 83–85

Swift & Company, 269 Systems simulation, 484–485

states, 502

T Tabular approach, 29 Taylor, Frederick Winslow, 3 Technological coefficients changes, 264,

268–269 Testing solutions, 5–6, 7, 14–15, 24 Thermal Neutron Analysis device, 30 Thompson, John, 64, 65, 66 Thompson Lumber Company

decision theory steps, 64–69 sequential decisions with decision trees,

78–81 Three grocery stores, transition probabilities for,

503–504 Three Hills Power Company simulation, 479–481 Three Rivers Shipping Company waiting lines,

428–429 Time series, 149–150 Time-series forecasting, 149, 160, 164–167, 246 TNT Express, 320 Toledo Leather Company, 107–108 Tolsky, Paul, 506 Tolsky Works, 506 Total cost (TC), 193

curve, 201 equation, 200 as function of order quantity, 191

Total expected cost, 428 Total Quality Control (Feigenbaum), 530 Total quality management (TQM), 530 Tracking signals, 172–174 Trane U.S. Inc., 117 Transformations, 131 Transient state, 445 Transition probabilities, for three grocery

stores, 504 Transportation applications, 309 Transportation models, 322, 326

history of, 324 Transportation problems, 309, 319–325

costs, 320, 321 demand constraints, 320, 328 destinations, 320, 322 facility location analysis, 323–325 general linear programming (LP), 320–322 intermediate points, 327 linear programming (LP) for, 320–321 minimizing costs, 320, 322, 323, 324 number of variables and constraints, 322 optimal shipping schedule, 321 solving with computer software, 321–322 source, 320, 322, 328 supply, 320 supply constraints, 320, 328 transshipment point, 327–329, 330, 332

Transshipment problems, 308, 319, 330 linear program for, 327–329 shortest-route problems, 332

Tree diagram for grocery store example, 503 Trend-adjusted exponential smoothing, 160–162 Trend analysis, 163–164 Trend (T) component, of time-series, 149 Trend line of deseasonalized data, 167–170 Trend projections, 163–164 Trends, linear, 167 Trial-and-error method, 5, 264, 463 Truck loading problem, 303–305 Tuberculosis drug allocation in Manila, 371 Tupperware International forecasting, 153

U ULAM, 24 Ulam, Stan, 463 Unboundedness, 261–262 Unconditional probabilities, 28 Uncontrollable inputs, 472 Uncontrollable variables, 4 Unfavorable market (UM), 66, 79, 83 Union of two events, 25 United Network for Organ Sharing (UNOS), 24 University of Maryland, College Park, 433 Unlimited calling population, 430 Unlimited queue length, 430 UNOS. See United Network for Organ Sharing

(UNOS) UPS optimization, 302 Urban government simulation, 462, 484–485 Usage curve, 189 U.S. Army simulation, 461 U.S. Defense Logistics Agency and inventory costs,

199 U.S. Department of Agriculture, 12 U.S. Department of Commerce, 444 U.S. Department of Energy (DOE), 93 U.S. Environmental Protection Agency, 538 U.S. Navy, 388 U.S. Postal Service (USPS), 362 U.S. Recommended Dietary Allowance (USRDA),

305–306 Utility assessment, 86–87 Utility curve, 87, 88 Utility theory, 86–91 Utility values, 86, 87, 88–91 Utilization factor, 435

V Validation simulation, 485 Validity of data, 14 Value of work completed, 404 Value stream mapping, 117 Variability in processes, 531–532 Variable costs, 6, 11, 189 Variables, 239, 472

continuous, 31–32 contribution rates, 264 control charts, 532–537 controllable, 4 cumulative probability distribution, 465 discrete random, 31 investigating relationship between, 112,

134–135 Monte Carlo simulation, 463–464 nonlinear relationships, 131 nonnegative, 238 probability distributions, 464–465 qualitative, 129 random, 30–31, 33 regression models, 130–134 relationship among, 111, 112, 113, 114 simulation, 464–465 transformation of, 131 transportation problems, 322 uncontrollable, 4

Variances of activity completion time, 391, 392 of binomial random variables, 38 of discrete probability distribution,

33–34 estimation, 119 exponential distribution, 47 Poisson distribution, 49 testing hypotheses about, 44–46

Variance (ANOVA) table, 122 Variations due to assignable causes, 531, 532 Vector of state probabilities, 502–504, 505 Vehicle Routing Problem (VRP), 362 Venn diagram, 23–24 Verification, 485

Z10_REND3161_13_AIE_IND.indd 578 27/10/16 2:20 PM

INDEX  579

Vertical axis, 112 VLOOKUP function, 469, 478 VOLCANO (Volume, Location, and Aircraft Network

Optimizer), 302 Volleyball and Markovian analysis, 513 von Neumann, John, 463 von Neumann midsquare method, 466

W Waiting costs, 428, 436–437 Waiting lines, 3, 427–429

characteristics of, 430 Walker, M. R., 388

Wallace Garden Supply, 154–156 Water project, California, 401 Waukesha example of LP and maximal-flow problems,

330–332 Weekly budget, 401 Weighted average, 67, 74 Weighted goals and goal programming, 371–372 Weighted moving averages, 154–156 Westover Wire Works, 286 What-if questions, 290, 363, 485 Whole Food Nutrition Center, 305 Win Big Gambling Club example for LP application,

290–291 Winter Park Hotel, 459 Woods, Tiger, 486

Work breakdown structure (WBS), 387 WTVX, 61

X x-chart (x-bar chart), 532–537 XLSim, 485

Z Zara inventory management system, 191 0–1 (binary) variables, 363–368 Zero-one integer programming problems, 358 Z standard random variable, 40–41

Z10_REND3161_13_AIE_IND.indd 579 27/10/16 2:20 PM

 M1-1

M1.3 Contrast multifactor evaluation with the analytic hierarchy process.

M1.1 Use the multifactor evaluation process in making decisions that involve a number of factors, where importance weights can be assigned.

M1.2 Understand the use of the analytic hierarchy process in decision making.

After completing this module, students will be able to:

Analytic Hierarchy Process

LEARNING OBJECTIVES

1 MODULE

Many decision-making problems involve a number of factors. For example, if you are considering a new job, factors might include starting salary, career advancement opportunities, work location, the people you would be working with on the job, the type of work you would be doing, and assorted fringe benefits. If you are considering the purchase of a personal computer, there are a number of important factors to consider as well: price, memory, compatibility with other computers, f lexibility, brand name, software availability, the existence of any user groups, and the support of the computer manufac- turer and the local computer store. In buying a new or used car, such factors as color, style, make and model, year, number of miles (if it’s a used car), price, dealership or person you are purchasing the car from, warranties, and cost of insurance may be important factors to consider.

In multifactor decision making, individuals subjectively and intuitively consider the vari- ous factors in making their selection. For difficult decisions, a quantitative approach is recom- mended. All of the important factors can then be given appropriate weights, and each alternative, such as a car, a computer, or a new job prospect, can be evaluated in terms of these factors. This approach is called the multifactor evaluation process (MFEP).

In other cases, we may not be able to quantify our preferences for various factors and alternatives. We then use the analytic hierarchy process (AHP). This process uses pairwise comparisons and then computes the weighting factors and evaluations for us. We begin with a discussion of the MFEP.

Many decisions involve a large number of factors.

Z02_REND3161_13_AIE_M01.indd 1 27/10/16 2:24 PM

M1-2  MODULE 1 • AnALytiC HiErArCHy PrOCEss

M1.1 Multifactor Evaluation Process

With the MFEP, we start by listing each factor and its relative importance on a scale from 0 to 1. Let’s consider an example. Steve Markel, an undergraduate business major, is looking at

several job opportunities. After discussing the employment situation with his academic advisor and the director of the placement center, Steve has determined that the only three factors re- ally important to him are salary, career advancement opportunities, and location of the new job. Furthermore, Steve has decided that career advancement opportunities are the most important to him. He has given this a weight of 0.6. Steve has placed salary next, with a weight of 0.3. Finally, Steve has given location an importance weight of 0.1. As with any MFEP problem, the importance weights for factors must sum to 1 (see Table M1.1).

At this time, Steve feels confident that he will get offers from AA Company, EDS, Ltd., and PW, Inc. For each of these jobs, Steve evaluated, or rated, the various factors on a 0 to 1 scale. For AA Company, Steve gave salary an evaluation of 0.7, career advancement an evaluation of 0.9, and location an evaluation of 0.6. For EDS, Steve evaluated salary as 0.8, career advance- ment as 0.7, and location as 0.8. For PW, Inc., Steve gave salary an evaluation of 0.9, career advancement an evaluation of 0.6, and location an evaluation of 0.9. The results are shown in Table M1.2.

Given this information, Steve can determine a total weighted evaluation for each of the alternatives or job possibilities. Each company is given factor evaluations for the three factors, and then the factor weights are multiplied by the factor evaluations and summed to get a total weighted evaluation for each company. As you can see in Table M1.3, AA Company has re- ceived a total weighted evaluation of 0.81. The same type of analysis is done for EDS, Ltd., and PW, Inc., in Tables M1.4 and M1.5. As you can see from the analysis, AA Company received the highest total weighted evaluation; EDS, Ltd., was next, with a total weighted evaluation of 0.74. Using the MFEP, Steve’s decision was to go with AA Company because it had the highest total weighted evaluation.

The company with the highest total weighted evaluation is selected.

TABLE M1.1 Factor Weights

FACTOR IMPORTANCE (WEIGHT)

Salary 0.3

Career advancement 0.6

Location 0.1

TABLE M1.2 Factor Evaluations

FACTOR AA CO. EDS, LTD. PW, INC.

Salary 0.7 0.8 0.9

Career advancement 0.9 0.7 0.6

Location 0.6 0.8 0.9

TABLE M1.3 Evaluation of AA Company

FACTOR NAME

FACTOR WEIGHT

FACTOR EVALUATION

WEIGHTED EVALUATION

Salary 0.3 × 0.7 = 0.21

Career 0.6 × 0.9 = 0.54

Location 0.1 × 0.6 = 0.06

Total 1 0.81

Z02_REND3161_13_AIE_M01.indd 2 27/10/16 2:24 PM

M1.2 AnALytiC HiErArCHy PrOCEss  M1-3

M1.2 Analytic Hierarchy Process

In situations in which we can assign evaluations and weights to the various decision factors, the MFEP described previously works fine. In other cases, decision makers may have difficulties in accurately determining the various factor weights and evaluations. In such cases, the analytic hierarchy process can be used. This process was developed by Thomas L. Saaty and published in his 1980 book The Analytic Hierarchy Process.

The AHP involves pairwise comparisons. The decision maker starts by laying out the overall hierarchy of the decision. This hierarchy reveals the factors to be considered, as well as the various decision alternatives. Then a number of pairwise comparisons are done, result- ing in the determination of factor weights and factor evaluations. They are the same types of weights and evaluations discussed in the preceding section and shown in Tables M1.1 through M1.5. As before, the alternative with the highest total weighted score is selected as the best alternative.

Judy Grim’s Computer Decision To illustrate this process, we take the case of Judy Grim, who is looking for a new computer system for her small business. She has determined that the most important overall factors are hardware, software, and vendor support. Furthermore, Judy has narrowed down her alternatives to three possible computer systems. She has labeled these SYSTEM-1, SYSTEM-2, and SYS- TEM-3. To begin, Judy has placed these factors and alternatives into a decision hierarchy (see Figure M1.1).

The decision hierarchy for the computer selection has three different levels. The top level describes the overall decision. As you can see in Figure M1.1, this overall decision is to select the best computer system. The middle level in the hierarchy describes the factors that are to be considered: hardware, software, and vendor support. Judy could decide to use a number of additional factors, but for this example, we keep our factors to only three to show you the types of calculations that are to be performed using the AHP. The bottom level of the decision hier- archy reveals the alternatives. (Alternatives have also been called items or systems.) As you can see, the alternatives include the three different computer systems.

The key to using the AHP is pairwise comparisons. The decision maker, Judy Grim, needs to compare two different alternatives using a scale that ranges from equally preferred to extremely preferred.

TABLE M1.5 Evaluation of PW, inc.

FACTOR NAME

FACTOR WEIGHT

FACTOR EVALUATION

WEIGHTED EVALUATION

Salary 0.3 × 0.9 = 0.27

Career 0.6 × 0.6 = 0.36

Location 0.1 × 0.9 = 0.09

Total 1 0.72

TABLE M1.4 Evaluation of EDs, Ltd.

FACTOR NAME

FACTOR WEIGHT

FACTOR EVALUATION

WEIGHTED EVALUATION

Salary 0.3 × 0.8 = 0.24

Career 0.6 × 0.7 = 0.42

Location 0.1 × 0.8 = 0.08

Total 1 0.74

The AHP uses pairwise comparisons.

Z02_REND3161_13_AIE_M01.indd 3 27/10/16 2:24 PM

M1-4  MODULE 1 • AnALytiC HiErArCHy PrOCEss

We use the following for pairwise comparison:

1—Equally preferred

2—Equally to moderately preferred

3—Moderately preferred

4—Moderately to strongly preferred

5—Strongly preferred

6—Strongly to very strongly preferred

7—Very strongly preferred

8—Very to extremely strongly preferred

9—Extremely preferred

AHP and the Environment

The release of greenhouse gases into the atmosphere has caused irremediable harm. New transportation technologies play a key function in improving air quality while simultaneously reducing the effects due to greenhouse gases, especially in urban areas. A need was identified to develop a decision tool to help determine the best fuel source for urban transportation fleet vehicles (e.g., buses, trucks).

Researchers in India employed a hybrid AHP to help decide between traditional and alternative fuel sources for urban areas

based on multiple criteria. The model they developed was a graph theoretic tool that portrayed a wide range of alternative fuels, their attributes, and their interrelations. The result was a “fuel performance index” that provided decision makers with an overall objective value for each fuel type that could be used for comparisons.

Source: Based on Lanjewar, P. B., R. V. Rao, and A. V. Kale, “Assessment of Alternative Fuels for Transportation Using a Hybrid Graph Theory and Analytic Hierarchy Process Method,” Fuel 154 (2015): 9–16, © Trevor S. Hale.

IN ACTION

Select the

Best Computer

System

Software Vendor SupportHardware

SYSTEM-1 SYSTEM-2 SYSTEM-3 SYSTEM-1 SYSTEM-2 SYSTEM-3 SYSTEM-1 SYSTEM-2 SYSTEM-3

FIGURE M1.1 Decision Hierarchy for Computer system selection

Z02_REND3161_13_AIE_M01.indd 4 27/10/16 2:24 PM

M1.2 AnALytiC HiErArCHy PrOCEss  M1-5

Using Pairwise Comparisons Judy begins by looking at the hardware factor and by comparing computer SYSTEM-1 with computer SYSTEM-2. Using the preceding scale, Judy determines that the hardware for com- puter SYSTEM-1 is moderately preferred to computer SYSTEM-2. Thus, Judy uses the number 3, representing moderately preferred. Next, Judy compares the hardware for SYSTEM-1 with SYSTEM-3. She believes that the hardware for computer SYSTEM-1 is extremely pre- ferred to computer SYSTEM-3. This is a numerical score of 9. Finally, Judy considers the only other pairwise comparison, which is the hardware for computer SYSTEM-2 compared with the hardware for computer SYSTEM-3. She believes that the hardware for computer SYSTEM-2 is strongly to very strongly preferred to the hardware for computer SYSTEM-3, a score of 6. With these pairwise comparisons, Judy constructs a pairwise comparison matrix for hardware. This is shown in the following table:

HARDWARE SYSTEM-1 SYSTEM-2 SYSTEM-3

SYSTEM-1 3 9

SYSTEM-2 6

SYSTEM-3

This pairwise comparison matrix reveals Judy’s preferences for hardware concerning the three computer systems. From this information, using the AHP, we can determine the evaluation fac- tors for hardware for the three computer systems.

Look at the upper-left corner of the pairwise comparison matrix. This upper-left corner compares computer SYSTEM-1 with itself for hardware. When comparing anything to itself, the evaluation scale must be 1, representing equally preferred. Thus, we can place the number 1 in the upper-left corner (see the next table) to compare SYSTEM-1 with itself. The same can be said for comparing SYSTEM-2 with itself and comparing SYSTEM-3 with itself. Each of these must also get a score of 1, which represents equally preferred.

In general, for any pairwise comparison matrix, we will place 1s down the diagonal from the upper-left corner to the lower-right corner. To finish such a table, we make the observation that if alternative A is twice as preferred as alternative B, we can conclude that alternative B is preferred only one-half as much as alternative A. Thus, if alternative A receives a score of 2 relative to alternative B, then alternative B should receive a score of 1∙2 when compared with alternative A. We can use this same logic to complete the lower-left side of the matrix of pairwise comparisons:

HARDWARE SYSTEM-1 SYSTEM-2 SYSTEM-3

SYSTEM-1 1 3 9

SYSTEM-2 1∙3 1 6

SYSTEM-3 1∙9 1∙6 1

Look at this newest matrix of pairwise comparisons. You will see that there are 1s down the diagonal from the upper-left corner to the lower-right corner. Then look at the lower left part of the table. In the second row and first column of this table, you can see that SYSTEM-2 received a score of 1∙3 compared with SYSTEM-1. This is because SYSTEM-1 received a score of 3 over SYSTEM-2 from the original assessment. Now look at the third row. The same has been done. SYSTEM-3 compared with SYSTEM-1, in row 3 and column 1 of the table, received a score of 1∙9. This is because SYSTEM-1 compared with SYSTEM-3 received a score of 9 in the original pairwise comparison. In a similar fashion, SYSTEM-3 compared with SYSTEM-2 received a score of 1∙6 in the third row and second column of the table. This is because when comparing SYSTEM-2 with SYSTEM-3 in the original pairwise comparison, the score of 6 was given.

Evaluations for Hardware Now that we have completed the matrix of pairwise comparisons, we can start to compute the evaluations for hardware. We start by converting the numbers in the matrix of pairwise compari- sons to decimals to make them easier to work with. We then get column totals:

Pairwise comparisons are performed for hardware.

Finishing the pairwise comparisons matrix.

Z02_REND3161_13_AIE_M01.indd 5 27/10/16 2:24 PM

M1-6  MODULE 1 • AnALytiC HiErArCHy PrOCEss

HARDWARE SYSTEM-1 SYSTEM-2 SYSTEM-3

SYSTEM-1 1 3 9

SYSTEM-2 0.333 1 6

SYSTEM-3 0.1111 0.1677 1

Column totals 1.444 4.1667 16.0

Once the column totals have been determined, the numbers in the matrix are divided by their respective column totals to produce the normalized matrix that follows:

HARDWARE SYSTEM-1 SYSTEM-2 SYSTEM-3

SYSTEM-1 0.6923 0.7200 0.5625

SYSTEM-2 0.2300 0.2400 0.3750

SYSTEM-3 0.0769 0.0400 0.0625

To determine the priorities for hardware for the three computer systems, we simply find the average of the various rows from the matrix of numbers, as follows:

HARDWARE

Row averages £ 0.6583

0.2819

0.0598

§ = = =

10.6923 + 0.7200 + 0.56252>3 10.2300 + 0.2400 + 0.37502>3 10.0769 + 0.0400 + 0.06252>3

The results are displayed in Table M1.6. As you can see, the factor evaluation for SYS- TEM-1 is 0.6583. For SYSTEM-2 and SYSTEM-3, the factor evaluations are 0.2819 and 0.0598, respectively. The same procedure is used to get the factor evaluations for all other factors—software and vendor support, in this case. But before we do this, we need to determine whether our responses are consistent by determining a consistency ratio.

Determining the Consistency Ratio To arrive at the consistency ratio, we begin by determining the weighted sum vector. This is done by multiplying the factor evaluation number for the first system by the first column of the original pairwise comparison matrix. We multiply the second factor evaluation by the second column and the third factor by the third column of the original matrix of pairwise comparisons. Then we sum these values over the rows:

Weighted sum vector =C 10.65832112 + 10.28192132 + 10.0598219210.6583210.33332 + 10.28192112 + 10.05982162 10.6583210.11112 + 10.2819210.16772 + 10.05982112

S = C2.04230.8602 0.1799

S The next step is to determine the consistency vector. This is done by dividing the weighted

sum vector by the factor evaluation values determined previously:

Consistency vector = C2.0423>0.65830.8602>0.2819 0.1799>0.0598

S = C3.10253.0512 3.0086

S COMPUTING LAMBDA AND THE CONSISTENCY INDEX Now that we have found the consistency vector, we need to compute values for two more terms, lambda 1l2 and the consistency index (CI),

Once the matrix is normalized, the numbers in each column will sum to 1.

The priorities for each system are obtained by averaging the values in each row of the normalized matrix.

Computing the weighted sum vector and the consistency vector.

TABLE M1.6 Factor Evaluation for Hardware

FACTOR SYSTEM-1 SYSTEM-2 SYSTEM-3

Hardware 0.6583 0.2819 0.0598

Z02_REND3161_13_AIE_M01.indd 6 27/10/16 2:24 PM

M1.2 AnALytiC HiErArCHy PrOCEss  M1-7

before the final consistency ratio can be computed. The value for lambda is simply the average value of the consistency vector. The formula for CI is

CI = l - n n - 1

(M1-1)

where n is the number of items or systems being compared. In this case, n = 3, for three differ- ent computer systems being compared. The results of the calculations are as follows:

l = 3.1025 + 3.0512 + 3.0086

3

= 3.0541

CI = l - n n - 1

= 3.0541 - 3

3 - 1 = 0.0270

COMPUTING THE CONSISTENCY RATIO Finally, we are now in a position to compute the consistency ratio. The consistency ratio (CR) is equal to the consistency index divided by the random index (RI), which is determined from a table. The random index is a direct function of the number of alternatives or systems being considered. This table is next followed by the final calculation of the consistency ratio:

n RI n RI

2 0.00 6 1.24

n S 3 S 0.58 7 1.32 4 0.90 8 1.41

5 1.12

In general,

CR = CI

RI (M1-2)

In this case,

CR = CI

RI =

0.0270

0.58 = 0.0466

The consistency ratio tells us how consistent we are with our answers. A higher number means we are less consistent, whereas a lower number means that we are more consistent. In general, if the consistency ratio is 0.10 or less, the decision maker’s answers are relatively con- sistent. For a consistency ratio that is greater than 0.10, the decision maker should seriously con- sider reevaluating his or her responses during the pairwise comparisons that were used to obtain the original matrix of pairwise comparisons.

As you can see from the analysis, we are relatively consistent with our responses, so there is no need to reevaluate the pairwise comparison responses. If you look at the original pair- wise comparison matrix, this makes sense. The hardware for SYSTEM-1 was moderately pre- ferred to the hardware for SYSTEM-2. The hardware for SYSTEM-1 was extremely preferred to the hardware for SYSTEM-3. This implies that the hardware for SYSTEM-2 should be pre- ferred over the hardware for SYSTEM-3. From our responses, the hardware for SYSTEM-2 was strongly to very strongly preferred over the hardware for SYSTEM-3, as indicated by the num- ber 6. Thus, our original assessments of the pairwise comparison matrix seem to be consistent, and the consistency ratio that we computed supports our observations.

Although the calculations to compute the consistency ratio are fairly involved, they are an important step in using the AHP.

Evaluations for the Other Factors So far, we have determined the factor evaluations for hardware for the three different com- puter systems along with a consistency ratio for these evaluations. Now, we can make the same

The consistency ratio tells us how consistent we are.

Z02_REND3161_13_AIE_M01.indd 7 27/10/16 2:24 PM

M1-8  MODULE 1 • AnALytiC HiErArCHy PrOCEss

calculations for other factors—namely, software and vendor support. As before, we start with the matrix of pairwise comparisons. We perform the same calculations and end up with the various factor evaluations for both software and vendor support. We begin by presenting the matrix of pairwise comparisons for both software and vendor support:

SOFTWARE SYSTEM-1 SYSTEM-2 SYSTEM-3

SYSTEM-1

SYSTEM-2 2

SYSTEM-3 8 5

VENDOR SUPPORT

SYSTEM-1

SYSTEM-2

SYSTEM-3

SYSTEM-1 1 6

SYSTEM-2 3

SYSTEM-3

With the matrices shown, we can perform the same types of calculations to determine the factor evaluations for both software and vendor support for the three computer systems. The data for the three different systems are summarized in Table M1.7. We also need to de- termine the consistency ratios for both software and support. As it turns out, both consistency ratios are under 0.10, meaning that the responses to the pairwise comparison are acceptably consistent.

Note that the factor evaluations for the three factors and three different computer systems shown in Table M1.7 are similar to the factor evaluations in Table M1.2 for the job selection problem. The major difference is that we had to use the AHP to determine these factor evalua- tions using pairwise comparisons because we were not comfortable with our abilities to assess these factors subjectively without some assistance.

Determining Factor Weights Next, we need to determine the factor weights. When we used the MFEP, it was assumed that we could simply determine these values subjectively. Another approach is to use the AHP and pairwise comparisons to determine the factor weights for hardware, software, and vendor support.

In comparing the three factors, we determine that software is the most important. Soft- ware is very to extremely strongly preferred over hardware (number 8). Software is moderately preferred over vendor support (number 3). In comparing vendor support to hardware, we de- cide that vendor support is more important. Vendor support is moderately preferred to hardware (number 3). With these values, we can construct the pairwise comparison matrix and then com- pute the weights for hardware, software, and support. We also need to compute a consistency

Next, we perform pairwise comparisons for software and vendor support.

TABLE M1.7 Factor Evaluations

FACTOR SYSTEM-1 SYSTEM-2 SYSTEM-3

Hardware 0.6583 0.2819 0.0598

Software 0.0874 0.1622 0.7504

Vendor 0.4967 0.3967 0.1066

The AHP can be used to set the factor weights.

Z02_REND3161_13_AIE_M01.indd 8 27/10/16 2:24 PM

M1.3 COMPArisOn OF MULtiFACtOr EvALUAtiOn AnD AnALytiC HiErArCHy PrOCEssEs  M1-9

ratio to make sure that our responses are consistent. As with software and vendor support, the actual calculations for determining the factor weights are left for you to make on your own. After making the appropriate calculations, the factor weights for hardware, software, and ven- dor support are shown in Table M1.8.

Overall Ranking After the factor weights have been determined, we can multiply the factor evaluations in Table M1.7 by the factor weights in Table M1.8. This is the same procedure that we used for the job selection decision in Section M1.2. It will give us the overall ranking for the three computer systems, which is shown in Table M1.9. As you can see, SYSTEM-3 received the highest final ranking and is selected as the best computer system.

Using the Computer to Solve Analytic Hierarchy Process Problems As you can see from the previous pages, solving AHP problems can involve a large num- ber of calculations. Fortunately, computer programs are available to make the AHP easier. Appendix M1.1 demonstrates how Excel can be used for the AHP calculations shown in this module. A commercial package called Expert Choice for Windows can also be used to solve the types of AHP problems discussed in this module. In addition, it is possible to use the AHP with group decision making. Team Expert Choice helps groups brainstorm ideas, structure their deci- sions, and evaluate alternatives.

M1.3 Comparison of Multifactor Evaluation and Analytic Hierarchy Processes

Multifactor decision making has a number of useful and important applications. If you know or can determine with confidence and accuracy the factor weights and factor evaluations, the MFEP is preferred. If not, you should use the AHP. As it turns out, the AHP also gives the factor weights and factor evaluations from which the final selection can be made. The only differ- ence is that with the AHP, we compute the factor weights and factor evaluations from a number of pairwise comparison matrices. We also compute a consistency ratio to make sure that our responses to the original pairwise comparison matrix are consistent and acceptable. If they are not, we should go back and perform the pairwise comparison again. Although the AHP involves a larger number of calculations, it is preferred to the MFEP in cases in which you do not feel confident or comfortable in determining factor weights or factor evaluations without making pairwise comparisons.

Finally, the overall ranking is determined by multiplying the factor evaluations times the factor weights.

TABLE M1.8 Factor Weights

FACTOR FACTOR WEIGHT

Hardware 0.0820

Software 0.6816

Vendor 0.2364

TABLE M1.9 total Weighted Evaluations

SYSTEM OR ALTERNATIVE TOTAL WEIGHTED EVALUATION

SYSTEM-1 0.2310

SYSTEM-2 0.2275

SYSTEM-3* 0.5416

*SYSTEM-3 is selected.

Z02_REND3161_13_AIE_M01.indd 9 27/10/16 2:24 PM

M1-10  MODULE 1 • AnALytiC HiErArCHy PrOCEss

Multifactor decision making is appropriate when an individual, a group, or an organization faces a number of factors in a deci- sion-making situation. With the MFEP, a decision maker assigns an importance weight to each factor. The weights can, for ex- ample, range from 0 to 1. Then, for each alternative, all factors are evaluated. The factor weights are multiplied by each factor evaluation for a given alternative and summed. The alternative with the highest overall score is selected.

With the AHP, the decision maker performs a number of pairwise comparisons between each pair of alternatives for

each factor to determine the factor evaluations. A pairwise comparison is also performed between each pair of factors to determine the factor weights. This information is used to deter- mine a total weighted evaluation for each alternative. The al- ternative with the highest total weighted evaluation is selected. The AHP approach also allows for the computation of a consis- tency ratio to help decision makers determine if their pairwise comparisons are consistent.

Summary

Glossary

Analytic Hierarchy Process (AHP) A process that uses pairwise comparisons to determine factor evaluations and factor weights in a multifactor decision-making environment.

Factor Evaluations Evaluations that indicate one’s preference for a particular factor for a particular alternative or item.

Factor Weights Weights that give the relative importance of one factor compared to another.

Multifactor Decision Making A decision-making environ- ment in which multiple factors are to be considered in mak- ing the final selection.

Multifactor Evaluation Process (MFEP) A multifactor decision-making approach in which the factor weights and factor evaluations can be accurately determined and used in the decision-making process.

Key Equations

(M1-1) CI = l - n n - 1

Consistency index.

(M1-2) CR = CI

RI

Consistency ratio.

Using the AHP in a Pilot study of Organ transplantation

Getting organs for transplantation and deciding who gets scarce organs has been a topic of discussion for decades. There have been cases of celebrities, retired athletes, and movie stars receiving organs ahead of perhaps more deserving people. Some believe the decision about who gets organs can be politi- cal instead of medical. There have also been charges that some countries harvest organs from living healthy prisoners.

At the Hospital for Sick Children in Toronto, the AHP has been used in a pilot study to help determine who should get organs. The goal of the pilot study was to develop a set of con- sistent and broadly acceptable criteria. Developing good crite- ria was difficult. For example, what priority should a child with Down syndrome be given to receive an organ transplant? Us- ing pairwise comparisons, a set of criteria for children receiv- ing organ transplants was evaluated using the AHP framework. The criteria included intelligence, survival expectations, physical dependence on others, the need for long-term financial support, the need for long-term health support, parent activities required, the ability of the child to return to a full schedule of school activities, and other similar factors.

The results of the AHP study differed from standard surveys conducted in Canada and the United States. The AHP study, for example, determined that such factors as the ability to pay, the presence of medical insurance, or a patient’s financial or eco- nomic status should not be considered in making a transplant decision. This may have been a result of Canada’s national health care system, which assures health care for all Canadian citizens. It was also determined that physical limitations, such as being disabled, should not be a determining factor for an organ trans- plant. A low intelligence, such as an IQ of 70 or lower, was also not as important in the AHP study as it had been in earlier sur- veys. The AHP study determined that the most important criterion was the organ transplant patient’s ability to survive the difficult transplant process, accept the difficult transition process follow- ing organ transplant, and lead a relatively normal life after the organ transplant. Overall, the study was able to take into account ethical, qualitative, and quantitative factors to determine who should receive organ transplants.

Source: Tom Koch, et al., “A Pilot Study on Transplant Eligibility Criteria,” Pediatric Nursing 23, 2(March 13, 1997): 160–162, © Trevor S. Hale.

IN ACTION

Z02_REND3161_13_AIE_M01.indd 10 27/10/16 2:24 PM

sOLvED PrOBLEMs  M1-11

Solved Problems

Solved Problem M1-1 Tom Schmid is thinking about buying a Nordic ski machine. The three factors important to him are price, ease of use, and the ability to store the exercise equipment in a closet when he is done using it. Given the following data, help Tom determine the better machine for him:

FACTOR WEIGHTS

FACTOR IMPORTANCE WEIGHT

Price 0.9

Ease of use 0.75

Storage 0.6

FACTOR EVALUATIONS

FACTOR

PROFESSIONAL NORDIC SKIER

ECONO NORDIC SKIER

Price 0.5 0.8

Ease of use 0.95 0.6

Storage 0.9 0.7

Solution Given these data, we can multiply the weights by the evaluations for each skier and then sum the results. The results are shown in the following table:

FINAL EVALUATIONS

FACTOR

PROFESSIONAL NORDIC SKIER

ECONO NORDIC SKIER

Price 10.5210.92 = 0.45 10.8210.92 = 0.72 Ease of use 10.95210.752 = 0.7125 10.6210.752 = 0.45 Storage 10.9210.62 = 0.54 10.7210.62 = 0.42 Total 1.70 1.59

Given this analysis, Tom should select the Professional Nordic Skier.

Solved Problem M1-2 Gretchen Little has used the AHP to determine factor evaluations. The consistency index for her problem is 0.0988. The number of factors in her problem is four. Can you draw any conclusions from these data?

Solution Using a value of 4 for n, we look in the table in this module to get the random index (RI). From the table with a value of 4 for n, we see that RI is 0.90. From this information we can compute the con- sistency ratio as follows:

CR = CI

RI =

0.0988

0.9 = 0.10978

Because CR is close to but greater than 0.10, her pairwise comparisons may not have been consistent. It is recommended that she re-solve the problem carefully and recompute the consistency ratio.

Z02_REND3161_13_AIE_M01.indd 11 27/10/16 2:24 PM

M1-12  MODULE 1 • AnALytiC HiErArCHy PrOCEss

Self-Test

●● Before taking the self-test, refer back to the learning objectives at the beginning of the module and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. In the MFEP a. the factor weights must sum to 1. b. the factor evaluations must sum to 1. c. the factor weights must sum to 10. d. the factor evaluations must sum to 10.

2. In the AHP, the pairwise comparisons use a scale that ranges from equally preferred to extremely preferred. The numerical range used for these comparisons is a. 0 to 10. b. 1 to 10. c. 0 to 9. d. 1 to 9.

3. In the pairwise comparison matrix used in the AHP, each position on the diagonal from the upper left to the lower right of the matrix will be assigned a value of a. 0. b. 1. c. 1∙2. d. 9.

4. In a normalized matrix, the sum of the numbers a. in each row must be 1. b. in each column must be 1. c. in each column must equal the consistency index. d. in each row must equal the consistency index.

5. The priorities in the AHP are found by averaging the numbers in a. the rows in the pairwise comparison matrix. b. the columns in the pairwise comparison matrix. c. the rows of the normalized matrix. d. the columns of the normalized matrix.

6. A decision maker’s decisions are relatively consistent if the consistency ratio is a. greater than or equal to 0.1. b. less than or equal to 0.1. c. greater than or equal to 1.0. d. less than or equal to 1.0.

7. If the consistency ratio indicates that a set of decisions is inconsistent, the decision maker should a. normalize the pairwise comparison matrix again. b. develop a new pairwise comparison matrix. c. eliminate some of the alternatives. d. eliminate some of the factors.

8. Pairwise comparisons are made with a. the MFEP. b. the AHP. c. both the MFEP and the AHP.

Discussion Questions and Problems

Discussion Questions M1-1 Describe decision situations in which multifac-

tor decision making is appropriate. What decision- making situations do you face that could benefit from the multifactor decision-making approach?

M1-2 Briefly describe the MFEP. M1-3 When should the AHP be used compared with the

MFEP?

Problems M1-4 George Lyon is about to buy a compact stereo cas-

sette player. He is currently considering three brands—Sun, Hitek, and Surgo. The important fac- tors to George are the price, color, warranty, size of the unit, and brand name. George has determined factor weights of 0.4, 0.1, 0.1, 0.1, and 0.3, respec- tively. Furthermore, George has determined factor evaluations for all of the factors for the three dif- ferent manufacturers of the unit he is considering.

The Sun unit has factor evaluations of 0.7, 0.9, 0.8, 0.8 and 0.9 for the price, color, warranty, size, and brand-name factors. The Hitek unit has factor evalu- ations of 0.6, 0.9, 0.9, 0.8, and 0.9 for these factors. Finally, Surgo has factor evaluations of 0.8, 0.4, 0.4, 0.2, and 0.6 for the same factors of price, color, warranty, size, and brand name. Determine the total weighted evaluation for the three manufacturers. Which one should George select?

M1-5 Linda Frieden is thinking about buying a new car. She is considering three different car models: car 1, car 2, and car 3. An important factor for Linda is the price. She has determined that car 1 is equally to moderately preferred to car 2. Car 1 is very strongly preferred to car 3, and car 2 is moderately to strongly preferred to car 3. Determine the priorities or factor evaluations for the three cars for price. What is the consistency ratio?

M1-6 Linda Frieden (Problem M1-5) is also concerned about the warranty for the three cars she is considering.

Z02_REND3161_13_AIE_M01.indd 12 27/10/16 2:24 PM

DisCUssiOn QUEstiOns AnD PrOBLEMs  M1-13

The second car is moderately preferred to the first car in terms of warranty. The third car is very to ex- tremely strongly preferred over the first car, and the third car is strongly preferred over the second car. Determine the factor evaluations or priorities for the three cars for car warranty. Compute the consis- tency ratio.

M1-7 Linda Frieden (Problems M1-5 and M1-6) would like to consider style as an important factor in mak- ing a decision to purchase a new car. Car 2 is mod- erately preferred to car 1 in terms of style, but car 1 is moderately preferred to car 3 in terms of style. Furthermore, car 2 is very to extremely strongly pre- ferred over car 3. Determine the factor evaluations for style concerning the three cars and compute the necessary ratio.

M1-8 Linda Frieden (Problems M1-5 to M1-7) now must determine the relative weights for the three factors of price, warranty, and style. She believes that the price is equally to moderately preferred over warranty and that price is extremely preferred to style. She also believes that the car warranty is strongly to very strongly preferred over the style. Using this informa- tion, determine the weights for these three factors. Also determine the consistency ratio to make sure that the values are consistent enough to use in the analysis. In Problems M1-5 to M1-7, Linda has de- termined factor evaluations for price, warranty, and style for the three cars. Using the information you determined in this problem, along with the solutions to the three preceding problems, determine the final ranking for each car. Which car should be selected?

M1-9 Gina Fox is a student who will be graduating soon, and she is planning to attend graduate school to work toward an MBA. Gina has been accepted into the graduate programs at three universities. Now she must decide which one to attend. Gina has rated each one on the cost, reputation of the program, and quality of life at the university. These ratings are summarized as follows (1 is a poor rating and 10 is perfect):

University A B C

Cost 4 8 7

Reputation 9 5 6

Quality of life 7 7 3

Gina has decided that cost is the overriding fac- tor. She has given cost a weight of 0.6, reputation a weight of 0.2, and quality of life a weight of 0.2. Which university should Gina select?

M1-10 Upon reevaluating the situation, Gina Fox (see Problem M1-9) is not comfortable with her ratings. Therefore, she has decided to compare the universi- ties two at a time. On cost, B is strongly preferred

to A; B is moderately preferred to C; and C is mod- erately preferred to A. On reputation, A is very strongly preferred to B; C is moderately preferred to B; and A is strongly preferred to C. On quality of life, A and B are equally preferred; A is strongly pre- ferred to C; and B is very strongly preferred to C. On the three factors, cost is very strongly preferred to quality of life; cost is moderately preferred to repu- tation; and reputation is equally to moderately pre- ferred to quality of life.

Develop the pairwise comparison matrices that would be used with the AHP. What university should Gina select?

M1-11 Jim Locke, an undergraduate student in the ESU College of Business, is trying to decide which per- sonal computer to purchase with the money his par- ents gave him for Christmas. He has reduced the number of computers he has been considering to three, calling them system 1 (S1), system 2 (S2), and system 3 (S3). For each computer, he would like to consider the price, the brand name, the memory capacity, speed, flexibility, and compatibility with existing software.

To make the correct decision, he has decided to make pairwise comparisons for all the factors. For price, the first computer system is equally to mod- erately preferred over the second computer system and very to extremely strongly preferred over the third computer system. The second computer sys- tem is strongly preferred over the third computer system.

For brand name, the first computer system is equally preferred to the second computer system, and the first computer system is strongly to very strongly preferred over the third computer sys- tem. The second computer system is moderately to strongly preferred over the third computer system.

When it comes to memory, the second computer is equally to moderately preferred over the first com- puter system, and the third computer system is very strongly preferred over the first computer system. Furthermore, the third computer system is strongly to very strongly preferred over the second computer system.

For speed, the second computer system is mod- erately preferred to the first computer system, but the first computer system is equally to moderately pre- ferred over the third computer system. Furthermore, the second computer system is strongly preferred over the third computer system.

For the flexibility factor, the third computer sys- tem is very to extremely strongly preferred over the first computer system, and the second computer sys- tem is equally to moderately preferred over the first computer system. The third computer system is also moderately to strongly preferred over the second computer system.

Z02_REND3161_13_AIE_M01.indd 13 27/10/16 2:24 PM

M1-14  MODULE 1 • AnALytiC HiErArCHy PrOCEss

Finally, Jim has used pairwise comparisons to look at how compatible each computer system is with the existing software. Using this analysis, he has determined that the first computer system is very to extremely strongly preferred over the second computer system when it comes to compatibility. The first computer system is moderately to strongly preferred over the third computer system, and the third computer system is moderately preferred over the second computer system.

When it comes to comparing the factors, Jim has used pairwise comparisons to look at price, brand name, memory, speed, flexibility, and compatibility. Here are the results of the analysis. Price is extremely preferred to brand name, moderately to strongly preferred to memory, strongly preferred to speed, moderately preferred to flexibility, and equally to moderately preferred to existing software compat- ibility. In other words, price is a very important fac- tor. The computer’s memory is equally to moderately preferred to brand name, speed is equally preferred

to brand name, flexibility is moderately to strongly preferred to brand name, and existing software com- patibility is strongly preferred to brand name. In looking at memory, Jim has determined that memory is equally to moderately preferred to speed. Existing software compatibility, however, is strongly to very strongly preferred to memory, and overall flexibility is equally to moderately preferred to the computer’s memory. Existing software compatibility is strongly to very strongly preferred to speed, and flexibility is moderately preferred to speed. Finally, Jim has determined that existing software compatibility is equally to moderately preferred to flexibility.

Using all of these preferences for pairwise com- parisons, determine the priorities or factor evalua- tions, along with the appropriate consistency ratios for price, brand name, memory, speed, flexibility, and existing software compatibility for the three dif- ferent computer systems. In addition, determine the overall weights for each of the factors. Which com- puter system should be selected?

Bibliography

Carlsson, Christer, and Pirkko Walden. “AHP in Political Group Decisions: A Study in the Art of Possibilities,” Interfaces 25, 4 (July 1995): 14–29.

Durso, A., and S. Donahue. “An Analytic Approach to Reshaping the United States Army,” Interfaces 25, 1 (January–February 1995): 109–133.

Goh, Chon. “AHP for Robot Selection,” Journal of Manufacturing Systems (January 1997): 381–387.

Islei, Gerd, Geoff Lockett, Barry Cox, Steve Gisbourne, and Mike Stratford. “Modeling Strategic Decision Making and Performance Measurements at ICI Pharmaceuticals,” Interfaces 21, 6 (November–December 1991): 4–22.

Kang, Moonsig and Antonie Stam “PAHAP: A Pairwise Aggregated Hierar- chical Analysis of Ration-Scale Preferences,” Decision Sciences 25 (July 1994): 607–624.

Koch, Tom, Mary Rowell,. et al. “A Pilot Study on Transplant Eligibility Criteria,” Pediatric Nursing 23, 2 (March 13, 1997): 160–162.

Saaty, Thomas. The Analytic Hierarchy Process. New York: McGraw-Hill Book Company, 1980.

——. “How to Make a Decision: The Analytic Hierarchy Process,” Interfaces 24, 6 (November–December 1994): 19–43.

Saaty, Thomas, and K. Kearn. Analytical Planning: The Organization of Systems. Oxford, UK: Pergamon Press Ltd., 1985.

Appendix M1.1: Using Excel for the Analytic Hierarchy Process

Excel can be used to perform the calculations in the AHP. Pro- gram M1.1A (columns A–I) and Program M1.1B (columns J–P) give the formulas that are used to develop the normalized matrices, the weighted sum vectors, the consistency indices, and the consistency ratios for the example in Section M1.3. The only inputs required in this example are the number of alternatives (cell D1), the upper-right halves of the pairwise

comparison matrices, and the table for the random index (cells A26 to B33). When using the MMULT command (cells J27–J29 and four times in column L), highlight the cells and type this function. Then press the Ctrl, Shift, and Enter keys simultaneously to enter the function into all of these cells. Program M1.2 gives the output for this example.

Z02_REND3161_13_AIE_M01.indd 14 27/10/16 2:24 PM

APPEnDiX M1.1: UsinG EXCEL FOr tHE AnALytiC HiErArCHy PrOCEss  M1-15

Enter the upper-right-hand half of each comparison matrix.

The normalized matrices are in columns G–I.

This matrix gives the priorities for each factor. These were computed in column J.

PROGRAM M1.1A   Partial Excel spreadsheet Formulas for AHP

The Ctrl, Shift, and Enter keys are simultaneously pressed to enter the MMULT function.

The factor weights (J21:J23) are multiplied by the individual factor evaluations to give the overall evaluations.

The LOOKUP command is used to find the random index (RI).

PROGRAM M1.1B   Additional Excel spreadsheet Formulas for AHP

Z02_REND3161_13_AIE_M01.indd 15 27/10/16 2:24 PM

M1-16  MODULE 1 • AnALytiC HiErArCHy PrOCEss

System 3 has the highest overall rating.

The normalized matrices are used to obtain the priorities for each individual factor.

There are three factors and three systems in this example.

PROGRAM M1.2 Excel Output for AHP

Z02_REND3161_13_AIE_M01.indd 16 27/10/16 2:24 PM

 M2-1

M2.4 Describe important dynamic programming terminology.

M2.5 Describe the use of dynamic programming in solving knapsack problems.

M2.1 Understand the overall approach of dynamic programming.

M2.2 Use dynamic programming to solve the shortest- route problem.

M2.3 Develop dynamic programming stages.

After completing this module, students will be able to:

Dynamic Programming

LEARNING OBJECTIVES

2 MODULE

Dynamic programming is a quantitative analysis technique that has been applied to large, complex problems that have sequences of decisions to be made. Dynamic programming divides problems into a number of decision stages; the outcome of a decision at one stage affects the decision at each of the next stages. The technique is useful in a large number of multiperiod business problems, such as smoothing production employment, allocating capital funds, allocating salespeople to marketing areas, and evaluating investment opportunities.

Dynamic programming differs from linear programming in two ways. First, there is no algo- rithm (as in the simplex method) that can be programmed to solve all problems. Dynamic program- ming is, instead, a technique that allows us to break up difficult problems into a sequence of easier subproblems, which are then evaluated by stages. Second, linear programming is a method that gives single-stage (one-time-period) solutions. Dynamic programming has the power to determine the optimal solution over a 1-year time horizon by breaking the problem into 12 smaller 1-month horizon problems and to solve each of these optimally. Hence, it uses a multistage approach.

Solving problems with dynamic programming involves four steps.

Four Steps of Dynamic Programming 1. Divide the original problem into subproblems called stages. 2. Solve the last stage of the problem for all possible conditions or states. 3. Working backward from the last stage, solve each intermediate stage. This is done by

determining optimal policies from that stage to the end of the problem (last stage). 4. Obtain the optimal solution for the original problem by solving all stages sequentially.

Dynamic programming breaks a difficult problem into subproblems.

Z03_REND3161_13_AIE_M02.indd 1 27/10/16 2:24 PM

M2-2  MODULE 2 • DynaMic PrOgraMMing

In this module, we show how to solve two types of dynamic programming problems: net- work and nonnetwork. The shortest-route problem is a network problem that can be solved by dynamic programming. The knapsack problem is an example of a nonnetwork problem that can be solved using dynamic programming.

M2.1 Shortest-Route Problem Solved Using Dynamic Programming

George Yates is about to make a trip from Rice, Georgia (1), to Dixieville, Georgia (7). George would like to find the shortest route. Unfortunately, there are a number of small towns between Rice and Dixieville. His road map is shown in Figure M2.1.

The circles on the map, called nodes, represent cities such as Rice, Dixieville, Brown, and so on. The arrows, called arcs, represent highways between the cities. The distance in miles is indicated along each arc. This problem can, of course, be solved by inspection. But seeing how dynamic programming can be used on this simple problem will teach you how to solve larger and more complex problems.

Step 1: The first step is to divide the problem into subproblems or stages. Figure M2.2 reveals the stages of this problem. In dynamic programming, we usually start with the last part of the problem, stage 1, and work backward to the beginning of the problem or network, which is stage 3 in this problem. Table M2.1 summarizes the arcs and arc distances for each stage.

The first step is to divide the problem into subproblems or stages.

FIGURE M2.1 Highway Map Between rice and Dixieville

10 Miles

10 Miles

12 Mil

es

4 M

ile s

Brown

2 M

ile s

14 Miles

5 Miles

4 M iles

2 Miles

Lake City

Hope

Athens

Georgetown

Dixieville

4

1 3

2

5

6

7

6 Miles

Rice

1 3

2

4

6

5

7

Stage 3

A Branch

Stage 2 Stage 1

A Node

4 5 2

10

12 6

4 10

2

14

FIGURE M2.2 Three Stages for the george yates Problem

Z03_REND3161_13_AIE_M02.indd 2 27/10/16 2:24 PM

M2.1 SHOrTEST-rOUTE PrOBLEM SOLvED USing DynaMic PrOgraMMing  M2-3

Step 2: We next solve stage 1, the last part of the network. Usually, this is trivial. We find the shortest path to the end of the network, node 7 in this problem. At stage 1, the shortest paths, from node 5 or node 6 to node 7, are the only paths. Also note in Figure M2.3 that the minimum distances are enclosed in boxes by the entering nodes to stage 1, node 5 and node 6. The objec- tive is to find the shortest distance to node 7. The following table summarizes this procedure for stage 1. As mentioned previously, the shortest distance is the only distance at stage 1.

The second step is to solve the last stage—stage 1.

TABLE M2.1 Distance along Each arc

STAGE ARC ARC DISTANCE

1 5–7 14

6–7 2

2 4–5 10

3–5 12

3–6 6

2–5 4

2–6 10

3 1–4 4

1–3 5

1–2 2

STAGE 1

BEGINNING NODE

SHORTEST DISTANCE TO NODE 7

ARCS ALONG THIS PATH

5 14 5–7

6 2 6–7

4 5 2

10

12 6

4 10

2

14

Minimum Distance to Node 7 from Node 6

Minimum Distance to Node 7 from Node 5

1 3

2

4

6

5

7

2

14

FIGURE M2.3 Solution for the One-Stage Problem

Step 3 involves moving backward solving intermediate stages.

Step 3: Moving backward, we now solve for stages 2 and 3. At stage 2, we will use Figure M2.4.

Z03_REND3161_13_AIE_M02.indd 3 27/10/16 2:24 PM

M2-4  MODULE 2 • DynaMic PrOgraMMing

If we are at node 4, the shortest and only route to node 7 is arcs 4–5 and 5–7, with a total minimum distance of 24 miles. At node 3, the shortest route is arcs 3–6 and 6–7, with a total minimum distance of 8 miles. If we are at node 2, the shortest route is arcs 2–6 and 6–7, with a total minimum distance of 12 miles. This information is summarized in the stage 2 table:

STAGE 2

BEGINNING NODE

SHORTEST DISTANCE TO NODE 7

ARCS ALONG THIS PATH

4 24 4–5

5–7

3 8 3–6

6–7

2 12 2–6

6–7

The solution to stage 3 can be completed using the following table and the network in Figure M2.5:

STAGE 3

BEGINNING NODE

SHORTEST DISTANCE TO NODE 7

ARCS ALONG THIS PATH

1 13 1–3

3–6

6–7

4 5 2

10 Minimum Distance to Node 7 from Node 3

12

6

4 10

2

14

Minimum Distance to Node 7 from Node 4

Minimum Distance to Node 7 from Node 2

1 3

2

4

6

5

7

8

12

14

2

24

FIGURE M2.4 Solution for the Two- Stage Problem

Z03_REND3161_13_AIE_M02.indd 4 27/10/16 2:24 PM

M2.2 DynaMic PrOgraMMing TErMinOLOgy  M2-5

Step 4: To obtain the optimal solution at any stage, all we consider are the arcs to the next stage and the optimal solution at the next stage. For stage 3, we have to consider only the three arcs to stage 2 (1–2, 1–3, and 1–4) and the optimal policies at stage 2, given in a previous table. This is how we arrived at the preceding solution. When the procedure is understood, we can perform all the calculations on one network. You may want to study the relationship between the networks and the tables because more complex problems are usually solved by using tables only.

M2.2 Dynamic Programming Terminology

Regardless of the type or size of a dynamic programming problem, there are some important terms and concepts that are inherent in every problem. Some of the more important of them follow:

1. Stage: a period or a logical subproblem. 2. State variables: possible beginning situations or conditions of a stage. These have also

been called the input variables. 3. Decision variables: alternatives or possible decisions that exist at each stage. 4. Decision criterion: a statement concerning the objective of the problem. 5. Optimal policy: a set of decision rules, developed as a result of the decision criteria, that

gives optimal decisions for any entering condition at any stage. 6. Transformation: normally, an algebraic statement that reveals the relationship between

stages.

In the shortest-route problem, the following transformation can be given:

Distance from the

beginning of a given

stage to the last node

= Distance from the beginning

of the previous stage

to the last node

+ Distance from the

given stage to the

previous stage

This relationship shows how we are able to go from one stage to the next in solving for the optimal solution to the shortest-route problem. In more complex problems, we can use symbols to show the relationship between stages.

1 3

2

4

6

5

7

4 5 2

10

8

12 6

4 10

2

14

24

Minimum Distance to Node 7 from Node 1

12

14

2

13

FIGURE M2.5 Solution for the Three- Stage Problem

The fourth and final step is to find the optimal solution after all stages have been solved.

Z03_REND3161_13_AIE_M02.indd 5 27/10/16 2:24 PM

M2-6  MODULE 2 • DynaMic PrOgraMMing

State variables, decision variables, the decision criterion, and the optimal policy can be determined for any stage of a dynamic programming problem. This is done here for stage 2 of the George Yates shortest-route problem.

1. State variables for stage 2 are the entering nodes, which are (a) node 2 (b) node 3 (c) node 4

2. Decision variables for stage 2 are the following arcs or routes: (a) 4–5 (b) 3–5 (c) 3–6 (d) 2–5 (e) 2–6

3. The decision criterion is the minimization of the total distances traveled. 4. The optimal policy for any beginning condition is shown in Figure M2.6 and the following

table:

GIVEN THIS ENTERING CONDITION

THIS ARC WILL MINIMIZE TOTAL DISTANCE TO NODE 7

2 2–6

3 3–6

4 4–5

1 3

2

4

6

5

7

10

8

12 6

4 10

24

12

14

2

State variables are the entering nodes.

The optimal policy is the arc, for any entering node, that will minimize total distance to the destination at this stage.

Decision variables are all the arcs.

Stage 2

FIGURE M2.6 Stage 2 from the Shortest-route Problem

Figure M2.6 may also be helpful in understanding some of the terminology used in the discussion of dynamic programming.

Z03_REND3161_13_AIE_M02.indd 6 27/10/16 2:24 PM

M2.3 DynaMic PrOgraMMing nOTaTiOn  M2-7

M2.3 Dynamic Programming Notation

In addition to dynamic programming terminology, we can also use mathematical notation to describe any dynamic programming problem. This helps us to set up and solve the problem. Consider stage 2 in the George Yates dynamic programming problem first discussed in Section M2.2. This stage can be represented by the diagram shown in Figure M2.7 (as could any given stage of a given dynamic programming problem).

As you can see, for every stage, we have an input, decision, output, and return. Look again at stage 2 for the George Yates problem in Figure M2.6. The input to this stage is s2, which con- sists of nodes 2, 3, and 4. The decision at stage 2, or choosing which arc will lead to stage 1, is represented by d2. The possible arcs or decisions are 4–5, 3–5, 3–6, 2–5, and 2–6. The output to stage 2 becomes the input to stage 1. The output from stage 2 is s1. The possible outputs from stage 2 are the exiting nodes, nodes 5 and 6. Finally, each stage has a return. For stage 2, the return is represented by r2. In our shortest-route problem, the return is the distance along the arcs in stage 2. These distances are 10 miles for arc 4–5, 12 miles for arc 3–5, 6 miles for arc 3–6, 4 miles for arc 2–5, and 10 miles for arc 2–6. The same notation applies for the other stages and can be used at any stage. In general, we use the following notation for these important concepts:

sn = Input to stage n (M2-1)

dn = Decision at stage n (M2-2)

rn = Return at stage n (M2-3) You should note that the input to one stage is also the output from another stage. For

example, the input to stage 2, s2, is also the output from stage 3 (see Figure M2.7). This leads us to the following equation:

sn - 1 = Output from stage n (M2-4)

An input, decision, output, and return are specified for each stage.

The input to one stage is the output from another stage.

Stage 2

Decision d2

Output s1

Return r2

Input s2

FIGURE M2.7 input, Decision, Output, and return for Stage 2 in george yates’s Problem

The final concept is transformation. The transformation function allows us to go from one stage to another. The transformation function for stage 2, t2, converts the input to stage 2, s2, and the decision made at stage 2, d2, to the output from stage 2, s1. Because the transformation function depends on the input and decision at any stage, it can be represented as t2 1s2, d22. In general, the transformation function can be represented as follows:

tn = Transformation function at stage n (M2-5) The following general formula allows us to go from one stage to another using the transforma- tion function:

sn - 1 = tn1sn, dn2 (M2-6)

A transformation function allows us to go from one stage to another.

Z03_REND3161_13_AIE_M02.indd 7 27/10/16 2:24 PM

M2-8  MODULE 2 • DynaMic PrOgraMMing

Although this equation may seem complex, it is really just a mathematical statement of the fact that the output from a stage is a function of the input to the stage and any decisions made at that stage. In the George Yates shortest-route problem, the transformation function consists of a number of tables. These tables show how we could progress from one stage to another in order to solve the problem. For more complex problems, we need to use dynamic programming nota- tion instead of tables.

Another useful quantity is the total return at any stage. The total return allows us to keep track of the total profit or costs at each stage as we solve the dynamic programming problem. It can be given as follows:

fn = Total return at stage n (M2-7)

M2.4 Knapsack Problem

The knapsack problem involves the maximization or the minimization of a value, such as profits or costs. As in a linear programming problem, there are restrictions in a knapsack problem. Imagine a knapsack or pouch that can hold only a certain weight or volume. We can place different types of items in the knapsack. Our objective is to place items in the knapsack to maximize total value without breaking the knapsack because of too much weight or a similar restriction.

Types of Knapsack Problems Many kinds of problems can be classified as knapsack problems. Choosing items to place in the cargo compartment of an airplane and how to best cut sheet metal are examples. The restriction can be volume, weight, or both. Some scheduling problems are also knapsack prob- lems. For example, we may want to determine which jobs to complete in the next 2 weeks. The 2-week period is the knapsack, and we want to load it with jobs in such a way as to maximize profits or minimize costs. The restriction is the number of days or hours during the 2-week period.

Roller’s Air Transport Service Problem Rob Roller owns and operates Roller’s Air Transport Service, which ships cargo by plane to most large cities in the United States and Canada. The remaining capacity for one of the flights from Seattle to Vancouver is 10 tons. There are four different items that Rob can ship between Seattle and Vancouver. Each item has a weight in tons per unit, a net profit in thousands of dollars per unit, and a total number of units that are available for shipping. This information is presented in Table M2.2.

PROBLEM SETUP The Roller’s Air Transport Service problem is an ideal one to solve using dynamic programming. Stage 4 will be item 1, stage 3 will be item 2, stage 2 will be item 3, and stage 1 will be item 4. This is shown in Table M2.3. During the solution, we will be using stage numbers.

The Roller’s Air Transport Service problem can be represented graphically (see Figure M2.8). As you can see, each item is represented by a stage. Look at stage 4, which is item 1. The total weight that can be used is represented by s4. This amount is 10 because we haven’t

The total return function allows us to keep track of profits and costs.

The objective of this problem is to maximize profits.

ITEM WEIGHT PROFIT/UNIT NUMBER AVAILABLE

1 1 $3 6

2 4 9 1

3 3 8 2

4 2 5 2

TABLE M2.2 items to Be Shipped

Z03_REND3161_13_AIE_M02.indd 8 27/10/16 2:24 PM

M2.4 KnaPSacK PrOBLEM  M2-9

ITEM STAGE

1 4

2 3

3 2

4 1

TABLE M2.3 relationship Between items and Stages

assigned any units to be shipped at this time. The decision at this stage is d4 (the number of units of item 1 we will ship). If d4 is 1, for example, we will be shipping 1 unit of item 1. Also note that r4 is the return or profit at stage 4 (item 1). If we ship 1 unit of item 1, the profit will be $3 (see Table M2.2).

Defining the Problem

Developing a Model

Acquiring Input Data

Developing a Solution

Testing the Solution

Analyzing the Results

Implementing the Results

MODELING IN THE REAL WORLD

reducing Electric Production costs Using Dynamic Programming

Defining the Problem The Southern Company, with service areas in Georgia, Alabama, Mississippi, and Florida, is a major provider of electric service, with about 240 generating units. In recent years, fuel costs have increased faster than other costs. Annual fuel costs are about $2.5 billion, representing about one-third of total expenses for the Southern Company. The problem for the Southern Company is to reduce total fuel costs.

Developing a Model To deal with this fuel cost problem, the company developed a state-of-the-art dynamic programming model. The dynamic programming model is embedded in the Wescouger optimization program, which is a computer program used to control electric generating units and reduce fuel costs through better utilization of existing equipment.

Acquiring Input Data Data were collected on past and projected electric usage. In addition, daily load/generation data were analyzed. Load/generation charts were used to investigate the fuel requirements for coal, nuclear, hydro- electric, and gas/oil.

Developing a Solution The solution of the dynamic programming model provides both short-term planning guidelines and long- term fuel usage for the various generating units. Optimal maintenance schedules for generating units are obtained using Wescouger.

Testing the Solution To test the accuracy of the Wescouger optimization program, Southern used a real-time economic dis- patch program. The results were a very close match. In addition, the company put the solution through an acid test, in which seasoned operators compared the results against their intuitive judgment. Again, the results were consistent.

Analyzing the Results The results were analyzed in terms of their impact on the use of various fuels, the usage of various gen- erating units, and maintenance schedules for generating units. Analyzing the results also revealed other needs. This resulted in a full-color screen editing routine, auxiliary programs to automate data input, and software to generate postanalysis reports.

Implementing the Results The Southern Company implemented the dynamic programming solution. Over a 7-year period, the results saved the company over $140 million.

Source: S. Erwin, et al., “Using an Optimization Software to Lower Overall Electric Production Costs for Southern Company,” Interfaces 21, 1 (January–February 1991): 27–41, © Trevor S. Hale.

Z03_REND3161_13_AIE_M02.indd 9 27/10/16 2:24 PM

M2-10  MODULE 2 • DynaMic PrOgraMMing

As mentioned previously, the decision variable, dn, represents the number of units of each item (stage) that can be shipped. Looking back at the original problem, we see that the problem is constrained by the number of units. This is summarized in the following table:

STAGE MAXIMUM VALUE OF DECISION

4 6

3 1

2 2

1 2

THE TRANSFORMATION FUNCTIONS Next, we need to look at the transformation function. The gen- eral transformation function for knapsack problems follows:

sn - 1 = 1an * sn2 + 1bn * dn2 + cn Note that an, bn, and cn are coefficients for the problem and that dn represents the decision at stage n. This is the number of units to ship at stage sn.

The following chart shows the transformation coefficients for Rob Roller’s transport problem:

COEFFICIENTS OF TRANSITION FUNCTION

STAGE an bn cn

4 1 -1 0 3 1 -4 0

2 1 -3 0

1 1 -2 0

First, note that s4 is 10, the total weight that can be shipped. Because s4 represents the first item, all 10 tons can be utilized. The transformation equations for the four stages are as follows:

s3 = s4 - 1d4 stage 4 (a)

s2 = s3 - 4d3 stage 3 (b)

s1 = s2 - 3d2 stage 2 (c)

s0 = s1 - 2d1 stage 1 (d)

Consider stage 3. Equation b reveals that the number of tons still available after stage 3, s2, is equal to the number of tons available before stage 3, s3, minus the number of tons shipped at stage 3, 4d3. In this equation, 4d3 means that each item at stage 3 weighs 4 tons.

s1Stage 2 (Item 3)

Stage 3 (Item 2)

d4

s3

r4

s4 Stage 4 (Item 1)

s0Stage 1 (Item 4)

d3

r3

d2

r2

d1

r1

Decisions

Returns

s2

FIGURE M2.8 roller’s air Transport Service Problem

Z03_REND3161_13_AIE_M02.indd 10 27/10/16 2:24 PM

M2.4 KnaPSacK PrOBLEM  M2-11

THE RETURN FUNCTIONS Next, we will look at the return function for each stage. This is the gen- eral form for the return function:

rn = 1an * sn2 + 1bn * dn2 + cn Note that an, bn, and cn are the coefficients for the return function. Using this general form of the return function, we can put the return function values in the following table:

DECISIONS

COEFFICIENTS OF RETURN FUNCTION

STAGE LOWER UPPER an bn cn

4 0 … dn … 6 0 3 0 3 0 … dn … 1 0 9 0 2 0 … dn … 2 0 8 0 1 0 … dn … 2 0 5 0

The lower value for each decision is zero, and the upper value is the total number available. The bn coefficient is the profit per item shipped. The actual return functions are:

r4 = 3d4 r3 = 9d3 r2 = 8d2 r1 = 5d1

STAGE-BY-STAGE SOLUTION As you would expect, the return at any stage, rn, is equal to the profit per unit at that stage multiplied by the number of units shipped at that stage, dn. With this information, we can solve the Roller’s Air Transport Service problem, starting with stage 1 (item 4). The following table shows the solution for the first stage. You may wish to refer to Figure M2.8 for this discussion.

STAGE 1

S1 d1 r1 s0 f0 f1

0 0 0 0 0 0

1 0 0 0 0 0

2 0 0 0 0 0

1 5 0 0 5

3 0 0 0 0 0

1 5 0 0 5

4 0 0 0 0 0

1 5 0 0 5

2 10 0 0 10

5 0 0 0 0 0

1 5 0 0 5

2 10 0 0 10

6 0 0 0 0 0

1 5 0 0 5

2 10 0 0 10

STAGE 1

S1 d1 r1 s0 f0 f1

7 0 0 0 0 0

1 5 0 0 5

2 10 0 0 10

8 0 0 0 0 0

1 5 0 0 5

2 10 0 0 10

9 0 0 0 0 0

1 5 0 0 5

2 10 0 0 10

10 0 0 0 0 0

1 5 0 0 5

2 10 0 0 10

Because we don’t know how many tons will be available at stage 1, we must consider all possibilities. Thus, the number of tons available at stage 1, s1, can vary from 1 to 10. This is seen in the first column of numbers for stage 1. The number of units that we ship at stage 1, d1, can vary from 0 to 2. We can’t go over 2 because the number available is only 2. For any decision, we compute the return at stage 1, r1, by multiplying the number of items shipped by 5, the profit per item. The profit at this stage will be 0, 5, or 10, depending on whether 0, 1, or 2 items are shipped. Note that the total return at this stage, f1, is the same as r1 because this is the only stage we are considering so far. Also note that the total return before stage 1, f0, is 0 because this is the beginning of the solution and we are shipping nothing at this point.

We consider all possibilities.

f1 is the total return at the first stage. The total return before the first stage is f0.

Z03_REND3161_13_AIE_M02.indd 11 27/10/16 2:24 PM

M2-12  MODULE 2 • DynaMic PrOgraMMing

The solution for stage 1 shows the best decision, the return for this stage, and the total re- turn, given all possible numbers of tons available (0 to 10 tons). Using the results of stage 1, we can now proceed to stage 2. The solution for stage 2 is as follows:

STAGE 2

S2 d2 r2 s1 f1 f2

0 0 0 0 0 0

1 0 0 1 0 0

2 0 0 2 2 5

3 0 0 3 5 5

1 8 0 0 8

4 0 0 4 10 10

1 8 1 0 8

5 0 0 5 10 10

1 8 2 5 13

6 0 0 6 10 10

1 8 3 5 13

2 16 0 0 16

STAGE 2

S2 d2 r2 s1 f1 f2

7 0 0 7 10 10

1 8 4 10 18

2 16 1 0 16

8 0 0 8 10 10

1 8 5 10 18

2 16 2 5 21

9 0 0 9 10 10

1 8 6 10 18

2 16 3 5 21

10 0 0 10 10 10

1 8 7 10 18

2 16 4 10 26

The solution for stage 2 is found in exactly the same way as for stage 1. At stage 2, we still have to consider all possible numbers of tons available (from 0 to 10). See the s2 column (the first column). At stage 2 (item 3), we still have only 2 units that can be shipped. Thus, d2 (second col- umn) can range from 0 to a maximum of 2. The return for each s2 and d2 combination at stage 2, r2, is shown in the third column. These numbers are the profit per item at this stage, 8, times the number of items shipped. Because 0, 1, or 2 items can be shipped at stage 2, the profit at this stage can be 0, 8, or 16. The return for stage 2 can also be computed from the return function: r2 = 8d2.

Now look at the fourth column, s1, which lists the number of items available after stage 2. This is also the number of items available for stage 1. To get this number, we have to subtract the number of tons we are shipping at stage 2 (which is the tonnage per unit times the number of units) from the number of tons available before stage 2 1s22. Look at the row in which s2 is 6 and d2 is 1. We have 6 tons available before stage 2, and we are shipping 1 item, which weighs 3 tons. Thus, we will have 3 tons still available after this stage. The s1 values can also be deter- mined using the transformation function, which is s1 = s2 - 3d2.

The last two columns of stage 2 contain the total return. The return after stage 1 and before stage 2 is f1. These are the same values that appeared under the f1 column for stage 1. The return after stage 2 is f2. It is equal to the return from stage 2 plus the total return before stage 2.

Stage 3 is solved in the same way as stages 1 and 2. The following table presents the solu- tion for stage 3; look at each row and make sure that you understand the meaning of each value.

STAGE 3

S3 d3 r3 s2 f2 f3

0 0 0 0 0 0

1 0 0 1 0 0

2 0 0 2 2 5

3 0 0 3 8 8

4 0 0 4 10 10

1 9 0 0 9

5 0 0 5 13 13

1 9 1 0 9

6 0 0 6 16 16

1 9 2 5 14

STAGE 3

S3 d3 r3 s2 f2 f3

7 0 0 7 18 18

1 9 3 8 17

8 0 0 8 21 21

1 9 4 10 19

9 0 0 9 21 21

1 9 5 13 22

10 0 0 10 26 26

1 9 6 16 25

Z03_REND3161_13_AIE_M02.indd 12 27/10/16 2:24 PM

SUMMary  M2-13

Now we solve the last stage of the problem, stage 4. The following table shows the solution procedure:

STAGE 4

s4 d4 r4 s3 f3 f4

10 0 0 10 26 26

1 3 9 22 25

2 6 8 21 27

3 9 7 18 27

4 12 6 16 28

5 15 5 13 28

6 18 4 10 28

The first thing to note is that we have to consider only one value for s4 because we know the number of tons available for stage 4; s4 must be 10 because we have all 10 tons available. There are six possible decisions at this stage, or six possible values for d4, because the number of available units is 6. The other columns are computed in the same way. Note that the return after stage 4, f4, is the total return for the problem. We see that the highest profit is 28. We also see that there are three possible decisions that will give this level of profit, shipping 4, 5, or 6 items. Thus, we have alternate optimal solutions. One possible solution is as follows:

FINAL SOLUTION

STAGE OPTIMAL DECISION OPTIMAL RETURN

4 6 18

3 0 0

2 0 0

1 2 10

Total 8 28

We start with shipping 6 units at stage 4. Note that s3 is 4 from the stage 4 calculations given that d4 is 6. We use this value of 4 and go to the stage 3 calculations. We find the rows in which s3 is 4 and pick the row with the highest total return, f3. In this row, d3 is 0 items with a total return 1f32 of 10. As a result, the number of units available, s2, is still 4. We next go to the calcu- lations for stage 2 and then stage 1 in the same way. This gives us the optimal solution already described. See if you can find one of the alternate optimal solutions.

Dynamic programming is a flexible, powerful technique. A large number of problems can be solved using this technique, including the shortest-route and knapsack problems. The shortest-route problem finds the path through a network that minimizes total distance traveled, and the knapsack problem maximizes the value or return. An example of a knapsack prob- lem is to determine what to ship in a cargo plane to maximize total profits given the weight and size constraints of the cargo plane. The dynamic programming technique requires four steps: (1) divide the original problem into stages, (2) solve the last stage first, (3) work backward solving each subsequent stage, and (4) obtain the optimal solution after all stages have been solved.

Dynamic programming requires that we specify stages, state variables, decision variables, decision criteria, an opti- mal policy, and a transformation function for each specific problem. The stages are logical subproblems. The state vari- ables are possible input values or beginning conditions. The decision variables are the alternatives that we have at each stage, such as which route to take in a shortest-route prob- lem. The decision criterion is the objective of the problem, such as finding the shortest route or maximizing total return. The optimal policy helps us obtain an optimal solution at any stage, and the transformation function allows us to go from one stage to the next.

Summary

Z03_REND3161_13_AIE_M02.indd 13 27/10/16 2:24 PM

M2-14  MODULE 2 • DynaMic PrOgraMMing

Solved Problem

Solved Problem M2-1 Lindsey Cortizan would like to travel from the university to her hometown over the holiday season. A road map from the university (node 1) to her home (node 7) is shown in Figure M2.9. What is the best route that will minimize total distance traveled?

Glossary

Decision Criterion A statement concerning the objective of a dynamic programming problem.

Decision Variable The alternatives or possible decisions that exist at each stage of a dynamic programming problem.

Dynamic Programming A quantitative technique that works backward from the end of the problem to the begin- ning of the problem in determining the best solution for a number of interrelated decisions.

Optimal Policy A set of decision rules, developed as a result of the decision criteria, that gives optimal decisions at any stage of a dynamic programming problem.

Stage A logical subproblem in a dynamic programming problem.

State Variable A term used in dynamic programming to describe the possible beginning situations or conditions of a stage.

Transformation An algebraic statement that shows the rela- tionship between stages in a dynamic programming problem.

Key Equations

(M2-1) sn = Input to stage n The input to stage n. This is also the output from stage n + 1.

(M2-2) dn = Decision at stage n The decision at stage n.

(M2-3) rn = Return at stage n The return function, usually profit or loss, at stage n.

(M2-4) sn - 1 = Output from stage n The output from stage n. This is also the input to stage n - 1.

(M2-5) tn = Transformation function at stage n A transformation function that allows us to go from one stage to another.

(M2-6) sn - 1 = tn1sn, dn2 The general relationship that shows how the output from any stage is a function of the input to the stage and the decisions made at that stage.

(M2-7) fn = Total return at stage n This equation gives the total return (profit or costs) at any stage. It is obtained by summing the return at each stage, rn.

1

2

3

4

5

6

7

20

18

22

39

28

36

18

13

10

FIGURE M2.9 road Map for Lindsey cortizan

Z03_REND3161_13_AIE_M02.indd 14 27/10/16 2:24 PM

Solution The solution to this problem is identical to the one presented earlier in the chapter. First, the problem is broken into three stages. See the network in Figure M2.10. Working backward, we start by solving stage 3. The closest and only distance from node 6 to 7 is 13, and the closest and only distance from node 5 to node 7 is 10. We proceed to stage 2. The minimum distances are 52, 41, and 28 from node 4, node 3, and node 2 to node 7. Finally, we complete stage 3. The optimal solution is 50. The short- est route is 1–2–5–7 and is shown in the following network. This problem can also be solved using tables, as shown following the network solution.

Problem type: Minimization network

Number of stages: 3

Transition function type: sn - 1 = sn - dn Recursion function type: fn = rn + fn - 1

1

4

3

2

6

5

7

20

18

22

39

28

36

18

13

10

Stage 3 Stage 2 Stage 1

50 41

28

52

10

13

FIGURE M2.10 Solution for the Lindsey cortizan Problem

STAGE NUMBER OF DECISIONS

3 3

2 4

1 2

STAGE STARTING NODE ENDING NODE RETURN VALUE

3 1 2 22

1 3 18

1 4 20

2 2 5 18

2 6 36

3 6 28

4 6 39

1 5 7 10

6 7 13

STAGE 1

s1 d1 r1 s0 f0 f1

6 6–7 13 7 0 13

5 5–7 10 7 0 10

SOLvED PrOBLEM  M2-15

Z03_REND3161_13_AIE_M02.indd 15 27/10/16 2:24 PM

M2-16  MODULE 2 • DynaMic PrOgraMMing

STAGE 2

s2 d2 r2 s1 f1 f2

4 4–6 39 6 13 52

3 3–6 28 6 13 41

2 2–6 36 6 13 49

2–5 18 5 10 28

STAGE 3

s3 d3 r3 s2 f2 f3

1 1–4 20 4 52 72

1–3 18 3 41 59

1–2 22 2 28 50

FINAL SOLUTION

STAGE OPTIMAL DECISION OPTIMAL RETURN

3 1–2 22

2 2–5 18

1 5–7 10

Total 50

Self-Test

●● Before taking the self-test, refer back to the learning objectives at the beginning of the module, the notes in the margins, and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Dynamic programming divides problems into a. nodes. b. arcs. c. decision stages. d. branches. e. variables.

2. Possible beginning situations or conditions of a dynamic programming problem are called a. stages. b. state variables. c. decision variables. d. optimal policy. e. transformation.

3. The statement concerning the objective of a dynamic programming problem is called a. stages. b. state variables.

c. decision variables. d. optimal policy. e. decision criterion.

4. The first step of a dynamic programming problem is a. to define the nodes. b. to define the arcs. c. to divide the original problem into stages. d. to determine the optimal policy. e. none of the above.

5. In working a problem with dynamic programming, we usually a. start at the first part of the problem and work forward

to the next parts. b. start at the end of the problem and work backward. c. start at the most expensive part of the problem. d. start at the least expensive part of the problem.

M2-16  MODULE 2 • DynaMic PrOgraMMing

Z03_REND3161_13_AIE_M02.indd 16 27/10/16 2:24 PM

DiScUSSiOn QUESTiOnS anD PrOBLEMS  M2-17

6. An algebraic statement that reveals the relationship between stages is called a. the transformation. b. state variables. c. decision variables. d. the optimal policy. e. the decision criterion.

7. In this module, dynamic programming is used to solve what type of problem? a. quantity discount b. just-in-time inventory c. shortest route d. minimal spanning tree e. maximal flow

8. In dynamic programming terminology, a period or logical subproblem is called a. the transformation. b. a state variable. c. a decision variable. d. the optimal policy. e. a stage.

9. The statement that the distance from the beginning stage is equal to the distance from the preceding stage to the last node plus the distance from the given stage to the preceding stage is called a. the transformation. b. state variables. c. decision variables. d. the optimal policy. e. stages.

10. In dynamic programming, sn is a. the input to the stage n. b. the decision at stage n.

c. the return at stage n. d. the output of stage n. e. none of the above.

11. The distance from the beginning stage is equal to the distance from the preceding stage to the last node plus the distance for the given stage to the preceding stage. This relationship is used to solve which type of problem? a. knapsack b. JIT c. shortest route d. minimal spanning tree e. maximal flow

12. In using dynamic programming to solve a shortest-route problem, the distance from one point to the next would be called a a. state. b. stage. c. return. d. decision.

13. In using dynamic programming to solve a shortest- route problem, the decision variables at one stage of the problem would be a. the distances from one node to the next. b. the possible arcs or routes that can be selected. c. the number of possible destination nodes. d. the entering nodes.

14. In using dynamic programming to solve a shortest-route problem, the entering nodes would be called a. the stages. b. the state variables. c. the returns. d. the decision variables.

Discussion Questions and Problems

Discussion Questions

M2-1 What is a stage in dynamic programming? M2-2 What is the difference between a state variable and a

decision variable? M2-3 Describe the meaning and use of a decision criterion. M2-4 Do all dynamic programming problems require an

optimal policy? M2-5 Why is transformation important for dynamic pro-

gramming problems?

Problems

M2-6 Refer to Figure M2.1. What is the shortest route between Rice and Dixieville if the road between Hope and Georgetown is improved and the distance is reduce to 4 miles?

M2-7 Due to road construction between Georgetown and Dixieville, a detour must be taken through country

roads (Figure M2.1). Unfortunately, this detour has increased the distance from Georgetown to Dixie- ville to 14 miles. What should George do? Should he take a different route?

M2-8 The Rice brothers have a gold mine between Rice and Brown. In their zeal to find gold, they have blown up the road between Rice and Brown. The road will not be in service for 5 months. What should George do? Refer to Figure M2.1.

M2-9 The Rice brothers (Figure M2.1) wish to determine the potential savings from using the shortest route from Rice to Dixieville rather than just randomly selecting any route. Use dynamic programming to find the longest route from Rice to Dixieville. How much farther is this than the shortest route?

M2-10 Solve the shortest-route problem for the network shown in Figure M2.11.

M2-11 Solve the shortest-route problem for the network shown in Figure M2.12.

Z03_REND3161_13_AIE_M02.indd 17 27/10/16 2:24 PM

M2-18  MODULE 2 • DynaMic PrOgraMMing

M2-12 Mail Express, an overnight mail service, delivers mail to customers throughout the United States, Canada, and Mexico. Fortunately, Mail Express has additional capacity on one of its cargo planes. To maximize profits, Mail Express takes shipments from local manufacturing plants to warehouses for other companies. Currently, there is room for an- other 6 tons. The following table shows the items that can be shipped, their weights, the expected profit for each, and the number of available units. How many units of each item do you suggest that Mail Express ship?

ITEMS TO BE SHIPPED

ITEM

WEIGHT (TONS)

PROFIT/UNIT

NUMBER AVAILABLE

1 1 $3 6

2 2 9 1

3 3 8 2

4 1 2 2

M2-13 Leslie Bessler must travel from her hometown to Denver to see her friend Austin. Given the road map of Figure M2.13, what route will minimize the dis- tance that Leslie travels?

M2-14 An air cargo company has the shipping requirements shown in the following table. Two planes are avail- able with a total capacity of 11 tons. How many units of each item should be shipped to maximize profits?

ITEMS TO BE SHIPPED

ITEM

WEIGHT (TONS)

PROFIT/UNIT

NUMBER AVAILABLE

1 1 $3 6

2 2 9 1

3 3 8 2

4 2 5 5

5 5 8 6

6 1 2 2

1 5

2

3

7

4

8

6

9

5

4

11

10

4

12

6

10

4

6

2 4

6

FIGURE M2.11 (for Problem M2-10)

1

3

2

6

5

4

7

8

9

10

11

3

4

5

3

2

2

7

5

2

2

4 3

3

3

6

FIGURE M2.12 (for Problem M2-11)

Z03_REND3161_13_AIE_M02.indd 18 27/10/16 2:24 PM

caSE STUDy  M2-19

1

4

3

2

5

6

9

8

7

10

11

12

2

1

3 3

4

4

3 3

2

3

2

3

4

2

3

3

FIGURE M2.13 (for Problem M2-13)

1 3

2

4 7

8

6

5 9

10

11

12

13

16

15

14

17

18

19 20

4

2

3 3

3

4

3

4

3

3

4

3

3

2

4

3

4

4

4

3

2

5

2

2

2

FIGURE M2.14 (for Problem M2-16)

Judson MacLay liked to innovate with his trucking company, United Trucking. He knew that he could make more money by keeping his trucks full. Thus, he decided to institute a discount trucking service. He gave substantial discounts to customers that would accept delivery to the West Coast within 2 weeks.

Customers got a great price, and he made more money and kept his trucks full. Over time, Judson developed steady customers that would usually have loads to go at the discounted price. On one shipment, he had an available capacity of 10 tons in sev- eral trucks going to the West Coast. Ten items can be shipped

Case Study

United Trucking

M2-15 Because of a new manufacturing and packaging proce- dure, the weight of item 2 in Problem M2-14 can be cut in half. Does this change the number or types of items that can be shipped by the air transport company?

M2-16 What is the shortest route through the network in Figure M2.14?

M2-17 Refer to Problem M2-16 . The road between node 6 and node 11 is no longer in service due to construc- tion. What is the shortest route given this situation?

M2-18 In Problem M2-16, what is the shortest distance from node 6 to the ending node? How does this change if the road between node 6 and node 11 is no longer in service (see Problem M2-17)?

M2-19 Paige Schwartz is planning to go camping in Big Bend National Park. She will carry a backpack with

food and other items, and she wants to carry no more than 18 pounds of food. The four possible food items she is considering each have certain nutritional ingredients. These items and their weights are as follows:

ITEM WEIGHT (POUNDS) NUTRITIONAL UNITS

A 3 600

B 4 1,000

C 5 1,500

D 2 300

How many of each item should Paige carry if she wishes to maximize the total nutritional units?

Z03_REND3161_13_AIE_M02.indd 19 27/10/16 2:24 PM

M2-20  MODULE 2 • DynaMic PrOgraMMing

at discount. The weight, profit, and number of units available are shown in the following table:

ITEM

WEIGHT (TONS)

PROFIT/UNIT

AVAILABLE

1 1 $10 2

2 1 10 1

3 2 5 3

4 1 7 20

5 3 25 2

6 1 11 1

7 4 30 2

8 3 50 1

9 1 10 2

10 1 5 4

Discussion Questions 1. What do you recommend that Judson do? 2. If the total available capacity were 20 tons, how would

this change Judson’s decision?

Source: Trevor S. Hale.

See our Internet home page at www.pearsonhighered.com/render for this additional case study: Briarcliff Electronics.

Internet Case Study

Bibliography

Bellman, R. E. Dynamic Programming. Princeton, NJ: Princeton University Press, 1957.

Bourland, Karla, and L. K. Carl. “Parallel-Machine Scheduling with Fractional Operator Requirements,” IIE Transactions 26, 5 (September 1994): 56–65.

Elmaghraby, Salah. “Resource Allocation via Dynamic Programming,” European Journal of Operational Research 64, 2 (January 1993): 199–215.

El-Rayes, Khaled, and Osama Moselhi. “Optimized Scheduling for Highway Construction,” Transactions of AACE International (February 1997): 311–315.

Hillard, Michael R., R. S. Solanki, C. Liu, I. K. Busch, G. Harrison, and R. D. Kraemer. “Scheduling the Operation Desert Storm Airlift: An Advanced

Automated Scheduling Support System,” Interfaces 21, 1 (January– February 1992): 131–146.

Howard, R. A. Dynamic Programming. Cambridge, MA: The MIT Press, 1960.

Ibarake, Toshihide, and Yuichi Nakamura. “A Dynamic Programming Method for Single Machine Scheduling,” European Journal of Operational Research 76, 1 (July 1994): 72–82.

Idem, Fidelis, and A. M. Reisman. “An Approach to Planning for Physician Requirements in Developing Countries Using Dynamic Programming,” Operations Research 38, 4 (July 1990): 607–618.

Stokes, Jeffrey, J. W. Mjelde, and C. R. Hall. “Optimal Marketing of Nursery Crops from Container-Based Production Systems,” American Journal of Agricultural Economics 79, 1 (February 1997): 235–245.

Z03_REND3161_13_AIE_M02.indd 20 27/10/16 2:24 PM

 M3-1

M3.1 Understand how the normal curve can be used in performing break-even analysis.

After completing this module, students will be able to:

Decision Theory and the Normal Distribution

LEARNING OBJECTIVES

3 MODULE

In Chapter 3 of your book, we looked at examples that deal with only a small number of states of nature and decision alternatives. But what if there were 50, 100, or even thousands of states and/or alternatives? If you used a decision tree or decision table, solving the prob- lem would be virtually impossible. This module shows how decision theory can be extended to handle problems of such magnitude.

We begin with the case of a firm facing two decision alternatives under conditions of numerous states of nature. The normal probability distribution, which is widely applicable in business decision making, is first used to describe the states of nature.

M3.1 Break-Even Analysis and the Normal Distribution

Break-even analysis, often called cost-volume analysis, answers several common management questions relating the effect of a decision to overall revenues or costs. At what point will we break even, or when will revenues equal costs? At a certain sales volume or demand level, what revenues will be generated? If we add a new product line, will this action increase revenues? In this section, we look at the basic concepts of break-even analysis and explore how the normal probability distribution can be used in the decision-making process.

Barclay Brothers Company’s New Product Decision Barclay Brothers Company is a large manufacturer of adult parlor games. Its marketing vice president, Rudy Barclay, must make the decision whether to introduce a new game called Strategy into the competitive market. Naturally, the company is concerned with costs, potential demand, and profit it can expect to make if it markets Strategy.

The normal distribution can be used when there are a large number of states and/or alternatives.

M3.2 Compute the expected value of perfect information using the normal curve.

Z04_REND3161_13_AIE_M03.indd 1 28/10/16 11:28 AM

M3-2  MODULE 3 • DECIsIOn ThEOry anD ThE nOrMaL DIsTrIbUTIOn

Rudy identifies the following relevant costs:

Fixed cost 1 f 2 = $36,000 (costs that do not vary with volume produced, such as new equipment, insurance, rent, and so on)

Variable cost (v) per game produced = $4

(costs that are proportional to the number of games produced, such as materials and labor)

The selling price per unit is set at $10. The break-even point is the number of games sold at which total revenues are equal to total

costs. It can be expressed as follows:1

Break@even point 1units2 = Fixed cost Price>unit - Variable cost>unit =

f

s - v (M3-1)

So in Barclay’s case,

Break@even point 1games2 = $36,000 $10 - $4

= $36,000

$6

= 6,000 games of Strategy

Any demand for the new game that exceeds 6,000 units will result in a profit, whereas a demand less than 6,000 units will cause a loss. For example, if it turns out that demand is 11,000 games of Strategy, Barclay’s profit would be $30,000:

Revenue 111,000 games * $10>game2 $110,000 Less expenses

Fixed cost Variable cost 111,000 games * $4>game2

$36,000

$44,000

Total expense $80,000

Profit $30,000

If demand is exactly 6,000 games (the break-even point), you should be able to compute for yourself that profit equals $0.

Rudy Barclay now has one useful piece of information that will help him make the decision about introducing the new product. If demand is less than 6,000 units, a loss will be incurred. But actual demand is not known. Rudy decides to turn to the use of a probability distribution to estimate demand.

Probability Distribution of Demand Actual demand for the new game can be at any level—0 units, 1 unit, 2 units, 3 units, up to many thousands of units. Rudy needs to establish the probability of various levels of demand in order to proceed.

In many business situations, the normal probability distribution is used to estimate the de- mand for a new product. It is appropriate when sales are symmetric around the mean expected demand and follow a bell-shaped distribution. Figure M3.1 illustrates a typical normal curve that we discussed at length in Chapter 2. Each curve has a unique shape that depends on two factors: the mean of the distribution 1m2 and the standard deviation of the distribution 1s2.

For Rudy Barclay to use the normal distribution in decision making, he must be able to specify values for m and s. This isn’t always easy for a manager to do directly, but if he or she has some idea of the spread, an analyst can determine the appropriate values. In the Barclay example, Rudy might think that the most likely sales figure is 8,000 but that demand might go as low as 5,000 or as high as 11,000. Sales could conceivably go even beyond those limits; say, there is a 15% chance of being below 5,000 and another 15% chance of being above 11,000.

1For a detailed explanation of the break-even equation, see Appendix M3.1 at the end of this module.

The normal distribution can be used to estimate demand.

Z04_REND3161_13_AIE_M03.indd 2 28/10/16 11:28 AM

M3.1 brEaK-EVEn anaLysIs anD ThE nOrMaL DIsTrIbUTIOn  M3-3

Because this is a symmetric distribution, Rudy decides that a normal curve is appropriate. In Chapter 2, we demonstrated how to take the data in a normal curve such as Figure M3.2 and compute the value of the standard deviation. The formula for calculating the number of standard deviations that any value of demand is away from the mean is

Z = Demand - m

s (M3-2)

where Z is the number of standard deviations above or below the mean, m. A standard Z- normal table is provided in Appendix A.

We see that the area under the curve to the left of 11,000 units demanded is 85% of the total area, or 0.85. From Appendix A, the Z value for 0.85 is approximately 1.04. This means that a demand of 11,000 units is 1.04 standard deviations to the right of the mean, m.

With m = 8,000, Z = 1.04, and a demand of 11,000, we can easily compute s:

Z = Demand - m

s or

1.04 = 11,000 - 8,000

s or

1.04s = 3,000

or

s = 3,000

1.04 = 2,885 units

At last, we can state that Barclay’s demand appears to be normally distributed, with a mean of 8,000 games and a standard deviation of 2,885 games. This allows us to answer some ques- tions of great financial interest to management, such as what the probability is of breaking even.

s 5 Standard Deviation of Demand (Describes Spread )

m 5 Mean Demand (Describes Center of Distribution)

FIGURE M3.1 shape of a Typical normal Distribution

m Demand (Games)

X 5,000 8,000 11,000

Mean of the Distribution, m

15% Chance Demand Is Less Than 5,000 Games

15% Chance Demand Exceeds 11,000 Games

FIGURE M3.2 normal Distribution for barclay’s Demand

Z04_REND3161_13_AIE_M03.indd 3 28/10/16 11:28 AM

M3-4  MODULE 3 • DECIsIOn ThEOry anD ThE nOrMaL DIsTrIbUTIOn

Recalling that the break-even point is 6,000 games of Strategy, we must find the number of stand- ard deviations from 6,000 to the mean:

Z = Break@even point - m

s

= 6,000 - 8,000

2,885 =

-2,000 2,885

= -0.69

This is represented in Figure M3.3. Because Appendix A is set up to handle only positive Z val- ues, we can find the Z value for +0.69, which is 0.7549 or 75.49% of the area under the curve. The area under the curve for -0.69 is just 1 minus the area computed for +0.69, or 1 - 0.7549. Thus, 24.51% of the area under the curve is to the left of the break-even point of 6,000 units. Hence,

P1Loss2 = P1Demand 6 Break@even2 = 0.2451 = 24.51,

P1Profit2 = P1Demand 7 Break@even2 = 0.7549 = 75.49,

The fact that there is a 75% chance of making a profit is useful management information for Rudy to consider.

Before leaving the topic of break-even analysis, we should point out two caveats:

1. We have assumed that demand is normally distributed. If we find that this is not reason- able, other distributions may be applied. These distributions are beyond the scope of this book.

2. We have assumed that demand is the only random variable. If one of the other variables (price, variable cost, or fixed costs) were a random variable, a similar procedure could be followed. If two or more variables are both random, the mathematics becomes very com- plex. This is also beyond our level of treatment. Simulation (see Chapter 13) could be used to help with this type of situation.

Using Expected Monetary Value to Make a Decision In addition to knowing the probability of suffering a loss with Strategy, Barclay is concerned about the expected monetary value (EMV) of producing the new game. He knows, of course, that the option of not developing Strategy has an EMV of $0. That is, if the game is not produced and marketed, his profit will be $0. If, however, the EMV of producing the game is greater than $0, he will recommend the more profitable strategy.

To compute the EMV for this strategy, Barclay uses the expected demand, m, in the follow- ing linear profit function:

EMV = 1Price>unit - Variable cost>unit2 * 1Mean demand2 - Fixed costs (M3-3) = 1$10 - $4218,000 units2 - $36,000 = $48,000 - $36,000 = $12,000

Break-Even 6,000 Units

Profit Area = 75.49%Loss Area = 24.51%

m

FIGURE M3.3 Probability of breaking Even for barclay’s new Game

Computing the probability of making a profit.

Computing the EMV.

Z04_REND3161_13_AIE_M03.indd 4 28/10/16 11:28 AM

M3.2 EXPECTED VaLUE OF PErFECT InFOrMaTIOn anD ThE nOrMaL DIsTrIbUTIOn  M3-5

Rudy has two choices at this point. He can recommend that the firm proceed with the new game; if so, he estimates there is a 75% chance of at least breaking even and an EMV of $12,000. Or he might prefer to do further market research before making a decision. This brings up the subject of the expected value of perfect information.

M3.2 Expected Value of Perfect Information and the Normal Distribution

Let’s return to the Barclay Brothers problem to see how to compute the expected value of perfect information (EVPI) and expected opportunity loss (EOL) associated with introducing the new game. The two steps follow.

Two Steps to Compute EVPI and EOL

1. Determine the opportunity loss function. 2. Use the opportunity loss function and the unit normal loss integral (given in

Appendix M3.2 at the end of this module) to find EOL, which is the same as EVPI.

Opportunity Loss Function The opportunity loss function describes the loss that would be suffered by making the wrong decision. We saw earlier that Rudy’s break-even point is 6,000 sets of the game Strategy. If Rudy produces and markets the new game and sales are greater than 6,000 units, he has made the right decision; in this case, there is no opportunity loss ($0). If, however, he introduces Strategy and sales are less than 6,000 games, he has selected the wrong alternative. The opportunity loss is just the money lost if demand is less than the break-even point; for example, if demand is 5,999 games, Barclay loses $6 (= $10 price/unit - $4 cost/unit). With a $6 loss for each unit of sales less than the break-even point, the total opportunity loss is $6 multiplied by the number of units under 6,000. If only 5,000 games are sold, the opportunity loss will be 1,000 units less than the break-even point times $6 per unit = $6,000. For any level of sales, X, Barclay’s opportunity loss function can be expressed as follows:

Opportunity loss = e$616,000 - X2 for X … 6,000 games $0 for X 7 6,000 games

In general, the opportunity loss function can be computed by

Opportunity loss = eK1Break@even point - X2 for X … Break@even point $0 for X 7 Break@even point

(M3-4)

where

K = loss per unit when sales are below the break@even point X = sales in units

Expected Opportunity Loss The second step is to find the expected opportunity loss. This is the sum of the opportunity losses multiplied by the appropriate probability values. But in Barclay’s case, there are a very large number of possible sales values. If the break-even point is 6,000 games, there will be 6,000 possible sales values, from 0, 1, 2, 3, up to 6,000 units. Thus, determining the EOL would re- quire setting 6,000 probability values that correspond to the 6,000 possible sales values. These numbers would be multiplied and added together, a very lengthy and tedious task.

When we assume that there are an infinite (or very large) number of possible sales values that follow a normal distribution, the calculations are much easier. Indeed, when the unit normal loss integral is used, the EOL can be computed as follows:

EOL = KsN1D2 (M3-5)

Using the unit normal loss integral.

Z04_REND3161_13_AIE_M03.indd 5 28/10/16 11:28 AM

M3-6  MODULE 3 • DECIsIOn ThEOry anD ThE nOrMaL DIsTrIbUTIOn

where EOL = expected opportunity loss

K = loss per unit when sales are below the break@even point s = standard deviation of the distribution

N1D2 = value for the unit normal loss integral in Appendix M3.2 for a given value of D

D = ` m - Break@even point s

` (M3-6) where

� � = absolute value sign m = mean sales

Here is how Rudy can compute the EOL for his situation:

K = $6 s = 2,885

D = ` 8,000 - 6,000 2,885

` = 0.69 = 0.60 + 0.09

Now refer to the unit normal loss integral table in Appendix M3.2. Look in the “0.6” row and read over to the “0.9” column. This is N10.692, which is 0.1453:

N10.692 = 0.1453 Therefore,

EOL = KsN10.692 = 1$6212,885210.14532 = $2,515.14

Because EVPI and minimum EOL are equivalent, the EVPI is also $2,515.14. This is the maximum amount that Rudy should be willing to spend on additional marketing information.

The relationship between the opportunity loss function and the normal distribution is shown in Figure M3.4. This graph shows both the opportunity loss and the normal distribution with a mean of 8,000 games and a standard deviation of 2,885. To the right of the break-even point, we note that the loss function is 0. To the left of the break-even point, the opportunity loss function increases at a rate of $6 per unit—hence the slope of -6. The use of Appendix M3.2 and Equa- tion M3-5 allows us to multiply the $6 unit loss times each of the probabilities between 6,000 units and 0 units and to sum these multiplications.

EVPI and minimum EOL are equivalent.

m6,000

Normal Distribution

Slope –6

Break-Even Point (XB)

Demand (Games) X

Loss ($)

Opportunity Loss 5

m 5 8,000 Games

$6 (6,000 – X ) for x # 6,000 games $0 for x . 6,000

m 5 8,000 s 5 2,885

FIGURE M3.4 barclay’s Opportunity Loss Function

Z04_REND3161_13_AIE_M03.indd 6 28/10/16 11:28 AM

sOLVED PrObLEMs  M3-7

In this module, we look at decision theory problems that involve many states of nature and alternatives. As an alternative to decision tables and decision trees, we demonstrate how to use the normal distribution to solve break-even problems and find the EMV and EVPI. We need to know the mean and standard

deviation of the normal distribution and to be certain that it is the appropriate probability distribution to apply. Other continu- ous distributions can also be used, but they are beyond the level of this module.

Summary

Glossary

Break-Even Analysis The analysis of relationships among profit, costs, and demand level.

Opportunity Loss Function A function that relates opportu- nity loss in dollars to sales in units.

Unit Normal Loss Integral A set of numbers in a table that is used in the determination of EOL and EVPI.

Key Equations

(M3-1) Break@even point 1in units2

= Fixed cost

Price>unit - Variable cost>unit = f

s - v

The formula that provides the volume at which total revenue equals total costs.

(M3-2) Z = Demand - m

s

The number of standard deviations that demand is from the mean, m.

(M3-3) EMV = 1Price>unit - Variable cost>unit2 * 1Mean demand2 - Fixed costs

The expected monetary value.

(M3-4) Opportunity loss = c K 1Break@even point - X2 for X … Break@even point $0 for X 7 Break@even point

The opportunity loss function.

(M3-5) EOL = KsN1D2 The expected opportunity loss.

(M3-6) D = ` m - Break@even point s

`

An intermediate value used to compute EOL.

Solved Problems

Solved Problem M3-1 Terry Wagner is considering self-publishing a book on yoga. She has been teaching yoga for more than 20 years. She believes that the fixed costs of publishing the book will be about $10,000. The variable costs are $5.50, and the price of the yoga book to bookstores is expected to be $12.50. What is the break-even point for Terry?

Solution This problem can be solved using the break-even formula in the module:

Break@even point in units = $10,000

$12.50 - $5.50

= $10,000

$7

= 1,429 units

Z04_REND3161_13_AIE_M03.indd 7 28/10/16 11:28 AM

Solved Problem M3-2 The annual demand for a new electric product is expected to be normally distributed with a mean of 16,000 and a standard deviation of 2,000. The break-even point is 14,000 units. For each unit less than 14,000, the company will lose $24. Find the expected opportunity loss.

Solution The expected opportunity loss (EOL) is

EOL = KsN1D2 We are given the following:

K = loss per unit = $24 m = 16,000 s = 2,000

Using Equation M3-6, we find

D = ` m - Break@even point s

` = ` 16,000 - 14,000 2,000

` = 1 N1D2 = N112 = 0.08332 from Appendix M3.2 EOL = KsN112 = 2412,000210.083322 = $3,999.36

Self-Test

●● Before taking the self-test, refer back to the learning objectives at the beginning of the module and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. Another name for break-even analysis is a. normal analysis. b. variable-cost analysis. c. cost-volume analysis. d. standard analysis. e. probability analysis.

2. The break-even point is the quantity at which a. total variable cost equals total fixed cost. b. total revenue equals total variable cost. c. total revenue equals total fixed cost. d. total revenue equals total cost.

3. If demand is greater than the break-even point, a. profit will equal zero. b. profit will be greater than zero. c. profit will be negative. d. total fixed cost will equal total variable cost.

4. If the break-even point is less than the mean, the Z value will a. be negative. b. equal zero. c. be positive. d. be impossible to calculate.

5. The minimum EOL is equal to the a. break-even point. b. EVPI.

c. maximum EMV. d. Z value for the break-even point.

6. Which of the following would indicate the maximum that should be paid for any additional information? a. the break-even point b. the EVPI c. the EMV of the mean d. total fixed cost

7. The opportunity loss function is expressed as a function of the demand (X) when the break-even point and the loss per unit (K) are known. Which of the following is true of the opportunity loss? a. Opportunity loss = K 1Break@even point - X2 for

X Ú Break-even point b. Opportunity loss = K 1X - Break@even point2 for

X Ú Break-even point c. Opportunity loss = K 1Break@even point - X2 for

X 6 Break-even point d. Opportunity loss = K 1X - Break@even point2 for

X 6 Break-even point

M3-8  MODULE 3 • DECIsIOn ThEOry anD ThE nOrMaL DIsTrIbUTIOn

Z04_REND3161_13_AIE_M03.indd 8 28/10/16 11:28 AM

DIsCUssIOn QUEsTIOns anD PrObLEMs  M3-9

Discussion Questions and Problems

Discussion Questions M3-1 What is the purpose of conducting break-even

analysis? M3-2 Under what circumstances can the normal distribu-

tion be used in break-even analysis? What does it usually represent?

M3-3 What assumption do you have to make about the relationship between EMV and a state of nature when you are using the mean to determine the value of EMV?

M3-4 Describe how EVPI can be determined when the distribution of the states of nature follows a normal distribution.

Problems M3-5 A publishing company is planning on developing

an advanced quantitative analysis book for gradu- ate students in doctoral programs. The company estimates that sales will be normally distributed, with mean sales of 60,000 copies and a standard deviation of 10,000 books. The book will cost $16 to produce and will sell for $24; fixed costs will be $160,000.

(a) What is the company’s break-even point? (b) What is the EMV?

M3-6 Refer to Problem M3-5.

(a) What is the opportunity loss function? (b) Compute the expected opportunity loss. (c) What is the EVPI? (d) What is the probability that the new book will

be profitable? (e) What do you recommend that the firm do?

M3-7 Barclay Brothers Company, the firm discussed in this module, thinks it underestimated the mean for its game Strategy. Rudy Barclay thinks expected sales may be 9,000 games. He also thinks that there is a 20% chance that sales will be less than 6,000 games and a 20% chance that he can sell more than 12,000 games.

(a) What is the new standard deviation of demand? (b) What is the probability that the firm will incur

a loss? (c) What is the EMV? (d) How much should Rudy be willing to pay now

for a market research study?

M3-8 True-Lens, Inc., is considering producing long- wearing contact lenses. Fixed costs will be $24,000, with a variable cost per set of lenses of $8. The lenses will sell to optometrists for $24 per set.

(a) What is the firm’s break-even point? (b) If expected sales are 2,000 sets, what should

True-Lens do, and what are the expected profits?

M3-9 Leisure Supplies produces sinks and ranges for travel trailers and recreational vehicles. The unit price on its double sink is $28 and the unit cost is $20. The fixed cost in producing the double sink is $16,000. Mean sales for the double sinks have been 35,000 units, and the standard deviation has been estimated to be 8,000 sinks. Determine the expected monetary value for these sinks. If the standard deviation were actually 16,000 units in- stead of 8,000 units, what effect would this have on the expected monetary value?

M3-10 Belt Office Supplies sells desks, lamps, chairs, and other related supplies. The company’s execu- tive lamp sells for $45, and Elizabeth Belt has de- termined that the break-even point for executive lamps is 30 lamps per year. If Elizabeth does not make the break-even point, she loses $10 per lamp. The mean sales for executive lamps has been 45, and the standard deviation is 30.

(a) Determine the opportunity loss function. (b) Determine the expected opportunity loss. (c) What is the EVPI?

M3-11 Elizabeth Belt is not completely certain that the loss per lamp is $10 if sales are below the break- even point (refer to Problem M3-10). The loss per lamp could be as low as $8 or as high as $15. What effect would these two values have on the expected opportunity loss?

M3-12 Leisure Supplies is considering the possibility of using a new process for producing sinks. This new process would increase the fixed cost by $16,000. In other words, the fixed cost would double (see Problem M3-9). This new process will improve the quality of the sinks and reduce the cost it takes to produce each sink. It will cost only $19 to pro- duce the sinks using the new process.

(a) What do you recommend? (b) Leisure Supplies is considering the possibility

of increasing the purchase price to $32 using the old process given in Problem M3-9. It is expected that this will lower the mean sales to 26,000 units. Should Leisure Supplies increase the selling price?

M3-13 Quality Cleaners specializes in cleaning apart- ment units and office buildings. Although the work is not too enjoyable, Joe Boyett has been able to realize a considerable profit in the Chicago area. Joe is now thinking about opening another Quality Cleaners in Milwaukee. To break even, Joe would need to get 200 cleaning jobs per year. For every job under 200, Joe will lose $80. Joe estimates that the average sales in Milwaukee will be 350 jobs per year, with a standard deviation of 150 jobs. A market research team has approached Joe with a

Z04_REND3161_13_AIE_M03.indd 9 28/10/16 11:28 AM

M3-10  MODULE 3 • DECIsIOn ThEOry anD ThE nOrMaL DIsTrIbUTIOn

proposition to perform a marketing study on the potential for his cleaning business in Milwaukee. What is the most that Joe would be willing to pay for the market research?

M3-14 Diane Kennedy is contemplating the possibility of going into competition with Primary Pumps, a manufacturer of industrial water pumps. Diane has gathered some interesting information from a friend of hers who works for Primary. Diane has been told that the mean sales for Primary are 5,000 units and the standard deviation is 50 units. The opportunity loss per pump is $100. Further- more, Diane has been told that the most that Pri- mary is willing to spend for market research for the demand potential for pumps is $500. Diane is interested in knowing the break-even point for Pri- mary Pumps. Given this information, compute the break-even point.

M3-15 Jack Fuller estimates that the break-even point for EM5, a standard electrical motor, is 500 motors. For any motor that is not sold, there is an oppor- tunity loss of $15. The average sales have been 700 motors, and 20% of the time sales have been between 650 and 750 motors. Jack has just been approached by Radner Research, a firm that specializes in performing marketing studies for

industrial products, to perform a standard market- ing study. What is the most that Jack would be will- ing to pay for market research?

M3-16 Jack Fuller believes that he has made a mistake in his sales figures for EM5 (see Problem M3-15 for details). He believes that the average sales are 750 instead of 700 units. Furthermore, he estimates that 20% of the time, sales will be between 700 and 800 units. What effect will these changes have on your estimate of the amount that Jack should be willing to pay for market research?

M3-17 Patrick’s Pressure Wash pays $4,000 per month to lease equipment that it uses for washing sidewalks, swimming pool decks, houses, and other things. Based on the size of a work crew, the cost of the labor used on a typical job is $80. However, Patrick charges $120 per job, which results in a profit of $40 per job. How many jobs would be needed to break even each month?

M3-18 Determine the EVPI for Patrick’s Pressure Wash in Problem M3-17 if the average monthly demand is 120 jobs, with a standard deviation of 15.

M3-19 If Patrick (see Problem M3-17) charged $150 per job while his labor cost remained at $80 per job, what would be the break-even point?

Bibliography

Drezner, Z., and G. O. Wesolowsky. “The Expected Value of Perfect Informa- tion in Facility Location,” Operations Research 28, 2 (March–April 1980): 395–402.

Hammond, J. S., R. L. Kenney, and H. Raiffa. “The Hidden Traps in Decision Making,” Harvard Business Review (September–October 1998): 47–60.

Keaton, M. “A New Functional Approximation to the Standard Normal Loss Integral,” Inventory Management Journal (Second Quarter 1994): 58–62.

Appendix M3.1: Derivation of the Break-Even Point

1. Total cost = Fixed cost + (Variable cost/unit) * (Number of units) 2. Total revenue = (Price/unit)(Number of units) 3. At break-even point, Total cost = Total revenue 4. Or Fixed cost + (Variable cost/unit) * (Number of units) = (Price/unit)(Number of units) 5. Solving for the number of units at the break-even point, we get

Break@even point 1units2 = Fixed cost Price>unit - Variable cost>unit

This equation is the same as Equation M3-1.

Z04_REND3161_13_AIE_M03.indd 10 28/10/16 11:28 AM

aPPEnDIX M3.2: UnIT nOrMaL LOss InTEGraL  M3-11

Appendix M3.2: Unit Normal Loss Integral

D 0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.0 0.3989423 0.3939622 0.3890221 0.3841218 0.3792614 0.3744409 0.3696602 0.3649193 0.3602182 0.3555569 0.1 0.3509353 0.3463535 0.3418112 0.3373086 0.3328455 0.3284220 0.3240379 0.3196932 0.3153878 0.3111216 0.2 0.3068946 0.3027068 0.2985579 0.2944480 0.2903770 0.2863447 0.2823511 0.2783960 0.2744794 0.2706012 0.3 0.2667612 0.2629594 0.2591956 0.2554697 0.2517816 0.2481311 0.2445181 0.2409426 0.2374043 0.2339031 0.4 0.2304388 0.2270114 0.2236207 0.2202665 0.2169487 0.2136671 0.2104216 0.2072119 0.2040380 0.2008996 0.5 0.1977966 0.1947288 0.1916960 0.1886981 0.1857348 0.1828060 0.1799115 0.1770512 0.1742247 0.1714320 0.6 0.1686727 0.1659468 0.1632540 0.1605942 0.1579670 0.1553724 0.1528100 0.1502798 0.1477814 0.1453147 0.7 0.1428794 0.1404753 0.1381023 0.1357600 0.1334483 0.1311669 0.1289157 0.1266943 0.1245026 0.1223403 0.8 0.1202072 0.1181031 0.1160278 0.1139809 0.1119623 0.1099717 0.1080090 0.1060738 0.1041659 0.1022851 0.9 0.1004311 0.0986038 0.0968028 0.0950280 0.0932790 0.0915557 0.0898578 0.0881851 0.0865373 0.0849142 1.0 0.0833155 0.0817410 0.0801904 0.0786636 0.0771603 0.0756801 0.0742230 0.0727886 0.0713767 0.0699871 1.1 0.0686195 0.0672737 0.0659494 0.0646465 0.0633646 0.0621035 0.0608631 0.0596430 0.0584430 0.0572629 1.2 0.0561025 0.0549614 0.0538396 0.0527367 0.0516525 0.0505869 0.0495395 0.0485101 0.0474985 0.0465046 1.3 0.0455280 0.0445685 0.0436259 0.0427001 0.0417907 0.0408975 0.0400204 0.0391592 0.0383135 0.0374832 1.4 0.0366681 0.0358680 0.0350827 0.0343119 0.0335554 0.0328131 0.0320848 0.0313702 0.0306691 0.0299814 1.5 0.0293068 0.0286452 0.0279963 0.0273600 0.0267361 0.0261243 0.0255246 0.0249367 0.0243604 0.0237955 1.6 0.0232420 0.0226995 0.0221679 0.0216471 0.0211369 0.0206370 0.0201474 0.0196678 0.0191981 0.0187382 1.7 0.0182878 0.0178468 0.0174151 0.0169924 0.0165787 0.0161738 0.0157775 0.0153897 0.0150102 0.0146389 1.8 0.0142756 0.0139202 0.0135726 0.0132326 0.0129000 0.0125748 0.0122569 0.0119459 0.0116420 0.0113448 1.9 0.0110544 0.0107704 0.0104930 0.0102218 0.0099569 0.0096980 0.0094451 0.0091980 0.0089566 0.0087209 2.0 0.0084907 0.0082659 0.0080464 0.0078320 0.0076228 0.0074185 0.0072191 0.0070245 0.0068345 0.0066492 2.1 0.0064683 0.0062919 0.0061197 0.0059518 0.0057880 0.0056282 0.0054724 0.0053204 0.0051723 0.0050278 2.2 0.0048870 0.0047497 0.0046159 0.0044855 0.0043584 0.0042346 0.0041139 0.0039964 0.0038818 0.0037703 2.3 0.0036616 0.0035557 0.0034527 0.0033523 0.0032546 0.0031595 0.0030668 0.0029767 0.0028889 0.0028035 2.4 0.0027204 0.0026396 0.0025609 0.0024844 0.0024099 0.0023375 0.0022670 0.0021985 0.0021319 0.0020671 2.5 0.0020041 0.0019429 0.0018834 0.0018255 0.0017693 0.0017147 0.0016616 0.0016100 0.0015599 0.0015112 2.6 0.0014639 0.0014179 0.0013733 0.0013300 0.0012879 0.0012471 0.0012074 0.0011689 0.0011316 0.0010953 2.7 0.0010601 0.0010260 0.0009928 0.0009607 0.0009295 0.0008992 0.0008699 0.0008414 0.0008138 0.0007870 2.8 0.0007611 0.0007359 0.0007115 0.0006879 0.0006650 0.0006428 0.0006213 0.0006004 0.0005802 0.0005606 2.9 0.0005417 0.0005233 0.0005055 0.0004883 0.0004716 0.0004555 0.0004398 0.0004247 0.0004101 0.0003959 3.0 0.0003822 0.0003689 0.0003560 0.0003436 0.0003316 0.0003199 0.0003087 0.0002978 0.0002873 0.0002771 3.1 0.0002672 0.0002577 0.0002485 0.0002396 0.0002311 0.0002227 0.0002147 0.0002070 0.0001995 0.0001922 3.2 0.0001852 0.0001785 0.0001720 0.0001657 0.0001596 0.0001537 0.0001480 0.0001426 0.0001373 0.0001322 3.3 0.0001273 0.0001225 0.0001179 0.0001135 0.0001093 0.0001051 0.0001012 0.0000973 0.0000937 0.0000901 3.4 0.0000867 0.0000834 0.0000802 0.0000771 0.0000741 0.0000713 0.0000685 0.0000659 0.0000633 0.0000609 3.5 0.00005848 0.00005620 0.00005400 0.00005188 0.00004984 0.00004788 0.00004599 0.00004417 0.00004242 0.00004073 3.6 0.00003911 0.00003755 0.00003605 0.00003460 0.00003321 0.00003188 0.00003059 0.00002935 0.00002816 0.00002702 3.7 0.00002592 0.00002486 0.00002385 0.00002287 0.00002193 0.00002103 0.00002016 0.00001933 0.00001853 0.00001776 3.8 0.00001702 0.00001632 0.00001563 0.00001498 0.00001435 0.00001375 0.00001317 0.00001262 0.00001208 0.00001157 3.9 0.00001108 0.00001061 0.00001016 0.00000972 0.00000931 0.00000891 0.00000853 0.00000816 0.00000781 0.00000747

Z04_REND3161_13_AIE_M03.indd 11 28/10/16 11:28 AM

This page intentionally left blank

 M4-1

M4.4 Solve mixed strategy games when there is no saddle point.

M4.5 Understand the concept of dominance to reduce the size of the game.

M4.1 Understand the principles of two-person, zero- sum games.

M4.2 Understand the minimax criterion as well as the upper and lower values of a game.

M4.3 Solve pure strategy games when there is a saddle point.

After completing this module, students will be able to:

Game Theory

LEARNING OBJECTIVES

4 MODULE

As discussed in Chapter 1, competition can be an important decision-making factor. The strategies taken by other organizations or individuals can dramatically affect the outcome of our decisions. In the automobile industry, for example, the strategies of competitors to introduce certain models with certain features can dramatically affect the profitability of other carmakers. Today, business cannot make important decisions without considering what other organizations or individuals are doing or might do.

Game theory is one way to consider the impact of the strategies of others on our strategies and outcomes. A game is a contest involving two or more decision makers, each of whom wants to win. Game theory is the study of how optimal strategies are formulated in conflict.

The study of game theory dates back to 1944, when John von Neumann and Oscar Morgen- stern published their classic book, Theory of Games and Economic Behavior.1 Since then, game theory has been used by army generals to plan war strategies, by union negotiators and managers in collective bargaining, and by businesses of all types to determine the best strategies given a competitive business environment.

Game theory continues to be important today. In 1994, John Harsanui, John Nash, and Reinhard Selten jointly received the Nobel Prize in Economics from the Royal Swedish Acad- emy of Sciences.2 In their classic work, these individuals developed the notion of noncoopera- tive game theory. After the work of John von Neumann, Nash developed the concepts of the Nash equilibrium and the Nash bargaining problem, which are the cornerstones of modern game theory.

1J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior. Princeton, NJ: Princeton University Press, 1944. 2Rita Koselka, “The Games Businesses Play,” Forbes (November 7, 1994): 12.

Z05_REND3161_13_AIE_M04.indd 1 27/10/16 2:23 PM

M4-2 MODULE 4 • GAME ThEOry

Game models are classified by the number of players, the sum of all payoffs, and the number of strategies employed. Due to the mathematical complexity of game theory, we limit the analy- sis in this module to two-person, zero-sum games. A two-person game is one in which only two parties can play—as in the case of a union and a company in a bargaining session. For simplicity, X and Y represent the two game players. Zero sum means that the sum of losses for one player must equal the sum of gains for the other player. Thus, if X wins 20 points or dollars, Y loses 20 points or dollars. With any zero-sum game, the sum of the gains for one player is always equal to the sum of the losses for the other player. When you sum the gains and losses for both players, the result is zero—hence the name zero-sum game.

M4.1 Language of Games

To introduce the notation used in game theory, let us consider a simple game. Suppose there are only two lighting fixture stores, X and Y, in Urbana, Illinois. (This is called a duopoly.) The respective market shares have been stable up until now, but the situation may change. The daughter of the owner of store X has just completed her MBA and has developed two distinct advertising strategies, one using radio spots and the other newspaper ads. Upon hearing this, the owner of store Y also proceeds to prepare radio and newspaper ads.

The 2 * 2 payoff matrix in Table M4.1 shows what will happen to current market shares if both stores begin advertising. By convention, payoffs are shown only for the first game player— X, in this case. Y’s payoffs will just be the negative of each number. For this game, there are only two strategies being used by each player. If store Y had a third strategy, we would be dealing with a 2 * 3 payoff matrix.

A positive number in Table M4.1 means that X wins and Y loses. A negative number means that Y wins and X loses. It is obvious from the table that the game favors competitor X, since all values are positive except one. If the game had favored player Y, the values in the table would have been negative. In other words, the game in Table M4.1 is biased against Y. However, since Y must play the game, he or she will play to minimize total losses. To do this, player Y would use the minimax criterion, our next topic.

Game Outcomes

STORE X’s STRATEGY STORE Y’s STRATEGY OUTCOME (% CHANGE IN MARKET SHARE)

X1 (use radio) Y1 (use radio) X wins 3 and Y loses 3

X1 (use radio) Y2 (use newspaper) X wins 5 and Y loses 5

X2 (use newspaper) Y1 (use radio) X wins 1 and Y loses 1

X2 (use newspaper) Y2 (use newspaper) X loses 2 and Y wins 2

M4.2 The Minimax Criterion

For two-person, zero-sum games, there is a logical approach to finding the solution: In a zero- sum game, each person should choose the strategy that minimizes the maximum loss, called the minimax criterion. This is identical to maximizing one’s minimum gains, so for one player, this could be called the maximin criterion.

In a zero-sum game, what is gained by one player is lost by the other.

A player using the minimax criterion will select the strategy that minimizes the maximum possible loss.

GAME PLAYER Y’s STRATEGIES

Y1

(Use radio)

Y2

(Use newspaper)

GAME PLAYER X’s STRATEGIES

X1

(Use radio)

3 5

X2

(Use newspaper)

1 -2

TABLE M4.1 Store X’s Payoff Matrix

Z05_REND3161_13_AIE_M04.indd 2 27/10/16 2:23 PM

M4.3 PUrE STrATEGy GAMES  M4-3

Let us use the example in Table M4.1 to illustrate the minimax criterion. This is a two- person, zero-sum game with the strategies for player Y given as the columns of the table. The values are gains for player X and losses for player Y. Player Y is looking at a maximum loss of 3 if strategy Y1 is selected and a maximum loss of 5 if strategy Y2 is selected. Thus, player Y should select strategy Y1, which results in a maximum loss of 3 (the minimum of the maxi- mum possible losses). This is called the upper value of the game. Table M4.2 illustrates this minimax approach.

In considering the maximin strategy for player X (whose strategies correspond to the rows of the table), let us look at the minimum payoff for each row. The payoffs are +3 for strategy X1 and -2 for strategy X2. The maximum of these minimums is +3, which means strategy X1 will be selected. This value 1+32 is called the lower value of the game.

If the upper and lower values of a game are the same, this number is called the value of the game, and an equilibrium or saddle point condition exists. For the game presented in Table M4.2, the value of the game is 3 because this is the value for both the upper and the lower val- ues. The value of the game is the average or expected game outcome if the game is played an infinite number of times.

In implementing the minimax strategy, player Y will find the maximum value in each column and select the minimum of these maximums. In implementing the maximin strategy, player X will find the minimum value in each row and select the maximum of these minimums. When a saddle point is present, this approach will result in pure strategies for each player. Oth- erwise, the solution to the game will involve mixed strategies. These concepts are discussed in the following sections.

M4.3 Pure Strategy Games

When a saddle point is present, the strategy each player should follow will always be the same, regardless of the other player’s strategy. This is called a pure strategy. A saddle point is a situ- ation in which both players are facing pure strategies.

Using the minimax criterion, we saw that the game in Table M4.2 had a saddle point and thus is an example of a pure strategy game. It is beneficial for player X and for player Y to always choose one strategy. Simple logic would lead us to this same conclusion. Player X will always select X1, since the payoffs for X1 are better than the payoffs for X2, regard- less of what player Y does. Knowing that player X will select X1, player Y will always select strategy Y1 and only lose 3 rather than 5. Note that the saddle point in this example, 3, is the largest number in its column and the smallest number in its row. This is true of all saddle points.

Another example of a pure strategy game is shown in Table M4.3. Notice that the value 6 is the lowest number in its row and the highest number in its column. Thus, it is a saddle point and indicates that strategy X1 will be selected by player X and strategy Y2 will be selected by player Y. The value of this game is 6.

The upper value of the game is equal to the minimum of the maximum values in the columns.

The lower value of the game is equal to the maximum of the minimum values in the rows.

An equilibrium or saddle point condition exists if the upper value of the game is equal to the lower value of the game. This is called the value of the game.

A pure strategy exists whenever a saddle point is present.

SADDLE POINT

Y1 Y2 Minimum

X1 3 5 3

X2 1 -2 −2

Maximum 3 5

Maximum of Minimums

Minimum of maximums

TABLE M4.2 Minimax Solution

Z05_REND3161_13_AIE_M04.indd 3 27/10/16 2:23 PM

M4-4 MODULE 4 • GaME ThEOry

PLAYERS Y’s STRATEGIES

Minimum row number

Y1 Y2 T

PLAYER X ’s STRATEGIES

X1 10 6 6

X2 -12 2 -12

Maximum column number S 10 6

TABLE M4.3 Example of a Pure Strategy Game

Game Theory in the Brewing Business

Companies that understand the principles and importance of game theory can often select the best competitive strategies. Companies that don’t can face financial loss or even bankruptcy. The successful and unsuccessful selection of competitive gaming strategies can be seen in most industries, including the brewing industry.

In the 1970s, Schlitz was the second-largest brewer in the United States. With its slogan “the beer that made Milwaukee famous,”* Schlitz was chasing after the leader in beer sales, Anheuser-Busch, maker of Budweiser. Schlitz could either keep its current production output or attempt to produce more beer to com- pete with Anheuser-Busch. It decided to get more beer to the mar- ket in a shorter amount of time. In order to accomplish this, Schlitz selected a strategy of distributing “immature” beer. The result was cloudy beer that often contained a slimy suspension. The beer and Schlitz’s market share and profitability went down the drain. Anheuser-Busch, Miller, and Coors became the market leaders.

Similarly, when Miller first decided to market Miller Lite, with the slogan “tastes great—less filling,” Anheuser-Busch had two

possible gaming strategies: to develop its own low-calorie beer or to criticize Miller in its advertising for producing a watered-down beer. The strategy it selected was to criticize Miller in its adver- tising. The strategy didn’t work, Miller gained significant market share, and Anheuser-Busch was forced to come out with its own low-calorie beer—Bud Light.

Today, Anheuser-Busch, Miller Coors, Pabst Brewing Company (owner of the Schlitz brand), D. G. Yuengling and Son Company, Boston Beer Company, and other large beer manufacturers face new games and new competitors. Although it is too early to tell what the large beer makers will do and how successful their strate- gies will be, it appears that their strategy will be to duplicate what these new competitors are doing. What is clear, however, is that a knowledge of the fundamentals of game theory can make a big difference.

*From “American Brewing, Unreal” by Philip Van Munching, © September 4, 1997, The Economist Newspaper Limited.

Source: Based on Philip Van Munching, “American Brewing, Unreal,” The Economist (September 4, 1997): 24, © Trevor S. Hale.

IN ACTION

M4.4 Mixed Strategy Games

When there is no saddle point, players will play each strategy for a certain percentage of the time. This is called a mixed strategy game. The most common way to solve a mixed strategy game is to use the expected gain or loss approach. The goal of this approach is for a player to play each strategy a particular percentage of the time so that the expected value of the game does not depend on what the opponent does. This will occur only if the expected value of each strategy is the same.

Consider the game shown in Table M4.4. There is no saddle point, so this will be a mixed strategy game. Player Y must determine the percentage of the time to play strategy Y1 and the percentage of the time to play strategy Y2. Let P be the percentage of time that player Y chooses strategy Y1 and 1 - P be the percentage of time that player Y chooses strategy Y2. We must weight the payoffs by these percentages to compute the expected gain for each of the different strategies that player X may choose.

For example, if player X chooses strategy X1, then P percent of the time the payoff for Y will be 4, and 1 - P percent of the time the payoff will be 2, as shown in Table M4.5. Simi- larly, if player X chooses strategy X2, then P percent of the time the payoff for Y will be 1, and 1 - P percent of the time the payoff will be 10. If these expected values are the same, then the expected value for player Y will not depend on the strategy chosen by X. Therefore, to solve this, we set these two expected values equal, as follows:

4P + 211 - P2 = 1P + 1011 - P2

In a mixed strategy game, each player should optimize the expected gain.

Z05_REND3161_13_AIE_M04.indd 4 01/11/16 2:33 PM

M4.4 MixED STrATEGy GAMES  M4-5

Y1 Y2

P 1 - P Expected gain

X1 Q 4 2 4P + 211 − P2 X2 1 - Q 1 10 1P + 1011 − P2 Expected gain 4Q + 111 − Q2 2Q + 1011 − Q2

Solving this for P, we have

P = 8>11 and

1 - P = 1 - 8>11 = 3>11 Thus, 8>11 and 3>11 indicate how often player Y will choose strategies Y1 and Y2, respectively. The expected value computed with these percentages is

1P + 1011 - P2 = 118>112 + 1013>112 = 38>11 = 3.46 Performing a similar analysis for player X, we let Q be the percentage of the time that strat-

egy X1 is played and 1 - Q be the percentage of the time that strategy X2 is played. Using these, we compute the expected gain shown in Table M4.5. We set these to be equal, as follows:

4Q + 111 - Q2 = 2Q + 1011 - Q2

PLAYER Y’s STRATEGIES

Y1 Y2

PLAYER X’s STRATEGIES

X1 4 2

X2 1 10

TABLE M4.4 Game Table for Mixed Strategy Game

TABLE M4.5 Game Table for Mixed Strategy Game with Percentages (P, Q) Shown

Using Game Theory to Shape Strategy at General Motors

Game theory often assumes that one player or company must lose for another to win. In the auto industry, car companies typi- cally compete by offering rebates and price cuts. This allows one company to gain market share at the expense of other car com- panies. Although this win–lose strategy works in the short term, competitors quickly follow the same strategy. The result is lower margins and profitability. Indeed, many customers wait until a rebate or price cut is offered before buying a new car. The short- term win–lose strategy turns into a long-term lose–lose result.

By changing the game itself, it is possible to find strategies that can benefit all competitors. This was the case when General

Motors (GM) developed a new credit card that allowed people to apply 5% of their purchases to a new GM vehicle, up to $500 per year, with a maximum of $3,500. The credit card program replaced other incentive programs offered by GM. Changing the game helped bring profitability back to GM. In addition, it helped other car manufacturers who no longer had to compete on price cuts and rebates. In this case, the new game resulted in a win– win situation with GM. Prices, margins, and profitability increased for GM and for some of its competitors.

Source: Based on Adam Brandenburger, et al., “The Right Game: Use Game Theory to Shape Strategy,” Harvard Business Review (July–August 1995): 57, © Trevor S. Hale.

IN ACTION

Z05_REND3161_13_AIE_M04.indd 5 27/10/16 2:23 PM

M4-6 MODULE 4 • GAME ThEOry

Solving for Q, we get

Q = 9>11 and

1 - Q = 2>11 Thus, 9>11 and 2>11 indicate how often player X will choose strategies X1 and X2, respec-

tively. The expected gains with these probabilities will also be 38>11, or 3.46.

M4.5 Dominance

The principle of dominance can be used to reduce the size of games by eliminating strategies that would never be played. A strategy for a player is said to be dominated if the player can always do as well or better playing another strategy. Any dominated strategy can be eliminated from the game. In other words, a strategy can be eliminated if all its game outcomes are the same as or worse than the corresponding game outcomes of another strategy.

Using the principle of dominance, we reduce the size of the following game:

Y1 Y2

X1 4 3

X2 2 20

X3 1 1

In this game, X3 will never be played because X can always do better by playing X1 or X2. The new game is

Y1 Y2

X1 4 3

X2 2 20

Here is another example:

Y1 Y2 Y3 Y4

X1 -5 4 6 -3

X2 -2 6 2 -20

In this game, Y would never play Y2 and Y3 because Y could always do better playing Y1 or Y4. The new game is

Y1 Y4

X1 -5 -3

X2 -2 -20

Z05_REND3161_13_AIE_M04.indd 6 27/10/16 2:23 PM

SOLVED PrOBLEMS  M4-7

Game theory is the study of how optimal strategies are for- mulated in conflict. Because of the mathematical complexi- ties of game theory, this module is limited to two-person, zero-sum games. A two-person game allows only two people or two groups to be involved in the game. Zero sum means that the sum of the losses for one player must equal the sum of the gains for the other player. The overall sum of the losses and gains for both players, in other words, must be zero.

Depending on the actual payoffs in the game and the size of the game, a number of solution techniques can be used. In a pure strategy game, strategies for the players can be ob- tained without making any calculations. When there is not a pure strategy for both players, it is necessary to use other tech- niques, such as the mixed strategy approach, dominance, and a computer solution for games larger than 2 * 2.

Summary

Dominance A procedure that is used to reduce the size of the game.

Minimax Criterion A criterion that minimizes one’s maxi- mum losses. This is another way of solving a pure strategy game.

Mixed Strategy Game A game in which the optimal strat- egy for both players involves playing more than one strat- egy over time. Each strategy is played a given percentage of the time.

Pure Strategy A situation in which a saddle point exists, causing both players to always play just one strategy.

Saddle Point A situation in which both players are facing pure strategies.

Two-Person Game A game that has only two players. Value of the Game The expected winnings of the game if

the game is played a large number of times. Zero-Sum Game A game in which the losses for one player

equal the gains for the other player.

Glossary

Solved Problems

Solved Problem M4-1 George Massic (player X) faces the following game. Using dominance, reduce the size of the game, if possible.

Y1 Y2

X1 6 5

X2 20 23

X3 15 11

Solution After carefully analyzing the game, George realizes that he will never play strategy X1. The best out- come for this strategy (6) is worse than the worst outcome for the other two strategies. In addition, George would never play strategy X3, for the same reason. Thus, George will always play strategy X2. Given this situation, player Y would always play strategy Y1 to minimize her losses. This is a pure strategy game with George playing X2 and person Y playing strategy Y1. The value of the game for this problem is the outcome of these two strategies, which is 20.

Solved Problem M4-2 Using the solution procedure for a mixed strategy game, solve the following game:

Y1 Y2

X1 4 2

X2 0 10

Z05_REND3161_13_AIE_M04.indd 7 27/10/16 2:23 PM

M4-8  MODULE • GAME ThEOry

Solution This game can be solved by setting up the mixed strategy table and developing the appropriate equations:

Y1 Y2

P 1 - P Expected gain

X1 Q 4 2 4P + 211 − P2 X1 1 - Q 0 10 0P + 1011 − P2 Expected gain 4Q + 011 − Q2 2Q + 1011 − Q2

The equations for Q are

4Q + 011 - Q2 = 2Q + 1011 - Q2 4Q = 2Q + 10 - 10Q

12Q = 10 or Q = 10>12 and 1 - Q = 2>12 The equations for P are

4P + 211 - P2 = 0P + 1011 - P2 4P + 2 - 2P = 10 - 10P

12P = 8 or P = 8>12 and 1 - P = 4>12

Self-Test

●● Before taking the self-test, refer back to the learning objectives at the beginning of the module and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers.

●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. In a two-person, zero-sum game, a. each person has two strategies. b. whatever is gained by one person is lost by the other. c. all payoffs are zero. d. a saddle point always exists.

2. A saddle point exists if a. the largest payoff in a column is also the smallest

payoff in its row. b. the smallest payoff in a column is also the largest

payoff in its row. c. there are only two strategies for each player. d. there is a dominant strategy in the game.

3. If the upper and lower values of the game are the same, a. there is no solution to the game. b. there is a mixed solution to the game. c. a saddle point exists. d. there is a dominated strategy in the game.

4. In a mixed strategy game, a. each player will always play just one strategy. b. there is no saddle point.

c. each player will try to maximize the maximum of all possible payoffs.

d. a player will play each of two strategies exactly 50% of the time.

5. In a two-person, zero-sum game, it is determined that strategy X1 dominates strategy X2. This means a. strategy X1 will never be chosen.

b. the payoffs for strategy X1 will be greater than or equal to the payoffs for X2.

c. a saddle point exists in the game. d. a mixed strategy must be used.

6. In a pure strategy game, a. each player will randomly choose the strategy to be

used. b. each player will always select the same strategy, regardless

of what the other person does. c. there will never be a saddle point. d. the value of the game must be computed using

probabilities. 7. The solution to a mixed strategy game is based on the

assumption that a. each player wishes to maximize the long-run average

payoff. b. both players can be winners with no one experiencing

any loss. c. players act irrationally. d. there is sometimes a better solution than a saddle point

solution.

M4-8 MODULE 4 • GAME ThEOry

Z05_REND3161_13_AIE_M04.indd 8 27/10/16 2:23 PM

DiSCUSSiON QUESTiONS AND PrOBLEMS  M4-9

Discussion Questions and Problems

Discussion Questions M4-1 What is a two-person, zero-sum game? M4-2 How do you compute the value of the game? M4-3 What is a pure strategy? M4-4 Explain the concept of dominance. How is it used? M4-5 How is a saddle point found in a game? M4-6 How do you determine whether a game is a pure

strategy game or a mixed strategy game? M4-7 What is a mixed game, and how is it solved?

Problems M4-8 Determine the strategies for X and Y, given the

following game. What is the value of the game?

Y1 Y2

X1 2 -4 X2 6 10

M4-9 What is the value of the following game and the strategies for A and B?

B1 B2

A1 19 20

A2 5 -4

M4-10 Determine each player’s strategy and the value of the game, given the following table:

Y1 Y2

X1 86 42

X2 36 106

M4-11 What is the value of the following game?

S1 S2

R1 21 116

R2 89 3

M4-12 Player A has a $1 bill and a $20 bill, and player B has a $5 bill and a $10 bill. Each player will select a bill from the other player without knowing what bill the other player selected. If the total of the bills selected is odd, player A gets both of the two bills that were se- lected, but if the total is even, player B gets both bills.

(a) Develop a payoff table for this game. (Place the sum of both bills in each cell.)

(b) What is the best strategy for each player?

(c) What is the value of the game? Which player would you like to be?

M4-13 Resolve Problem M4-12. If the total of the bills is even, player A gets both of the bills selected, but if the total is odd, player B gets both bills.

M4-14 Solve the following game:

Y1 Y2

X1 -5 -10 X2 12 8

X3 4 12

X4 -40 -5

M4-15 Shoe Town and Fancy Foot are both vying for more share of the market. If Shoe Town does no advertising, it will not lose any share of the market if Fancy Foot does nothing. It will lose 2% of the market if Fancy Foot invests $10,000 in advertis- ing, and it will lose 5% of the market if Fancy Foot invests $20,000 in advertising. On the other hand, if Shoe Town invests $15,000 in advertising, it will gain 3% of the market if Fancy Foot does nothing; it will gain 1% of the market if Fancy Foot invests $10,000 in advertising; and it will lose 1% if Fancy Foot invests $20,000 in advertising.

(a) Develop a payoff table for this problem. (b) Determine the various strategies using the

computer. (c) How would you determine the value of the

game?

M4-16 Assume that a 1% increase in the market means a profit of $1,000. Resolve Problem M4-15, using monetary value instead of market share.

M4-17 Solve for the optimal strategies and the value of the following game:

B A

STRATEGY B1

STRATEGY B2

STRATEGY B3

STRATEGY A1 -10 5 15 STRATEGY A2 20 2 -20 STRATEGY A3 6 2 6 STRATEGY A4 -13 -10 44 STRATEGY A5 -30 0 45 STRATEGY A6 16 -20 6

M4-18 For the following two-person, zero-sum game, are there any dominated strategies? If so, eliminate any dominated strategy and find the value of the game.

Note: means the problem may be solved with QM for Windows.

Z05_REND3161_13_AIE_M04.indd 9 27/10/16 2:23 PM

M4-10 MODULE 4 • GAME ThEOry

PLAYER Y’s STRATEGIES

PLAYER X’s

STRATEGIES

Y1 Y2 Y3

X1 4 5 10

X2 3 4 2

X3 8 6 9

M4-19 Refer to Problem M4-18. There is a saddle point in this game, making it a pure strategy game. Ignore this and solve it as a mixed strategy game. What special condition in the solution indicates that this should not have been solved as a mixed strategy game?

M4-20 Petroleum Research, Inc. (A), and Extraction International, Inc. (B), have each developed a new

extraction procedure that will remove metal and other contaminants from used automotive engine oil. The equipment is expensive, and the extraction process is complex, but the approach provides an economical way to recycle used engine oil. Both companies have developed unique technical proce- dures. Both companies also believe that advertising and promotion are critical to their success. Petro- leum Research, with the help of an advertising firm, has developed 15 possible strategies. Extraction International has developed 5 possible advertising strategies. The economic outcome in millions of dollars is shown in the following table. What strat- egy do you recommend for Petroleum Research? How much money can it expect from its approach?

Bibliography

Bierman, H., and L. Fernandez. Game Theory with Economic Applications, 2nd ed. New York: Addison-Wesley, 1998.

Bowen, Kenneth Credson, with contributions by Janet I. Harris. Research Games: An Approach to the Study of Decision Process. New York: Halstead Press, 1978.

Brandenburger, A. and B. Nalebuff. “The Right Game: Use Game Theory to Shape Strategy,” Harvard Business Review (July–August 1995): 57—71.

Bushko, David, and Michael Raynor. “Consulting’s Future, Game Theory, and Sto- rytelling,” Journal of Management Consulting 9, 4 (November 1997): 3–6.

Davis, M. Game Theory: A Nontechnical Introduction. New York: Basic Books, Inc., 1970.

Dixit, A. K., and Susan Skeath. Games of Strategy. New York; W.W. Norton and Co., 1999.

Dutta, Prajit. Strategies and Games: Theory and Practice. Cambridge, MA: MIT Press, 1999.

Fudenberg, D., and D. K. Levine. The Theory of Learning in Games. Cambridge, MA: MIT Press, 1998.

Koselka, Rita. “Playing Poker with Craig McCaw,” Forbes (July 3, 1995): 62–64.

Lucas, W. “An Overview of the Mathematical Theory of Games,” Management Science 8, 5, Part II (January 1972): 3–19.

Luce, R. D., and H. Raiffa. Games and Decisions. New York: John Wiley & Sons, Inc., 1957.

Shubik, M. The Uses and Methods of Game Theory. New York: American Elsevier Publishing Company, 1957.

Sinha, Arunava. “The Value Addition Game,” Business Today (February 7, 1998): 143.

von Neumann, J., and O. Morgenstern. Theory of Games and Economic Behavior. Princeton, NJ: Princeton University Press, 1944.

Yuan, L. L. “Property Acquisition and Negotiation Styles: An Asian Case Study,” Real Estate Finance 15, 1 (1998): 72–78.

B A

STRATEGY B1

STRATEGY B2

STRATEGY B3

STRATEGY B4

STRATEGY B5

STRATEGY A1 1 2 2 1 4

STRATEGY A2 -1 3 -6 7 5 STRATEGY A3 10 -3 -5 -20 12 STRATEGY A4 6 -8 5 2 2 STRATEGY A5 -5 3 3 7 5 STRATEGY A6 -1 -1 -3 4 -2 STRATEGY A7 -1 0 0 0 -1 STRATEGY A8 3 6 -6 8 3 STRATEGY A9 2 6 -5 4 -7 STRATEGY A10 0 0 0 -5 7 STRATEGY A11 4 8 -5 3 3 STRATEGY A12 -3 -3 0 3 3 STRATEGY A13 1 0 0 -2 2 STRATEGY A14 4 3 3 5 7

STRATEGY A15 4 -4 4 -5 5

Z05_REND3161_13_AIE_M04.indd 10 27/10/16 2:23 PM

 M5-1

M5.3 Determine the inverse of a matrix. M5.1 Add, subtract, multiply, and transpose matrices. Use matrices to represent a system of equations.

M5.2 Calculate the determinant, the matrix of cofactors, and adjoint of a matrix.

After completing this module, students will be able to:

Mathematical Tools: Determinants and Matrices

LEARNING OBJECTIVES

5 MODULE

Two new mathematical concepts, matrices and determinants, are introduced in this mod-ule. These tools are especially useful in Chapter 14, which deals with Markov analysis and game theory, but they are also handy computational aids for many other quantitative analysis problems, including linear programming, the topic of Chapters 7 and 8.

≤¢

M5.1 Matrices and Matrix Operations

A matrix is an array of numbers arranged in rows and columns. Matrices, which are usually enclosed in parentheses or brackets, are used as an effective means of presenting or summarizing business data.

The following 2-row by 3-column 12 * 32 matrix, for example, might be used by televi- sion station executives to describe the channel-switching behavior of their 5 o’clock TV news audience:

AUDIENCE SWITCHING PROBABILITIES, NEXT MONTH’S ACTIVITY

CURRENT STATION

CHANNEL 6

CHANNEL 8

STOP VIEWING

CHANNEL 6 0.80 0.15 0.05

CHANNEL 8 0.20 0.70 0.10

2 * 3 matrix

Z06_REND3161_13_AIE_M05.indd 1 28/10/16 11:36 AM

M5-2  MODULE 5 • MAThEMATiCAL TOOLs: DETErMinAnTs AnD MATriCEs

The number in the first row and first column indicates that there is a 0.80 probability that someone currently watching the Channel 6 news will continue to do so next month. Similarly, 15% of Channel 6’s viewers are expected to switch to Channel 8 next month (row 1, column 2), 5% will not be watching the 5 o’clock news at all (row 1, column 3), and so on for the second row.

The remainder of this module deals with the numerous mathematical operations that can be performed on matrices. These include adding, subtracting, and multiplying matrices; transpos- ing a matrix; finding a matrix’s determinant, cofactors, and adjoint; and finding the inverse of a matrix.

Matrix Addition and Subtraction Matrix addition and subtraction are the easiest operations. Matrices of the same dimensions— that is, the same number of rows and columns—can be added or subtracted by adding or sub- tracting the numbers in the same row and column of each matrix. Here are two small matrices:

Matrix A = a5 7 2 1

b

Matrix B = a3 6 3 8

b

To find the sum of these 2 * 2 matrices, we add corresponding elements to create a new matrix:

Matrix C = Matrix A + Matrix B

= a5 7 2 1

b + a3 6 3 8

b = a8 13 5 9

b

+ =

To subtract matrix B from matrix A, we simply subtract the corresponding elements in each position:

Matrix C = Matrix A - Matrix B

+ =

= a5 7 2 1

b - a3 6 3 8

b = a 2 1 -1 -7

b

Matrix Multiplication Matrix multiplication is an operation that can take place only if the number of columns in the first matrix equals the number of rows in the second matrix. Thus, matrices of the dimensions in the following table can be multiplied:

MATRIX A SIZE MATRIX B SIZE SIZE OF A : B RESULTING

3 * 3 3 * 3 3 * 3 3 * 1 1 * 3 3 * 3 3 * 1 1 * 1 3 * 1 2 * 4 4 * 3 2 * 3 6 * 9 9 * 2 6 * 2 8 * 3 3 * 6 8 * 6

We also note, in the far right column in the table, that the outer two numbers in the matrix sizes determine the dimensions of the new matrix. That is, if an 8-row by 3-column matrix is multiplied by a 3-row by 6-column matrix, the resultant product will be an 8-row by 6-column matrix.

Matrices of the dimensions in the following table may not be multiplied:

Adding and subtracting numbers.

Z06_REND3161_13_AIE_M05.indd 2 28/10/16 11:36 AM

M5.1 MATriCEs AnD MATrix OpErATiOns  M5-3

MATRIX A SIZE MATRIX B SIZE

3 * 4 3 * 3 1 * 2 1 * 2 6 * 9 8 * 9 2 * 2 3 * 3

To perform the multiplication process, we take each row of the first matrix and multiply its elements times the numbers in each column of the second matrix. Hence, the number in the first row and first column of the new matrix is derived from the product of the first row of the first matrix times the first column of the second matrix. Similarly, the number in the first row and second column of the new matrix is the product of the first row of the first matrix times the second column of the second matrix. This concept is not nearly as confusing as it may sound.

Let us begin by computing the value of matrix C, which is the product of matrix A times matrix B:

Matrix A = £52 3

≥ Matrix B = 14 62 This is a legitimate task, since matrix A is 3 * 1 and matrix B is 1 * 2. The product, matrix C,

will have 3 rows and 2 columns 13 * 22. Symbolically, the operation is Matrix A * Matrix B = Matrix C, or AB = C:

£ab c

≥ * 1d e2 = £ad aebd be cd ce

≥ (M5-1) Using the actual numbers, we have£52

3

≥ * 14 62 = £20 308 12 12 18

≥ = Matrix C As a second example, let matrix R be (6 2 5) and matrix S be£31

2

≥ Then the product, Matrix T = Matrix R * Matrix S, will be of dimension 1 * 1 because

we are multiplying a 1 * 3 matrix by a 3 * 1 matrix:

Matrix R * Matrix S = Matrix T 11 * 32 13 * 12 11 * 12

1a b c2 * £de f

≥ = 1ad + be + cf 2 16 2 52 * £31

2

≥ = 3162132 + 122112 + 1521224 = 1302

Multiplying numbers.

Z06_REND3161_13_AIE_M05.indd 3 28/10/16 11:36 AM

M5-4  MODULE 5 • MAThEMATiCAL TOOLs: DETErMinAnTs AnD MATriCEs

To multiply larger matrices, we combine the approaches of the preceding examples:

Matrix U = a6 2 7 1

b Matrix V = a3 4 5 8

b

Matrix U * Matrix V = Matrix Y

12 * 22 * 12 * 22 12 * 22

aa b c d

b * ae f g h

b = aae + bg af + bh ce + dg cf + dh

b

a6 2 7 1

b * a3 4 5 8

b = a18 + 10 24 + 16 21 + 5 28 + 8

b

= a28 40 26 36

b

(M5-2)

To introduce a special type of matrix, called the identity matrix, let’s try a final multiplica- tion example:

Matrix H = a4 7 2 3

b Matrix I = a1 0 0 1

b Matrix H * Matrix I = Matrix J

a4 7 2 3

b * a1 0 0 1

b = a4 + 0 0 + 7 2 + 0 0 + 3

b

= a4 7 2 3

b

Matrix I is called an identity matrix. An identity matrix has 1s on its primary diagonal and 0s in all other positions. When multiplied by any matrix of the same square dimensions, it yields the original matrix, so in this case, Matrix J = Matrix H.

Matrix multiplication can also be useful in performing business computations. For example, Blank Plumbing and Heating is about to bid on three contract jobs: to install plumbing fixtures in a new university dormitory, an office building, and an apartment complex. The number of toi- lets, sinks, and bathtubs needed at each project is summarized in matrix notation as follows. The cost per plumbing fixture is also given. Matrix multiplication can be used to provide an estimate of the total cost of fixtures at each job.

PROJECT DEMAND COST/UNIT

TOILETS SINKS BATHTUBS

Dormitory 5 10 2 Toilet $40

Office 20 20 0 Sink 25

Apartments 15 30 15 Bathtub 50

Job demand matrix * Fixture cost matrix = Job cost matrix

13 * 32 13 * 12 13 * 12£ 5 10 220 20 0 15 30 15

≥ * £$40$25 $50

≥ = £$200 + 250 + 100$800 + 500 + 0 $600 + 750 + 750

≥ = £ $550$1,300 $2,100

≥ Hence, Blank Plumbing can expect to spend $550 on fixtures at the dormitory project,

$1,300 at the office building, and $2,100 at the apartment complex.

The identity matrix.

An example.

£ ≥

Z06_REND3161_13_AIE_M05.indd 4 28/10/16 11:36 AM

M5.2 DETErMinAnTs, COfACTOrs, AnD ADjOinTs  M5-5

Matrix Notation for Systems of Equations The use of matrices is helpful in representing a system of equations. For example, the system

2X1 + 3X2 = 24 4X1 + 2X2 = 36

can be written as

a2 3 4 2

baX1 X2

b = a24 36

b

In general, we can express a system of equations as

AX = B

Matrix Transpose The transpose of a matrix is a means of presenting data in a different form. To create the trans- pose of a given matrix, we simply interchange the rows with the columns. Hence, the first row of a matrix becomes its first column, the second row becomes its second column, and so on.

Two matrices are transposed here:

Matrix A = £5 2 63 0 9 1 4 8

≥ Transpose of matrix A = £5 3 12 0 4

6 9 8

≥ Matrix B = a2 7 0 3

8 5 6 4 b

Transpose of matrix B = §2 87 5 0 6

3 4

¥ M5.2 Determinants, Cofactors, and Adjoints

There are other important concepts related to matrices. These include the determinant, cofactor, and adjoint of a matrix.

Determinants A determinant is a value associated with a square matrix. As a mathematical tool, determinants are of value in helping to solve a series of simultaneous equations.

A 2-row by 2-column 12 * 22 determinant can be expressed by enclosing vertical lines around the matrix, as shown here:

` a b c d

`

Z06_REND3161_13_AIE_M05.indd 5 28/10/16 11:36 AM

M5-6  MODULE 5 • MAThEMATiCAL TOOLs: DETErMinAnTs AnD MATriCEs

Similarly, a 3 * 3 determinant is indicated as3 a b cd e f g h i

3 One common procedure for finding the determinant of a 2 * 2 or 3 * 3 matrix is to draw

its primary and secondary diagonals. In the case of a 2 * 2 determinant, the value is found by multiplying the numbers on the primary diagonal and subtracting from that product the product of the numbers on the secondary diagonal:

Value = 1a21d2 - 1c21b2

Primary diagonal ` a b c d

` Secondary diagonal

For a 3 * 3 matrix, we redraw the first two columns to help visualize all diagonals and fol- low a similar procedure:

Primary diagonal 3 a b cd e f g h i

3 a bd e g h

3 Secondary diagonal Value = C1st primary diagonal product 1aei2 +2nd primary diagonal product 1bfg2 +

3rd primary diagonal product 1cdh2 S

- C1st secondary diagonal product 1gec2 +2nd secondary diagonal product 1hfa2 + 3rd secondary diagonal product 1idb2

S = aei + bfg + cdh - gec - hfa - idb

Let’s use this approach to find the numerical values of the following 2 * 2 and 3 * 3 determinants:

1a2 ` 2 5 1 8

` 1b2 3 3 1 22 5 1 4 -2 -1

3 1a2 ` 2 5

1 8 ` Value = 122182 - 112152 = 11

1b2 3 3 1 22 5 1 4 -2 -1

3 3 12 5 4 -2

3 Value = 1321521-12 + 112112142 + 1221221-22

- 142152122 - 1-22112132 - 1-12122112 = -15 + 4 - 8 - 40 + 6 + 2 = -51

A set of simultaneous equations can be solved through the use of determinants by setting up a ratio of two special determinants for each unknown variable. This fairly easy procedure is best illustrated with an example.

Given the three simultaneous equations

2X + 3Y + 1Z = 10 4X - 1Y - 2Z = 8 5X + 2Y - 3Z = 6

Z06_REND3161_13_AIE_M05.indd 6 28/10/16 11:36 AM

M5.2 DETErMinAnTs, COfACTOrs, AnD ADjOinTs  M5-7

we can structure determinants to help solve for unknown quantities X, Y, and Z:

X

Y

Z

5

2 2 2

2 2 2

5

2 2

2 2 2

5

10 3 1 8 1 2 6 2 3 2 3 1 4 1 2 5 2 3

2 10 1 4 8 2 5 6 3 2 3 1 4 1 2 5 2 3

Coe�cients for right-hand side Coe�cients for Y Coe�cients for Z Numerator determinant, in which column with Xs is replaced by column of numbers to the right-hand side of the equal sign

Denominator determinant, in which coe�cients of all unknown variables are listed (all columns to the left of the equal sign) Coe�cients for Coe�cients for Coe�cients for

Numerator determinant, in which column with s is replaced by right-hand side numbers

Denominator determinant stays the same, regardless of which variable we are solving for

.

Z Y X

Y

22 3 10 4 1 8 5 2 6 2 3 1 4 1 2 5 2 3

2

2 2 2

Numerator determinant, in which column with s is replaced by right-hand side numbers

Denominator determinant, again the same as when solving for and

Z

X Y

Determining the values of X, Y, and Z now involves finding the numerical values of the four separate determinants using the method shown earlier in this module:

X = Numerical value of numerator determinant

Numerical value of denominator determinant

= 128

33 = 3.88

Y = -20 33

= -0.61

Z = 134

33 = 4.06

To verify that X = 3.88, Y = -0.61, and Z = 4.06, we may choose any one of the original three simultaneous equations and insert these numbers. For example,

2X + 3Y + 1Z = 10 213.882 + 31-0.612 + 114.062 = 7.76 - 1.83 + 4.06

= 10

Matrix of Cofactors and Adjoint Two more useful concepts in the mathematics of matrices are the matrix of cofactors and the adjoint of a matrix. A cofactor is defined as the set of numbers that remains after a given row and column have been taken out of a matrix. An adjoint is simply the transpose of the matrix of cofactors. The real value of the two concepts lies in their usefulness in forming the inverse of a matrix—something that we investigate in the next section.

Z06_REND3161_13_AIE_M05.indd 7 28/10/16 11:36 AM

M5-8  MODULE 5 • MAThEMATiCAL TOOLs: DETErMinAnTs AnD MATriCEs

To compute the matrix of cofactors for a particular matrix, we follow six steps:

Six Steps in Computing a Matrix of Cofactors

1. Select an element in the original matrix. 2. Draw a line through the row and column of the element selected. The numbers uncovered

represent the cofactor for that element. 3. Calculate the value of the determinant of the cofactor. 4. Add together the location numbers of the row and column crossed out in step 2. If the sum

is even, the sign of the determinant’s value (from step 3) does not change. If the sum is an odd number, change the sign of the determinant’s value.

5. The number just computed becomes an entry in the matrix of cofactors; it is located in the same position as the element selected in step 1.

6. Return to step 1 and continue until all elements in the original matrix have been replaced by their cofactor values.

Let’s compute the matrix of cofactors, and then the adjoint, for the following matrix, using Table M5.1 to help in the calculations:

Original matrix = £3 7 52 0 3 4 1 8

≥ Matrix of cofactors = £ -3 -4 2-51 4 25

21 1 -14 ≥

Adjoint of the matrix = £ -3 -51 21-4 4 1 2 25 -14

≥ (from Table M5.1)

ELEMENT REMOVED COFACTORS

DETERMINANT OF COFACTORS

VALUE OF COFACTOR

Row 1, column 1 a0 3 1 8

b ` 0 3 1 8

` = -3 -3 (sign not changed)

Row 1, column 2 a2 3 4 8

b ` 2 3 4 8

` = 4 -4 (sign changed)

Row 1, column 3 a2 0 4 1

b ` 2 0 4 1

` = 2 2 (sign not changed)

Row 2, column 1 a7 5 1 8

b ` 7 5 1 8

` = 51 -51 (sign changed)

Row 2, column 2 a3 5 4 8

b ` 3 5 4 8

` = 4 4 (sign not changed)

Row 2, column 3 a3 7 4 1

b ` 3 7 4 1

` = -25 25 (sign changed)

Row 3, column 1 a7 5 0 3

b ` 7 5 0 3

` = 21 21 (sign not changed)

Row 3, column 2 a3 5 2 3

b ` 3 5 2 3

` = -1 1 (sign changed)

Row 3, column 3 a3 7 2 0

b ` 3 7 2 0

` = -14 -14 (sign not changed)

TABLE M5.1 Matrix of Cofactor Calculations

Z06_REND3161_13_AIE_M05.indd 8 28/10/16 11:36 AM

M5.3 finDing ThE invErsE Of A MATrix  M5-9

M5.3 Finding the Inverse of a Matrix

The inverse of a matrix is a unique matrix of the same dimensions that, when multiplied by the original matrix, produces a unit or identity matrix. For example, if A is any 2 * 2 matrix and its inverse is denoted A-1, then

A * A-1 = a1 0 0 1

b = Identity matrix (M5-3)

The adjoint of a matrix is extremely helpful in forming the inverse of the original matrix. We simply compute the value of the determinant of the original matrix and divide each term of the adjoint by this value.

To find the inverse of the matrix just presented, we need to know the adjoint (already com- puted) and the value of the determinant of the original matrix:£3 7 52 0 3

4 1 8

≥ = Original matrix Value of determinant:

3 3 7 52 0 3 4 1 8

3 3 72 0 4 1

Value = 0 + 84 + 10 - 0 - 9 - 112 = -27

The inverse is found by dividing each element in the adjoint by -27:

Inverse = £ -3�-27 -51�-27 21�-27-4�-27 4�-27 1�-27 2�-27 25�-27 -14�-27

≥ = £ 3�27 51�27 -21�274�27 -4�27 -1�27

-2�27 -25�27 14�27

≥ We can verify that this is indeed the correct inverse of the original matrix by multiplying the original matrix by the inverse:

Original Identity

matrix * Inverse = matrix£3 7 52 0 3 4 1 8

≥ * £ 3�27 51�27 -21�274�27 -4�27 -1�27 -2�27 -25�27 14�27

≥ = £1 0 00 1 0 0 0 1

≥ If this process is applied to a 2 * 2 matrix, the inverse is easily found, as shown with the fol- lowing matrix.

Original matrix = aa b c d

b Determinant value of original matrix = ad - cb

Matrix of cofactors = a d -c -b a

b

Adjoint of the matrix = a d -b -c a

b

Determining the value of the determinant.

Z06_REND3161_13_AIE_M05.indd 9 28/10/16 11:36 AM

M5-10  ChApTEr 5 • MAThEMATiCAL TOOLs: DETErMinAnTs AnD MATriCEs

Since the inverse of the matrix is equal to the adjoint divided by the determinant, we have

aa b c d

b -1

= § dad - cb -bad - cb -c

ad - cb a

ad - cb

¥ (M5-4) For example, if

Original matrix = a1 2 3 8

b

Determinant value = 1182 - 3122 = 2 then

Inverse = a1 2 3 8

b -1

= a 8>2 -2>2 -3>2 1>2b = a

4 -1 -1.5 0.5

b

This module contains a brief presentation of matrices and common operations associated with matrices. The discussion includes matrix addition, subtraction, and multiplication. We demonstrate how to represent a system of equations with ma- trix notation. This is used with the linear programming simplex

algorithm in Module 7. We show how determinants are used in finding the inverse of a matrix and solving a series of si- multaneous equations. Interchanging the rows and columns of a matrix results in the transpose of that matrix. Cofactors and adjoints are used to develop the inverse of a matrix.

Summary

Glossary

Adjoint The transpose of a matrix of cofactors. Determinant A unique numerical value associated with a

square matrix. Identity Matrix A square matrix with 1s on its diagonal and

0s in all other positions. Inverse A unique matrix that can be multiplied by the origi-

nal matrix to create an identity matrix.

Matrix An array of numbers that can be used to present or summarize business data.

Matrix of Cofactors The determinants of the numbers remaining in a matrix after a given row and column have been removed.

Simultaneous Equations A series of equations that must be solved at the same time.

Transpose The interchange of rows and columns in a matrix.

Key Equations

(M5-1) £ab c

≥ * 1d e2 = £ad aebd be cd ce

≥ Multiplying matrices.

(M5-2) aa b c d

b * ae f g h

b = aae + bg af + bh ce + dg cf + dh

b

Multiplying 2 * 2 matrices.

(M5-3) A * A-1 = a1 0 0 1

b

The identity matrix.

(M5-4) aa b c d

b -1

= § dad - cb -bad - cb -c

ad - cb a

ad - cb

¥ The inverse of a 2 * 2 matrix.

Z06_REND3161_13_AIE_M05.indd 10 28/10/16 11:36 AM

DisCUssiOn QUEsTiOns AnD prOBLEMs  M5-11

Self-Test

●● Before taking the self-test, refer back to the learning objectives at the beginning of the module and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. The value of the determinant ` 1 2 3 4

` is

a. 2. d. -5. b. 10. e. 14. c. -2.

2. To add two matrices, a. the first matrix must have the same number of rows

and columns as the second matrix. b. the number of rows in the second matrix must equal

the number of columns in the first matrix. c. the number of columns in the second matrix must

equal the number of rows in the first matrix. d. both matrices must be square matrices.

3. In a 2 * 2 matrix, the determinant value is a. equal to the sum of all the values in the matrix. b. found by multiplying the numbers on the primary

diagonal and subtracting from that the product of the numbers on the secondary diagonal.

c. found by turning each row of the matrix into a column. d. always equal to 4.

4. If matrix A is a 2 * 3 matrix, it can be multiplied by matrix B to obtain matrix AB only if matrix B has a. 2 rows. c. 3 rows. b. 2 columns. d. 3 columns.

5. If matrix A is a 3 * 4 matrix, the transpose of matrix A will be a a. 3 * 4 matrix. c. 3 * 3 matrix. b. 4 * 3 matrix. d. 4 * 4 matrix.

6. When a matrix is multiplied by an identity matrix, the result will be a. the original matrix. b. an identity matrix. c. the inverse of the original matrix. d. the transpose of the original matrix.

7. An identity matrix a. has 1s on its diagonal. b. has 0s in all positions not on a diagonal. c. can be multiplied by any matrix of the same

dimensions. d. is square in size. e. all of the above.

8. When the inverse of a matrix is multiplied by the original matrix, it produces a. the matrix of cofactors. b. the adjoint of the matrix. c. the transpose. d. the identity matrix. e. none of the above.

Discussion Questions and Problems

Discussion Questions M5-1 List some of the ways that matrices are used. M5-2 Explain how to calculate the determinant of a matrix. M5-3 What are some of the uses of determinants? M5-4 Explain how to develop a matrix of cofactors. M5-5 What is the adjoint of a matrix? M5-6 How is the adjoint used in finding the inverse of a

matrix?

Problems M5-7 Find the numerical values of the following

determinants.

(a) ` 6 2 -5 2

`

(b) 3 3 7 -61 -1 2 4 3 -2

3

M5-8 Use determinants to solve the following set of simul- taneous equations:

5X + 2Y + 3Z = 4 2X + 3Y + 1Z = 2 3X + 1Y + 2Z = 3

M5-9 Use matrices to write the system of equations in Problem M5-8.

M5-10 Perform the following operations. (a) Add matrix A to matrix B. (b) Subtract matrix A from matrix B. (c) Add matrix C to matrix D. (d) Add matrix C to matrix A.

Matrix A = a2 4 1 3 8 7

b Matrix C = £3 6 97 8 1 9 2 4

≥ Matrix B = a7 6 5

0 1 2 b Matrix D = £5 1 64 0 6

3 1 5

≥ Z06_REND3161_13_AIE_M05.indd 11 28/10/16 11:36 AM

M5-12  ChApTEr 5 • MAThEMATiCAL TOOLs: DETErMinAnTs AnD MATriCEs

M5-11 Using the matrices in Problem M5-10, determine which of the following operations are possible. If the operation is possible, give the size of the resulting matrix.

(a) B * C (b) C * B (c) A * B (d) C * D (e) D * C

M5-12 Perform the following matrix multiplications.

(a) Matrix C = Matrix A * Matrix B (b) Matrix G = Matrix E * Matrix F (c) Matrix T = Matrix R * Matrix S (d) Matrix Z = Matrix W * Matrix Y

Matrix A = a2 1 b Matrix B = 13 4 52

Matrix E = 15 2 6 12 Matrix F = §43 2

0

¥ Matrix R = a2 3

1 4 b Matrix S = a1 0

0 1 b

Matrix W = £3 52 1 4 4

≥ Matrix Y = a1 4 5 1 2 3 6 5

b

M5-13 RLB Electrical Contracting, Inc., bids on the same three jobs as Blank Plumbing (see Section M5.2). RLB must supply wiring, conduits, electrical wall fixtures, and lighting fixtures. The following are needed supplies and their costs per unit:

DEMAND

Project Wiring (Rolls) Conduits

Wall Fixtures

Lighting Fixtures

Dormitory 50 100 10 20

Office 70 80 20 30

Apartments 20 50 30 10

Item Cost/Unit ($)

Wiring 1.00

Conduits 2.00

Wall fixtures 3.00

Lighting fixtures 5.00

Use matrix multiplication to compute the cost of materials at each job site.

M5-14 Transpose matrices R and S:

Matrix R = §6 8 2 21 0 5 7 6 4 3 1

3 1 2 7

¥ Matrix S = £3 12 2

5 4

≥ M5-15 Find the matrix of cofactors and adjoint of the fol-

lowing matrix:£1 4 72 0 8 3 6 9

≥ M5-16 Find the inverse of the original matrix of Problem

M5-15 and verify its correctness. M5-17 Write the following as a system of equations:

a5 1 4 2

baX1 X2

b = a240 320

b

M5-18 Write the following as a system of equations:

a0 4 3 1 2 2

b £X1X2 X3

≥ = a28 16

b

Bibliography

Barnett, Raymond, Michael Ziegler, and Karl Byleen. College Mathematics for Business, Economics, Life Sciences, and Social Sciences, 13e, Pear- son, 2015.

Haeussler, Ernest, Richard Paul, and Richard Wood, Introductory Mathemati- cal Analysis for Business, Economics and the Life and Social Sciences, 13e, Pearson, 2011.

Z06_REND3161_13_AIE_M05.indd 12 28/10/16 11:36 AM

AppEnDix M5.1: Using ExCEL fOr MATrix CALCULATiOns  M5-13

Appendix M5.1: Using Excel for Matrix Calculations

Three Excel functions are helpful with matrices: MMULT for matrix multiplication, MIN- VERSE for finding the inverse of the matrix, and MDETERM for finding the determinant of a matrix.

To multiply matrices in Excel, use MMULT as follows:

1. Highlight all the cells that will contain the resulting matrix. 2. Type = MMULT(matrix1, matrix2), where matrix1 and matrix2 are the cell ranges for the

two matrices being multiplied. 3. Instead of just pressing Enter, press Ctrl+Shift+Enter.

Pressing Ctrl+Shift+Enter simultaneously indicates that a matrix operation is being performed, so all cells in the matrix are changed accordingly. Program M5.1A provides an example of this in cells F9:G10. The output is shown in Program M5.1B.

The MINVERSE function is illustrated in cells F14:G15 of Program M5.1A. Remember that the entire range of the matrix (F14:G15) must be highlighted before entering the MINVERSE function. Pressing Ctrl+Shift+Enter provides the final result shown in Program M5.1B.

The MDETERM function is used to find the determinant of a matrix. This is illustrated in cell F19 of Program M5.1A. The numerical result is shown in Program M5.1B.

PROGRAM M5.1B Excel Output for Matrix Operations

PROGRAM M5.1A Excel formulas for Matrix Operations

Z06_REND3161_13_AIE_M05.indd 13 28/10/16 11:36 AM

 M6-1

M6.5 Use derivatives to maximize total revenue and other functions.

M6.1 Find the slope of a straight line.

M6.2 Find the slope of a curve at any point.

M6.3 Find derivatives for several common types of functions.

M6.4 Find the maximum and minimum points on curves.

After completing this module, students will be able to:

Calculus-Based Optimization

LEARNING OBJECTIVES

6 MODULE

A lthough most of the quantitative techniques presented in this book are based on algebra, there are many situations in which calculus and derivatives are helpful in finding the best solution to a business problem. In this module, we begin by reviewing the slope of a line, as this is important in understanding the derivative of a function. Then we explain what a deriva- tive is and how it is used.

M6.1 Slope of a Straight Line

Recall that the equation of a line can be written as

Y = a + bX (M6-1)

where b is the slope of the line. If we are given any two points 1X1, Y12 and 1X2, Y22, that are on a line, the slope is

b = Change in Y

Change in X =

∆Y ∆X

= Y2 - Y1 X2 - X1

(M6-2)

where ∆ (delta) is used to represent “change in.” For example, the slope of the line that passes through the points (2,3) and (4,7) is

b = ∆Y ∆X

= 7 - 3 4 - 2

= 4

2 = 2

The equation of a straight line is Y = a + bX.

The slope of the line is the change in Y over the change in X.

Z07_REND3161_13_AIE_M06.indd 1 27/10/16 2:22 PM

M6-2  MODULE 6 • CALCULUS-BASED OPTIMIZATION

We can find the intercept, a, by using this slope and either point in the equation for a line. For this example, if we select the point (2,3), we have

Y = a + bX

3 = a + 2122 a = -1

The equation of this line is then

Y = -1 + 2X

This is illustrated in Figure M6.1. Notice that the slope of this line (and any other straight line) is constant. We can pick any two points on the line and compute the slope using Equation M6-2. For a nonlinear equation, the slope is not constant, as we explain in the next section.

M6.2 Slope of a Nonlinear Function

Figure M6.2 provides a graph of the function

Y = X2 - 4X + 6

Notice that this is not a straight line. To determine the slope of a curve at any point, we find the slope of a line tangent to the curve at this point. For example, if we wish to find the slope of the line when X = 3, we find a line that is tangent at that point. To find the slope of a line, we use Equation M6-2, which requires us to have two points. We want the slope at X = 3, so we let X1 = 3 and we find

Y1 = 1322 - 4132 + 6 = 3 Thus, one point will be (3,3). We wish to find another point close to this, so we will choose a value of X2 close to X1 = 3. If we pick X2 = 5 for the other point (an arbitrary choice used sim- ply to illustrate this process), we find

Y2 = 1522 - 4152 + 6 = 11 This other point is (5,11).

The slope of the line between these two points is

b = ∆Y ∆X

= 11 - 3 5 - 3

= 8

2 = 4

Y = –1 + 2X

Y

X

DY = 7 – 3 = 4

DX = 4 – 2 = 2

20

2

–2

4

–4

6

8

10

12

14

–2 4 6 8

(2,3)

(4,7)

FIGURE M6.1 Graph of Straight Line

If a curve is nonlinear, we can find the slope at any point by finding the slope of a tangent line at that point.

Z07_REND3161_13_AIE_M06.indd 2 27/10/16 2:22 PM

M6.2 SLOPE OF A NONLINEAr FUNCTION  M6-3

To get a better estimate of the slope where X1 = 3, we choose a value of X2 even closer to X1 = 3. Taking the point (3,3) with the point (4,6), we have

b = ∆Y ∆X

= 6 - 3 4 - 3

= 3

1 = 3

Neither of these slopes would be exactly the same as the slope of the line tangent to this curve at the point (3,3), as shown in Figure M6.3. However, we see that they each give us an estimate of the slope of a tangent line. If we keep selecting points closer and closer to the point where X = 3, we find slopes that are closer to the value we are trying to find.

To get a point very close to (3,3), we will use a value, ∆X, and add this to X = 3 to get the second point. As we let ∆X get smaller, we find a point 1X + ∆X, Y22 closer to the original point (3,3). From the original equation,

Y = X2 - 4X + 6

we have

Y1 = 32 - 4132 + 6 = 3

Y = X 2 – 4X + 6

–2 0 2 4 6

12

10

8

6

4

2

Y

X

4 6 82–2 0

5

–5

–10

–15

10

15

20

Tangent line at (3,3)

Line through (3,3) and (4,6)

Line through (3,3) and (5,11)

Y = X 2 – 4X + 6

X

Y

FIGURE M6.2 Graph of Quadratic Function

FIGURE M6.3 Graph of Tangent Line and Other Lines Connecting Points

Z07_REND3161_13_AIE_M06.indd 3 27/10/16 2:22 PM

M6-4  MODULE 6 • CALCULUS-BASED OPTIMIZATION

and

Y2 = 13 + ∆X22 - 413 + ∆X2 + 6 = 19 + 6∆X + ∆X22 - 12 - 4∆X + 6 = ∆X2 + 2∆X + 3

Thus,

∆Y = Y2 - Y1 = 1∆X2 + 2∆X + 32 - 3 = ∆X2 + 2∆X The slope is then

b = ∆Y ∆X

= ∆X2 + 2∆X

∆X =

∆X1∆X + 22 ∆X

= ∆X + 2

As ∆X gets smaller, the value of ∆Y>∆X approaches the slope of the tangent line. The value of the slope (b) in this example will approach 2. This is called the limit as ∆X approaches zero and is written as

lim ∆XS0

1∆X + 22 = 2

It is obvious that at other points on the curve, the tangent line would have a different slope, as Y and ∆Y would not be the values given here.

To find a general expression for the slope of the tangent line at any point on a curve, we can repeat this process for a general point X. Let X1 = X and X2 = X + ∆X, and let Y1 and Y2 rep- resent the corresponding values for Y. For an equation of the form

Y = aX2 + bX + c

we let

Y1 = aX2 + bX + c

and

Y2 = a1X + ∆X22 + b1X + ∆X2 + c

Expanding these expressions and simplifying, we find

∆Y = Y2 - Y1 = b1∆X2 + 2aX1∆X2 + c1∆X22 Then

∆Y ∆X

= b1∆X2 + 2aX1∆X2 + c1∆X22

∆X =

∆X1b + 2aX + c∆X2 ∆X

= b + 2aX + c∆X

Taking the limit as ∆X approaches zero, we have

lim ∆XS0

1b + 2aX + c∆X2 = b + 2aX

This is the slope of the function at the point X, and it is called the derivative of Y. It is denoted as Y′ or dY>dX. The definition of a derivative is

Y′ = dY

dX = lim

∆XS0 e ∆Y

∆X f (M6-3)

Fortunately, we will be using some common derivatives that are easy to remember, and it is not necessary to go through this process of finding the limit every time we wish to find a derivative.

The limit as ∆X approaches 0 is used to find the slope of a tangent line.

The derivative of a function is used to find the slope of the curve at a particular point.

Z07_REND3161_13_AIE_M06.indd 4 27/10/16 2:22 PM

M6.3 SOME COMMON DErIvATIvES  M6-5

M6.3 Some Common Derivatives

Although derivatives exist for a number of different functional forms, we restrict our discus- sion to the six most common ones. The references at the end of this module provide additional information on derivatives. Table M6.1 gives a summary of the common derivatives. We provide examples of each of these.

1. If Y = c, then Y′ = 0 (M6-4)

c = constant

For example, if Y = 4, then Y′ = 0. The graph of Y is a horizontal line, so the change in Y is zero, regardless of the value of X.

2. If Y = Xn, then Y′ = nXn - 1 (M6-5)

For example,

if Y = X2, then Y′ = 2X2 - 1 = 2X

if Y = X3, then Y′ = 3X3 - 1 = 3X2

if Y = X9, then Y′ = 9X9 - 1 = 9X8

3. If Y = cXn, then Y′ = cnXn - 1 (M6-6)

The derivative of a constant is 0.

FUNCTION DERIVATIVE

Y = C Y′ = 0

Y = Xn Y′ = nXn - 1

Y = cXn Y′ = cnXn - 1

Y = 1

Xn Y′ =

-n Xn + 1

Y = g1x2 + h1x2 Y′ = g′1x2 + h′1x2 Y = g1x2 - h1x2 Y′ = g′1x2 - h′1x2

TABLE M6.1 Some Common Derivatives

For example,

if Y = 4X3, then Y′ = 4132X3 - 1 = 12X2

if Y = 2X4, then Y′ = 2142X4 - 1 = 8X3

4. If Y = 1

xn , then Y′ = -nX-n - 1 =

-n Xn + 1

(M6-7)

Note that Y = 1

Xn is the same as Y = X-n. For example,

if Y = 1

X3 1or Y = X-32, then Y′ = -3X-3 - 1 = -3X-4 = -3

X4

if Y = 2

X4 , then Y′ = 21-42X-4 - 1 = -8

X5

Z07_REND3161_13_AIE_M06.indd 5 27/10/16 2:22 PM

M6-6  MODULE 6 • CALCULUS-BASED OPTIMIZATION

5. If Y = g1x2 + h1x2, then Y′ = g′1x2 + h′1x2 (M6-8) For example,

if Y = 2X3 + X2, then Y′ = 2132X3 - 1 + 2X2 - 1 = 6X2 + 2X if Y = 5X4 + 3X2, then Y′ = 5142X4 - 1 + 3122X2 - 1 = 20X3 + 6X 6. If Y = g1x2 - h1x2, then Y′ = g′1x2 - h′1x2 (M6-9)

For example,

if Y = 5X3 - X2, then Y′ = 5132X3 - 1 - 2X2 - 1 = 15X2 - 2X if Y = 2X4 - 4X2, then Y′ = 2142X4 - 1 - 4122X2 - 1 = 8X3 - 8X

Second Derivatives The second derivative of a function is the derivative of the first derivative. This is denoted as Y″ or d2Y>dX2. For example, if

Y = 6X4 + 4X3

then the first derivative is

Y′ = dY

dX = 6142X4 - 1 + 4132X3 - 1

= 24X3 + 12X2

and

Y″ = d2Y

dX2 = 24132X3 - 1 + 12122X2 - 1

= 72X2 + 24X

The second derivative tells us about the slope of the first derivative, and it is used in finding the maximum and minimum of a function. We use this in the next section.

M6.4 Maximum and Minimum

In using quantitative techniques in business, we often try to maximize profit or minimize cost. If a profit function or cost function can be developed, taking a derivative may help us to find the optimum solution. In dealing with nonlinear functions, we often look at local optimums, which represent the maximums or minimums within a small range of X.

Figure M6.4 illustrates a curve where point A is a local maximum (it is higher than the points around it), and point B is a local minimum (it is lower than the points around it); how- ever, there is no global maximum or minimum, as the curve continues to increase without bound

If a function is the sum or difference of two functions, the derivative is the sum or difference of the individual derivatives of those two functions.

The second derivative is the derivative of the first derivative.

4 6 10800 2

Y = X 3 – 4X 2 + 12X + 313A

B

X

YFIGURE M6.4 Graph of Curve with Local Maximum and Local Minimum

A local maximum (or minimum) is the highest (or lowest) point in a neighborhood around that point.

Z07_REND3161_13_AIE_M06.indd 6 27/10/16 2:22 PM

M6.4 MAxIMUM AND MINIMUM  M6-7

as X increases, and to decrease without bound as X decreases. If we place limits on the maximum and minimum values for X, then the endpoints can be checked to see if they are higher than any local maximum or lower than any local minimum.

To find a local optimum, we take the derivative of the function and set it equal to zero. Remember that the derivative gives the slope of the function. For a point to be a local maximum or minimum, the tangent line must be a horizontal line, which has a slope of zero. Therefore, when we set the derivative equal to zero and solve, we find a value of X that might be a local maximum or minimum. Such a point is called a critical point.

The following function generated the graph in Figure M6.4:

Y = 1

3 X3 - 4X2 + 12X + 3

Point A gives a local maximum and point B gives a local minimum. To find the values of X where these occur, we find the first derivative and set this equal to zero:

Y′ = X2 - 8X + 12 = 0

Solving this for X, we factor this and have

1X - 221X - 62 = 0 so the critical points occur when X = 2 and X = 6.

The second derivative is

Y″ = 2X - 8

At the first critical point, X = 2, so

Y″ = 2122 - 8 = -4 Because this is negative, this point is a local maximum. At the second critical point, where X = 8,

Y″ = 2182 - 8 = 8 Because this is positive, this critical point is a local minimum.

Consider Figure M6.5, which is a graph of

Y = X3

Y′ = 3X2

This derivative is equal to zero when X = 0. The second derivative is

Y″ = 3122X2 - 1 = 6X

To find a local optimum, we find the first derivative, set it equal to 0, and solve for X. This point is called a critical point.

–1.5 –1

Y = X 3

–0.5 0.50

–0.5

–1

–1.5

0.5

1

1.5

1 1.5

Y

X

FIGURE M6.5 Graph of Function with Point of Inflection at X = 0

Z07_REND3161_13_AIE_M06.indd 7 27/10/16 2:22 PM

M6-8  MODULE 6 • CALCULUS-BASED OPTIMIZATION

When X = 0, Y″ = 6102 = 0. Thus, this is neither a maximum nor a minimum but is a point of inflection, as shown in Figure M6.5.

A critical point will be:

1. A maximum if the second derivative is negative. 2. A minimum if the second derivative is positive. 3. A point of inflection if the second derivative is zero.

M6.5 Applications

There are many problems in which derivatives are used in business. We discuss a few of these here.

Economic Order Quantity In Chapter 6, we show the formula for computing the economic order quantity (EOQ), which minimizes cost when certain conditions are met. The total cost formula under these conditions is

Total cost = 1Total ordering cost2 + 1Total holding cost2 + 1Total purchase cost2

TC = D

Q Co +

Q

2 Ch + DC

where Q = order quantity D = annual demand Co = ordering cost per order Ch = holding cost per unit per year C = purchase (material) cost per unit

The variable is Q, and all of the others are known constants. The derivative of the total cost with respect to Q is

dTC

dQ =

-DCo Q2

+ Ch 2

Setting this equal to zero and solving results in

Q = {A2DCoCh We cannot have a negative quantity, so the positive value is the minimum cost. The second derivative is

d2TC

dQ2 =

DCo Q3

If all the costs are positive, this derivative will be positive for any value of Q 7 0. Thus, this point must be a minimum.

The formula for the EOQ model demonstrated here is the same formula used in Chapter 6. This method of using derivatives to derive a minimum cost quantity can be used with many total cost functions, even if the EOQ assumptions are not met.

Total Revenue In analyzing inventory situations, it is often assumed that whatever quantity is produced can be sold at a fixed price. However, we know from economics that demand is a function of the price. When the price is raised, the demand declines. The function that relates the demand to the price is called a demand function.

Suppose that historical sales data indicate that the demand function for a particular product is

Q = 6,000 - 500P

The EOQ model is derived from the total inventory cost function.

Z07_REND3161_13_AIE_M06.indd 8 27/10/16 2:22 PM

SUMMArY  M6-9

where

Q = quantity demanded (or sold) P = price in dollars

The total revenue function is

Total revenue = Price * Quantity TR = PQ

Substituting for Q (using the preceding demand function) in this equation gives us

TR = P16,000 - 500P2 TR = 6,000 P - 500P2

A graph illustrating this total revenue function is provided in Figure M6.6. To find the price that will maximize the total revenue, we find the derivative of total revenue:

TR′ = 6,000 - 1,000P

Setting this equal to zero and solving, we have

P = 6

Thus, to maximize total revenue, we set the price at $6. The quantity that will be sold at this price is

Q = 6,000 - 500 P = 6,000 - 500162 = 3,000 units The total revenue is

TR = PQ = 613,0002 = $18,000

Total revenue equals total demand times selling price.

To maximize total revenue, find the derivative of the total revenue function, set it equal to 0, and solve.

Y = 6,000X – 500X 2

0

2,000

4,000

6,000

8,000

10,000

12,000

14,000

16,000

18,000

20,000

0 5 Price

10 15 R

ev en

ue

FIGURE M6.6 Total revenue Function

In this module, we use the concept of limits to demonstrate that the derivative is the slope of a curve. We use several common derivatives to find the maximums and minimums of functions. The local optimum is found by taking the derivative of a func- tion, setting it equal to zero, and solving. If the second deriva- tive is negative at this point, the local optimum is a maximum.

If the second derivative is positive at this point, the local opti- mum is a minimum. If the second derivative is zero, the point is called a point of inflection.

Derivatives can be used to find the EOQ, which minimizes total inventory cost. A total revenue function is based on a demand curve. The derivative of this shows where revenues are maximized.

Summary

Z07_REND3161_13_AIE_M06.indd 9 27/10/16 2:22 PM

M6-10  MODULE 6 • CALCULUS-BASED OPTIMIZATION

Glossary

Critical Point A point on a curve where the first derivative is equal to zero.

Derivative The slope of a function at a particular point. It is the limit of the change in Y over the change in X as the change in X approaches 0.

Local Maximum The highest point in the neighborhood around a point.

Local Minimum The lowest point in the neighborhood around a point.

Point of Inflection A point on a curve where the first derivative is equal to zero, but the point is neither a maxi- mum nor a minimum.

Second Derivative The derivative of the first derivative. Slope The slope of a line is the change in the Y value divided

by the change in the X value.

Key Equations

(M6-1) Y = a + bX Equation of a straight line.

(M6-2) b = Change in Y

Change in X =

∆Y ∆X

= Y2 - Y1 X2 - X1

Slope of a straight line found from two points.

(M6-3) Y′ = dY

dX = lim

∆XS0 e ∆Y ∆X

f Definition of derivative.

(M6-4) If Y = c where c is any constant, then Y′ = 0 Derivative of a constant function.

(M6-5) If Y = Xn, then Y′ = nXn - 1

Derivative of X raised to a power.

(M6-6) If Y = cXn, then Y′ = cnXn - 1

Derivative of a constant times a function of X.

(M6-7) If Y = 1>Xn, then Y′ = -nX-n - 1 = -n>Xn + 1 Derivative of 1>X to a power.

(M6-8) If Y = g1x2 + h1x2, then Y′ = g′1x2 + h′1x2 Derivative of the sum of two functions of X.

(M6-9) If Y = g1x2 - h1x2, then Y′ = g′1x2 - h′1x2 Derivative of the difference of two functions of X.

Solved Problem

Solved Problem M6-1 The following function relates the price for a product to the quantity sold:

P = 6 - 0.75Q

Find the price that will maximize total revenue.

Solution

Total revenue = Price * Quantity TR = PQ TR = 16 - 0.75Q2Q = 6Q - 0.75Q2

So

TR′ = 6 - 0.75122Q Setting this equal to zero and solving, we have

6 - 1.5Q = 0

or

Q = 4

Then

P = 6 - 0.75Q = 6 - 0.75142 = 6 - 3 = 3

Z07_REND3161_13_AIE_M06.indd 10 27/10/16 2:22 PM

Self-Test

●● Before taking the self-test, refer back to the learning objectives at the beginning of the module and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. The slope of a curve at a particular point can be found a. by computing the first derivative of the function for

that curve. b. by computing the second derivative of the function for

that curve. c. by computing the change in X divided by the change

in Y. d. by dividing the value of Y at that point by the value

of X. 2. If the first derivative is set equal to zero and solved for X,

at that point (X) the curve could be a. at a maximum. b. at a minimum. c. at an inflection point. d. any of the above.

3. A critical point is a point where a. the slope of the function is 0. b. the Y value for the function is 0. c. the X value for the function is 0. d. the value of Y>X is 0.

4. A function is at a maximum at the point X = 5. At this point, a. the value of the second derivative is 0. b. the value of the second derivative is negative. c. the value of the second derivative is positive. d. the value of the first derivative is negative.

5. A point of inflection occurs when a. the first derivative is 0. b. the second derivative is 0. c. the first and the second derivatives are both 0. d. the first and the second derivatives are both positive.

6. The EOQ model can be derived from the derivative of a. the holding cost function. b. the ordering cost function. c. the purchase cost function. d. the total inventory cost function.

7. To find the quantity that maximizes total revenue, we should a. set total revenue equal to total cost. b. find the derivative of the total cost function. c. find the derivative of the total profit function. d. find the derivative of the total revenue function.

Discussion Questions and Problems Discussion Questions M6-1 Explain how to find the slope of a straight line. M6-2 Explain how to find the slope of a nonlinear function

at a particular point, using limits. M6-3 What is the procedure for finding the maximum or

minimum of a function? How is the second deriva- tive used in this process?

M6-4 What are critical points?

Problems M6-5 Find the derivatives of the following functions.

(a) Y = 2X3 - 3X2 + 6 (b) Y = 4X5 + 2X3 - 12X + 1 (c) Y = 1>X2 (d) Y = 25>X4

M6-6 Find the second derivative for each of the functions in Problem M6-5.

M6-7 Find the derivatives of the following functions.

(a) Y = X6 - 0.5X2 - 16 (b) Y = 5X4 + 12X2 + 10X + 21

(c) Y = 2>X3 (d) Y = 25>2X4

M6-8 Find the second derivative for each of the functions in Problem M6-7.

M6-9 Find the critical point for the function Y = 6X2 - 5X + 4. Is this a maximum, minimum, or point of inflection?

M6-10 F ind the c r i t i ca l po in ts for the func t ion Y = 1132X3 - 5X2 + 25X + 12. Identify each crit- ical point as a maximum or a minimum or a point of inflection.

M6-11 Find the critical point for the function Y = X3 - 20. Is this a maximum, minimum, or point of inflection?

M6-12 The total revenue function for a particular product is TR = 1,200Q - 0.25Q2. Find the quantity that will maximize total revenue. What is the total revenue for this quantity?

M6-13 The daily demand function for the AutoBright car wash- ing service has been estimated to be Q = 75 - 2P, where Q is the quantity of cars and P is the price. Determine what price would maximize total revenue. How many cars would be washed at this price?

SELF-TEST  M6-11

Z07_REND3161_13_AIE_M06.indd 11 27/10/16 2:22 PM

M6-12  MODULE 6 • CALCULUS-BASED OPTIMIZATION

M6-14 The total revenue function for AutoBright car wash- ing service (see Problem M6-13) is believed to be incorrect due to a changing demand pattern. Based on new information, the demand function is now estimated to be Q = 180 - 2P2. Find the price that would maximize total revenue.

M6-15 The total cost function for the EOQ model is

TC = D

Q Co +

Q

2 Ch + DC

In a particular inventory situation, annual demand (D) is 2,000, ordering cost per order 1Co2 is $25, holding cost per unit per year 1Ch2 is $10, and pur- chase (material) cost per unit (C) is $40. Write the total cost function with these values. Take the deriv- ative and find the quantity that minimizes cost.

M6-16 Find the second derivative of the total cost function in Problem M6-15, and verify that the value at the critical point is a minimum.

Bibliography

Barnett, Raymond, Michael Ziegler, and Karl Byleen. College Mathemat- ics for Business, Economics, Life Sciences, and Social Sciences, 13e, Pearson, 2015.

Haeussler, Ernest, Richard Paul, and Richard Wood, Introductory Mathemati- cal Analysis for Business, Economics and the Life and Social Sciences, 13e, Pearson, 2011.

Z07_REND3161_13_AIE_M06.indd 12 27/10/16 2:22 PM

 M7-1

In Chapter 7, we looked at examples of linear programming (LP) problems that contained two decision variables. With only two variables, it is possible to use a graphical approach. We plotted the feasible region and then searched for the optimal corner point and corre- sponding profit or cost. This approach provides a good way to understand the basic concepts of LP. Most real-life LP problems, however, have more than two variables and are thus too large for the simple graphical solution procedure. Problems faced in business and government can have dozens, hundreds, or even thousands of variables. We need a more powerful method than graph- ing, so in this module we turn to a procedure called the simplex method.

How does the simplex method work? The concept is simple, and it is similar to graphical LP in one important respect. In graphical LP, we examine each of the corner points; LP theory tells us that the optimal solution lies at one of them. In LP problems containing several variables, we may not be able to graph the feasible region, but the optimal solution will still lie at a corner point of the many-sided, many-dimensional figure (called an n-dimensional polyhedron) that represents the area of feasible solutions. The simplex method examines the corner points in a systematic fashion, using basic algebraic concepts. It does so in an iterative manner—that is, repeating the same set of procedures time after time until an optimal solution is reached. Each iteration brings a higher value for the objective function so that we are always moving closer to the optimal solution.

Why should we study the simplex method? It is important to understand the ideas used to produce solutions. The simplex approach yields not only the optimal solution to the decision

Recall that the theory of LP states the optimal solution will lie at a corner point of the feasible region. In large LP problems, the feasible region cannot be graphed because it has many dimensions, but the concept is the same.

M7.5 Recognize special cases such as infeasibility, unboundedness and degeneracy.

M7.6 Use the simplex tables to conduct sensitivity analysis.

M7.7 Construct the dual problem from the primal problem.

M7.8 Understand the importance of Karmarkar’s Algorithm to the field of LP.

M7.1 Convert LP constraints to equalities with slack, surplus, and artificial variables.

M7.2 Set up and solve LP maximization problems with simplex tableaus.

M7.3 Interpret the meaning of every number in a simplex tableau.

M7.4 Set up and solve LP minimization problems with simplex tableaus.

After completing this module, students will be able to:

Linear Programming: The Simplex Method

LEARNING OBJECTIVES

7 MODULE

Z08_REND3161_13_AIE_M07.indd 1 28/10/16 11:40 AM

M7-2  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

variables and the maximum profit (or minimum cost) but valuable economic information as well. To be able to use computers successfully and to interpret LP computer printouts, we need to know what the simplex method is doing and why.

We begin by solving a maximization problem using the simplex method. We then tackle a minimization problem and look at a few technical issues that are faced when employing the sim- plex procedure. From there, we examine how to conduct sensitivity analysis using the simplex tables. The module concludes with a discussion of the dual, which is an alternative way of look- ing at any LP problem.

M7.1 How to Set Up the Initial Simplex Solution

Let us consider the case of the Flair Furniture Company from Chapter 7. Instead of the graphical solution we used in that chapter, we now demonstrate the simplex method. You may recall that we let

T = number of tables produced C = number of chairs produced

and that the problem was formulated as

Maximize profit = $70T + $50C 1objective function2 subject to 2T + 1C … 100 1painting hours constraint2

4T + 3C … 240 1carpentry hours constraint2 T, C Ú 0 1nonnegativity constraints2

Converting the Constraints to Equations The first step of the simplex method requires that we convert each inequality constraint (except nonnegativity constraints) in an LP formulation into an equation.1 Less-than-or-equal-to con- straints 1…2 such as in the Flair problem are converted to equations by adding a slack variable to each constraint. Slack variables represent unused resources; these may be in the form of time on a machine, labor hours, money, warehouse space, or any number of such resources in various business problems.

In our case at hand, we can let

S1 = slack variable representing unused hours in the painting department S2 = slack variable representing unused hours in the carpentry department

The constraints to the problem may now be written as

2T + 1C + S1 = 100

and

4T + 3C + S2 = 240

Thus, if the production of tables (T) and chairs (C) uses less than 100 hours of painting time available, the unused time is the value of the slack variable, S1. For example, if T = 0 and C = 0 (in other words, if nothing is produced), we have S1 = 100 hours of slack time in the painting department. If Flair produces T = 40 tables and C = 10 chairs, then

2T + 1C + S1 = 100 21402 + 11102 + S1 = 100

S1 = 10

and there will be 10 hours of slack, or unused, painting time available.

The simplex method systematically examines corner points, using algebraic steps, until an optimal solution is found.

1This is because the simplex is a matrix algebra method that requires all mathematical relationships to be equations, with each equation containing all of the variables.

Slack variables are added to each less-than-or-equal-to constraint. Each slack variable represents an unused resource.

Z08_REND3161_13_AIE_M07.indd 2 28/10/16 11:40 AM

M7.1 HOw TO SET UP THE INITIAL SIMPLEX SOLUTION  M7-3

To include all variables in each equation, which is a requirement of the next simplex step, slack variables not appearing in an equation are added with a coefficient of 0. This means, in effect, that they have no influence on the equations in which they are inserted; however, this step does allow us to keep tabs on all variables at all times. The equations now appear as follows:

2T + 1C + 1S1 + 0S2 = 100 4T + 3C + 0S1 + 1S2 = 240

T, C, S1, S2 Ú 0

Because slack variables yield no profit, they are added to the original objective function with 0 profit coefficients. The objective function becomes

Maximize profit = $70T + $50C + $0S1 + $0S2

Finding an Initial Solution Algebraically Let’s take another look at the new constraint equations. We see that there are two equations and four variables. Think back to your last algebra course. When you have the same number of unknown variables as you have equations, it is possible to solve for unique values of the variables. But when there are four unknowns (T, C, S1, and S2, in this case) and only two equa- tions, you can let two of the variables equal 0 and then solve for the other two. For example, if T = C = 0, then S1 = 100 and S2 = 240. A solution found in this manner is called a basic feasible solution.

The simplex method begins with an initial feasible solution in which all real variables (such as T and C) are set equal to 0. This trivial solution always produces a profit of $0, as well as slack variables equal to the constant (right-hand-side) terms in the constraint equations. It’s not a very exciting solution in terms of economic returns, but it is one of the original corner point solutions (see Figure M7.1). As mentioned, the simplex method will start at this corner point (A) and then move up or over to the corner point that yields the most improved profit (B or D). Finally, the technique will move to a new corner point (C), which happens to be the optimal solution to the Flair Furniture problem. The simplex method considers only feasible solutions and hence will touch no possible combinations other than the corner points of the shaded region in Figure M7.1.

C

100

80

60

40

20

(0,0) A 0 20 40 60

Number of Tables

80

N um

be r o

f C ha

irs

T

B = (0, 80)

2T + 1C # 100

4T + 3C # 240

C = (30, 40)

D = (50, 0)

A basic feasible solution to a system of n equations is found by setting all but n variables equal to 0 and solving for the other variables.

FIGURE M7.1 Corner Points of the Flair Furniture Company Problem

Simplex considers only corner points as it seeks the best solution.

Z08_REND3161_13_AIE_M07.indd 3 28/10/16 11:40 AM

M7-4  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

The First Simplex Tableau To simplify handling the equations and objective function in an LP problem, we place all of the coefficients into tabular form. The first simplex tableau is shown in Table M7.1. An explanation of its parts and how the tableau is derived follows.

CONSTRAINT EQUATIONS We see that Flair Furniture’s two constraint equations can be expressed as follows:

Here are the constraints in tabular form. SOLUTION

MIX T

C

S1

S2

QUANTITY (RIGHT-HAND SIDE)

S1 2 1 1 0 100

S2 4 3 0 1 240

TABLE M7.1 Flair Furniture’s Initial Simplex Tableau

Cj SOLUTION MIX

$70 T

$50 C

$0 S1

$0 S2 QUANTITY Profit per unit row

$0 S1 2 1 1 0 100 Constraint equation rows

$0 S2 4 3 0 1 240

Zj $0 $0 $0 $0 $0 Gross profit row

Cj - Zj $70 $50 $0 $0 $0 Net profit row

Pr ofi

t p er

u ni

t c ol

um n

Pr od

uc tio

n m

ix c

ol um

n

R ea

l v ar

ia bl

es c

ol um

ns

Sl ac

k va

ri ab

le s

co lu

m ns

C on

st an

t c ol

um n

The numbers 12, 1, 1, 02 in the first row represent the coefficients of the first equation— namely, 2T + 1C + 1S1 + 0S2. The numbers 14, 3, 0, 12 in the second row are the algebraic equivalent of the constraint 4T + 3C + 0S1 + 1S2.

As suggested earlier, we begin the initial solution procedure at the origin, where T = 0 and C = 0. The values of the other two variables must then be nonzero, so S1 = 100 and S2 = 240. These two slack variables constitute the initial solution mix; their values are found in the quan- tity (or right-hand-side [RHS]) column. Because T and C are not in the solution mix, their initial values are automatically equal to 0.

This initial solution is a basic feasible solution and is described in vector, or column, form asD TC S1 S2

T = D 00 100

240

T The initial solution mix begins with real, or decision, variables set equal to zero.

Here is the basic feasible solution in column form.

Z08_REND3161_13_AIE_M07.indd 4 28/10/16 11:40 AM

M7.1 HOw TO SET UP THE INITIAL SIMPLEX SOLUTION  M7-5

Variables in the solution mix, which is called the basis in LP terminology, are referred to as basic variables. In this example, the basic variables are S1 and S2. Variables that are not in the solution mix or basis and that have been set equal to zero (T and C, in this case) are called nonbasic variables. Of course, if the optimal solution to this LP problem turned out to be T = 30, C = 40, S1 = 0, and S2 = 0, orD TC

S1 S2

T = D3040 0

0

T 1in vector form2 then T and C would be the final basic variables, and S1 and S2 would be the nonbasic variables. Notice that for any corner point, exactly two of the four variables will equal zero.

SUBSTITUTION RATES Many students are unsure as to the actual meaning of the numbers in the columns under each variable. We know that the entries are the coefficients for that variable.

Under T are the coefficients a2 4 b , under C are a1

3 b , under S1 are a10b , and under S2 are a

0

1 b .

But what is their interpretation? The numbers in the body of the simplex tableau (see Table M7.1) can be thought of as substitution rates. For example, suppose we now wish to make T larger than 0—that is, to produce some tables. For every unit of the T product introduced into the current solution, 2 units of S1 and 4 units of S2 must be removed from the solution. This is so because each table requires 2 hours of the currently unused painting department slack time, S1. It also takes 4 hours of carpentry time; hence, 4 units of variable S2 must be removed from the solution for every unit of T that enters. Similarly, the substitution rates for each unit of C that enters the current solution are 1 unit of S1 and 3 units of S2.

Another point that you are reminded of throughout this module is that for any variable ever to appear in the solution mix column, it must have the number 1 someplace in its column and 0s

in every other place in that column. We see that column S1 contains a10b , so variable S1 is in the solution. Similarly, the S2 column is a01b , so S2 is also in the solution.

2

ADDING THE OBJECTIVE FUNCTION We now continue to the next step in establishing the first simplex tableau. We add a row to reflect the objective function values for each variable. These contribu- tion rates, called Cj, appear just above each respective variable, as shown in the following table:

Cj $70 $50 $0 $0

SOLUTION MIX T C S1 S2 QUANTITY

$0 S1 2 1 1 0 100

$0 S2 4 3 0 1 240

Variables in the solution mix are called basic. Those not in the solution are called nonbasic.

Substitution rates are numbers in the body of the table.

2If there had been three less-than-or-equal-to constraints in the Flair Furniture problem, there would be three slack vari- ables, S1, S2, and S3. The 1s and 0s would appear like this:

SOLUTION MIX S1 s2 s3 S1 1 0 0

S2 0 1 0

S3 0 0 1

Z08_REND3161_13_AIE_M07.indd 5 28/10/16 11:40 AM

M7-6  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

The unit profit rates are not just found in the top Cj row: in the leftmost column, Cj indicates the unit profit for each variable currently in the solution mix. If S1 were removed from the solu- tion and replaced—for example, by C—$50 would appear in the Cj column just to the left of the term C.

THE Zj AND Cj – Zj ROWS We can complete the initial Flair Furniture simplex tableau by adding two final rows. These last two rows provide us with important economic information, including the total profit and the answer as to whether the current solution is optimal.

We compute the Zj row values of the initial solution in Table M7.1 by multiplying the 0 contribution value of each number in the Cj column by each number in that row and the jth column and then summing. The Zj value for the quantity column provides the total contribution (gross profit, in this case) of the given solution:

Zj 1for gross profit2 = 1Profit per unit of S12 * 1Number of units of S12 + 1Profit per unit of S22 * 1Number of units of S22

= $0 * 100 units + $0 * 240 units = $0 profit

The Zj values for the other columns (under the variables T, C, S1, and S2) represent the gross profit given up by adding one unit of this variable into the current solution. Their calculations are as follows:

Zj = 1Profit per unit of S12 * 1Substitution rate in row 12 + 1Profit per unit of S22 * 1Substitution rate in row 22

Thus,

Zj 1for column T2 = 1$02122 + 1$02142 = $0 Zj 1for column C2 = 1$02112 + 1$02132 = $0 Zj 1for column S12 = 1$02112 + 1$02102 = $0 Zj 1for column S22 = 1$02102 + 1$02112 = $0

We see that there is no profit lost by adding one unit of T (tables), C (chairs), S1, or S2.

Resource Allocation at Pantex

Companies often use optimization techniques such as LP to allocate limited resources to maximize profits or minimize costs. One of the most important resource allocation problems faced by the United States is dismantling old nuclear weapons and maintaining the safety, security, and reliability of the remain- ing systems. This is the problem faced by Pantex, a $300 million corporation.

Pantex is responsible for disarming, evaluating, and maintain- ing the U.S. nuclear stockpile. The company is also responsible for storing critical weapon components that relate to U.S.–Russian nonproliferation agreements. Pantex constantly makes trade-offs in meeting the requirements of disarming some nuclear weap- ons versus maintaining existing nuclear weapon systems, while effectively allocating limited resources. Like many manufacturers,

Pantex must allocate scarce resources among competing demands, all of which are important.

The team charged with solving the resource allocation prob- lem at Pantex developed the Pantex Process Model (PPM). PPM is a sophisticated optimization system capable of analyzing nuclear needs over different time horizons. Since its development, PPM has become the primary tool for analyzing, planning, and scheduling issues at Pantex. PPM also helps to determine future resources. For example, it was used to gain government support for $17 million to modify an existing plant with new buildings and $70 million to construct a new plant.

Source: Based on Edwin Kjeldgaard, et al. “Swords into Plowshares: Nuclear Weapon Dismantlement, Evaluation, and Maintenance at Pantex,” Interfaces 30, 1 (January–February 2000): 57–82, © Trevor S. Hale.

IN ACTION

The Zj-row entry in the quantity column provides the gross profit.

Z08_REND3161_13_AIE_M07.indd 6 28/10/16 11:40 AM

M7.2 SIMPLEX SOLUTION PROCEDURES  M7-7

The Cj - Zj number in each column represents the net profit—that is, the profit gained minus the profit given up—that will result from introducing 1 unit of each product or variable into the solution. It is not calculated for the quantity column. To compute these numbers, simply subtract the Zj total for each column from the Cj value at the very top of that variable’s column. The calculations for the net profit per unit (the Cj - Zj row) in this example follow:

COLUMN

T C S1 S2

Cj for column $70 $50 $0 $0

Zj for column 0 0 0 0

Cj - Zj for column $70 $50 $0 $0

It is obvious to us when we compute a profit of $0 that the initial solution is not optimal. By examining the numbers in the Cj - Zj row of Table M7.1, we see that the total profit can be increased by $70 for each unit of T (tables) and by $50 for each unit of C (chairs) added to the solution mix. A negative number in the Cj - Zj row would tell us that profits would decrease if the corresponding variable were added to the solution mix. An optimal solution is reached in the simplex method when the Cj - Zj row contains no positive numbers. Such is not the case in our initial tableau.

M7.2 Simplex Solution Procedures

After an initial tableau has been completed, we proceed through a series of five steps to compute all the numbers needed in the next tableau. The calculations are not difficult, but they are com- plex enough that even the smallest arithmetic error can produce a wrong answer.

We first list the five steps and then carefully explain and apply them in completing the sec- ond and third tableaus for the Flair Furniture Company data.

Five Steps of the Simplex Method for Maximization Problems

1. Determine which variable to enter into the solution mix next. One way of doing this is by identifying the column, and hence the variable, with the largest positive number in the Cj - Zj row of the preceding tableau. This means that we will now be producing some of the product contributing the greatest additional profit per unit. The column identified in this step is called the pivot column.

2. Determine which variable to replace. Because we have just chosen a new variable to enter the solution mix, we must decide which basic variable currently in the solution will have to leave to make room for it. Step 2 is accomplished by dividing each amount in the quantity column by the corresponding number in the column selected in step 1. The row with the smallest nonnegative number calculated in this fashion will be replaced in the next tableau. (This smallest number, by the way, gives the maximum number of units of the variable that may be placed in the solution.) This row is often referred to as the pivot row. The number at the intersection of the pivot row and pivot column is referred to as the pivot number.

3. Compute new values for the pivot row. To do this, we simply divide every number in the row by the pivot number.

4. Compute the new values for each remaining row. (In our Flair Furniture problem there are only two rows in the LP tableau, but most larger problems have many more rows.) All remaining row(s) are calculated as follows:

1New row numbers2 = 1Numbers in old row2

- C £Number aboveor below pivot number

≥ * £Corresponding number inthe new row:that is, the row replaced in step 3

≥ S (M7-1)

The Cj − Zj row gives the net profit from introducing one unit of each variable into the solution.

We reach an optimal solution when the Cj − Zj row has no positive numbers in it.

1. Variable entering the solution has the largest positive Cj − Zj.

2. Variable leaving the solution is determined by a ratio we must compute.

3. New pivot-row calculations are done next. 4. Other new rows are calculated with Equation M7-1.

Here are the five simplex steps.

Z08_REND3161_13_AIE_M07.indd 7 28/10/16 11:40 AM

M7-8  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

5. Compute the Zj and Cj - Zj rows, as demonstrated in the initial tableau. If all numbers in the Cj − Zj row are 0 or negative, an optimal solution has been reached. If this is not the case, return to step 1.

The Second Simplex Tableau Now that we have listed the five steps needed to move from an initial solution to an improved solution, we apply them to the Flair Furniture problem. Our goal is to add a new variable to the solution mix, or basis, to raise the profit from its current tableau value of $0.

Step 1. To decide which of the variables will enter the solution next (it must be either T or C, since they are the only two nonbasic variables at this point), we select the one with the largest positive Cj - Zj value. Variable T, tables, has a Cj - Zj value of $70, implying that each unit of T added into the solution mix will contribute $70 to the overall profit. Variable C, chairs, has a Cj - Zj value of only $50. The other two variables, S1 and S2, have 0 values and can add nothing more to profit. Hence, we select T as the variable to enter the solution mix and identify its column (with an arrow) as the pivot column. This is shown in Table M7.2.

Step 2. Since T is about to enter the solution mix, we must decide which variable is to be replaced. There can be only as many basic variables as there are constraints in any LP problem, so either S1 or S2 will have to leave to make room for the introduction of T, tables, into the basis. To identify the pivot row, each number in the quantity column is divided by the corresponding number in the T column.

For the S1 row:

100 1hours of painting time available2 2 1hours required per table2 = 50 tables

For the S2 row:

240 1hours of carpentry time available2 4 1hours required per table2 = 60 tables

The smaller of these two ratios, 50, indicates the maximum number of units of T that can be produced without violating either of the original constraints. This corresponds to point D in Figure M7.2. The other ratio (60) corresponds to point E on this graph. Thus, the smallest ratio is chosen so that the next solution is feasible. Also, when T = 50, there is no slack in constraint 1, so S1 = 0. This means that S1 will be the next variable to be replaced at this iteration of the simplex method. The row with the smallest ratio (row 1) is the pivot row. The pivot row and the pivot number (the number at the intersection of the pivot row and pivot column) are identified in Table M7.3.

Step 3. Now that we have decided which variable is to enter the solution mix (T) and which is to leave 1S12, we begin to develop the second, improved simplex tableau. Step 3 involves

5. Finally, the Zj and Cj − Zj rows are recomputed.

Here we apply the five steps to Flair Furniture.

First, T (tables) enters the solution mix because its Cj − Zj value of $70 is largest.

S1 leaves the solution mix because the smaller of the two ratios indicates that the next pivot row will be the first row.

Cj $70 $50 $0 $0

SOLUTION MIX T C S1 S2

QUANTITY (RHS)

$0 S1 2 1 1 0 100

$0 S2 4 3 0 1 240

Zj $0 $0 $0 $0 $0

Cj - Zj $70 $50 $0 $0 Total profit

Pivot column

TABLE M7.2 Pivot Column Identified in the Initial Simplex Tableau

Z08_REND3161_13_AIE_M07.indd 8 28/10/16 11:40 AM

M7.2 SIMPLEX SOLUTION PROCEDURES  M7-9

The new pivot row is computed by dividing every number in the pivot row by the pivot number.

C

100

80

60

40

20

(0,0) A 0 20 40 60

Number of Tables

80

N um

be r o

f C ha

irs

T

B = (0, 80)

C = (30, 40)

E = (60, 0) D = (50, 0)

F = (0, 100)

FIGURE M7.2 Graph of the Flair Furniture Company Problem

computing a replacement for the pivot row. This is done by dividing every number in the pivot row by the pivot number:

2

2 = 1

1

2 = 0.5

1

2 = 0.5

0

2 = 0

100

2 = 50

The new version of the entire pivot row appears in the accompanying table. Note that T is now in the solution mix and that 50 units of T are being produced. The Cj value is listed as a $70 contribution per unit of T in the solution. This will definitely provide Flair Furniture with a more profitable solution than the $0 generated in the initial tableau.

Cj SOLUTION MIX T C S1 S2 QUANTITY

$70 T 1 0.5 0.5 0 50

Cj $70 $50 $0 $0

SOLUTION MIX T C S1 S2 QUANTITY

$0 S1 2 1 1 0 100 Pivot row

$0 S2 4 3 0 1 240

Pivot number

Zj $0 $0 $0 $0 $0

Cj - Zj $70 $50 $0 $0

Pivot column

TABLE M7.3 Pivot Row and Pivot Number Identified in the Initial Simplex Tableau

Z08_REND3161_13_AIE_M07.indd 9 28/10/16 11:40 AM

M7-10  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Step 4. This step is intended to help us compute new values for the other row in the body of the tableau—that is, the S2 row. It is slightly more complex than replacing the pivot row and uses the formula (Equation M7-1) shown earlier. The expression on the right side of the following equa- tion is used to calculate the left side.

a Number in New S2 Row

b = aNumber in Old S2 Row

b− c aNumber Below Pivot Number

b : aCorresponding Number in the New T Row

b d

0 = 4 - 142 * 112 1 = 3 - 142 * 10.52 -2 = 0 - 142 * 10.52 1 = 1 - 142 * 102 40 = 240 - 142 * 1502

This new S2 row will appear in the second tableau in the following format:

Cj SOLUTION MIX T C S1 S2 QUANTITY

$70 T 1 0.5 0.5 0 50

$0 S2 0 1 -2 1 40

Now that T and S2 are in the solution mix, take a look at the values of the coefficients in their

respective columns. The T column contains a1 0 b , a condition necessary for that variable to be

in the solution. Similarly, the S2 column has a01b ; that is, it contains a 1 and a 0. Basically, the algebraic manipulations we just went through in steps 3 and 4 were simply directed at producing 0s and 1s in the appropriate positions. In step 3, we divided every number in the pivot row by the pivot number; this guaranteed that there would be a 1 in the T column’s top row. To derive the new second row, we multiplied the first row (each row is really an equation) by a constant (the number 4 here) and subtracted it from the second equation. The result was the new S2 row with a 0 in the T column.

Step 5. The final step of the second iteration is to introduce the effect of the objective func- tion. This involves computing the Zj and Cj - Zj rows. Recall that the Zj entry for the quantity column gives us the gross profit for the current solution. The other Zj values represent the gross profit given up by adding one unit of each variable into this new solution. The Zj values are cal- culated as follows:

Zj 1for T column2 = 1$702112 + 1$02102 = $70 Zj 1for C column2 = 1$70210.52 + 1$02112 = $35 Zj 1for S1 column2 = 1$70210.52 + 1$021-22 = $35 Zj 1for S2 column2 = 1$702102 + 1$02112 = $0 Zj 1for total profit2 = 1$7021502 + 1$021402 = $3,500

Note that the current profit is $3,500.

We note that the T column

contains a1 0 b and the S2 column

contains a0 1 b . These 0s and 1s

indicate that T and S2 are in the basis (the solution mix).

We find the new profit in the Z row.

We can now recompute the S2 row.

Z08_REND3161_13_AIE_M07.indd 10 28/10/16 11:40 AM

M7.2 SIMPLEX SOLUTION PROCEDURES  M7-11

The Cj - Zj numbers represent the net profit that will result, given our present production mix, if we add one unit of each variable into the solution:

COLUMN

T C S1 S2

Cj for column $70 $50 $0 $0

Zj for column $70 $35 $35 $0

Cj - Zj for column $0 $15 -$35 $0

The Zj and Cj - Zj rows are inserted into the complete second tableau, as shown in Table M7.4.

Interpreting the Second Tableau Table M7.4 summarizes all of the information for the Flair Furniture Company’s production mix de- cision as of the second iteration of the simplex method. Let’s briefly look over a few important items.

CURRENT SOLUTION At this point, the solution point of 50 tables and 0 chairs 1T = 50, C = 02 generates a profit of $3,500. T is a basic variable; C is a nonbasic variable. Using a graphical LP approach, this corresponds to corner point D, as shown earlier in Figure M7.2.

RESOURCE INFORMATION We also see in Table M7.4 that slack variable S2, representing the amount of unused time in the carpentry department, is in the basis. It has a value of 40, implying that 40 hours of carpentry time remain available. Slack variable S1 is nonbasic and has a value of 0 hours. There is no slack time in the painting department.

SUBSTITUTION RATES We mentioned earlier that the substitution rates are the coefficients in the heart of the tableau. Look at the C column. If 1 unit of C (1 chair) is added to the current solu- tion, 0.5 unit of T and 1 unit of S2 must be given up. This is because the solution T = 50 tables uses up all 100 hours of time in the painting department. (The original constraint, you may recall, was 2T + 1C + S1 = 100.) To capture the 1 painting hour needed to make 1 chair, 0.5 of a table less must be produced. This frees up 1 hour to be used in making 1 chair.

But why must 1 unit of S2 (i.e., 1 hour of carpentry time) be given up to produce 1 chair? The original constraint was 4T + 3C + S2 = 240 hours of carpentry time. Doesn’t this indicate that 3 hours of carpentry time are required to produce 1 unit of C? The answer is that we are looking at marginal rates of substitution. Adding 1 chair replaced 0.5 table. Because 0.5 table required 10.5 * 4 hours per table2 = 2 hours of carpentry time, 2 units of S2 are freed. Thus, only 1 more unit of S2 is needed to produce 1 chair.

Just to be sure you have this concept down pat, let’s look at one more column, S1, as well.

The coefficients are a0.5 -2

b . These substitution rate values mean that if 1 hour of slack painting time is added to the current solution, 0.5 of a table (T) less will be produced. However, note that if 1 unit of S1 is added into the solution, 2 hours of carpentry time 1S22 will no longer be used. These will be added to the current 40 slack hours of carpentry time. Hence, a negative substitution rate means that if 1 unit of a column variable is added to the solution, the value of the corresponding

Cj $70 $50 $0 $0

SOLUTION MIX T C S1 S2 QUANTITY

$70 T 1 0.5 0.5 0 50

$0 S2 0 1 -2 1 40 Zj $70 $35 $35 $0 $3,500

Cj - Zj $0 $15 -$35 $0

TABLE M7.4 Completed Second-Simplex Tableau for Flair Furniture

We can look at the current solution as a corner point in the graphical method.

Here is an explanation of the meaning of substitution rates.

The Cj − Zj row indicates the net profit, given the current solution, of one more unit of each variable. For example, C has a profit of $15 per unit.

Z08_REND3161_13_AIE_M07.indd 11 28/10/16 11:40 AM

M7-12  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

solution (or row) variable will be increased. A positive substitution rate tells us that if 1 unit of the column variable is added to the solution, the row variable will decrease by the rate.

Can you interpret the rates in the T and S2 columns now?

NET PROFIT ROW The Cj - Zj row is important to us for two reasons. First, it indicates whether the current solution is optimal. When there are no positive numbers in the bottom row, an opti- mum solution to an LP maximization problem has been reached. In the case of Table M7.4, we see that Cj - Zj values for columns T, S1, and S2 are 0 or negative. The value for column C (15) means that the net profit can be increased by $15 for each chair added into the current solution.

Because the Cj - Zj value for T is 0, for every unit of T added the total profit will remain unchanged because we are already producing as many tables as possible. A negative number, such as the -35 in the S1 column, implies that total profit will decrease by $35 if 1 unit of S1 is added to the solution. In other words, making one slack hour available in the painting depart- ment (S1 = 0 currently) means that we would have to produce one-half table less. Since each table results in a $70 contribution, we would be losing 0.5 * $70 = $35, for a net loss of $35.

Later in this module we discuss in detail the subject of shadow prices. These relate to Cj - Zj values in the slack variable columns. Shadow prices are simply another way of inter- preting negative Cj - Zj values; they may be viewed as the potential increase in profit if one more hour of the scarce resource (such as painting or carpentry time) could be made available.

We mentioned previously that there are two reasons to consider the Cj - Zj row carefully. The second reason, of course, is that we use the row to determine which variable will enter the solution next. Since an optimal solution has not yet been reached, let’s proceed to the third simplex tableau.

The Third Simplex Tableau Since not all numbers in the Cj - Zj row of the latest tableau are 0 or negative, the previous solution is not optimal, and we must repeat the five simplex steps.

Step 1. Variable C will enter the solution next by virtue of the fact that its Cj - Zj value of 15 is the largest (and only) positive number in the row. This means that for every unit of C (chairs) we start to produce, the objective function will increase in value by $15. The C column is the new pivot column.

Step 2. The next step involves identifying the pivot row. The question is, which variable cur- rently in the solution (T or S2) will have to leave to make room for C to enter? Again, each number in the quantity column is divided by its corresponding substitution rate in the C column:

For the T row: 50

0.5 = 100 chairs

For the S2 row: 40

1 = 40 chairs

These ratios correspond to the values of C (the variable entering the solution mix) at points F and C, seen earlier in Figure M7.2. The S2 row has the smallest ratio, so variable S2 will leave the basis (and will become a nonbasic variable equal to zero) and will be replaced by C (which will have a value of 40). The new pivot row, pivot column, and pivot number are all shown in Table M7.5.

The Cj − Zj row tells us (1) whether the current solution is optimal and (2) if it is not, which variable should enter the solution mix next.

C (chairs) will be the next solution mix variable because it has the only positive value in the Cj − Zj row.

Cj $70 $50 $0 $0

SOLUTION MIX T C S1 S2 QUANTITY

$70 T 1 0.5 0.5 0 50

$0 S2 0 1 -2 1 40 Pivot row

Pivot number

Zj $70 $35 $35 $0 $3,500

Cj - Zj $0 $15 -$35 $0 (total profit)

Pivot column

TABLE M7.5 Pivot Row, Pivot Column, and Pivot Number Identified in the Second Simplex Tableau

We replace the variable S2 because it is in the pivot row.

Z08_REND3161_13_AIE_M07.indd 12 28/10/16 11:40 AM

M7.2 SIMPLEX SOLUTION PROCEDURES  M7-13

Step 3. The pivot row is replaced by dividing every number in it by the (circled) pivot number. Since every number is divided by 1, there is no change:

0

1 = 0

1

1 = 1

-2 1

= -2 1

1 = 1

40

1 = 40

The entire new C row looks like this:

Cj SOLUTION MIX T C S1 S2 QUANTITY

$50 C 0 1 -2 1 40

It will be placed in the new simplex tableau in the same row position that S2 was in before (see Table M7.5).

Step 4. The new values for the T row may now be computed:£Numberin new T row

≥ = £Numberin old T row

≥ - C £ Numberabove pivot number

≥ * £Correspondingnumber in new C row

≥ S 1 = 1 - 10.52 * 102 0 = 0.5 - 10.52 * 112 1.5 = 0.5 - 10.52 * 1-22

-0.5 = 0 - 10.52 * 112 30 = 50 - 10.52 * 1402

Hence, the new T row will appear in the third tableau in the following position:

Cj SOLUTION MIX T C S1 S2 QUANTITY

$70 T 1 0 1.5 -0.5 30 $50 C 0 1 -2 1 40

Step 5. Finally, the Zj and Cj - Zj rows are calculated for the third tableau:

Zj 1for T column2 = 1$702112 + 1$502102 = $70 Zj 1for C column2 = 1$702102 + 1$502112 = $50 Zj 1for S1 column2 = 1$70211.52 + 1$5021-22 = $5 Zj 1for S2 column2 = 1$7021-0.52 + 1$502112 = $15 Zj 1for total profit2 = 1$7021302 + 1$5021402 = $4,100

The net profit per unit row appears as follows:

COLUMN

T C S1 S2

Cj for column $70 $50 $0 $0

Zj for column $70 $50 $5 $15

Cj - Zj for column $0 $0 -$5 -$15

The pivot row for the third tableau is replaced here.

The new T row is computed here.

The final step is again computing the Zj and Cj − Zj values.

Z08_REND3161_13_AIE_M07.indd 13 28/10/16 11:41 AM

M7-14  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Cj $70 $50 $0 $0

SOLUTION MIX T C S1 S2 QUANTITY

$70 T 1 0 1.5 -0.5 30 $50 C 0 1 -2 1 40

Zj $70 $50 $5 $15 $4,100

Cj - Zj $0 $0 -$5 -$15

TABLE M7.6 Final Simplex Tableau for the Flair Furniture Problem

Review of Procedures for Solving LP Maximization Problems Before moving on to other issues concerning the simplex method, let’s review briefly what we’ve learned so far for LP maximization problems.

I. Formulate the LP problem’s objective function and constraints. II. Add slack variables to each less-than-or-equal-to constraint and to the problem’s objective

function. III. Develop an initial simplex tableau with slack variables in the basis and the decision

variables set equal to 0. Compute the Zj and Cj - Zj values for this tableau. IV. Follow these five steps until an optimal solution has been reached:

1. Choose the variable with the greatest positive Cj - Zj to enter the solution. This is the pivot column.

2. Determine the solution mix variable to be replaced and the pivot row by selecting the row with the smallest (nonnegative) ratio of quantity to pivot column substitution rate. This row is the pivot row.

Here is a review of the five simplex steps.

All results for the third iteration of the simplex method are summarized in Table M7.6. Note that since every number in the tableau’s Cj - Zj row is 0 or negative, an optimal solution has been reached.

That solution is

T = 30 tables C = 40 chairs S1 = 0 slack hours in the painting department S2 = 0 slack hours in the carpentry department

Profit = $4,100 for the optimal solution

T and C are the final basic variables, and S1 and S2 are nonbasic (and thus automatically equal to 0). This solution corresponds to corner point C in Figure M7.2.

It’s always possible to make an arithmetic error when you are going through the numerous simplex steps and iterations, so it is a good idea to verify your final solution. This can be done in part by looking at the original Flair Furniture Company constraints and objective function:

First constraint: 2T + 1C … 100 painting department hours 21302 + 11402 … 100

100 … 100 ✓ Second constraint: 4T + 3C … 240 carpentry department hours

41302 + 31402 … 240 240 … 240 ✓

Objective function: profit = $70T + $50C = $701302 + $501402 = $4,100

The final solution is to make 30 tables and 40 chairs at a profit of $4,100. This is the same as the graphical solution presented earlier.

Verifying that the solution does not violate any of the original constraints is a good way to check that no mathematical errors were made.

An optimal solution is reached because all Cj − Zj values are zero or negative.

Z08_REND3161_13_AIE_M07.indd 14 28/10/16 11:41 AM

M7.3 SURPLUS AND ARTIFICIAL VARIAbLES  M7-15

3. Calculate the new values for the pivot row. 4. Calculate the new values for the other row(s). 5. Calculate the Zj and Cj - Zj values for this tableau. If there are any Cj - Zj numbers

greater than 0, return to step 1. If there are no Cj - Zj numbers that are greater than 0, an optimal solution has been reached.

M7.3 Surplus and Artificial Variables

Up to this point in the module, all of the LP constraints you have seen were of the less-than- or-equal-to 1…2 variety. Just as common in real-life problems—especially in LP minimiza- tion problems—are greater-than-or-equal-to 1Ú2 constraints and equalities. To use the simplex method, each of these must also be converted to a special form. If they are not, the simplex tech- nique is unable to set up an initial solution in the first tableau.

Before moving on to the next section of this module, which deals with solving LP mini- mization problems with the simplex method, we take a look at how to convert a few typical constraints:

Constraint 1: 5X1 + 10X2 + 8X3 Ú 210 Constraint 2: 25X1 + 30X2 = 900

Surplus Variables Greater-than-or-equal-to 1Ú2 constraints, such as constraint 1 as just described, require a dif- ferent approach than do the less-than-or-equal-to 1…2 constraints we saw in the Flair Furni- ture problem. They involve the subtraction of a surplus variable rather than the addition of a slack variable. The surplus variable tells us how much the solution exceeds the constraint amount. Because of its analogy to a slack variable, surplus is sometimes simply called nega- tive slack. To convert the first constraint, we begin by subtracting a surplus variable, S1, to create an equality:

Constraint 1 rewritten: 5X1 + 10X2 + 8X3 - S1 = 210

If, for example, a solution to an LP problem involving this constraint is X1 = 20, X2 = 8 and X3 = 5, the amount of surplus could be computed as follows:

5X1 + 10X2 + 8X3 - S1 = 210 51202 + 10182 + 8152 - S1 = 210

100 + 80 + 40 - S1 = 210 -S1 = 210 - 220

S1 = 10 surplus units

There is one more step, however, in preparing a Ú constraint for the simplex method.

Artificial Variables There is one small problem in trying to use the first constraint (as it has just been rewritten) in setting up an initial simplex solution. Since all “real” variables such as X1, X2, and X3 are set to 0 in the initial tableau, S1 takes on a negative value:

5102 + 10102 + 8102 - S1 = 210 0 - S1 = 210

S1 = -210

All variables in LP problems, be they real, slack, or surplus, must be nonnegative at all times. If S1 = -210, this important condition is violated.

To resolve the situation, we introduce one last kind of variable, called an artificial variable. We simply add the artificial variable, A1, to the constraint, as follows:

Constraint 1 completed: 5X1 + 10X2 + 8X3 - S1 + A1 = 210

To handle # and = constraints, the simplex method makes a conversion like it made to " constraints.

We subtract a surplus variable to form an equality when dealing with a # constraint.

Artificial variables are needed in # and = constraints.

Z08_REND3161_13_AIE_M07.indd 15 28/10/16 11:41 AM

M7-16  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Now, not only the X1, X2, and X3 variables but the S1 surplus variable as well may be set to 0 in the initial simplex solution. This leaves us with A1 = 210.

Let’s turn our attention to constraint 2 for a moment. This constraint is already an equality, so why worry about it? To be included in the initial simplex solution, it turns out that even an equality must have an artificial variable added to it:

Constraint 2 rewritten: 25X1 + 30X2 + A2 = 900

The reason for inserting an artificial variable into an equality constraint deals with the usual problem of finding an initial LP solution. In a simple constraint such as number 2, it’s easy to guess that X1 = 0, X2 = 30 would yield an initial feasible solution. But what if our problem had 10 equality constraints, each containing seven variables? It would be extremely difficult to sit down and “eyeball” a set of initial solutions. By adding artificial variables, such as A2, we can provide an automatic initial solution. In this case, when X1 and X2 are set equal to 0, A2 = 900.

Artificial variables have no meaning in a physical sense and are nothing more than computa- tional tools for generating initial LP solutions. If an artificial variable has a positive (nonzero) value, then the original constraint where this artificial variable was added has not been satisfied. A feasible solution has been found when all artificial variables are equal to zero, indicating all constraints have been met. Before the final simplex solution has been reached, all artificial variables must be gone from the solution mix. This matter is handled through the problem’s objective function.

Surplus and Artificial Variables in the Objective Function Whenever an artificial or surplus variable is added to one of the constraints, it must also be in- cluded in the other equations and in the problem’s objective function, just as was done for slack variables. Since artificial variables must be forced out of the solution, we can assign a very high Cj cost to each. In minimization problems, variables with low costs are the most desirable ones and the first to enter the solution. Variables with high costs leave the solution quickly, or never enter it at all. Rather than set an actual dollar figure of $10,000 or $1 million for each artificial variable, however, we simply use $M to represent a very large number.3 Surplus variables, like slack variables, carry a zero cost. In maximization problems, we use negative M.

If a problem had an objective function that read

Minimize cost = $5X1 + $9X2 + $7X3 and constraints such as the two mentioned previously, the completed objective function and con- straints would appear as follows:

Minimize cost = $5X1 + $9X2 + $7X3 + $0S1 + $MA1 + $MA2 subject to 5X1 + 10X2 + 8X3 - 1S1 + 1A1 + 0A2 = 210

25X1 + 30X2 + 0X3 + 0S1 + 0A1 + 1A2 = 900

M7.4 Solving Minimization Problems

Now that we have discussed how to deal with objective functions and constraints associated with minimization problems, let’s see how to use the simplex method to solve a typical problem.

The Muddy River Chemical Corporation Example The Muddy River Chemical Corporation must produce exactly 1,000 pounds of a special mixture of phosphate and potassium for a customer. Phosphate costs $5 per pound and potas- sium costs $6 per pound. No more than 300 pounds of phosphate can be used, and at least 150 pounds of potassium must be used. The problem is to determine the least-cost blend of the two ingredients.

Artificial variables have no physical meaning and drop out of the solution mix before the final tableau.

To make sure that an artificial variable is forced out before the final solution is reached, it is assigned a very high cost (M).

3A technical point: If an artificial variable is ever used in a maximization problem (an occasional event), it is assigned an objective function value of -$M to force it from the basis.

Z08_REND3161_13_AIE_M07.indd 16 28/10/16 11:41 AM

M7.4 Solving MiniMization ProbleMS  M7-17

This problem may be restated mathematically as

Minimize cost = $5X1 + $6X2 subject to X1 + X2 = 1,000 lb X1 … 300 lb X2 Ú 150 lb

X1, X2 Ú 0

where X1 = number of pounds of phosphate X2 = number of pounds of potassium

Note that there are three constraints, not counting the nonnegativity constraints: the first is an equality, the second is a less-than-or-equal-to constraint, and the third is a greater-than-or-equal- to constraint.

Graphical Analysis To have a better understanding of the problem, a brief graphical analysis may prove useful. There are only two decision variables, X1 and X2, so we are able to plot the constraints and feasible region. Because the first constraint, X1 + X2 = 1,000, is an equality, the solution must lie somewhere on the line ABC (see Figure M7.3). It must also lie between points A and B because of the constraint X1 … 300. The third constraint, X2 Ú 150, is actually redundant and nonbinding, since X2 will automatically be greater than 150 pounds if the first two con- straints are observed. Hence, the feasible region consists of all points on the line segment AB. As you recall from Chapter 7, however, an optimal solution will always lie at a corner point of the feasible region (even if the region is only a straight line). The solution must therefore be at either point A or point B. A quick analysis reveals that the least-cost solution lies at corner B—namely, X1 = 300 pounds of phosphate and X2 = 700 pounds of potassium. The total cost is $5,700.

You don’t need the simplex method to solve the Muddy River Chemical problem, of course. But we can guarantee you that few problems will be this simple. In general, you can expect to see several variables and many constraints. The purpose of this section is to illustrate the straightforward application of the simplex method to minimization problems. When the simplex procedure is used to solve this, it will methodically move from corner point to corner point until the optimal solution is reached. In Figure M7.3, the simplex method will begin at point E, then move to point F, then to point G, and finally to point B, which is the optimal solution.

Here is the mathematical formulation of the minimization problem for Muddy River Chemical Corporation.

Looking at a graphical solution first will help us understand the steps in the simplex method.

linear Programming Modeling in the Forests of Chile

Faced with a series of challenges in making short-term harvest- ing decisions, Forestal Arauco, a Chilean forestry firm, turned to professors at the University of Chile for LP modeling help. One of the problems in short-term harvesting of trees is to match the demand for products—defined by length and diameter—with the supply of standing timber.

The manual system used at the time by foresters led to a significant amount of waste timber, where larger-diameter logs, suited for export or sawmills, ended up being used for pulp, with a considerable loss in value. An LP model, labeled OPTICORT by the professors, was the logical way to get better schedules.

“The system not only optimized the operational decisions in harvesting, but also changed the way managers looked at the problem,” says Professor Andres Weintraub. “The model and its

concepts became the natural language to discuss the operations. They had to negotiate the parameters, and the model would do the dirty work. The system had to run in a few minutes to allow discussion and negotiation; that was a critical feature for the suc- cess of this tool,”* he adds.

The LP program took about 2 years to develop, and the re- searchers were careful to observe two cardinal rules: (1) the solu- tion approach had to be comfortable and clear to the user, and (2) the system had to provide answers to the user as soon as pos- sible, so the user could see quick improvements.

*From “Chilean Forestry Firm a ‘Model’ of Success” by Jenny Summerour in OR/MS Today, April 1999 INFORMS.

Source: Based on J. Summerour, “Chilean Forestry Firm a ‘Model’ of Success,” OR/MS Today (April 1999): 22–23, © Trevor S. Hale.

IN ACTION

Z08_REND3161_13_AIE_M07.indd 17 01/11/16 2:20 PM

M7-18  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Converting the Constraints and Objective Function The first step is to apply what we learned in the preceding section to convert the constraints and objective function into the proper form for the simplex method. The equality constraint, X1 + X2 = 1,000, just involves adding an artificial variable, A1:

X1 + X2 + A1 = 1,000

The second constraint, X1 … 300, requires the insertion of a slack variable—let’s call it S1:

X1 + S1 = 300

The last constraint is X2 Ú 150, which is converted to an equality by subtracting a surplus vari- able, S2, and adding an artificial variable, A2:

X2 - S2 + A2 = 150

Finally, the objective function, cost = $5X1 + $6X2, is rewritten as

Minimize cost = $5X1 + $6X2 + $0S1 + $0S2 + $MA1 + $MA2

The complete set of constraints can now be expressed as follows:

1X1 + 1X2 + 0S1 + 0S2 + 1A1 + 0A2 = 1,000 1X1 + 0X2 + 1S1 + 0S2 + 0A1 + 0A2 = 300 0X1 + 1X2 + 0S1 - 1S2 + 0A1 + 1A2 = 150

X1, X2, S1, S2, A1, A2 Ú 0

Rules of the Simplex Method for Minimization Problems Minimization problems are quite similar to the maximization problems tackled earlier in this module. The significant difference involves the Cj - Zj row. Our objective is to minimize cost, and a negative Cj - Zj value indicates that the total cost will decrease if that variable is selected to enter the solution. Thus, the new variable to enter the solution in each tableau (the pivot col- umn variable) will be the one with a negative Cj - Zj that gives the largest improvement. We

X2

1,000

0 200 400 600 800 X1

X1 + X2 = 1,000

X2 $ 150

A

1,000

800

600

400

200

100

B

C

X1 # 300

HF G

E D

FIGURE M7.3 Muddy River Chemical Corporation’s Feasible Region Graph

First, insert slack, surplus, and artificial variables. This makes it easier to set up the initial simplex tableau in Table M7.7.

The minimization simplex rules are slightly different. Now, the new variable to enter the solution mix will be in the column with the negative Cj − Zj value indicating the greatest improvement.

Z08_REND3161_13_AIE_M07.indd 18 28/10/16 11:41 AM

M7.4 SOLVING MINIMIzATION PRObLEMS  M7-19

choose the variable that decreases costs the most. In minimization problems, an optimal solution is reached when all the numbers in the Cj - Zj row are 0 or positive—just the opposite from the maximization case.4 All other simplex steps, as seen in the following, remain the same.

Steps for Simplex Minimization Problems

1. Choose the variable with a negative Cj - Zj that indicates the largest decrease in cost to enter the solution. The corresponding column is the pivot column.

2. Determine the row to be replaced by selecting the one with the smallest (nonnegative) ratio of quantity to pivot column substitution rate. This is the pivot row.

3. Calculate new values for the pivot row. 4. Calculate new values for the other rows. 5. Calculate the Zj and Cj - Zj values for this tableau. If there are any Cj - Zj numbers less

than 0, return to step 1.

First Simplex Tableau for the Muddy River Chemical Corporation Problem Now we solve Muddy River Chemical Corporation’s LP formulation using the simplex method. The initial tableau is set up just as in the earlier maximization example. Its first three rows are shown in the accompanying table. We note the presence of the $M costs associated with artificial variables A1 and A2, but we treat them as if they were any large number. As noted earlier, they have the effect of forcing the artificial variables out of the solution quickly because of their large costs.

Cj SOLUTION MIX X1 X2 S1 S2 A1 A2 QUANTITY

$M A1 1 1 0 0 1 0 1,000

$0 S1 1 0 1 0 0 0 300

$M A2 0 1 0 -1 0 1 150

The numbers in the Zj row are computed by multiplying the Cj column on the far left of the tableau times the corresponding numbers in the other columns. They are then entered in Table M7.7:

Zj 1for X1 column2 = $ M112 + $ 0112 + M 102 = $ M Zj 1for X2 column2 = $ M112 + $ 0102 + $ M112 = $ 2M Zj 1for S1 column2 = $ M102 + $ 0112 + $ M102 = $ 0 Zj 1for S2 column2 = $ M102 + $ 0102 + $ M1-12 = -$ M Zj 1for A1 column2 = $ M112 + $ 0102 + $ M102 = $ M Zj 1for A2 column2 = $M102 + $0102 + $M112 = $M Zj 1for total cost2 = $M11,0002 + $ 013002 + $M11502 = $ 1,150M

4We should note that there is a second way to solve minimization problems with the simplex method: it involves a simple mathematical trick. It happens that minimizing the cost objective is the same as maximizing the negative of the cost objective function. This means that instead of writing the Muddy River objective function as

Minimize cost = 5X1 + 6X2 we can instead write

Maximize 1-Cost2 = -5X1 - 6X2 The solution that maximizes 1-Cost2 also minimizes cost. It also means that the same simplex procedure shown earlier for maximization problems can be used if this trick is employed. The only change is that the objective function must be multiplied by 1-12.

Z08_REND3161_13_AIE_M07.indd 19 28/10/16 11:41 AM

M7-20  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

The Cj - Zj entries are determined as follows:

COLUMN

X1 X2 S1 S2 A1 A2

Cj for column $5 $6 $0 $0 $M $M

Zj for column $M $2M $0 -$M $M $M Cj - Zj for column -$M + $5 -$2M + $6 $0 $M $0 $0

Cj $5 $6 $0 $0 $M $M

SOLUTION MIX X1 X2 S1 S2 A1 A2 QUANTITY

$M A1 1 1 0 0 1 0 1,000

$0 S1 1 0 1 0 0 0 300

$M A2 0 1 0 -1 0 1 150 Pivot row

Pivot number

Zj $M $2M 0 -$ M $M $M $1,150M

Cj - Zj -$ M + 5 -$ 2M + 6 $0 $M $0 0 (Total cost) Pivot column

TABLE M7.7 Initial Simplex Tableau for the Muddy River Chemical Corporation Problem

This initial solution was obtained by letting each of the variables X1, X2, and S2 assume a value of 0. The current basic variables are A1 = 1,000, S1 = 300, and A2 = 150. This complete solution could be expressed in vector, or column, form asFX1X2S1

S2 A1 A2

V = F 00300 0

1,000

150

V An extremely high cost, $1,150M from Table M7.7, is associated with this answer. We know that this can be reduced significantly and now move on to the solution procedures.

Developing a Second Tableau In the Cj - Zj row of Table M7.7, we see that there are two entries with negative values, X1 and X2. In the simplex rules for minimization problems, this means that an optimal solution does not yet exist. The pivot column is the one with the negative entry in the Cj - Zj row that indicates the largest improvement—shown in Table M7.7 as the X2 column, which means that X2 will enter the solution next.

Which variable will leave the solution to make room for the new variable, X2? To find out, we divide the elements of the quantity column by the respective pivot column substitution rates:

For the A1 row = 1,000

1 = 1,000

For the S1 row = 300

0 1this is an undefined ratio, so we ignore it2

For the A2 row = 150

1 = 150 1smallest quotient, indicating pivot row2

Here is the initial simplex solution.

We examine whether the current solution is optimal by looking at the Cj - Zj row.

A2 is the pivot row because 150 is the smallest quotient.

Z08_REND3161_13_AIE_M07.indd 20 28/10/16 11:41 AM

M7.4 SOLVING MINIMIzATION PRObLEMS  M7-21

Hence, the pivot row is the A2 row, and the pivot number (circled) is at the intersection of the X2 column and the A2 row.

The entering row for the next simplex tableau is found by dividing each element in the pivot row by the pivot number, 1. This leaves the old pivot row unchanged, except that it now repre- sents the solution variable X2. The other two rows are altered one at a time by again applying the formula shown earlier in step 4:

1New row numbers2 = 1Numbers in old row2

- c aNumber above or below pivot number

b * aCorresponding number in newly replaced row

b d

A1 Row S1 Row

1 = 1 - 112102 1 = 1 - 102102 0 = 1 - 112112 0 = 0 - 102112 0 = 0 - 112102 1 = 1 - 102102 1 = 0 - 1121-12 0 = 0 - 1021-12 1 = 1 - 112102 0 = 0 - 102102

-1 = 0 - 112112 0 = 0 - 102112 850 = 1,000 - 11211502 300 = 300 - 10211502

Cj $5 $6 $0 $0 $M $M

SOLUTION MIX X1 X2 S1 S2 A1 A2 QUANTITY

$M A1 1 0 0 1 1 -1 850 $0 S1 1 0 1 0 0 0 300 Pivot row

Pivot number

$6 X2 0 1 0 -1 0 1 150

Zj $M $6 $0 $ M - 6 $M -$ M + 6 $850M + $900 Cj - Zj -$ M + 5 $0 $0 -$ M + 6 $0 $ 2M - 6

Pivot column

TABLE M7.8 Second Simplex Tableau for the Muddy River Chemical Corporation Problem

The Zj and Cj - Zj rows are computed next:

Zj 1for X12 = $M112 + $0112 + $6102 = $M Zj 1for X22 = $M102 + $0102 + $6112 = $6 Zj 1for S12 = $M102 + $0112 + $6102 = $0 Zj 1for S22 = $M112 + $0102 + $61-12 = $M - 6 Zj 1for A12 = $M112 + $0102 + $6102 = $M Zj 1for A22 = $M1-12 + $0102 + $6112 = -$M + 6 Zj 1for total cost2 = $M18502 + $013002 + $611502 = $850M + 900

COLUMN

X1 X2 S1 S2 A1 A2

Cj for column $5 $6 $0 $0 $M $M

Zj for column $M $6 $0 $ M - 6 $M -$ M + 6 Cj - Zj for column -$ M + 5 $0 $0 -$ M + 6 $0 $ 2M - 6

All of these computational results are presented in Table M7.8.

Z08_REND3161_13_AIE_M07.indd 21 28/10/16 11:41 AM

M7-22  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

The solution at the end of the second tableau (point F in Figure M7.3) is A1 = 850, S1 = 300, and X2 = 150. X1, S2, and A2 are currently the nonbasic variables and have zero value. The cost at this point is still quite high, $850M + $900. This answer is not optimal because not every number in the Cj - Zj row is zero or positive.

Developing a Third Tableau The new pivot column is the X1 column. To determine which variable will leave the basis to make room for X1, we check the quantity column–to–pivot column ratios again:

For the A1 row = 850

1 = 850

For the S1 row = 300

1 = 300 1smallest ratio2

For the X2 row = 150

0 = undefined

The solution after the second tableau is still not optimal.

The third tableau is developed in this section.

Cj $5 $6 $0 $0 $M $M

SOLUTION MIX

X1 X2 S1 S2 A1 A2 QUANTITY

$M A1 0 0 -1 1 1 -1 550 Pivot row $5 X1 1 0 1 0 0 0 300 Pivot number

$6 X2 0 1 0 -1 0 1 150

Zj $5 $6 -$ M + 5 $ M - 6 $M -$ M + 6 $ 550M + 2,400 Cj - Zj $0 $0 $ M - 5 -$ M + 6 $0 $ 2M - 6

Pivot column

TABLE M7.9 Third Simplex Tableau for the Muddy River Chemical Corporation Problem

Hence, variable S1 will be replaced by X1. 5 The pivot number, row, and column are labeled

in Table M7.8. To replace the pivot row, we divide each number in the S1 row by 1 (the circled pivot num-

ber), leaving the row unchanged. The new X1 row is shown in Table M7.9. The other computa- tions for this third simplex tableau follow:

A1 Row S1 Row

0 = 1 - 112112 0 = 0 - 102112 0 = 0 - 112102 1 = 1 - 102102

-1 = 0 - 112112 0 = 0 - 102112 1 = 1 - 112102 -1 = -1 - 102102 1 = 1 - 112102 0 = 0 - 102102

-1 = -1 - 112102 1 = 1 - 102102 550 = 850 - 11213002 150 = 150 - 10213002

5At this point, it might appear to be more cost effective to replace the A1 row instead of the S1 row. This would remove the last artificial variable, and its large $M cost, from the basis. The simplex method, however, does not always pick the most direct route to reaching the final solution. You may be assured, though, that it will lead us to the correct answer. In Figure M7.3, this would involve moving to point H instead of point G.

Here are the computations for the third solution.

Z08_REND3161_13_AIE_M07.indd 22 28/10/16 11:41 AM

M7.4 SOLVING MINIMIzATION PRObLEMS  M7-23

The Zj and Cj - Zj rows are computed next:

Zj 1for X12 = $ M102 + $ 5112 + $ 6102 = $ 5 Zj 1for X22 = $ M102 + $ 5102 + $ 6112 = $ 6 Zj 1for S12 = $ M1-12 + $ 5112 + $ 6102 = -$ M + 5 Zj 1for S22 = $ M112 + $ 5102 + $ 61-12 = $ M - 6 Zj 1for A12 = $ M112 + $ 5102 + $ 6102 = $ M Zj 1for A22 = $ M1-12 + $ 5102 + $ 6112 = -$ M + 6 Zj 1for total cost2 = $ M15502 + $ 513002 + $ 611502 = $ 550M + 2,400

COLUMN

X1 X2 S1 S2 A1 A2

Cj for column $5 $6 $0 $0 $M $M

Zj for column $5 $6 -$ M + 5 $ M - 6 $M -$ M + 6 Cj - Zj for column $0 $0 $ M - 5 -$ M + 6 $0 $ 2M - 6

The solution at the end of the three iterations (point G in Figure M7.3) is still not optimal because the S2 column contains a Cj - Zj value that is negative. Note that the current total cost is nonetheless lower than at the end of the second tableau, which in turn is lower than the initial solution cost. We are headed in the right direction but have one more tableau to go!

Fourth Tableau for the Muddy River Chemical Corporation Problem The pivot column is now the S2 column. The ratios that determine the row and variable to be replaced are computed as follows:

For the A1 row: 550

1 = 550 1row to be replaced2

For the X1 row: 300

0 1undefined2

For the X2 row: 150

-1 1not considered because it is negative2

Each number in the pivot row is divided by the pivot number (again 1, by coincidence). The other two rows are computed as follows and are shown in Table M7.10:

X1 Row X2 Row

1 = 1 - 102102 0 = 0 - 1-12102 0 = 0 - 102102 1 = 1 - 1-12102 1 = 1 - 1021-12 -1 = 0 - 1-121-12 0 = 0 - 102112 0 = -1 - 1-12112 0 = 0 - 102112 1 = 0 - 1-12112 0 = 0 - 1021-12 0 = 1 - 1-121-12

300 = 300 - 10215502 700 = 150 - 1-1215502

Zj 1for X12 = $0102 + $5112 + $6102 = $5 Zj 1for X22 = $0102 + $5102 + $6112 = $6 Zj 1for S12 = $01-12 + $5112 + $61-12 = -$1 Zj 1for S22 = $0112 + $5102 + $6102 = $0 Zj 1for A12 = $0112 + $5102 + $6112 = $6 Zj 1for A22 = $01-12 + $5102 + $6102 = $0 Zj 1for total cost2 = $015502 + $513002 + $617002 = $5,700

The third solution is still not optimal.

Here are the computations for the fourth solution.

Z08_REND3161_13_AIE_M07.indd 23 28/10/16 11:41 AM

M7-24  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

COLUMN

X1 X2 S1 S2 A1 A2

Cj for column $5 $6 $0 $0 $M $M

Zj for column $5 $6 -$ 1 $0 $6 $0 Cj - Zj for column $0 $0 $1 $0 $M - 6 $M

Cj $5 $6 $0 $0 $M $M

SOLUTION MIX X1 X2 S1 S2 A1 A2 QUANTITY

$0 S2 0 0 -1 1 1 -1 550 $5 X1 1 0 1 0 0 0 300

$6 X2 0 1 -1 0 1 0 700

Zj $5 $6 -$ 1 $0 $6 $0 $5,700 Cj - Zj $0 $0 $1 $0 $ M - 6 $M

TABLE M7.10 Fourth and Optimal Solution to the Muddy River Chemical Corporation Problem

On examining the Cj - Zj row in Table M7.10, only positive or 0 values are found. The fourth tableau therefore contains the optimum solution. That solution is X1 = 300, X2 = 700, and S2 = 550. The artificial variables are both equal to 0, as is S1. Translated into management terms, the chemical company’s decision should be to blend 300 pounds of phosphate 1X12 with 700 pounds of potassium 1X22. This provides a surplus 1S22 of 550 pounds of potassium more than required by the constraint X2 Ú 150. The cost of this solution is $5,700. If you look back to Figure M7.3, you can see that this is identical to the answer found by the graphical approach.

Although small problems such as this can be solved graphically, more realistic product blending problems demand use of the simplex method, usually in computerized form.

Review of Procedures for Solving LP Minimization Problems Just as we summarized the steps for solving LP maximization problems with the simplex method, let us do so for minimization problems here:

I. Formulate the LP problem’s objective function and constraints. II. Include slack variables in each less-than-or-equal-to constraint, artificial variables in each

equality constraint, and both surplus and artificial variables in each greater-than-or-equal- to constraint. Then add all of these variables to the problem’s objective function.

III. Develop an initial simplex tableau with artificial and slack variables in the basis and the other variables set equal to 0. Compute the Zj and Cj - Zj values for this tableau.

IV. Follow these five steps until an optimal solution has been reached:

1. Choose the variable with the negative Cj - Zj indicating the greatest improvement to enter the solution. This is the pivot column.

2. Determine the row to be replaced by selecting the one with the smallest (nonnegative) ratio of quantity to pivot column substitution rate. This is the pivot row.

3. Calculate the new values for the pivot row. 4. Calculate the new values for the other row(s). 5. Calculate the Zj and Cj - Zj values for the tableau. If there are any Cj - Zj numbers

less than 0, return to step 1. If there are no Cj - Zj numbers that are less than 0, an optimal solution has been reached.

The optimal solution has been reached because only positive or zero values appear in the Cj - Zj row.

Z08_REND3161_13_AIE_M07.indd 24 28/10/16 11:41 AM

M7.5 SPECIAL CASES  M7-25

M7.5 Special Cases

In Chapter 7, we addressed some special cases that may arise when solving LP problems graphi- cally (see Section 7.6). Here we describe these cases again, this time as they refer to the simplex method.

Infeasibility Infeasibility, you may recall, comes about when there is no solution that satisfies all of the problem’s constraints. In the simplex method, an infeasible solution is indicated by looking at the final tableau. In it, all Cj - Zj row entries will be of the proper sign to imply optimality, but an artificial variable 1A12 will still be in the solution mix.

Table M7.11 illustrates the final simplex tableau for a hypothetical minimization type of LP problem. The table provides an example of an improperly formulated problem, probably con- taining conflicting constraints. No feasible solution is possible because an artificial variable, A2, remains in the solution mix, even though all Cj - Zj entries are positive or 0 (the criterion for an optimal solution in a minimization case).

Unbounded Solutions Unboundedness describes linear programs that do not have finite solutions. It occurs in maxi- mization problems, for example, when a solution variable can be made infinitely large without violating a constraint. In the simplex method, the condition of unboundedness will be discovered prior to reaching the final tableau. We will note the problem when trying to decide which vari- able to remove from the solution mix. As seen earlier in this module, the procedure is to divide each quantity column number by the corresponding pivot column number. The row with the smallest positive ratio is replaced. But if all the ratios turn out to be negative or undefined, it indicates that the problem is unbounded.

Table M7.12 illustrates the second tableau calculated for a particular LP maximization problem by the simplex method. It also points to the condition of unboundedness. The solution is not optimal because not all Cj - Zj entries are 0 or negative, as required in a maximization problem. The next variable to enter the solution should be X1. To determine which variable will leave the solution, we examine the ratios of the quantity column numbers to their corresponding numbers in the X1, or pivot, column:

Ratio for the X2 row: 30

-1

Ratio for the S2 row: 10

-2 Negative ratios unacceptable

Since both pivot column numbers are negative, an unbounded solution is indicated.

A situation with no feasible solution may exist if the problem was formulated improperly.

No finite solution may exist in problems that are not bounded. This means that a variable can be infinitely large without violating a constraint.

Cj $5 $8 $0 $0 $M $M

SOLUTION MIX X1 X2 S1 S2 A1 A2 QUANTITY

$5 X1 1 0 -2 3 -1 0 200 $8 X2 0 1 1 2 -2 0 100

$M A2 0 0 0 -1 -1 1 20

Zj $5 $8 -$ 2 $ 31 - M -21 - M $M $ 1,800 + 20M Cj - Zj $0 $0 $2 $ M - 31 $ 2M + 21 $0

TABLE M7.11 Illustration of Infeasibility

Z08_REND3161_13_AIE_M07.indd 25 28/10/16 11:41 AM

M7-26  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Degeneracy Degeneracy is another situation that can occur when solving an LP problem using the simplex method. It develops when three (or more) constraints pass through a single point. For example, suppose a problem has only these three constraints X1 … 10, X2 … 10, and X1 + X2 6 20. All three constraint lines will pass through the point 110, 102. Degeneracy is first recognized when the ratio calculations are made. If there is a tie for the smallest ratio, this is a signal that degen- eracy exists. As a result of this, when the next tableau is developed, one of the variables in the solution mix will have a value of zero.

Table M7.13 provides an example of a degenerate problem. At this iteration of the given maximization LP problem, the next variable to enter the solution will be X1, since it has the only positive Cj - Zj number. The ratios are computed as follows:

For the X2 row: 10

0.25 = 40

For the S2 row: 20

4 = 5 Tie for the smallest ratio indicates degeneracy

For the S3 row: 10

2 = 5

Theoretically, degeneracy could lead to a situation known as cycling, in which the simplex algorithm alternates back and forth between the same nonoptimal solutions; that is, it puts a new variable in, then takes it out in the next tableau, then puts it back in, and so on. One simple way of dealing with the issue is to select either row (S2 or S3, in this case) arbitrarily. If we are unlucky and cycling does occur, we simply go back and select the other row.

Cj $6 $9 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$9 X2 -1 1 2 0 30 $0 S2 -2 0 -1 1 10

Zj -$ 9 $9 $18 $0 $270

Cj - Zj $15 $0 -$ 18 $0 Pivot column

TABLE M7.12 Problem with an Unbounded Solution

Tied ratios in the simplex calculations signal degeneracy.

Cycling may result from degeneracy.

Cj $5 $8 $2 $0 $0 $0

SOLUTION MIX X1 X2 X3 S1 S2 S3 QUANTITY

$8 X2 0.25 1 1 -2 0 0 10 $0 S2 4 0 0.33 -1 1 0 20

$0 S3 2 0 2 0.4 0 1 10

Zj $2 $8 $8 $16 $0 $0 $80

Cj - Zj $3 $0 -$ 6 -$ 16 $0 $0 Pivot column

TABLE M7.13 Problem Illustrating Degeneracy

Z08_REND3161_13_AIE_M07.indd 26 28/10/16 11:41 AM

M7.6 SENSITIVITy ANALySIS wITH THE SIMPLEX TAbLEAU  M7-27

More Than One Optimal Solution Multiple, or alternate, optimal solutions can be spotted when the simplex method is being used by looking at the final tableau. If the Cj - Zj value is equal to 0 for a variable that is not in the solution mix, more than one optimal solution exists.

Let’s take Table M7.14 as an example. Here is the last tableau of a maximization problem; each entry in the Cj - Zj row is 0 or negative, indicating that an optimal solution has been reached. That solution is read as X2 = 6, S2 = 3, and profit = $12. Note, however, that vari- able X1 can be brought into the solution mix without increasing or decreasing profit. The new solution, with X1 in the basis, would become X1 = 3 and X2 = 1.5, with profit still at $12. Can you modify Table M7.14 to prove this?

M7.6 Sensitivity Analysis with the Simplex Tableau

In Chapter 7, we introduce the topic of sensitivity analysis as it applies to LP problems that we have solved graphically. This valuable concept shows how the optimal solution and the value of its objective function change given changes in various inputs to the problem. Graphical analy- sis is useful in understanding intuitively and visually how feasible regions and the slopes of objective functions can change as model coefficients change. Computer programs handling LP problems of all sizes provide sensitivity analysis as an important output feature. Those programs use the information provided in the final simplex tableau to compute ranges for the objective function coefficients and ranges for the RHS values. They also provide shadow prices, a concept that we introduce in this section.

High Note Sound Company Revisited In Chapter 7, we use the High Note Sound Company to illustrate sensitivity analysis graphically. High Note is a firm that makes quality speakers (called X1) and stereo receivers (called X2). Its LP formulation is repeated here:

Maximize profit = $ 50X1 + $ 120X2 subject to 2X1 + 4X2 … 80 1hours of electricians> time available2

3X1 + 1X2 … 60 1hours of audio technicians> time available2 High Note’s graphical solution is repeated in Figure M7.4.

Cj $3 $2 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$2 X2 1.5 1 1 0 6

$0 S2 1 0 0.5 1 3

Zj $3 $2 $2 $0 $12

Cj - Zj $0 $0 -$ 2 $0

TABLE M7.14 Problem with Alternate Optimal Solutions

Alternate optimal solutions may exist if the Cj − Zj value = 0 for a variable not in the solution mix.

Z08_REND3161_13_AIE_M07.indd 27 28/10/16 11:41 AM

M7-28  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Changes in the Objective Function Coefficients In Chapter 7, we saw how to use graphical LP to examine the objective function coefficients. A second way of illustrating the sensitivity analysis of objective function coefficients is to consider the problem’s final simplex tableau. For the High Note Sound Company, this tableau is shown in Table M7.15. The optimal solution is seen to be as follows:

X2 = 20 stereo receivers S2 = 40 hours of slack time of audio technicians

f Basic variables

X1 = 0 Speakers S1 = 0 hours of slack time of electricians

f Nonbasic variables

Basic variables (those in the solution mix) and nonbasic variables (those set equal to 0) must be handled differently using sensitivity analysis. Let us first consider the case of a nonbasic variable.

10 20 30 40 50 60

60

40

20

10

0 X 1

X 2

a = (0, 20)

b

Isoprofit Line: $2,400 = 50X1 + 120X2

= (16, 12)

Optimal Solution at Point a

X 1 = 0 Speakers X 2 = 20 Receivers Profits = $2,400

c = (20, 0)

(receivers)

(Speakers)

FIGURE M7.4 High Note Sound Company Graphical Solution

Cj $50 $120 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$120 X2 0.5 1 0.25 0 20

$0 S2 2.5 0 -0.25 1 40

Zj $60 $120 $30 $0 $2,400

Cj - Zj -$ 10 $0 -$ 30 $0

TABLE M7.15 Optimal Solution by the Simplex Method

NONBASIC OBJECTIVE FUNCTION COEFFICIENT Our goal here is to find out how sensitive the problem’s optimal solution is to changes in the contribution rates of variables not currently in the basis (X1 and S1). Just how much would the objective function coefficients have to change before X1 or S1 would enter the solution mix and replace one of the basic variables?

Nonbasic variables are variables that have a value of zero.

Z08_REND3161_13_AIE_M07.indd 28 28/10/16 11:41 AM

M7.6 SENSITIVITy ANALySIS wITH THE SIMPLEX TAbLEAU  M7-29

The answer lies in the Cj - Zj row of the final simplex tableau (as in Table M7.15). Since this is a maximization problem, the basis will not change unless the Cj - Zj value of one of the nonbasic variables becomes positive. That is, the current solution will be optimal as long as all numbers in the bottom row are less than or equal to 0. It will not be optimal if X1’s Cj - Zj value is positive or if S1’s Cj - Zj value is greater than 0. Therefore, the values of Cj for X1 and S1 that do not bring about any change in the optimal solution are given by

Cj - Zj … 0

This is the same as writing

Cj … Zj Since X1’s Cj value is $50 and its Zj value is $60, the current solution is optimal as long as the profit per speaker does not exceed $60 or, correspondingly, does not increase by more than $10. Similarly, the contribution rate per unit of S1 (or per hour of electrician’s time) may increase from $0 up to $30 without changing the current solution mix.

In both cases, when you are maximizing an objective function, you may increase the value of Cj up to the value of Zj. You may also decrease the value of Cj for a nonbasic variable to nega- tive infinity 1- ∞2 without affecting the solution. This range of Cj values is called the range of insignificance for nonbasic variables.

- ∞ … Cj 1for X12 … $ 60 - ∞ … Cj 1for S12 … $ 30

BASIC OBJECTIVE FUNCTION COEFFICIENT Sensitivity analysis on objective function coefficients of variables that are in the basis or solution mix is slightly more complex. We saw that a change in the objective function coefficient for a nonbasic variable affects only the Cj - Zj value for that variable. But a change in the profit or cost of a basic variable can affect the Cj - Zj values of all nonbasic variables because this Cj is not only in the Cj row but also in the Cj column. This then impacts the Zj row.

Let us consider changing the profit contribution of stereo receivers in the High Note Sound Company problem. Currently, the objective function coefficient is $120. The change in this value can be denoted by the Greek capital letter delta 1∆2. We rework the final simplex tableau (first shown in Table M7.15) and see our results in Table M7.16.

Notice the new Cj - Zj values for nonbasic variables X1 and S1. These were determined in exactly the same way as we did earlier in this module. But wherever the Cj value for X2 of $120 was seen in Table M7.15, a new value of $120 + ∆ is used in Table M7.16.

Once again, we recognize that the current optimal solution will change only if one or more of the Cj - Zj row values becomes greater than 0. The question is, how may the value of ∆ vary so that all Cj - Zj entries remain negative? To find out, we solve for ∆ in each column.

From the X1 column:

-10 - 0.5∆ … 0 -10 … 0.5∆ -20 … ∆ or ∆ Ú -20

The solution is optimal as long as all Cj − Zj " 0.

The range over which Cj rates for nonbasic variables can vary without causing a change in the optimal solution mix is called the range of insignificance.

Testing basic variables involves reworking the final simplex tableau.

Cj $50 $120 + Δ $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$120 + ∆ X2 0.5 1 0.25 0 20 $0 S2 2.5 0 -0.25 1 40

Zj $ 60 + 0.5∆ $ 120 + ∆ $ 30 + 0.25∆ $0 $ 2,400 + 20∆ Cj - Zj -$ 10 - 0.5∆ $0 -$ 30 - 0.25∆ $0

TABLE M7.16 Change in the Profit Contribution of Stereo Receivers

Z08_REND3161_13_AIE_M07.indd 29 28/10/16 11:41 AM

M7-30  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

This inequality means that the optimal solution will not change unless X2’s profit coefficient decreases by at least $20, which is a change of ∆ = -$20. Hence, variable X1 will not enter the basis unless the profit per stereo receiver drops from $120 to $100 or less. This, interestingly, is exactly what we noticed graphically in Chapter 7. When the profit per stereo receiver dropped to $80, the optimal solution changed from corner point a to corner point b.

Now we examine the S1 column:

-30 - 0.25∆ … 0 -30 … 0.25∆ -120 … ∆ or ∆ Ú -120

This inequality implies that S1 is less sensitive to change than X1. S1 will not enter the basis unless the profit per unit of X2 drops from $120 all the way down to $0.

Since the first inequality is more binding, we can say that the range of optimality for X2’s profit coefficient is

$ 100 … Cj1for X22 … ∞ As long as the profit per stereo receiver is greater than or equal to $100, the current production mix of X2 = 20 receivers and X1 = 0 speakers will be optimal.

In analyzing larger problems, we would use this procedure to test for the range of optimal- ity of every real decision variable in the final solution mix. The procedure helps us avoid the time-consuming process of reformulating and resolving the entire LP problem each time a small change occurs. Within the bounds set, changes in profit coefficients would not force a firm to alter its product mix decision or change the number of units produced. Overall profits, of course, will change if a profit coefficient increases or decreases, but such computations are quick and easy to perform.

Changes in Resources or RHS Values Making changes in the RHS values (the resources of electricians’ and audio technicians’ time) results in changes in the feasible region and often the optimal solution.

SHADOW PRICES This leads us to the important subject of shadow prices. Exactly how much should a firm be willing to pay to make additional resources available? Is one more hour of ma- chine time worth $1 or $5 or $20? Is it worthwhile to pay workers an overtime rate to stay one extra hour each night to increase production output? Valuable management information could be provided if the worth of additional resources were known.

Fortunately, this information is available to us by looking at the final simplex tableau of an LP problem. An important property of the Cj - Zj row is that the negatives of the numbers in its slack variable 1Si2 columns provide us with what we call shadow prices. A shadow price is the change in value of the objective function from an increase of one unit of a scarce resource (e.g., when one more hour of machine time or labor time or other resource is made available).

The final simplex tableau for the High Note Sound Company problem is repeated as Table M7.17 (it was first shown as Table M7.15). The tableau indicates that the optimal solution is X1 = 0, X2 = 20, S1 = 0, and S2 = 40 and that profit = $ 2,400. Recall that S1 represents slack availability of the electricians’ resource and S2 the unused time in the audio technicians’ department.

The firm is considering hiring an extra electrician on a part-time basis. Let’s say that it will cost $22 per hour in wages and benefits to bring the part-timer on board. Should the firm do this? The answer is yes: the shadow price of the electrician time resource is $30. Thus, the firm will net $8 1=$30 - $222 for every hour the new worker helps in the production process.

Should High Note also hire a part-time audio technician at a rate of $14 per hour? The answer is no: the shadow price is $0, implying no increase in the objective function by making more of this second resource available. Why? Because not all of the resource is currently being used—40 hours are still available. It would hardly pay to buy more of the resource.

RIGHT-HAND-SIDE RANGING Obviously, we can’t add an unlimited number of units of resource with- out eventually violating one of the problem’s constraints. When we understand and compute the

The range of optimality is the range of values over which a basic variable’s coefficient can change without causing a change in the optimal solution mix.

The shadow price is the value of one additional unit of a scarce resource. Shadow pricing provides an important piece of economic information.

The negatives of the numbers in the Cj − Zj row’s slack variable columns are the shadow prices.

Z08_REND3161_13_AIE_M07.indd 30 28/10/16 11:41 AM

M7.6 SENSITIVITy ANALySIS wITH THE SIMPLEX TAbLEAU  M7-31

shadow price for an additional hour of electricians’ time ($30), we will want to determine how many hours we can actually use to increase profits. Should the new resource be added 1 hour, 2 hours, or 200 hours per week? In LP terms, this process involves finding the range over which shadow prices will stay valid. Right-hand-side ranging tells us the number of hours High Note can add or remove from the electrician department and still have a shadow price of $30.

Ranging is simple in that it resembles the simplex process we used earlier in this mod- ule to find the minimum ratio for a new variable. The S1 column and quantity column from Table M7.17 are repeated in the following table; the ratios, both positive and negative, are also shown:

QUANTITY S1 RATIO

20 0.25 20>0.25 = 80 40 -0.25 40>-0.25 = -160

The range over which shadow prices remain valid is called right-hand-side ranging.

Cj $50 $120 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$120 X2 0.5 1 0.25 0 20

$0 S2 2.5 0 -0.25 1 40

Zj $60 $120 $30 $0 $2,400

Cj - Zj - $ 10 $0 -$ 30 $0 Objective function increases by $30 if 1 additional hour of electricians’ time is made available

TABLE M7.17 Final Tableau for the High Note Sound Company

The smallest positive ratio (80, in this example) tells us by how many hours the electricians’ time resource can be reduced without altering the current solution mix. Hence, we can decrease the RHS resource by as much as 80 hours—basically from the current 80 hours all the way down to 0 hours—without causing a basic variable to be pivoted out of the solution.

The smallest negative ratio 1-1602 tells us the number of hours that can be added to the resource before the solution mix changes. In this case, we can increase electricians’ time by 160 hours, up to 240 1= 80 currently + 160 may be added2 hours. We have now established the range of electricians’ time over which the shadow price of $30 is valid. That range is from 0 to 240 hours.

The audio technician resource is slightly different in that all 60 hours of time originally available have not been used. (Note that S2 = 40 hours in Table M7.17.) If we apply the ratio test, we see that we can reduce the number of audio technicians’ hours by only 40 (the small- est positive ratio = 40>1) before a shortage occurs. But since we are not using all the hours currently available, we can increase them indefinitely without altering the problem’s solution. Note that there are no negative substitution rates in the S2 column, so there are no negative ratios. Hence, the valid range for this shadow price would be from 20 1= 60 - 402 hours to an unbounded upper limit.

The substitution rates in the slack variable column can also be used to determine the actual values of the solution mix variables if the right-hand side of a constraint is changed. The follow- ing relationship is used to find these values:

New quantity = Original quantity + 1Substution rate21Change in right@hand side2Changes in the RHS values of constraints may change the optimal quantity values of the solution mix variables.

Z08_REND3161_13_AIE_M07.indd 31 28/10/16 11:41 AM

M7-32  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

For example, if 12 more electrician hours were made available, the new values in the quan- tity column of the simplex tableau are found as follows:

ORIGINAL QUANTITY S1 NEW QUANTITY

20 0.25 20 + 10.2521122 = 23 40 -0.25 40 + 1-0.2521122 = 37

Thus, if 12 hours are added, X2 = 23 and S2 = 37. All other variables are nonbasic and remain zero. This yields a total profit of 50102 + 1201232 = $ 2,760, which is an increase of $360 (or the shadow price of $30 per hour for 12 hours of electrician time). A similar analysis with the other constraint and the S2 column would show that if any additional audio technician hours were added, only the slack for that constraint would increase.

M7.7 The Dual

Every LP problem has another LP problem associated with it, which is called its dual. The first way of stating a linear problem is called the primal of the problem; we can view all of the problems formulated thus far as primals. The second way of stating the same problem is called the dual. The optimal solutions for the primal and the dual are equivalent, but they are derived through alternative procedures.

The dual contains economic information useful to management, and it may also be easier to solve, in terms of less computation, than the primal problem. Generally, if the LP primal involves maximizing a profit function subject to less-than-or-equal-to resource constraints, the dual will involve minimizing total opportunity costs subject to greater-than-or-equal-to product profit constraints. Formulating the dual problem from a given primal is not terribly complex, and once it is formulated, the solution procedure is exactly the same as for any LP problem.

Let’s illustrate the primal–dual relationship with the High Note Sound Company data. As you recall, the primal problem is to determine the best production mix of Speakers 1X12 and stereo receivers 1X22 to maximize profit:

Maximize profit = $ 50X1 + $ 120X2 subject to 2X1 + 4X2 … 80 1hours of electricians> time available2

3X1 + 1X2 … 60 1hours of audio technicians> time available2 The dual of this problem has the objective of minimizing the opportunity cost of not using the resources in an optimal manner. Let’s call the variables that it will attempt to solve for U1 and U2. U1 represents the potential hourly contribution or worth of electrician time—in other words, the dual value of 1 hour of the electrician’ resource. U2 stands for the imputed worth of the audio technicians’ time, or the dual technician resource. Thus, each constraint in the primal problem will have a corresponding variable in the dual problem. Also, each decision variable in the pri- mal problem will have a corresponding constraint in the dual problem.

The RHS quantities of the primal constraints become the dual’s objective function coef- ficients. The total opportunity cost that is to be minimized will be represented by the function 80U1 + 60U2—that is,

Minimize opportunity cost = 80U1 + 60U2

The corresponding dual constraints are formed from the transpose6 of the primal constraints’ coefficients. Note that if the primal constraints are … , the dual constraints are Ú :

2 U1 + 3 U2 Ú 50 Primal profit coefficients 4 U1 + 1 U2 Ú 120 Coefficients from the second primal constraint Coefficients from the first primal constraint

Every LP primal has a dual. The dual provides useful economic information.

The dual variables represent the potential value of resources.

6For example, the transpose of the set of numbers aa b c d

b is aa c b d

b . In the case of the transpose of the primal coefficients a2 4

3 1 b , the result is a2 3

4 1 b . Refer to Module 5, which deals with matrices and determinants, for a review of the trans-

pose concept.

Z08_REND3161_13_AIE_M07.indd 32 28/10/16 11:41 AM

M7.7 THE DUAL  M7-33

Let’s look at the meaning of these dual constraints. In the first inequality, the RHS constant ($50) is the income from one speaker. The coefficients of U1 and U2 are the amounts of each scarce resource (electrician time and audio technician time) that are required to produce a speaker. That is, 2 hours of electricians’ time and 3 hours of audio technicians’ time are used up in making one speaker. Each speaker produced yields $50 of revenue to High Note Sound Company. This inequality states that the total imputed value or potential worth of the scarce resources needed to produce a speaker must be at least equal to the profit derived from the product. The second constraint makes an analogous statement for the stereo receiver product.

Dual Formulation Procedures The mechanics of formulating a dual from the primal problem are summarized in the following list.

Steps to Form a Dual

1. If the primal is a maximization, the dual is a minimization, and vice versa. 2. The RHS values of the primal constraints become the dual’s objective function coefficients. 3. The primal objective function coefficients become the RHS values of the dual constraints. 4. The transpose of the primal constraint coefficients becomes the dual constraint coefficients. 5. Constraint inequality signs are reversed.7

Solving the Dual of the High Note Sound Company Problem The simplex algorithm is applied to solve the preceding dual problem. With appropriate surplus and artificial variables, it can be restated as follows:

Minimize opportunity cost = 80U1 + 60U2 + 0S1 + 0S2 + MA1 + MA2

subject to 2U1 + 3U2 - 1S1 + 1A1 = 50

4U1 + 1U2 - 1S2 + 1A2 = 120

The first and second tableaus are shown in Table M7.18. The third tableau—containing the opti- mal solution of U1 = 30, U2 = 0, S1 = 10, S2 = 0, and opportunity cost = $ 2,400—appears in Figure M7.5, along with the final tableau of the primal problem.

7If the jth primal constraint should be an equality, the ith dual variable is unrestricted in sign. This technical issue is discussed in L. Cooper and D. Steinberg, Methods and Applications of Linear Programming (Philadelphia: W. B. Saunders, 1974), p. 170.

These are the five steps for formulating a dual.

Cj 80 60 0 0 M M

SOLUTION MIX U1 U2 S1 S2 A1 A2 QUANTITY

First tableau

$M A1 2 3 -1 0 1 0 50 $M A2 4 1 0 -1 0 1 120

Zj $6M $4M -$ M -$M $M $M $170M

Cj - Zj 80 - 6M 60 - 4M M M 0 0

Second tableau

$80 U1 1 1.5 -0.5 0 0.5 0 25

$M A2 0 -5 2 -1 -2 1 20

Zj $80 $ 120 - 5M -$ 40 + 2M -$ M $ 40 - 2M $M $ 2,000 + 20M Cj - Zj 0 5M - 60 -2M + 40 M 3M - 40 0

TABLE M7.18 First and Second Tableaus of the High Note Dual Problem

Z08_REND3161_13_AIE_M07.indd 33 28/10/16 11:41 AM

M7-34  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

We mentioned earlier that the primal and dual lead to the same solution even though they are formulated differently. How can this be?

It turns out that in the final simplex tableau of a primal problem, the absolute values of the numbers in the Cj - Zj row under the slack variables represent the solutions to the dual prob- lem—that is, the optimal Uis (see Figure M7.5). In the earlier section on sensitivity analysis, we termed these numbers in the columns of the slack variables shadow prices. Thus, the solution to the dual problem presents the marginal profits of each additional unit of resource.

It also happens that the absolute value of the Cj - Zj values of the slack variables in the optimal dual solution represent the optimal values of the primal X1 and X2 variables. The minimum opportunity cost derived in the dual must always equal the maximum profit derived in the primal.

Also note the other relationships between the primal and the dual that are indicated in Figure M7.5 by arrows. Columns A1 and A2 in the optimal dual tableau may be ignored because, as you recall, artificial variables have no physical meaning.

M7.8 Karmarkar’s Algorithm

The biggest change to take place in the field of LP solution techniques in four decades was the 1984 arrival of an alternative to the simplex algorithm. Developed by Narendra Karmarkar, the new method, called Karmarkar’s algorithm, often takes significantly less computer time to solve very large-scale LP problems.8

Solution Mix

$120

$0

Cj

X2

S2

Zj

ZjCj –

$50 $0$120 $0

X1 X2 S1 S2

60

–10

120

0

1

0

30

–30

0

0

0

1

0.5

2.5

0.25

–0.25

Primal’s Optimal Solution

Solution Mix

80

0

Cj

U1

S1

Zj

ZjCj –

80 0

U1 S1 A2

80

0

0

0

20

Dual’s Optimal Solution

60

U2

20

40

0.25

0

S2

–20

20

–0.5

M

A1

0

M

1

0 –2.5

0

1

–0.25 0

–1

M

0.5

0.25

M – 20

20

40

Quantity

$2,400

30

10

Quantity

$2,400

FIGURE M7.5 Comparison of the Primal and Dual Optimal Tableaus

The solution to the dual yields shadow prices.

8For details, see Narendra Karmarkar, “A New Polynomial Time Algorithm for Linear Programming,” Combinatorica 4, 4 (1984): 373–395, or J. N. Hooker, “Karmarkar’s Linear Programming Algorithm,” Interfaces 16, 4 (July–August 1986): 75–90.

Z08_REND3161_13_AIE_M07.indd 34 28/10/16 11:41 AM

GLOSSARy  M7-35

As we saw, the simplex algorithm finds a solution by moving from one adjacent corner point to the next, following the outside edges of the feasible region. In contrast, Karmarkar’s method follows a path of points on the inside of the feasible region. Karmarkar’s method is also unique in its ability to handle an extremely large number of constraints and variables, thereby giving LP users the capacity to solve previously unsolvable problems.

Although it is likely that the simplex method will continue to be used for many LP problems, a new generation of LP software built around Karmarkar’s algorithm is already becoming popu- lar. Delta Air Lines became the first commercial airline to use the Karmarkar program, called KORBX, which was developed and is sold by AT&T. Delta found that the program streamlined the monthly scheduling of 7,000 pilots who fly more than 400 airplanes to 166 cities worldwide. With increased efficiency in allocating limited resources, Delta saves millions of dollars in crew time and related costs.

In Chapter 7, we examined the use of graphical methods to solve LP problems that contained only two decision variables. This module moves us one giant step further by introducing the simplex method. The simplex method is an iterative procedure for reaching the optimal solution to LP problems of any dimen- sion. It consists of a series of rules that, in effect, algebraically examine corner points in a systematic way. Each step moves us closer to the optimal solution by increasing profit or decreasing cost, while maintaining feasibility.

This module explains the procedure for converting less- than-or-equal-to, greater-than-or-equal-to, and equality con- straints into the simplex format. These conversions employed the inclusion of slack, surplus, and artificial variables. An ini- tial simplex tableau is developed that portrays the problem’s original data formulations. It also contains a row providing profit or cost information and a net evaluation row. The lat- ter, identified as the Cj - Zj row, is examined in determining whether an optimal solution has yet been reached. It also points out which variable next enters the solution mix, or basis, if the current solution is nonoptimal.

The simplex method consists of five steps: (1) identifying the pivot column, (2) identifying the pivot row and number, (3) replacing the pivot row, (4) computing new values for each

remaining row, and (5) computing the Zj and Cj - Zj rows and examining for optimality. Each tableau of this iterative proce- dure is displayed and explained for a sample maximization and minimization problem.

A few special issues in LP that arise in using the simplex method are also discussed in this module. Examples of infeasi- bility, unbounded solutions, degeneracy, and multiple optimal solutions are presented.

Although large LP problems are seldom, if ever, solved by hand, the purpose of this module is to help you gain an under- standing of how the simplex method works. Understanding the underlying principles helps you to interpret and analyze com- puterized LP solutions.

This module also provides a foundation for another issue: answering questions about the problem after an optimal solu- tion has been found, which is called postoptimality analysis, or sensitivity analysis. Included in this discussion is the analy- sis of the value of additional resources, called shadow pricing. Finally, the relationship between a primal LP problem and its dual is explored. We illustrate how to derive the dual from a primal and how the solutions to the dual variables are actually the shadow prices.

Summary

Glossary

Artificial Variable A variable that has no meaning in a physical sense but acts as a tool to help generate an initial LP solution.

Basic Feasible Solution A solution to an LP problem that corresponds to a corner point of the feasible region.

Basis or Basic Variables The set of variables that are in the solution, have positive, nonzero values, and are listed in the solution mix column.

Cj − Zj Row The row containing the net profit or loss that will result from introducing one unit of the variable indi- cated in that column into the solution.

Current Solution The basic feasible solution that is the set of variables presently in the solution. It corresponds to a corner point of the feasible region.

Degeneracy A condition that arises when there is a tie in the values used to determine which variable will enter the solu- tion next. It can lead to cycling back and forth between two nonoptimal solutions.

Infeasibility The situation in which there is no solution that satisfies all of a problem’s constraints.

Iterative Procedure A process (algorithm) that repeats the same steps over and over.

Nonbasic Variables Variables not in the solution mix or basis. Nonbasic variables are equal to zero.

Pivot Column The column with the largest positive number in the Cj - Zj row of a maximization problem or with the largest negative Cj - Zj improvement value in a minimization prob- lem. It indicates which variable will enter the solution next.

Z08_REND3161_13_AIE_M07.indd 35 28/10/16 11:41 AM

M7-36  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Pivot Number The number at the intersection of the pivot row and pivot column.

Pivot Row The row corresponding to the variable that will leave the basis in order to make room for the variable en- tering (as indicated by the new pivot column). This is the smallest positive ratio found by dividing the quantity col- umn values by the pivot column values for each row.

Primal–Dual Relationship An alternative way of stating an LP problem.

Quantity Column A column in the simplex tableau that gives the numeric value of each variable in the solution mix column.

Range of Insignificance The range of values over which a nonbasic variable’s coefficient can vary without causing a change in the optimal solution mix.

Range of Optimality The range of values over which a basic variable’s coefficient can change without causing a change in the optimal solution mix.

Right-Hand-Side Ranging A method used to find the range over which shadow prices remain valid.

Shadow Prices The coefficients of slack variables in the Cj - Zj row. They represent the value of one additional unit of a resource.

Simplex Method A matrix algebra method for solving LP problems.

Simplex Tableau A table for keeping track of calculations at each iteration of the simplex method.

Slack Variable A variable added to less-than-or-equal-to constraints in order to create an equality for a simplex method. It represents a quantity of unused resource.

Solution Mix A column in the simplex tableau that contains all the basic variables in the solution.

Substitution Rates The coefficients in the central body of each simplex table. They indicate the number of units of each basic variable that must be removed from the solution if a new variable (as represented at any column head) is entered.

Surplus Variable A variable inserted in a greater-than-or- equal-to constraint to create an equality. It represents the amount of resource usage above the minimum required usage.

Unboundedness A condition describing LP maximization problems having solutions that can become infinitely large without violating any stated constraints.

Zj Row The row containing the figures for gross profit or loss given up by adding one unit of a variable into the solution.

Key Equations

(M7-1) 1New row numbers2 = 1Numbers in old row2

- c aNumber above or below pivot number

b * aCorresponding number in newly replaced row

b

Formula for computing new values for nonpivot rows in the simplex tableau (step 4 of the simplex procedure).

Solved Problems

Solved Problem M7-1 Convert the following constraints and objective function into the proper form for use in the simplex method:

Minimize cost = 4X1 + 1X2 subject to 3X1 + X2 = 3

4X1 + 3X2 Ú 6 X1 + 2X2 … 3

Solution Minimize cost = 4X1 + 1X2 + 0S1 + 0S2 + MA1 + MA2 subject to 3X1 + 1X2 + 1A1 = 3

4X1 + 3X2 - 1S1 + 1A2 = 6 1X1 + 2X2 + 1S2 = 3

Z08_REND3161_13_AIE_M07.indd 36 28/10/16 11:41 AM

SOLVED PRObLEMS  M7-37

Solved Problem M7-2 Solve the following LP problem:

Maximize profit = $9X1 + $7X2 subject to 2X1 + 1X2 … 40

X1 + 3X2 … 30

Solution We begin by adding slack variables and converting inequalities into equalities.

Maximize profit = 9X1 + 7X2 + 0S1 + 0S2 subject to 2X1 + 1X2 + 1S1 + 0S2 = 40

1X1 + 3X2 + 0S1 + 1S2 = 30

The initial tableau is then as follows:

Cj $9 $7 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$0 S1 2 1 1 0 40

$0 S2 1 3 0 1 30

Zj $0 $0 $0 $0 $0

Cj - Zj 9 7 0 0

The correct second tableau and third tableau and some of their calculations follow. The optimal solu- tion, given in the third tableau, is X1 = 18, X2 = 4, S1 = 0, S2 = 0, and profit = $190.

Steps 1 and 2 To go from the first to the second tableau, we note that the pivot column (in the first tab- leau) is X1, which has the highest Cj - Zj value, $9. The pivot row is S1, since 40/2 is less than 30/1, and the pivot number is 2.

Step 3 The new X1 row is found by dividing each number in the old S1 row by the pivot number—that is, 2>2 = 1, 1>2 = 0.5, 1>2 = 0.5, 0>2 = 0, and 40>2 = 20. Step 4 The new values for the S2 row are computed as follows:

aNumber in new S2 row

b = aNumber in old S2 row

b - C aNumber below pivot number

b * £Correspondingnumber in new X1 row

≥ S 0 = 1 - 3112 * 1124 2.5 = 3 - 3112 * 10.524 -0.5 = 0 - 3112 * 10.524 1 = 1 - 3112 * 1024

10 = 30 - 3112 * 12024

Step 5 The following new Zj and Cj - Zj rows are formed: Zj1for X12 = $9112 + 0102 = $9 Cj - Zj = $9 - $9 = 0 Zj1for X22 = $910.52 + 012.52 = $4.5 Cj - Zj = $7 - 4.5 = $2.5 Zj1for S12 = $910.52 + 01-0.52 = $4.5 Cj - Zj = 0 - 4.5 = $4.5 Zj1for S22 = $9102 + 0112 = $0 Cj - Zj = 0 - 0 = 0 Zj1profit2 = $91202 + 01102 = $180

Z08_REND3161_13_AIE_M07.indd 37 28/10/16 11:41 AM

M7-38  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Cj $9 $7 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$9 X1 1 0.5 0.5 0 20

0 S2 0 2.5 -0.5 1 10 Pivot row

Zj $9 $4.5 $4.5 $0 $180

Cj - Zj 0 2.5 -4.5 0

Pivot column

This solution is not optimal, and you must perform steps 1 to 5 again. The new pivot column is X2, the new pivot row is S2, and 2.5 (circled in the second tableau) is the new pivot number.

Cj $9 $7 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$9 X1 1 0 0.6 -0.2 18 7 X2 0 1 -0.2 0.4 4

Zj $9 $7 $4 $1 $190

Cj - Zj 0 0 -4 -1

The final solution is X1 = 18, X2 = 4, and profit = $190.

Solved Problem M7-3 Use the final simplex tableau in Solved Problem M7-2 to answer the following questions. a. What are the shadow prices for the two constraints? b. Perform RHS ranging for constraint 1. c. If the right-hand side of constraint 1 were increased by 10, what would the maximum possible profit

be? Give the values for all the variables. d. Find the range of optimality for the profit on X1.

Solution a. Shadow price = -1Cj - Zj2 For constraint 1, shadow price = -1-42 = 4. For constraint 2, shadow price = -1-12 = 1. b. For constraint 1, we use the S1 column.

QUANTITY S1 RATIO

18 0.6 18>10.62 = 30 4 -0.2 4>1-0.22 = -20

The smallest positive ratio is 30, so we may reduce the right-hand side of constraint 1 by 30 units (for a lower bound of 40 - 30 = 10). Similarly, the negative ratio of -20 tells us that we may increase the right-hand side of constraint 1 by 20 units (for an upper bound of 40 + 20 = 60).

c. The maximum possible profit = Original profit + 101shadow price2 = 190 + 10142 = 230

Z08_REND3161_13_AIE_M07.indd 38 28/10/16 11:41 AM

SOLVED PRObLEMS  M7-39

The values for the basic variables are found using the original quantities and the substitution rates:

ORIGINAL QUANTITY S1 NEW QUANTITY

18 0.6 18 + 10.621102 = 24 4 -0.2 4 + 1-0.221102 = 2

X1 = 24, X2 = 2, S1 = 0, S2 = 0 1both slack variables remain nonbasic variables2 profit = 91242 + 7122 = 230 1which was also found using the shadow price2 d. Let ∆= change in profit for X1.

Cj 9 + Δ 7 0 0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

9 + ∆ X1 1 0 0.6 -0.2 18 7 X2 0 1 -0.2 0.4 4

Zj 9 + ∆ 7 4 + 10.62∆ 1 - 10.22∆ 190 + 18∆ Cj - Zj 0 0 -4 - 10.62∆ -1 + 10.22∆

For this solution to remain optimal, the Cj - Zj values must remain negative or zero.

-4 - 10.62∆ … 0 -4 … 10.62∆

-20>3 … ∆

and

-1 + 10.22∆ … 0 10.22∆ … 1

∆ … 5

So the change in profit 1∆2 must be between -20>3 and 5. The original profit was 9, so this solution remains optimal as long as the profit on X1 is between 2.33 = 9 - 20>3 and 14 = 9 + 5.

Z08_REND3161_13_AIE_M07.indd 39 28/10/16 11:41 AM

M7-40  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Self-Test

●● Before taking the self-test, refer to the learning objectives at the beginning of the module, the notes in the margins, and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. A basic feasible solution is a solution to an LP problem that corresponds to a corner point of the feasible region. a. True b. False

2. In preparing a Ú constraint for an initial simplex tableau, you would a. add a slack variable. b. add a surplus variable. c. subtract an artificial variable. d. subtract a surplus variable and add an artificial variable.

3. In the initial simplex tableau, the solution mix variables can be a. only slack variables. b. slack and surplus variables. c. artificial and surplus variables. d. slack and artificial variables.

4. Even if an LP problem involves many variables, an optimal solution will always be found at a corner point of the n-dimensional polyhedron forming the feasible region. a. True b. False

5. Which of the following in a simplex tableau indicates that an optimal solution for a maximization problem has been found? a. All the Cj - Zj values are negative or zero. b. All the Cj - Zj values are positive or zero. c. All the substitution rates in the pivot column are nega-

tive or zero. d. There are no more slack variables in the solution mix.

6. To formulate a problem for solution by the simplex method, we must add slack variables to a. all inequality constraints. b. only equality constraints. c. only “greater than” constraints. d. only “less than” constraints.

7. If in the optimal tableau of an LP problem an artificial variable is present in the solution mix, this implies a. infeasibility. b. unboundedness. c. degeneracy. d. alternate optimal solutions.

8. If in the final optimal simplex tableau the Cj - Zj value for a nonbasic variable is zero, this implies a. feasibility. b. unboundedness. c. degeneracy. d. alternate optimal solutions.

9. In a simplex tableau, all of the substitution rates in the pivot column are negative. This indicates that a. there is no feasible solution to this problem. b. the solution is unbounded.

c. there is more than one optimal solution. d. the solution is degenerate.

10. The pivot column in a maximization problem is the column with a. the greatest positive Cj - Zj. b. the greatest negative Cj - Zj. c. the greatest positive Zj. d. the greatest negative Zj.

11. A change in the objective function coefficient 1Cj2 for a basic variable can affect a. the Cj - Zj values of all the nonbasic variables. b. the Cj - Zj values of all the basic variables. c. only the Cj - Zj value of that variable. d. the Cj values of other basic variables.

12. Linear programming has few applications in the real world due to the assumption of certainty in the data and relationships of a problem. a. True b. False

13. In a simplex tableau, one variable will leave the basis and be replaced by another variable. The leaving variable is a. the basic variable with the largest Cj. b. the basic variable with the smallest Cj. c. the basic variable in the pivot row. d. the basic variable in the pivot column.

14. Which of the following must equal 0? a. basic variables b. solution mix variables c. nonbasic variables d. objective function coefficients for artificial variables

15. The shadow price for a constraint is a. the value of an additional unit of that resource. b. always equal to zero if there is positive slack for that

constraint. c. found from the Cj - Zj value in the slack variable

column. d. all of the above.

16. The solution to the dual LP problem a. presents the marginal profit of each additional unit of

resource. b. can always be derived by examining the Zj row of the

primal’s optimal simplex tableau. c. is better than the solution to the primal. d. is all of the above.

17. The number of constraints in a dual problem will equal the number of a. constraints in the primal problem. b. variables in the primal problem. c. variables plus the number of constraints in the primal

problem. d. variables in the dual problem.

Z08_REND3161_13_AIE_M07.indd 40 28/10/16 11:41 AM

DISCUSSION QUESTIONS AND PROBLEMS  M7-41

Discussion Questions and Problems

Discussion Questions M7-1 Explain the purpose and procedures of the simplex

method. M7-2 How do the graphical and simplex methods of solv-

ing LP problems differ? In what ways are they the same? Under what circumstances would you prefer to use the graphical approach?

M7-3 What are slack, surplus, and artificial variables? When is each used, and why? What value does each carry in the objective function?

M7-4 You have just formulated an LP problem with 12 decision variables and eight constraints. How many basic variables will there always be? What is the dif- ference between a basic and a nonbasic variable?

M7-5 What are the simplex rules for selecting the pivot column? The pivot row? The pivot number?

M7-6 How do maximization and minimization problems differ when applying the simplex method?

M7-7 Explain what the Zj value indicates in the simplex tableau.

M7-8 Explain what the Cj - Zj value indicates in the sim- plex tableau.

M7-9 What is the reason behind the use of the minimum ratio test in selecting the pivot row? What might happen without it?

M7-10 A particular LP problem has the following objective function:

Maximize profit = $8X1 + $6X2 + $12X3 - $2X4

Which variable should enter at the second simplex tableau? If the objective function were

Minimize cost = $2.5X1 + $2.9X2 + $4.0X3 + $7.9X4

which variable would be the best candidate to enter the second tableau?

M7-11 What happens if an artificial variable is in the final optimal solution? What should the manager who for- mulated the LP problem do?

M7-12 The great Romanian operations researcher Dr. Ima Student proposes that instead of selecting the vari- able with the largest positive Cj - Zj value (in a maximization LP problem) to enter the solution mix next, a different approach be used. She suggests that any variable with a positive Cj - Zj can be chosen, even if it isn’t the largest. What will happen if we adopt this new rule for the simplex procedure? Will an optimal solution still be reached?

M7-13 What is a shadow price? How does the concept relate to the dual of an LP problem? How does it relate to the primal?

M7-14 If a primal problem has 12 constraints and eight variables, how many constraints and variables will its corresponding dual have?

M7-15 Explain the relationship between each number in a primal and corresponding numbers in the dual.

M7-16 Create your own original LP maximization problem with two variables and three less-than-or-equal-to con- straints. Now form the dual for this primal problem.

Problems

M7-17 The first constraint in the High Note example in this module is

2X1 + 4X2 … 80 (hours of electricians’ time available)

Table M7.17 gives the final simplex tableau for this example. From the tableau, it was determined that the maximum increase in electrician hours was 160 (for a total of 240 hours).

(a) Change the right-hand side of that constraint to 240, and graph the new feasible region.

(b) Find the new optimal corner point. How much did the profit increase as a result of this?

(c) What is the shadow price? (d) Increase the electrician hours available by one unit

more (to 241), and find the optimal solution. How much did the profit increase as a result of this one extra hour? Explain why the shadow price from the simplex tableau is no longer relevant.

M7-18 The Dreskin Development Company is building two apartment complexes. It must decide how many units to construct in each complex subject to labor and material constraints. The profit generated for each apartment in the first complex is estimated at $900, and for each apartment in the second complex, $1,500. A partial initial simplex tableau for Dreskin is given in the following table:

Cj $900 $1,500 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

14 4 1 0 3,360

10 12 0 1 9,600

Zj

Cj - Zj

(a) Complete the initial tableau. (b) Reconstruct the problem’s original constraints

(excluding slack variables).

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel; and means the problem may be solved with QM for Windows and/or Excel.

Z08_REND3161_13_AIE_M07.indd 41 28/10/16 11:41 AM

M7-42  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

(c) Write the problem’s original objective function. (d) What is the basis for the initial solution? (e) Which variable should enter the solution at the

next iteration? (f) Which variable will leave the solution at the next

iteration? (g) How many units of the variable entering the

solution next will be in the basis in the second tableau?

(h) How much will profit increase in the next solution?

M7-19 Consider the following LP problem:

Maximize earnings = $0.80X1 + $0.40X2 + $1.20X3 - $0.10X4

subject to X1 + 2X2 + X3 + 5X4 … 150 X2 - 4X3 + 8X4 = 70

6X1 + 7X2 + 2X3 - X4 Ú 120 X1, X2, X3, X4 Ú 0

(a) Convert these constraints to equalities by adding the appropriate slack, surplus, or artificial vari- ables. Also, add the new variables into the prob- lem’s objective function.

(b) Set up the complete initial simplex tableau for this problem. Do not attempt to solve.

(c) Give the values for all variables in this initial solution.

M7-20 Solve the following LP problem graphically. Then set up a simplex tableau and solve the problem us- ing the simplex method. Indicate the corner points generated at each iteration by the simplex method on your graph.

Maximize profit = $3X1 + $5X2 subject to X2 … 6

3X1 + 2X2 … 18 X1, X2 Ú 0

M7-21 Consider the following LP problem:

Maximize profit = 10X1 + 8X2 subject to 4X1 + 2X2 … 80

X1 + 2X2 … 50 X1, X2 Ú 0

(a) Solve this problem graphically. (b) Set up the initial simplex tableau. On the graph,

identify the corner point represented by this tableau.

(c) Select the pivot column. Which variable is the entering variable?

(d) Compute the ratio of the quantity-to-pivot col- umn substitution rate for each row. Identify the points on the graph related to these ratios.

(e) How many units of the entering variable will be brought into the solution in the second tableau? What would happen if the largest ratio rather than the smallest ratio were selected to deter- mine this (see the graph)?

(f) Which variable is the leaving variable? What will the value of this variable be in the next tableau?

(g) Finish solving this problem using the simplex algorithm.

(h) The solution in each simplex tableau is a corner point on the graph. Identify the corner point as- sociated with each tableau.

M7-22 Solve the following LP problem first graphically and then by the simplex algorithm:

Minimize cost = 4X1 + 5X2

subject to X1 + 2X2 Ú 80 3X1 + X2 Ú 75

X1,X2 Ú 0

What are the values of the basic variables at each iteration? Which are the nonbasic variables at each iteration?

M7-23 The final simplex tableau for an LP maximization problem is shown on this page. Describe the situa- tion encountered here.

M7-24 Solve the following problem by the simplex method. What condition exists that prevents you from reach- ing an optimal solution?

Maximize profit = 6X1 + 3X2 subject to 2X1 - 2X2 … 2

-X1 + X2 … 1 X1, X2 Ú 0

M7-25 Consider the following financial problem:

Maximize return on investment = $2X1 + $3X2 Tableau for Problem M7-23

Cj 3 5 0 0 - M

SOLUTION MIX X1 X2 S1 S2 A1 QUANTITY

$5 X2 1 1 2 0 0 6

-M A1 -1 0 -2 -1 1 2

Zj $5 + M $5 $10 + 2M $M -$M $30 - 2M

Cj - Zj -2 - M 0 -10 - 2M -M 0

Z08_REND3161_13_AIE_M07.indd 42 28/10/16 11:41 AM

DISCUSSION QUESTIONS AND PROBLEMS  M7-43

subject to 6X1 + 9X2 … 18 9X1 + 3X2 Ú 9

X1, X2 Ú 0

(a) Find the optimal solution using the simplex method.

(b) What evidence indicates that an alternate opti- mal solution exists?

(c) Find the alternate optimal solution. (d) Solve this problem graphically as well, and illus-

trate the alternate optimal corner points.

M7-26 At the third iteration of a particular LP maximiza- tion problem, the tableau on this page is established. What special condition exists as you improve the profit and move to the next iteration? Proceed to solve the problem for the optimal solution.

M7-27 A pharmaceutical firm is about to begin production of three new drugs. An objective function designed to minimize ingredient costs and three production constraints are as follows:

Minimize cost = 50X1 + 10X2 + 75X3 Subject to X1 - X2 = 1,000

2X2 + 2X3 = 2,000 X1 … 1,500

X1, X2, X3 Ú 0

(a) Convert these constraints and objective function to the proper form for use in the simplex tableau.

(b) Solve the problem by the simplex method. What is the optimal solution and cost?

M7-28 The Bitz-Karan Corporation faces a blending deci- sion in developing a new cat food called Yum-Mix. Two basic ingredients have been combined and tested, and the firm has determined that to each can of Yum- Mix at least 30 units of protein and at least 80 units of riboflavin must be added. These two nutrients are available in two competing brands of animal food supplements. The cost per kilogram of the brand A supplement is $9, and the cost per kilogram of the brand B supplement is $15. A kilogram of brand A added to each production batch of Yum-Mix provides

a supplement of 1 unit of protein and 1 unit of ribo- flavin to each can. A kilogram of brand B provides 2 units of protein and 4 units of riboflavin in each can. Bitz-Karan must satisfy these minimum nutri- ent standards while keeping costs of supplements to a minimum.

(a) Formulate this problem to find the best combi- nation of the two supplements to meet the mini- mum requirements at the least cost.

(b) Solve for the optimal solution by the simplex method.

M7-29 The Roniger Company produces two products: bed mat- tresses and box springs. A prior contract requires that the firm produce at least 30 mattresses or box springs, in any combination. In addition, union labor agreements demand that stitching machines be kept running at least 40 hours per week, which is one production period. Each box spring takes 2 hours of stitching time, and each mattress takes 1 hour on the machine. Each mat- tress produced costs $20; each box spring costs $24.

(a) Formulate this problem so as to minimize total production costs.

(b) Solve using the simplex method.

M7-30 Each coffee table produced by Meising Designers nets the firm a profit of $9. Each bookcase yields a $12 profit. Meising’s firm is small, and its resources are limited. During any given production period of one week, 10 gallons of varnish and 12 lengths of high-quality redwood are available. Each coffee table requires approximately 1 gallon of varnish and 1 length of redwood. Each bookcase takes 1 gallon of varnish and 2 lengths of redwood. For- mulate Meising’s production mix decision as an LP problem, and solve using the simplex method. How many tables and bookcases should be produced each week? What will the maximum profit be?

M7-31 Bagwell Distributors packages and distributes indus- trial supplies. A standard shipment can be packaged in a class A container, a class K container, or a class T container. A single class A container yields a profit of $8; a class K container, a profit of $6; and a class

Tableau for Problem M7-26

Cj $6 $3 $5 0 0 0

SOLUTION MIX X1 X2 X3 S1 S2 S3 QUANTITY

$5 X3 0 1 1 1 0 3 5

$6 X1 1 -3 0 0 0 1 12

$0 S2 0 2 0 1 1 -1 10

Zj $6 -$13 $5 $5 $0 $21 $97

Cj - Zj $0 $16 $0 -$5 $0 -$21

Z08_REND3161_13_AIE_M07.indd 43 28/10/16 11:41 AM

M7-44  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

T container, a profit of $14. Each shipment prepared requires a certain amount of packing material and a certain amount of time, as seen in the following table:

CLASS OF CONTAINER

PACKING MATERIAL (LB)

PACKING TIME (HOURS)

A 2 2

K 1 6

T 3 4

Total amount of resource available each week

120 lb 240 hours

Bill Bagwell, head of the firm, must decide the opti- mal number of each class of container to pack each week. He is bound by the previously mentioned resource restrictions, but he also decides that he must keep his six full-time packers employed all 240 hours (6 workers, 40 hours) each week. Formulate and solve this problem using the simplex method.

M7-32 The Foggy Bottom Development Corporation has just purchased a small hotel for conversion to con- dominium apartments. The building, in a popu- lar area of Washington, D.C., near the U.S. State Department, will be highly marketable, and each condominium sale is expected to yield a good profit. The conversion process, however, includes several options. Basically, four types of condominiums can be designed out of the former hotel rooms. They are deluxe one-bedroom apartments, regular one- bedroom apartments, deluxe studios, and efficiency apartments. Each will yield a different profit, but each type also requires a different level of invest- ment in carpeting, painting, appliances, and car- pentry work. Bank loans dictate a limited budget that may be allocated to each of these needs. Profit data and the conversion costs for each apartment are shown in the table on this page.

Thus, we see that the cost of carpeting a deluxe one-bedroom unit is $1,100, the cost of carpeting a regular one-bedroom unit is $1,000, and so on. A

total of $35,000 is budgeted for all new carpet in the building.

Zoning regulations dictate that the building con- tain no more than 50 condominiums when the con- version is completed—and no fewer than 25 units. The development company decides that to have a good blend of owners, at least 40% but no more than 70% of the units should be one-bedroom apartments. Not all money budgeted in each category need be spent, although profit is not affected by cost savings. But since the money represents a bank loan, under no circumstances may it be exceeded or even shifted from one area, such as carpeting, to another, such as painting.

(a) Formulate Foggy Bottom Development Corpora- tion’s decision as a linear program to maximize profits.

(b) Convert your objective function and constraints to a form containing the appropriate slack, sur- plus, and artificial variables.

M7-33 The initial simplex tableau on the following page was developed by Tommy Gibbs, vice president of a large cotton spinning mill. Unfortunately, Gibbs quit before completing this important LP applica- tion. Stephanie Robbins, the newly hired replace- ment, was immediately given the task of using LP to determine what different kinds of yarn the mill should use to minimize costs. Her first need was to be certain that Gibbs correctly formulated the objective function and constraints. She could find no statement of the problem in the files, so she de- cided to reconstruct the problem from the initial tableau.

(a) What is the correct formulation, using real deci- sion variables (that is, Xis) only?

(b) Which variable will enter this current solution mix in the second tableau? Which basic variable will leave?

Table for Problem M7-32

TYPE OF APARTMENT

RENOVATION REQUIREMENT

DELUXE ONE-BEDROOM ($)

REGULAR ONE-BEDROOM ($)

DELUXE STUDIO ($)

EFFICIENCY ($)

TOTAL BUDGETED ($)

New carpet 1,100 1,000 600 500 35,000

Painting 700 600 400 300 28,000

New appliances 2,000 1,600 1,200 900 45,000

Carpentry work 1,000 400 900 200 19,000

Profit per unit 8,000 6,000 5,000 3,500

Z08_REND3161_13_AIE_M07.indd 44 28/10/16 11:41 AM

DISCUSSION QUESTIONS AND PROBLEMS  M7-45

M7-34 Consider the following optimal tableau, where S1 and S2 are slack variables added to the original problem:

Cj $10 $30 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$10 X1 1 4 2 0 160

$0 S2 0 6 -7 1 200 Zj $10 $40 $20 $0 $1,600

Cj - Zj 0 -10 -20 0

(a) What is the range of optimality for the contribu- tion rate of the variable X1?

(b) What is the range of insignificance of the contri- bution rate for the variable X2?

(c) How much would you be willing to pay for one more unit of the first resource, which is repre- sented by slack variable S1?

(d) What is the value of one more unit of the second resource? Why?

(e) What would the optimal solution be if the profit on X2 were changed to $35 instead of $30?

(f) What would the optimal solution be if the profit on X1 were changed to $12 instead of $10? How much would the maximum profit change?

(g) How much could the right-hand side in con- straint 2 be decreased before profit would be affected?

M7-35 A linear program has been formulated and solved. The optimal simplex tableau for this is as follows:

Cj 80 120 90 0 0 0

SOLUTION MIX X1 X2 X3 S1 S2 S3 QUANTITY

120 X2 -1.5 1 0 0.125 -0.75 0 37.5 90 X3 3.5 0 1 -0.125 1.25 0 12.5

0 S3 -1.0 0 0 0 -0.5 1 10.0

Zj 135 120 90 3.75 22.5 0 5,625

Cj - Zj -55 0 0 -3.75 -22.5 0

(a) What are the shadow prices for the three con- straints? What does a zero shadow price mean? How can this occur?

(b) How much could the right-hand side of the first constraint be changed without changing the so- lution mix (i.e., perform RHS ranging for this constraint)?

(c) How much could the right-hand side of the third constraint be changed without changing the so- lution mix?

M7-36 Clapper Electronics produces two models of telephone-answering devices, model 102 1X12 and model H23 1X22. Jim Clapper, vice president for production, formulates their constraints as follows:

2X1 + 1X2 … 40 1hours of time available on soldering machine2

1X1 + 3X2 … 30 1hours of time available in inspection department2

Clapper’s objective function is

Maximize profit = $9X1 + $7X2

Tableau for Problem M7-33

Cj $12 $18 $10 $20 $7 $8 $0 $0 $0 $0 $0 M M M M

SOLUTION MIX X1 X2 X3 X4 X5 X6 S1 S2 S3 S4 S5 A1 A2 A3 A4 QUANTITY

$M A1 1 0 -3 0 0 0 0 0 0 0 0 1 0 0 0 100 0 S1 0 25 1 2 8 0 1 0 0 0 0 0 0 0 0 900

M A2 2 1 0 4 0 1 0 -1 0 0 0 0 1 0 0 250

M A3 18 -15 -2 -1 15 0 0 0 -1 0 0 0 0 1 0 150

0 S4 0 0 0 0 0 25 0 0 0 1 0 0 0 0 0 300

M A4 0 0 0 2 6 0 0 0 0 0 -1 0 0 0 1 70

Zj $21M -$14M -$5M $5M $21M $M $0 $0 -$M $0 -$M $M $M $M $M $570M

Cj - Zj 12 - 21M 18 + 14M 10 + 5M 20 - 5M 7 - 21M 8 - M 0 0 M 0 M 0 0 0 0

Z08_REND3161_13_AIE_M07.indd 45 28/10/16 11:41 AM

M7-46  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

Solving the problem using the simplex method, he produces the following final tableau:

Cj $9 $7 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$9 X1 1 0 0.6 -0.2 18 7 X2 0 1 -0.2 0.4 4

Zj $9 $7 $4 $1 $190

Cj - Zj 0 0 -4 –1

(a) What is the optimal mix of models 102 and H23 to produce?

(b) What do variables S1 and S2 represent? (c) Clapper is considering renting a second solder-

ing machine at a cost to the firm of $2.50 per hour. Should he do so?

(d) Clapper computes that he can hire a part-time inspector for only $1.75 per hour. Should he do so?

M7-37 Refer to Table M7.6, which is the optimal tableau for the Flair Furniture Company problem.

(a) What are the values of the shadow prices? (b) Interpret the physical meaning of each shadow

price in the context of the furniture problem. (c) What is the range over which the profit per ta-

ble can vary without changing the optimal basis (solution mix)?

(d) What is the range of optimality for C (number of chairs produced)?

(e) How many hours can Flair Furniture add to or remove from the first resource (painting depart- ment time) without changing the basis?

(f) Conduct RHS ranging on the carpentry depart- ment resource to determine the range over which the shadow price remains valid.

M7-38 Consider the optimal solution to the Muddy River Chemical Corporation problem in Table M7.10.

(a) For each of the two chemical ingredients, phosphate and potassium, determine the range over which their cost may vary without affecting the basis.

(b) If the original constraint that “no more than 300 pounds of phosphate can be used” 1X1 … 3002 were changed to X1 … 400, would the ba- sis change? Would the values of X1, X2, and S2 change?

M7-39 Formulate the dual of this LP problem:

Maximize profit = 80X1 + 75X2 1X1 + 3X2 … 4 2X1 + 5X2 … 8

Find the dual of the problem’s dual. M7-40 What is the dual of the following LP problem?

Primal: Minimize cost = 120X1 + 250X2 subject to 12X1 + 20X2 Ú 50

X1 + 3X2 Ú 4 M7-41 The third, and final, simplex tableau for the LP prob-

lem stated here follows:

Maximize profit = 200X1 + 200X2 subject to 2X1 + X2 … 8

X1 + 3X2 … 9 What are the solutions to the dual variables, U1 and

U2? What is the optimal dual cost?

Cj $200 $200 $0 $0

SOLUTION MIX X1 X2 S1 S2 QUANTITY

$200 X1 1 0 0.6 -0.2 3 200 X2 0 1 -0.2 0.4 2

Zj $200 $200 $80 $40 $1,000

Cj - Zj 0 0 -80 -40

M7-42 The tableau on this page provides the optimal solu- tion to this dual:

Minimize cost = 120U1 + 240U2 subject to 2U1 + 2U2 Ú 0.5

U1 + 3U2 Ú 0.4

What does the corresponding primal problem look like, and what is its optimal solution?

Tableau for Problem M7-42

Cj 120 240 0 0 M M

SOLUTION MIX U1 U2 S1 S2 A1 A2 QUANTITY

$120 U1 1 0 -0.75 0.5 0.75 -0.5 0.175

240 U2 0 1 0.25 -0.5 -0.25 0.5 0.075

Zj $120 $240 -$30 -$60 $30 $60 $39 Cj - Zj 0 0 30 60 M - 30 M - 60

Z08_REND3161_13_AIE_M07.indd 46 28/10/16 11:41 AM

DISCUSSION QUESTIONS AND PROBLEMS  M7-47

M7-43 Given the following dual formulation, reconstruct the original primal problem:

Minimize cost = 28U1 + 53U2 + 70U3 + 18U4 subject to U1 + U4 Ú 10

U1 + 2U2 + U3 Ú 5

- 2U2 + 5U4 Ú 31

5U3 Ú 28

12U1 + 2U3 - U4 Ú 17

U1, U2, U3, U4 Ú 0

M7-44 A firm that makes three products and has three ma- chines available as resources constructs the follow- ing LP problem:

Maximize profit = 4X1 + 4X2 + 7X3

subject to 1X1 + 7X2 + 4X3 … 100 1hours on machine 12 2X1 + 1X2 + 7X3 … 110 1hours on machine 22 8X1 + 4X2 + 1X3 … 110 1hours on machine 32

Solve this problem by computer and answer these questions:

(a) Before the third iteration of the simplex method, which machine still has unused time available?

(b) When the final solution is reached, is there any unused time available on any of the three machines?

(c) What would it be worth to the firm to make an additional hour of time available on the third machine?

(d) How much would the firm’s profit increase if an extra 10 hours of time were made available on the second machine at no extra cost?

M7-45 Management analysts at a Fresno laboratory have developed the following LP primal problem:

Minimize cost = 23X1 + 18X2

subject cost 8X1 + 4X2 Ú 120 4X1 + 6X2 Ú 115 9X1 + 4X2 Ú 116

This model represents a decision concerning number of hours spent by biochemists on certain laboratory experiments 1X12 and number of hours spent by bio- physicists on the same series of experiments 1X22. A biochemist costs $23 per hour, while a biophysicist’s salary averages $18 per hour. Both types of scien- tists can be used on three needed laboratory opera- tions: test 1, test 2, and test 3. The experiments and their times are as follows:

TESTS PER HOUR BY SCIEN- TIST TYPE

MINIMUM TEST TIME

NEEDED

LAB EXPERIMENT BIOPHYSICIST BIOCHEMIST PER DAY

Test 1 8 4 120

Test 2 4 6 115

Test 3 9 4 116

This means that a biophysicist can complete 8, 4, and 9 of tests 1, 2, and 3 per hour. Similarly, a bio- chemist can perform 4 of test 1, 6 of test 2, and 4 of test 3 per hour. The optimal solution to the lab’s primal problem is

X1 = 8.12 hours and X2 = 13.75 hours

Total cost = $434.37 per day

The optimal solution to the dual problem is

U1 = 2.07, U2 = 1.63, U3 = 0

(a) What is the dual of the primal LP problem? (b) Interpret the meaning of the dual and its solution.

M7-46 Refer to Problem M7-45.

(a) If this is solved with the simplex algorithm, how many constraints and how many variables (including slack, surplus, and artificial variables) will be used?

(b) If the dual of this problem is formulated and solved with the simplex algorithm, how many constraints and how many variables (including slack, surplus, and artificial variables) will be used?

(c) If the simplex algorithm is used, will it be easier to solve the primal problem or the dual problem?

M7-47 The Flair Furniture Company, described first in Chapter 7 and again in this module, manufactures inexpensive tables (T) and chairs (C). The firm’s daily LP formulation is given as

Maximize profits = 70T + 50C

subject to 4T + 3C … 240 hours of carpentry time available

2T + 1C … 100 hours of painting time available

In addition, Flair finds that three more constraints are in order. First, each table and chair must be inspected and may need reworking. The follow- ing constraint describes the time required on average for each:

Z08_REND3161_13_AIE_M07.indd 47 28/10/16 11:41 AM

M7-48  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

0.5T + 0.6C … 36 hours of inspection>rework time available Second, Flair faces a resource constraint relating to

the lumber needed for each table or chair and the amount available each day:

32T + 10C … 1,248 linear feet of lumber available for production

Finally, the demand for tables is found to be a maxi- mum of 40 daily. There are no similar constraints regarding chairs.

T … 40 1maximize table production daily2 These data have been entered in the QM for Win-

dows software that is available with this book. The inputs and results are shown in Programs M7.1A, M7.1B, and M7.1C and should be referred to in answering these questions.

(a) How many tables and chairs should Flair Furni- ture produce daily? What is the profit generated by this solution?

(b) Will Flair use all of its resources to their limits each day? Be specific in explaining your answer.

(c) Explain the physical meaning of each shadow price.

(d) Should Flair purchase more lumber if it is avail- able at $0.07 per linear foot? Should it hire more carpenters at $12.75 per hour?

(e) Flair’s owner has been approached by a friend whose company would like to use several hours in the painting facility every day. Should Flair sell time to the other firm? If so, how much? Explain.

(f) What is the range within which the carpentry hours, painting hours, and inspection/rework hours can fluctuate before the optimal solution changes?

(g) Within what range for the current solution can the profit contribution of tables and chairs change?

PROGRAM M7.1A QM for windows Input Data for Revised Flair Furniture Problem (Problem M7-47)

PROGRAM M7.1B Solution Results (Final Tableau) for Revised Flair Furniture Problem (Problem M7-47)

Z08_REND3161_13_AIE_M07.indd 48 28/10/16 11:41 AM

DISCUSSION QUESTIONS AND PROBLEMS  M7-49

M7-48 A Chicago manufacturer of office equipment is desperately attempting to control its profit and loss statement. The company currently manufactures 15 different products, each coded with a one-letter and three-digit designation, as shown in the table on the next page.

(a) How many of each of the 15 products should be produced each month?

(b) Clearly explain the meaning of each shadow price.

(c) A number of workers interested in saving money for the holidays have offered to work overtime next month at a rate of $12.50 per hour. What should the response of management be?

(d) Two tons of steel alloy are available from an overstocked supplier at a total cost of $8,000. Should the steel be purchased? All or part of the supply?

(e) The accountants have just discovered that an error was made in the contribution to profit for product N150. The correct value is actually $8.88. What are the implications of this error?

(f) Management is considering the abandonment of five product lines (those beginning with the letters A through E). If no minimum monthly demand is established, what are the implica- tions? Note that there already is no minimum for two of these products. Use the corrected value for N150.

PROGRAM M7.1C Sensitivity Analysis for Revised Flair Furniture Problem (Problem M7-47)

Z08_REND3161_13_AIE_M07.indd 49 28/10/16 11:41 AM

M7-50  MODULE 7 • LINEAR PROGRAMMING: THE SIMPLEX METHOD

PRODUCT

STEEL ALLOY

REQUIRED (LB)

PLASTIC REQUIRED

(SQ FT)

WOOD REQUIRED

(BD FT)

ALUMINUM REQUIRED

(LB)

FORMICA REQUIRED

(BD FT)

LABOR REQUIRED

(HOURS)

MINIMUM MONTHLY DEMAND (UNITS)

CONTRIBU- TION TO PROFIT

A158 — 0.4 0.7 5.8 10.9 3.1 — $18.79

B179 4 0.5 1.8 10.3 2.0 1.0 20 6.31

C023 6 — 1.5 1.1 2.3 1.2 10 8.19

D045 10 0.4 2.0 — — 4.8 10 45.88

E388 12 1.2 1.2 8.1 4.9 5.5 — 63.00

F422 — 1.4 1.5 7.1 10.0 0.8 20 4.10

G366 10 1.4 7.0 6.2 11.1 9.1 10 81.15

H600 5 1.0 5.0 7.3 12.4 4.8 20 50.06

I701 1 0.4 — 10.0 5.2 1.9 50 12.79

J802 1 0.3 — 11.0 6.1 1.4 20 15.88

K900 — 0.2 — 12.5 7.7 1.0 20 17.91

L901 2 1.8 1.5 13.1 5.0 5.1 10 49.99

M050 — 2.7 5.0 — 2.1 3.1 20 24.00

N150 10 1.1 5.8 — — 7.7 10 88.88

P259 10 — 6.2 15.0 1.0 6.6 10 77.01

Availability per month 980 400 600 2,500 1,800 1,000

Bibliography

See the Bibliography at the end of Chapter 7.

Z08_REND3161_13_AIE_M07.indd 50 28/10/16 11:41 AM

M8.3 Use the maximal flow algorithm.

M8.4 Use the shortest-route method.

M8.1 Use the northwest corner and stepping-stone methods to solve transportation problems.

M8.2 Use the Hungarian (matrix reduction) method to solve assignment problems.

After completing this module, students will be able to:

Transportation, Assignment, and Network Algorithms

LEARNING OBJECTIVES

8 MODULE

In Chapter 9, several important distribution and network models were presented. Linear pro-gramming was used extensively in the presentation of these models. However, there are some specialized algorithms that can be used to find the best solutions more quickly and are often used instead of linear programming. In this module, we will present these specialized techniques for solving the transportation problem, the assignment problem, the maximal-flow problem, and the shortest-route problem.

M8.1 The Transportation Algorithm

The transportation algorithm is an iterative procedure in which an initial solution to a trans- portation problem is found. This solution is evaluated using a special procedure to determine if it is optimal. If the solution is optimal, the process stops. If it is not optimal, a new solution is generated. This new solution is at least as good as the previous one, and it is usually better. This new solution is then evaluated, and if it is not optimal, another solution is generated. The process continues until the optimal solution is found.

We will illustrate this method using the Executive Furniture Corporation example that was first seen in Chapter 9. The company manufactures office desks at three locations: Des Moines, Evansville, and Fort Lauderdale. The firm distributes the desks to warehouse destinations located in Albuquerque, Boston, and Cleveland. An estimate of the monthly production capacity at each factory, the monthly demand at each warehouse, and the shipping cost per unit from each factory to each warehouse is shown in Table M8.1.

We see in Table M8.1 that the total factory supply available is exactly equal to the total warehouse demand. When this situation of equal demand and supply occurs (something that is

 M8-1

Z09_REND3161_13_AIE_M08.indd 1 31/10/16 1:58 PM

M8-2  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

rather unusual in real life), a balanced transportation problem is said to exist. Later in this module, we take a look at how to deal with unbalanced problems—namely, those in which desti- nation requirements may be greater than or less than origin capacities.

Developing an Initial Solution: Northwest Corner Rule When the data have been arranged in tabular form, we must establish an initial feasible solution to the problem. One systematic procedure, known as the northwest corner rule, requires that we start in the upper-left-hand cell (or northwest corner) of the table and allocate units to ship- ping routes as follows:

1. Exhaust the supply (factory capacity) at each row before moving down to the next row. 2. Exhaust the (warehouse) requirements of each column before moving to the right to the

next column. 3. Check that all supply and demand constraints are met.

We can now use the northwest corner rule to find an initial feasible solution to the Executive Furniture Corporation problem shown in Table M8.1.

It takes five steps in this example to make the initial shipping assignments (see Table M8.2):

Balanced supply and demand occurs when total demand equals total supply.

TABLE M8.1 Transportation Table for Executive Furniture Corporation

FROM

TO

DES MOINES FACTORY

WAREHOUSE AT ALBUQUERQUE

WAREHOUSE AT BOSTON

WAREHOUSE AT CLEVELAND

FACTORY CAPACITY

EVANSVILLE FACTORY

FORT LAUDERDALE FACTORY

WAREHOUSE REQUIREMENTS

$5 $4 $3 100

$8

Cost of shipping 1 unit from Fort Lauderdale factory to Boston warehouse

Cleveland warehouse demand

Total demand and total supply

Cell representing a source-to-destination (Evansville to Cleveland) shipping assignment that could be made

Des Moines capacity constraint

$4 $3 300

$9 $7 $5 300

700200200300

TABLE M8.2 Initial Solution to Executive Furniture Problem Using the Northwest Corner Method

FROM TO

DES MOINES (D)

EVANSVILLE (E)

FORT LAUDERDALE (F)

WAREHOUSE REQUIREMENTS

$5 $4 $3 100

$8

Means that the firm is shipping 100 units along the Fort Lauderdale–Boston route

$4 $3 300

$9 $7 $5 300

700200

200

200

100

100200

100

300

ALBUQUERQUE (A)

BOSTON (B)

CLEVELAND (C )

FACTORY CAPACITY

Z09_REND3161_13_AIE_M08.indd 2 31/10/16 1:58 PM

M8.1 THE TRANSPORTATION ALGORITHM  M8-3

1. Beginning at the upper-left-hand corner, we assign 100 units from Des Moines to Albuquerque. This exhausts the capacity or supply at the Des Moines factory. But it still leaves the warehouse at Albuquerque 200 desks short. Move down to the second row in the same column.

2. Assign 200 units from Evansville to Albuquerque. This meets Albuquerque’s demand for a total of 300 desks. The Evansville factory has 100 units remaining, so we move to the right to the next column of the second row.

3. Assign 100 units from Evansville to Boston. The Evansville supply has now been exhausted, but Boston’s warehouse is still short by 100 desks. At this point, we move down vertically in the Boston column to the next row.

4. Assign 100 units from Fort Lauderdale to Boston. This shipment will fulfill Boston’s demand for a total of 200 units. We note, though, that the Fort Lauderdale factory still has 200 units available that have not been shipped.

5. Assign 200 units from Fort Lauderdale to Cleveland. This final move exhausts Cleveland’s demand and Fort Lauderdale’s supply. This always happens with a balanced problem. The initial shipment schedule is now complete.

We can easily compute the cost of this shipping assignment:

ROUTE

FROM TO UNITS

SHIPPED : PER-UNIT COST ($) =

TOTAL COST ($)

D A 100 5 500

E A 200 8 1,600

E B 100 4 400

F B 100 7 700

F C 200 5 1,000

Total 4,200

This solution is feasible, since all demand and supply constraints are satisfied. It was also very quick and easy to reach. However, we would be very lucky if this solution yielded the optimal transportation cost for the problem because this route-loading method totally ignored the cost of shipping over each of the routes.

After the initial solution has been found, it must be evaluated to see if it is optimal. We compute an improvement index for each empty cell using the stepping-stone method. If this indicates a better solution is possible, we use the stepping-stone path to move from this solution to improved solutions until we find an optimal solution.

Stepping-Stone Method: Finding a Least-Cost Solution The stepping-stone method is an iterative technique for moving from an initial feasible solution to an optimal feasible solution. This process has two distinct parts: the first involves testing the current solution to determine if improvement is possible, and the second part involves making changes to the current solution in order to obtain an improved solution. This process continues until the optimal solution is reached.

For the stepping-stone method to be applied to a transportation problem, one rule about the number of shipping routes being used must first be observed: the number of occupied routes (or squares) must always be equal to one less than the sum of the number of rows plus the number of columns. In the Executive Furniture problem, this means that the initial solution must have 3 + 3 - 1 = 5 squares used. Thus

Occupied shipping routes 1squares2 = Number of rows + Number of columns - 1 5 = 3 + 3 - 1

A feasible solution is reached when all demand and supply constraints are met.

Here is an explanation of the five steps needed to make an initial shipping assignment for Executive Furniture.

Z09_REND3161_13_AIE_M08.indd 3 31/10/16 1:58 PM

When the number of occupied routes is less than this, the solution is called degenerate. Later in this module we talk about what to do if the number of used squares is less than the num- ber of rows plus the number of columns minus 1.

TESTING THE SOLUTION FOR POSSIBLE IMPROVEMENT How does the stepping-stone method work? Its approach is to evaluate the cost-effectiveness of shipping goods via transportation routes not currently in the solution. Each unused shipping route (or square) in the transportation table is tested by asking the following question: “What would happen to total shipping costs if one unit of our product (in our example, one desk) were tentatively shipped on an unused route?”

This testing of each unused square is conducted using the following five steps.

Five Steps to Test Unused Squares with the Stepping-Stone Method

1. Select an unused square to be evaluated. 2. Beginning at this square, trace a closed path back to the original square, turning corners

only at squares that are currently being used and moving only horizontally and vertically. 3. Beginning with a plus 1+2 sign at the unused square, place alternate minus 1-2 signs and

plus signs on each corner square of the closed path just traced. 4. Calculate an improvement index by adding together the unit cost figures found in each

square containing a plus sign and then subtracting the unit costs in each square containing a minus sign.

5. Repeat steps 1 to 4 until an improvement index has been calculated for all unused squares. If all indices computed are greater than or equal to zero, an optimal solution has been reached. If not, it is possible to improve the current solution and decrease total shipping costs.

To see how the stepping-stone method works, let us apply these steps to the Executive Furniture Corporation data in Table M8.2 to evaluate unused shipping routes. The four currently unassigned routes are Des Moines to Boston, Des Moines to Cleveland, Evansville to Cleveland, and Fort Lauderdale to Albuquerque.

Steps 1 and 2. Beginning with the Des Moines–Boston route, we first trace a closed path using only currently occupied squares (see Table M8.3) and then place alternate plus signs and minus signs in the corners of this path. To indicate more clearly the meaning of a closed path, we see that only squares currently used for shipping can be used in turning the corners of the route being traced. Hence, the path Des Moines–Boston to Des Moines–Albuquerque to Fort Lauderdale–Albuquerque to Fort Lauderdale–Boston to Des Moines–Boston would not be acceptable, since the Fort Lauderdale–Albuquerque square is currently empty. It turns out that only one closed route is possible for each square we wish to test.

Step 3. How do we decide which squares are given plus signs and which minus signs? The answer is simple. Since we are testing the cost-effectiveness of the Des Moines–Boston shipping route, we pretend we are shipping one desk from Des Moines to Boston. This is one more unit than we were sending between the two cities, so we place a plus sign in the box. But if we ship one more unit than before from Des Moines to Boston, we end up sending 101 desks out of the Des Moines factory.

That factory’s capacity is only 100 units; hence we must ship one fewer desks from Des Moines–Albuquerque—this change is made to avoid violating the factory capacity constraint. To indicate that the Des Moines–Albuquerque shipment has been reduced, we place a minus sign in its box. Continuing along the closed path, we notice that we are no longer meeting the Albu- querque warehouse requirement for 300 units. In fact, if the Des Moines–Albuquerque shipment is reduced to 99 units, the Evansville–Albuquerque load has to be increased by 1 unit, to 201 desks. Therefore, we place a plus sign in that box to indicate the increase. Finally, we note that if the Evansville–Albuquerque route is assigned 201 desks, the Evansville–Boston route must be reduced by 1 unit, to 99 desks, to maintain the Evansville factory capacity constraint of 300 units. Thus, a minus sign is placed in the Evansville–Boston box. We observe in Table M8.3 that all four routes on the closed path are thereby balanced in terms of demand-and-supply limitations.

The stepping-stone method involves testing each unused route to see if shipping one unit on that route would increase or decrease total costs.

Note that every row and every column will have either two changes or no changes.

Closed paths are used to trace alternate plus and minus signs.

How to assign + and - signs.

M8-4  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 4 31/10/16 1:58 PM

M8.1 THE TRANSPORTATION ALGORITHM  M8-5

Step 4. An improvement index 1Iij2 for the Des Moines–Boston route is now computed by adding unit unit costs in squares with plus signs and subtracting unit costs unit in squares with minus signs. Hence,

Does Moines9Boston index = IDB = +$4 - $5 + $8 - $4 = +$3

This means that for every desk shipped via the Des Moines–Boston route, total transportation costs will increase by $3 over their current level.

Step 5. Let us now examine the Des Moines–Cleveland unused route, which is slightly more dif- ficult to trace with a closed path. Again, you will notice that we turn each corner along the path only at squares that represent existing routes. The path can go through the Evansville–Cleveland box but cannot turn a corner or place a + or - sign there. Only an occupied square may be used as a stepping stone (Table M8.4).

The closed path we use is +DC - DA + EA - EB + FB - FC:

Des Moines:Cleveland improvement index = IDC = +$3 - $5 + $8 - $4 + $7 - $5 = +$4

Thus, opening this route will also not lower our total shipping costs. The other two routes may be evaluated in a similar fashion:

Evansville9Cleveland index = IEC = +$3 - $4 + $7 - $5 = +$1

1closed path: +EC - EB + FB - FC2

TABLE M8.3 Evaluating the Unused Des Moines–Boston Shipping Route

FROM TO ALBUQUERQUE

(A)

Warehouse A

Factory D

Factory E

BOSTON (B)

CLEVELAND (C)

FACTORY CAPACITY

DES MOINES (D)

EVANSVILLE (E)

FORT LAUDERDALE (F)

WAREHOUSE REQUIREMENTS

Start

$5

100

100

Result of Proposed Shift in Allocation

Evaluation of Des Moines–Boston Square

99

+

+

– +

+ –

300

300

700200

200

200

100

100200

100

300

Warehouse B

$4

$8 $4

200

201

100

99

1

= 1 3 $4 – 1 3 $5 + 1 3 $8 – 1 3 $4 = + $3

5 4 3

8 4 3

9 7 5

The improvement index computation involves adding costs in squares with plus signs and subtracting costs in squares with minus signs. Iij is the improvement index on the route from source i to destination j.

A path can go through any box but can only turn a corner at a box (cell) that is occupied.

Z09_REND3161_13_AIE_M08.indd 5 31/10/16 1:58 PM

M8-6  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Fort Lauderdale9Albuquerque index = IFA = +$9 - $7 + $4 - $8

= -$2

1closed path: +FA - FB + EB - EA2 Because this last improvement index 1IFA2 is negative, a cost savings may be attained by making use of the (currently unused) Fort Lauderdale–Albuquerque route.

OBTAINING AN IMPROVED SOLUTION Each negative index computed by the stepping-stone method represents the amount by which total transportation costs could be decreased if 1 unit or product were shipped on that route. We found only one negative index in the Executive Furniture problem, that being -$2 on the Fort Lauderdale factory–Albuquerque warehouse route. If, however, there were more than one negative improvement index, our strategy would be to choose the route (unused square) with the negative index indicating the largest improvement.

The next step, then, is to ship the maximum allowable number of units (or desks, in our case) on the new route (Fort Lauderdale to Albuquerque). What is the maximum quantity that can be shipped on the money-saving route? That quantity is found by referring to the closed path of plus signs and minus signs drawn for the route and selecting the smallest number found in those squares containing minus signs. To obtain a new solution, that number is added to all squares on the closed path with plus signs and subtracted from all squares on the path assigned minus signs. All other squares are unchanged.

Let us see how this process can help improve Executive Furniture’s solution. We repeat the transportation table (Table M8.5) for the problem. Note that the stepping-stone route for Fort Lauderdale to Albuquerque (F–A) is drawn in. The maximum quantity that can be shipped on the newly opened route (F–A) is the smallest number found in squares containing minus signs—in this case, 100 units. Why 100 units? Since the total cost decreases by $2 per unit shipped, we know we would like to ship the maximum possible number of units. Table M8.5 indicates that each unit shipped over the F–A route results in an increase of 1 unit in the amount shipped from E to B and a decrease of 1 unit in both the amount shipped from F to B (now 100 units) and the amount shipped from E to A (now 200 units). Hence, the maximum we can ship over the F–A route is 100. This results in 0 units being shipped from F to B.

We add 100 units to the 0 now being shipped on route F–A; then subtract 100 from route F–B, leaving 0 in that square (but still balancing the row total for F ); then add 100 to route E–B, yielding 200; and, finally, subtract 100 from route E–A, leaving 100 units shipped. Note that the

To reduce our overall costs, we want to select the route with the negative index indicating the largest improvement.

The maximum we can ship on the new route is found by looking at the closed path’s minus signs. We select the smallest number found in the squares with minus signs.

Changing the shipping route involves adding to squares on the closed path with plus signs and subtracting from squares on the closed path with minus signs.

TABLE M8.4 Evaluating the Des Moines–Cleveland (D–C) Shipping Route

TO

FROM ALBUQUERQUE

(A) BOSTON

(B) CLEVELAND

(C) FACTORY CAPACITY

DES MOINES (D)

$5

- 100

$4 $3

Start

+ 100

EVANSVILLE (E)

$8

+ 200

$4

- 100

$3

300

FORT LAUDERDALE (F)

$9 $7

100

+ 100

$5

- 200 300

WAREHOUSE REQUIREMENTS 300 200 200 700

Z09_REND3161_13_AIE_M08.indd 6 31/10/16 1:58 PM

M8.1 THE TRANSPORTATION ALGORITHM  M8-7

new numbers still produce the correct row and column totals as required. The new solution is shown in Table M8.6.

Total shipping cost has been reduced by 1100 units2 * 1$2 saved per unit2 = $200 and is now $4,000. This cost figure can, of course, also be derived by multiplying the unit shipping cost times the number of units transported on its route—namely, 1100 * $52 + 1100 * $82 + 1200 * $42 + 1100 * $92 + 1200 * $52 = $4,000.

The solution shown in Table M8.6 may or may not be optimal. To determine whether further improvement is possible, we return to the first five steps given earlier to test each square that is now unused. The four improvement indices—each representing an available shipping route—are as follows:

D to B = IDB = +$4 - $5 + $8 - $4 = +$3 1closed path: +DB - DA + EA - EB2

D to C = IDC = +$3 - $5 + $9 - $5 = +$2 1closed path: +DC - DA + FA - FC2

E to C = IEC = +$3 - $8 + $9 - $5 = -$1 1closed path: +EC - EA + FA - FC2

F to B = IFB = +$7 - $4 + $8 - $9 = +$2 1closed path: +FB - EB + EA - FA2

Hence, an improvement can be made by shipping the maximum allowable number of units from E to C (see Table M8.7). Only the squares E–A and F–C have minus signs in the closed path; because the smallest number in these two squares is 100, we add 100 units each to E–C and F–A and subtract 100 units each from E–A and F–C. The new cost for this third solution, $3,900, is computed in the following table:

Total Cost of Third Solution

ROUTE

FROM TO UNITS

SHIPPED : PER-UNIT COST ($) =

TOTAL COST ($)

D A 100 5 500

E B 200 4 800

E C 100 3 300

F A 200 9 1,800

F C 100 5 500

Total 3,900

The improvement indices for the four unused shipping routes must now be tested to see if any are negative.

TABLE M8.5 Stepping-Stone Path Used to Evaluate Route F–A

TO

FROM A B C FACTORY CAPACITY

D $5

100

$4 $3

100

E $8

-200 $4

+100 $3

300

F $9

+ $7

-100 $5

200 300

WAREHOUSE REQUIREMENTS 300 200 200 700

Z09_REND3161_13_AIE_M08.indd 7 31/10/16 1:58 PM

M8-8  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Table M8.8 contains the optimal shipping assignments because each improvement index that can be computed at this point is greater than or equal to zero, as shown in the following equations. Improvement indices for the table are

D to B = IDB = +$4 - $5 + $9 - $5 + $3 - $4 = +$2 1path: +DB - DA + FA - FC + EC - EB2

D to C = IDC = +$3 - $5 + $9 - $5 = +$2 1path: +DC - DA + FA - FC2 E to A = IEA = +$8 - $9 + $5 - $3 = +$1 1path: +EA - FA + FC - EC2 F to B = IFB = +$7 - $5 + $3 - $4 = +$1 1path: +FB - FC + EC - EB2

TABLE M8.7 Path to Evaluate the E–C Route

TO

FROM A B C FACTORY CAPACITY

D $5

100

$4 $3

100

E $8

100 - $4

200 $3

Start + 300

F $9

100 + $7 $5

200 - 300

WAREHOUSE REQUIREMENTS 300 200 200 700

Since all four of these improvement indices are greater than or equal to zero, we have reached an optimal solution.

TABLE M8.8 Third and Optimal Solution

TO

FROM A B C FACTORY CAPACITY

D $5

100

$4 $3

100

E $8 $4

200

$3

100 300

F $9

200

$7 $5

100 300

WAREHOUSE REQUIREMENTS 300 200 200 700

TABLE M8.6 Second Solution to the Executive Furniture Problem

TO

FROM A B C FACTORY CAPACITY

D $5

100

$4 $3

100

E $8

100

$4

200

$3

300

F $9

100

$7 $5

200 300

WAREHOUSE REQUIREMENTS 300 200 200 700

Z09_REND3161_13_AIE_M08.indd 8 31/10/16 1:58 PM

M8.1 THE TRANSPORTATION ALGORITHM  M8-9

Let us summarize the steps in the transportation algorithm.

Summary of Steps in Transportation Algorithm (Minimization)

1. Set up a balanced transportation table. 2. Develop an initial solution using the northwest corner method. 3. Calculate an improvement index for each empty cell using the stepping-stone method. If

improvement indices are all nonnegative, stop; the optimal solution has been found. If any index is negative, continue to step 4.

4. Select the cell with the improvement index indicating the greatest decrease in cost. Fill this cell using a stepping-stone path and go to step 3.

Some special situations may occur when using this algorithm. They are presented in the next section.

Special Situations with the Transportation Algorithm When using the transportation algorithm, some special situations may arise, including unbal- anced problems, degenerate solutions, multiple optimal solutions, and unacceptable routes. This algorithm may be modified to maximize total profit rather than minimizing total cost. All of these situations will be addressed, and other modifications of the transportation algorithm will be presented.

Unbalanced Transportation Problems A situation occurring quite frequently in real-life problems is the case in which total demand is not equal to total supply. These unbalanced problems can be handled easily by the preceding solution procedures if we first introduce dummy sources or dummy destinations. In the event that total supply is greater than total demand, a dummy destination (warehouse), with demand exactly equal to the surplus, is created. If total demand is greater than total supply, we introduce a dummy source (factory) with a supply equal to the excess of demand over supply. In either case, shipping cost coefficients of zero are assigned to each dummy location or route because no shipments will actually be made from a dummy factory or to a dummy warehouse. Any units assigned to a dummy destination represent excess capacity, and any units assigned to a dummy source represent unmet demand.

DEMAND LESS THAN SUPPLY Considering the original Executive Furniture Corporation problem, suppose that the Des Moines factory increases its rate of production to 250 desks. (That factory’s capacity used to be 100 desks per production period.) The firm is now able to supply a total of 850 desks each period. Warehouse requirements, however, remain the same (at 700 desks), so the row and column totals do not balance.

To balance this type of problem, we simply add a dummy column that will represent a fake warehouse requiring 150 desks. This is somewhat analogous to adding a slack variable in solv- ing an LP problem. Just as slack variables were assigned a value of zero dollars in the LP objec- tive function, the shipping costs to this dummy warehouse are all set equal to zero.

The northwest corner rule is used once again, in Table M8.9, to find an initial solution to this modified Executive Furniture problem. To complete this task and find an optimal solution, you would employ the stepping-stone method.

Note that the 150 units from Fort Lauderdale to the dummy warehouse represent 150 units that are not shipped from Fort Lauderdale.

DEMAND GREATER THAN SUPPLY The second type of unbalanced condition occurs when total de- mand is greater than total supply. This means that customers or warehouses require more of a product than the firm’s factories can provide. In this case, we need to add a dummy row repre- senting a fake factory.

The new factory will have a supply exactly equal to the difference between total demand and total real supply. The shipping cost from the dummy factory to each destination will be zero.

Let us set up such an unbalanced problem for the Happy Sound Stereo Company. Happy Sound assembles high-fidelity stereophonic systems at three plants and distributes through three

The transportation algorithm has four basic steps.

Dummy sources or destinations are used to balance problems in which demand is not equal to supply.

Z09_REND3161_13_AIE_M08.indd 9 31/10/16 1:58 PM

M8-10  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

regional warehouses. The production capacity at each plant, demand at each warehouse, and unit shipping costs are presented in Table M8.10.

As can be seen in Table M8.11, a dummy plant adds an extra row, balances the problem, and allows us to apply the northwest corner rule to find the initial solution shown. This initial solu- tion shows 50 units being shipped from the dummy plant to warehouse C. This means that ware- house C will be 50 units short of its requirements. In general, any units shipped from a dummy source represent unmet demand at the respective destination.

Degeneracy in Transportation Problems We briefly mentioned the subject of degeneracy earlier in this module. Degeneracy occurs when the number of occupied squares or routes in a transportation table solution is less than the number of rows plus the number of columns minus 1. Such a situation may arise in the initial solution or in any subsequent solution. Degeneracy requires a special procedure to correct the problem. Without enough occupied squares to trace a closed path for each unused route, it would be impossible to apply the stepping-stone method. You might recall that no problem discussed in the module thus far has been degenerate.

To handle degenerate problems, we create an artificially occupied cell—that is, we place a zero (representing a fake shipment) in one of the unused squares and then treat that square as if it were occupied. The square chosen must be in such a position as to allow all stepping-stone paths to be closed, although there is usually a good deal of flexibility in selecting the unused square that will receive the zero.

TABLE M8.9 Initial Solution to an Unbalanced Problem Where Demand Is Less Than Supply

FROM TO ALBUQUERQUE

(A) BOSTON (B)

CLEVELAND (C)

DUMMY WAREHOUSE

FACTORY CAPACITY

DES MOINES (D)

EVANSVILLE (E)

FORT LAUDERDALE (F)

WAREHOUSE REQUIREMENTS

250 250

50 50200

New Des Moines capacity

300

150 150 300

850

Total cost = 250($5) + 50($8) + 200($4) + 50($3) + 150($5) + 150($0) = $3,350

5

8

4 3

4 3

9 7 5

0

0

0

150200300 200

TABLE M8.10 Unbalanced Transportation Table for Happy Sound Stereo Company

Degeneracy arises when the number of occupied squares is less than the number of rows + columns −1.

TO

FROM WAREHOUSE

A WAREHOUSE

B WAREHOUSE

C PLANT SUPPLY

PLANT W $6 $4 $9

200

PLANT X

$10 $5 $8

175

PLANT Y

$12 $7 $6

75

WAREHOUSE DEMAND 250 100 150

450

500

Totals do not balance

Z09_REND3161_13_AIE_M08.indd 10 31/10/16 1:58 PM

M8.1 THE TRANSPORTATION ALGORITHM  M8-11

DEGENERACY IN AN INITIAL SOLUTION Degeneracy can occur in our application of the northwest corner rule to find an initial solution, as we see in the case of the Martin Shipping Company. Martin has three warehouses from which to supply its three major retail customers in San Jose. Martin’s shipping costs, warehouse supplies, and customer demands are presented in Table M8.12. Note that sources in this problem are warehouses and destinations are retail stores. Initial shipping assignments are made in the table by application of the northwest corner rule.

This initial solution is degenerate because it violates the rule that the number of used squares must be equal to the number of rows plus the number of columns minus 1 (i.e., 3 + 3 - 1 = 5 is greater than the number of occupied boxes). In this particular problem, degeneracy arose because both a column and a row requirement (that being column 1 and row 1) were satis- fied simultaneously. This broke the stair-step pattern that we usually see with northwest corner solutions.

To correct the problem, we can place a zero in an unused square. With the northwest corner method, this zero should be placed in one of the cells that is adjacent to the last filled cell so the stair-step pattern continues. In this case, the square representing either the shipping route from warehouse 1 to customer 2 or the shipping route from warehouse 2 to customer 1 will do. If you treat the new zero square just like any other occupied square, the regular solution method can be used.

DEGENERACY DURING LATER SOLUTION STAGES A transportation problem can become degenerate after the initial solution stage if the filling of an empty square results in two (or more) filled cells becoming empty simultaneously instead of just one cell becoming empty. Such a problem occurs when two or more squares assigned minus signs on a closed path tie for the lowest quantity.

TABLE M8.12 Initial Solution of a Degenerate Problem

TO

FROM CUSTOMER

1 CUSTOMER

2 CUSTOMER

3 WAREHOUSE

SUPPLY

WAREHOUSE 1

8

100

2 6

100

WAREHOUSE 2

10 9

100

9

20 120

WAREHOUSE 3

7 10 7

80 80

CUSTOMER DEMAND 100 100 100 300

TABLE M8.11 Initial Solution to an Unbalanced Problem in Which Demand Is Greater Than Supply

TO

FROM WAREHOUSE

A WAREHOUSE

B WAREHOUSE

C PLANT SUPPLY

PLANT W 6

200

4 9

200

PLANT X 10

50

5

100

8

25 175

PLANT Y 12 7 6

75 75

DUMMY PLANT 0 0 0

50 50

WAREHOUSE DEMAND 250 100 150 500

Total cost of initial solution = 2001$62 + 501$102 + 1001$52 + 251$82 + 751$62 + 501$02 = $2,850

Z09_REND3161_13_AIE_M08.indd 11 31/10/16 1:58 PM

M8-12  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

To correct this problem, a zero should be put in one (or more) of the previously filled squares so that only one previously filled square becomes empty.

BAGWELL PAINT EXAMPLE After one iteration of the stepping-stone method, cost analysts at Bagwell Paint produced the transportation table shown as Table M8.13. We observe that the solution in Table M8.13 is not degenerate, but it is also not optimal. The improvement indices for the four currently unused squares are

factory A - warehouse 2 index = +2 factory A - warehouse 3 index = +1 factory B - warehouse 3 index = -15 factory C - warehouse 2 index = +11

Hence, an improved solution can be obtained by opening the route from factory B to ware- house 3. Let us go through the stepping-stone procedure for finding the next solution to Bagwell Paint’s problem. We begin by drawing a closed path for the unused square representing factory B–warehouse 3. This is shown in Table M8.14, which is an abbreviated version of Table M8.13 and contains only the factories and warehouses necessary to close the path.

The smallest quantity in a square containing a minus sign is 50, so we add 50 units each to the factory B–warehouse 3 and factory C–warehouse 1 routes and we subtract 50 units each from the two squares containing minus signs. However, this act causes two formerly occu- pied squares to drop to 0. It also means that there are not enough occupied squares in the new solution and that it will be degenerate. We will have to place an artificial zero in one of the previously filled squares (generally, the one with the lowest shipping cost) to handle the degeneracy problem.

More Than One Optimal Solution Just as with LP problems, it is possible for a transportation problem to have multiple optimal solutions. Such a situation is indicated when one or more of the improvement indices that we

Only route with a negative index

Multiple solutions are possible when one or more improvement indices in the optimal solution stages are equal to zero.

TABLE M8.13 Bagwell Paint Transportation Table

TABLE M8.14 Tracing a Closed Path for the Factory B–Warehouse 3 Route

TO

FROM WAREHOUSE

1 WAREHOUSE

2 WAREHOUSE

3 FACTORY CAPACITY

FACTORY A

8

70

5 16

70

FACTORY B

15

50

10

80

7

130

FACTORY C

3

30

9 10

50 80

WAREHOUSE REQUIREMENT 150 80 50 280

Total shipping cost = $2,700

TO

FROM WAREHOUSE

1 WAREHOUSE

3

FACTORY B

15

50 - 7

+ FACTORY

C 3

30 + 10

- 50

Z09_REND3161_13_AIE_M08.indd 12 31/10/16 1:58 PM

M8.2 THE ASSIGNMENT ALGORITHM  M8-13

calculate for each unused square is zero in the optimal solution. This means that it is possible to design alternative shipping routes with the same total shipping cost. The alternate optimal solution can be found by shipping the most to this unused square using a stepping-stone path. Practically speaking, multiple optimal solutions provide management with greater flexibility in selecting and using resources.

Maximization Transportation Problems If the objective in a transportation problem is to maximize profit, a minor change is required in the transportation algorithm. Since the improvement index for an empty cell indicates how the objective function value will change if one unit is placed in that empty cell, the optimal solution is reached when all the improvement indices are negative or zero. If any index is positive, the cell with the largest positive improvement index is selected to be filled using a stepping-stone path. This new solution is evaluated, and the process continues until there are no positive improvement indices.

Unacceptable or Prohibited Routes At times, there are transportation problems in which one of the sources is unable to ship to one or more of the destinations. When this occurs, the problem is said to have an unacceptable or prohibited route. In a minimization problem, such a prohibited route is assigned a very high cost to prevent this route from ever being used in the optimal solution. After this high cost is placed in the transportation table, the problem is solved using the techniques previously discussed. In a maximization problem, the very high cost used in minimization problems is given a negative sign, turning it into a very bad profit.

Other Transportation Methods While the northwest corner method is very easy to use, there are other methods for finding an initial solution to a transportation problem. Two of these are the least-cost method and Vo- gel’s approximation method. Similarly, while the stepping-stone method can be used to evaluate empty cells, there is another technique called the modified distribution (MODI) method that can be used. For very large problems, the MODI method is usually much faster than the stepping- stone method.

M8.2 The Assignment Algorithm

The second special-purpose LP algorithm discussed in this module is the assignment method. Each assignment problem has associated with it a table, or matrix. Generally, the rows con- tain the objects or people we wish to assign, and the columns comprise the tasks or things we want them assigned to. The numbers in the table are the costs associated with each particular assignment.

An assignment problem can be viewed as a transportation problem in which the capacity from each source (or person to be assigned) is 1 and the demand at each destination (or job to be done) is 1. Such a formulation could be solved using the transportation algorithm, but it would have a severe degeneracy problem. However, this type of problem is very easy to solve using the assignment method.

As an illustration of the assignment method, let us consider the case of the Fix-It Shop, which has just received three new rush projects to repair: (1) a radio, (2) a toaster oven, and (3) a broken coffee table. Three repair persons, each with different talents and abilities, are available to do the jobs. The Fix-It Shop owner estimates what it will cost in wages to assign each of the workers to each of the three projects. The costs, which are shown in Table M8.15, differ because the owner believes that each worker will differ in speed and skill on these quite varied jobs.

The owner’s objective is to assign the three projects to the workers in a way that will result in the lowest total cost to the shop. Note that the assignment of people to projects must be on a one-to-one basis; each project will be assigned exclusively to one worker only. Hence, the num- ber of rows must always equal the number of columns in an assignment problem’s cost table.

Because the Fix-It Shop problem consists of only three workers and three projects, one easy way to find the best solution is to list all possible assignments and their respective costs. For example, if Adams is assigned to project 1, Brown to project 2, and Cooper to project 3, the total

The optimal solution to a maximization problem has been found when all improvement indices are negative or zero.

A prohibited route is assigned a very high cost to prevent it from being used.

The goal is to assign projects to people (one project to one person) so that the total costs are minimized.

Z09_REND3161_13_AIE_M08.indd 13 31/10/16 1:58 PM

M8-14  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

cost will be $11 + $10 + $7 = $28. Table M8.16 summarizes all six assignment options. The table also shows that the least-cost solution would be to assign Cooper to project 1, Brown to project 2, and Adams to project 3, at a total cost of $25.

Obtaining solutions by enumeration works well for small problems but quickly becomes inefficient as assignment problems become larger. For example, a problem involving the assign- ment of four workers to four projects requires that we consider 4! 1= 4 * 3 * 2 * 12, or 24 alternatives. A problem with eight workers and eight tasks, which actually is not that large in a realistic situation, yields 8! 1= 8 * 7 * 6 * 5 * 4 * 3 * 2 * 12, or 40,320 possible solu- tions! Since it would clearly be impractical to compare so many alternatives, a more efficient solution method is needed.

The Hungarian Method (Flood’s Technique) The Hungarian method (also called Flood’s technique) of assignment provides us with an efficient means of finding the optimal solution without having to make a direct comparison of every option. It operates on a principle of matrix reduction, which means that by subtract- ing and adding appropriate numbers in the cost table or matrix, we can reduce the problem to a matrix of opportunity costs. Opportunity costs show the relative penalties associated with assigning any person to a project as opposed to making the best, or least-cost, assignment. We would like to make assignments such that the opportunity cost for each assignment is zero. The Hungarian method will indicate when it is possible to make such assignments.

If the number of rows is equal to the number of columns, then there are three steps to the assignment method.

Three Steps of the Assignment Method

1. Find the opportunity cost table by

a. Subtracting the smallest number in each row of the original cost table or matrix from every number in that row.

b. Then subtracting the smallest number in each column of the table obtained in part a from every number in that column.

TABLE M8.15 Estimated Project Repair Costs for the Fix-It Shop Assignment Problem

PROJECT

PERSON 1 2 3

Adams $11 $14 $6

Brown 8 10 11

Cooper 9 12 7

One way to solve (small) problems is to enumerate all possible outcomes.

Matrix reduction reduces the table to a set of opportunity costs. These show the penalty of not making the least-cost (or best) assignment.

TABLE M8.16 Summary of Fix-It Shop Assignment Alternatives and Costs

PROJECT ASSIGNMENT

1 2 3 LABOR COSTS ($) TOTAL COSTS ($)

Adams Brown Cooper 11 + 10 + 7 28 Adams Cooper Brown 11 + 12 + 11 34

Brown Adams Cooper 8 + 14 + 7 29

Brown Cooper Adams 8 + 12 + 6 26

Cooper Adams Brown 9 + 14 + 11 34 Cooper Brown Adams 9 + 10 + 6 25

Here are the three steps of the assignment method.

Z09_REND3161_13_AIE_M08.indd 14 31/10/16 1:58 PM

M8.2 THE ASSIGNMENT ALGORITHM  M8-15

2. Test the table resulting from step 1 to see whether an optimal assignment can be made. The procedure is to draw the minimum number of vertical and horizontal straight lines necessary to cover all zeros in the table. If the number of lines equals either the number of rows or the number of columns in the table, an optimal assignment can be made. If the number of lines is less than the number of rows or columns, we proceed to step 3.

3. Revise the present opportunity cost table. This is done by subtracting the smallest number not covered by a line from every uncovered number. This same smallest number is also added to any number(s) lying at the intersection of horizontal and vertical lines. We then return to step 2 and continue the cycle until an optimal assignment is possible.

These steps are charted in Figure M8.1. Let us now apply them.

Step 1. Find the Opportunity Cost Table. As mentioned earlier, the opportunity cost of any deci- sion we make in life consists of the opportunities that are sacrificed in making that decision. For example, the opportunity cost of the unpaid time a person spends starting a new business is the

Revise opportunity cost table in two steps: (a) Subtract the smallest number not covered by a line from itself and every other uncovered number. (b) Add this number at every intersection of any two lines.

Find opportunity cost. (a) Subtract the smallest number in each row from every number in that row. (b) Then subtract the smallest number in each column from every number in that column.

Step 1

Test opportunity cost table to see if optimal assignments are possible by drawing the minimum possible number of lines on columns and/or rows such that all zeros are covered.

Optimal solution at zero locations. Systematically make final assignments. (a) Check each row and column for a unique zero and make the first assign- ment in that row or column. (b) Eliminate that row and column and search for another unique zero. Make that assignment and proceed in a like manner.

Step 2

Optimal (No. of Lines = No. of Rows or Columns)

Not Optimal (No. of Lines < No. of Rows or Columns)

Step 3

Set up cost table for problem.

FIGURE M8.1 Steps in the Assignment Method

Z09_REND3161_13_AIE_M08.indd 15 31/10/16 1:58 PM

M8-16  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

salary that person would earn for those hours that he or she could have worked on another job. This important concept in the assignment method is best illustrated by applying it to a prob- lem. For your convenience, the original cost table for the Fix-It Shop problem is repeated in Table M8.17.

Suppose that we decide to assign Cooper to project 2. The table shows that the cost of this assignment is $12. Based on the concept of opportunity costs, this is not the best decision, since Cooper could perform project 3 for only $7. The assignment of Cooper to project 2 then involves an opportunity cost of $5 1= $12 - $72, the amount we are sacrificing by making this assign- ment instead of the least-cost one. Similarly, an assignment of Cooper to project 1 represents an opportunity cost of $9 - $7 = $2. Finally, because the assignment of Cooper to project 3 is the best assignment, we can say that the opportunity cost of this assignment is zero 1$7 - $72. The results of this operation for each of the rows in Table M8.17 are called the row opportunity costs and are shown in Table M8.18.

We note at this point that although the assignment of Cooper to project 3 is the cheapest way to make use of Cooper, it is not necessarily the least-expensive approach to completing project 3. Adams can perform the same task for only $6. In other words, if we look at this assign- ment problem from a project angle instead of a people angle, the column opportunity costs may be completely different.

What we need to complete step 1 of the assignment method is a total opportunity cost table—that is, one that reflects both row and column opportunity costs. This involves following part b of step 1 to derive column opportunity costs.1 We simply take the costs in Table M8.18 and subtract the smallest number in each column from each number in that column. The result- ing total opportunity costs are given in Table M8.19.

You might note that the numbers in columns 1 and 3 are the same as those in Table M8.18, since the smallest column entry in each case was zero. Thus, it may turn out that the assignment of Cooper to project 3 is part of the optimal solution because of the relative nature of opportunity costs. What we are trying to do is measure the relative efficiencies for the entire cost table and find what assignments are best for the overall solution.

Step 2. Test for an Optimal Assignment. The objective of the Fix-It Shop owner is to assign the three workers to the repair projects in such a way that total labor costs are kept at a minimum. When translated to making assignments using our total opportunity cost table, this means that we would like to have a total assigned opportunity cost of 0. In other words, an optimal solution has zero opportunity costs for all of the assignments.

TABLE M8.17 Cost of Each Person– Project Assignment for the Fix-It Shop Problem

TABLE M8.18 Row Opportunity Cost Table for the Fix-It Shop, Step 1, Part a

PROJECT

PERSON 1 2 3

Adams $11 $14 $6

Brown 8 10 11

Cooper 9 12 7

PROJECT

PERSON 1 2 3

Adams $5 $8 $0

Brown 0 2 3

Cooper 2 5 0

Row and column opportunity costs reflect the cost we are sacrificing by not making the least-cost selection.

1Can you think of a situation in which part b of step 1 would not be required? See if you can design a cost table in which an optimal solution is possible after part a of step 1 is completed.

Total opportunity costs reflect the row and column opportunity cost analyses.

When a zero opportunity cost is found for all of the assignments, an optimal assignment can be made.

Z09_REND3161_13_AIE_M08.indd 16 31/10/16 1:58 PM

M8.2 THE ASSIGNMENT ALGORITHM  M8-17

Looking at Table M8.19, we see that there are four possible zero opportunity cost assign- ments. We could assign Adams to project 3 and Brown to either project 1 or project 2. But this leaves Cooper without a zero opportunity cost assignment. Recall that two workers cannot be given the same task; each must do one and only one repair project, and each project must be as- signed to only one person. Hence, even though four zeros appear in this cost table, it is not yet possible to make an assignment yielding a total opportunity cost of zero.

A simple test has been designed to help us determine whether an optimal assignment can be made. The method consists of finding the minimum number of straight lines (verti- cal and horizontal) necessary to cover all zeros in the cost table. (Each line is drawn so that it covers as many zeros as possible at one time.) If the number of lines equals the number of rows or columns in the table, then an optimal assignment can be made. If, on the other hand, the number of lines is less than the number of rows or columns, an optimal assign- ment cannot be made. In the latter case, we must proceed to step 3 and develop a new total opportunity cost table.

Table M8.20 illustrates that it is possible to cover all four zero entries in Table M8.19 with only two lines. Because there are three rows, an optimal assignment may not yet be made.

Step 3. Revise the Opportunity Cost Table. An optimal solution is seldom obtained from the initial opportunity cost table. Often, we need to revise the table in order to shift one (or more) of the zero costs from its present location (covered by lines) to a new uncovered location in the table. Intuitively, we would want this uncovered location to emerge with a new zero opportunity cost.

This is accomplished by subtracting the smallest number not covered by a line from all numbers not covered by a straight line. This same smallest number is then added to every num- ber (including zeros) lying at the intersection of any two lines.

The smallest uncovered number in Table M8.20 is 2, so this value is subtracted from each of the four uncovered numbers. A 2 is also added to the number that is covered by the intersecting horizontal and vertical lines. The results of step 3 are shown in Table M8.21.

TABLE M8.20 Test for Optimal Solution to Fix-It Shop Problem

TABLE M8.21 Revised Opportunity Cost Table for the Fix-It Shop Problem

TABLE M8.19 Total Opportunity Cost Table for the Fix-It Shop, Step 1, Part b

PROJECT

PERSON 1 2 3

Adams $5 $6 $0

Brown 0 0 3

Cooper 2 3 0

PROJECT

PERSON 1 2 3

Adams $5 $6 $0

Brown 0 0 3 Covering line 1

Cooper 2 3 0

Covering line 2

This line test is used to see if a solution is optimal.

PROJECT

PERSON 1 2 3

Adams $3 $4 $0

Brown 0 0 5

Cooper 0 1 0

Z09_REND3161_13_AIE_M08.indd 17 31/10/16 1:58 PM

M8-18  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

To test now for an optimal assignment, we return to step 2 and find the minimum number of lines necessary to cover all zeros in the revised opportunity cost table. Because it requires three lines to cover the zeros (see Table M8.22), an optimal assignment can be made.

Making the Final Assignment It is apparent that the Fix-It Shop problem’s optimal assignment is Adams to project 3, Brown to project 2, and Cooper to project 1. In solving larger problems, however, it is best to rely on a more systematic approach to making valid assignments. One such way is first to select a row or column that contains only one zero cell. Such a situation is found in the first row, Adams’s row, in which the only zero is in the project 3 column. An assignment can be made to that cell and then lines drawn through its row and column (see Table M8.23). From the uncovered rows and columns, we again choose a row or column in which there is only one zero cell. We make that assignment and continue the procedure until each person is assigned to one task.

The total labor costs of this assignment are computed from the original cost table (see Table M8.17). They are as follows:

ASSIGNMENT COST ($)

Adams to project 3 6

Brown to project 2 10

Cooper to project 1 9

Total cost 25

Special Situations with the Assignment Algorithm There are two special situations that require special procedures when using the Hungarian algo- rithm for assignment problems. The first involves solving problems that are not balanced, and the second involves solving a maximization problem instead of a minimization problem.

Unbalanced Assignment Problems The solution procedure to assignment problems just discussed requires that the number of rows in the table equal the number of columns. Such a problem is called a balanced assignment problem. Often, however, the number of people or objects to be assigned does not equal the

TABLE M8.22 Optimality Test on the Revised Fix-It Shop Opportunity Cost Table

PROJECT

PERSON 1 2 3

Adams $3 $4 $0

Brown 0 0 5 Covering line 2

Cooper 0 1 0

Covering line 1 Covering line 3

TABLE M8.23 Making the Final Fix-It Shop Assignments

(A) FIRST ASSIGNMENT (B) SECOND ASSIGNMENT (C) THIRD ASSIGNMENT

1 2 3 1 2 3 1 2 3

Adams 3 4 0 Adams 3 4 0 Adams 3 4 0

Brown 0 0 5 Brown 0 0 5 Brown 0 0 5

Cooper 0 1 0 Cooper 0 1 0 Cooper 0 1 0

Making an optimal assignment involves first checking the rows and columns where there is only one zero cell.

A balanced assignment problem is one in which the number of rows equals the number of columns.

Z09_REND3161_13_AIE_M08.indd 18 31/10/16 1:58 PM

M8.2 THE ASSIGNMENT ALGORITHM  M8-19

number of tasks or clients or machines listed in the columns, and the problem is unbalanced. When this occurs and we have more rows than columns, we simply add a dummy column or task (similar to how we handled unbalanced transportation problems earlier in this module). If the number of tasks that need to be done exceeds the number of people available, we add a dummy row. This creates a table of equal dimensions and allows us to solve the problem as before. Since the dummy task or person is really nonexistent, it is reasonable to enter zeros in its row or column as the cost or time estimate.

Suppose the owner of the Fix-It Shop realizes that a fourth worker, Davis, is also available to work on one of the three rush jobs that just came in. Davis can do the first project for $10, the second project for $13, and the third project for $8. The shop’s owner still faces the same basic problem—that is, which worker to assign to which project to minimize total labor costs. We do not have a fourth project, however, so we simply add a dummy column or dummy proj- ect. The initial cost table is shown in Table M8.24. One of the four workers, you should realize, will be assigned to the dummy project; in other words, the worker will not really be assigned any of the tasks.

Maximization Assignment Problems Some assignment problems are phrased in terms of maximizing the payoff, profit, or effective- ness of an assignment instead of minimizing costs. It is easy to obtain an equivalent minimiza- tion problem by converting all numbers in the table to opportunity costs. This is brought about by subtracting every number in the original payoff table from the largest single number in that table. The transformed entries represent opportunity costs; it turns out that minimizing oppor- tunity costs produces the same assignment as the original maximization problem. Once the op- timal assignment for this transformed problem has been computed, the total payoff or profit is found by adding the original payoffs of those cells that are in the optimal assignment.

Let us consider the following example. The British navy wishes to assign four ships to pa- trol four sectors of the North Sea. In some areas, ships are to be on the lookout for illegal fishing boats, and in other sectors, they are to watch for enemy submarines, so the commander rates each ship in terms of its probable efficiency in each sector. These relative efficiencies are illus- trated in Table M8.25. On the basis of the ratings shown, the commander wants to determine the patrol assignments producing the greatest overall efficiencies.

Step by step, the solution procedure is as follows. We first convert the maximizing efficiency table into a minimizing opportunity cost table. This is done by subtracting each rating from 100, the largest rating in the whole table. The resulting opportunity costs are given in Table M8.26.

TABLE M8.24 Estimated Project Repair Costs for Fix-It Shop with Davis Included

PROJECT

PERSON 1 2 3 DUMMY

Adams $11 $14 $6 $0

Brown 8 10 11 0

Cooper 9 12 7 0

Davis 10 13 8 0

Maximization problems can easily be converted to minimization problems. This is done by subtracting each rating from the largest rating in the table.

TABLE M8.25 Efficiencies of British Ships in Patrol Sectors

SECTOR

SHIP A B C D

1 20 60 50 55

2 60 30 80 75

3 80 100 90 80

4 65 80 75 70

SECTOR

SHIP A B C D

1 80 40 50 45

2 40 70 20 25

3 20 0 10 20

4 35 20 25 30

TABLE M8.26 Opportunity Costs of British Ships

Z09_REND3161_13_AIE_M08.indd 19 31/10/16 1:58 PM

M8-20  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

We now follow steps 1 and 2 of the assignment algorithm. The smallest number in each row is subtracted from every number in that row (see Table M8.27); then the smallest number in each column is subtracted from every number in that column (as shown in Table M8.28).

The minimum number of straight lines needed to cover all zeros in this total opportunity cost table is four. Hence, an optimal assignment can be made already. You should be able by now to spot the best solution—namely, ship 1 to sector D, ship 2 to sector C, ship 3 to sector B, and ship 4 to sector A.

The overall efficiency, computed from the original efficiency data in Table M8.25, can now be shown:

ASSIGNMENT EFFICIENCY

Ship 1 to sector D 55

Ship 2 to sector C 80

Ship 3 to sector B 100

Ship 4 to sector A 65

Total efficiency 300

M8.3 Maximal-Flow Problem

The maximal-flow problem involves determining the maximum amount of material that can flow from one point (the source) to another (the sink) in a network. Examples of this type of problem include determining the maximum number of cars that can flow through a highway system, the maximum amount of a liquid that can flow through a series of pipes, and the maxi- mum amount of data that can flow through a computer network. We will begin by presenting an example.

Maximal-Flow Technique Waukesha, Wisconsin, is in the process of developing a road system for the downtown area. Bill Blackstone, one of the city planners, would like to determine the maximum number of cars that can f low through the town from west to east. The road network is shown in Figure M8.2.

In this model, each street is denoted by an arc and each intersection is denoted by a node. Look at the arc between nodes 1 and 2. The numbers by the nodes indicate the maximum num- ber of cars (in hundreds of cars per hour) that can flow from the various nodes. The number 3 by

Column subtractions: the smallest number in each column is subtracted from every number in that column.

TABLE M8.27 Row Opportunity Costs for the British Navy Problem

TABLE M8.28 Total Opportunity Costs for the British Navy Problem

SECTOR

SHIP A B C D

1 40 0 10 5

2 20 50 0 5

3 20 0 10 20

4 15 0 5 10

SECTOR

SHIP A B C D

1 25 0 10 0

2 5 50 0 0

3 5 0 10 15

4 0 0 5 5

The maximal-flow technique finds the most that can flow through a network.

Row subtractions: the smallest number in each row is subtracted from every number in that row.

Z09_REND3161_13_AIE_M08.indd 20 31/10/16 1:58 PM

M8.3 MAxIMAL-FLOW PROBLEM  M8-21

node 1 indicates that 300 cars per hour can flow from node 1 to node 2. Look at the numbers 1, 1, and 2 by node 2. These numbers indicate the maximum flow from node 2 to nodes 1, 4, and 6, respectively. As you can see, the maximum flow from node 2 back to node 1 is 100 cars per hour (1). One hundred cars per hour (1) can flow from node 2 to node 4, and 200 cars (2) can flow from node 2 to node 6. Note that traffic can flow in both directions down a street. A zero (0) means no flow or a one-way street.

The maximal-flow technique is not difficult. It involves the following steps.

Four Steps of the Maximal-Flow Technique

1. Pick any path from the start (source) to the finish (sink) with some flow. If no path with flow exists, then the optimal solution has been found.

2. Find the arc on this path with the smallest flow capacity available. Call this capacity C. This represents the maximum additional capacity that can be allocated to this route.

3. For each node on this path, decrease the flow capacity in the direction of flow by the amount C. For each node on this path, increase the flow capacity in the reverse direction by the amount C.

4. Repeat these steps until an increase in flow is no longer possible.

We start by arbitrarily picking the path 1–2–6, which is at the top of the network. What is the maximum flow from west to east? It is 2 because only 2 units (200 cars) can flow from node 2 to node 6. Now we adjust the flow capacities (see Figure M8.3). As you can see, we subtracted the maximum flow of 2 along the path 1–2–6 in the direction of the flow (west to east) and added 2 to the path in the direction against the flow (east to west). The result is the new path in Figure M8.3.

It is important to note that the new path in Figure M8.3 reflects the new relative capac- ity at this stage. The flow number by any node represents two factors. One factor is the flow that can come from that node. The second factor is flow that can be reduced coming into the node. First consider the f low from west to east. Look at the path that goes from node 1 to node 2. The number 1 by node 1 tells us that 100 cars can flow from node 1 to node 2. Look- ing at the path from node 2 to node 6, we can see that the number 0 by node 2 tells us that 0 cars can f low from node 2 to node 6. Now consider the f low from east to west shown in the new path in Figure M8.3. First, consider the path from node 6 to node 2. The number 4 by node 6 tells us the total by which we can either reduce the flow from node 2 to node 6 or

3

2 10

1 2

1

0 1 1

1

0 3 2

1 6

1 2

0 West Point

Capacity in Hundreds of Cars per Hour

East Point

1

2

6

5

4

3

FIGURE M8.2 Road Network for Waukesha

Traffic can flow in both directions.

The four maximal-flow technique steps.

We start by arbitrarily picking a path and adjusting the flow.

Z09_REND3161_13_AIE_M08.indd 21 31/10/16 1:58 PM

M8-22  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

increase the f low from node 6 to node 2 (or some combination of these f lows into and out of node 6), depending on the current status of the flows. Since we have indicated that there would currently be only 2 units (200 cars) flowing from node 2 to node 6, the maximum we could reduce this is 2, leaving us with the capacity to also allow a flow of 2 units from node 6 to node 2 (giving us a total change of 4 units). Looking at the path from node 2 to node 1, we see the number 3 by node 2. This tells us that the total possible change in that direction is 3, and this could come from reducing flows from node 1 to node 2 or increasing flows from node 2 to node 1. Since the flow from node 1 to node 2 is currently 2, we could reduce this by 2, leaving us with the capacity to also allow a flow of 1 unit from node 2 to node 1 (giving us a total change of 3 units). At this stage, we have a f low of 200 cars through the network from node 1 to node 2 to node 6. We have also reflected the new relative capacity, as shown in Figure M8.3.

Now we repeat the process by picking another path with existing capacity. We will arbi- trarily pick path 1–2–4–6. The maximum capacity along this path is 1. In fact, the capacity at every node along this path (1–2–4–6) going from west to east is 1. Remember, the capac- ity of branch 1–2 is now 1 because 2 units (200 cars per hour) are now flowing through the network. Thus, we increase the flow along path 1–2–4–6 by 1 and adjust the capacity f low (see Figure M8.4).

Now we have a flow of 3 units (300 cars): 200 cars per hour along path 1–2–6 plus 100 cars per hour along path 1–2–4–6. Can we still increase the flow? Yes, along path 1–3–5–6. This is the bottom path. We consider the maximum capacity for each node along this route. The capacity from node 1 to node 3 is 10 units; the capacity from node 3 to node 5 is 2 units; and the capacity from node 5 to node 6 is 6 units. We are limited by the lowest of these, which is the 2 units of f low from node 3 to node 5. The 2-unit increase in f low along this path is shown in Figure M8.5.

Again we repeat the process, trying to find a path with any unused capacity through the network. If you carefully check the last iteration in Figure M8.5, you will see that there are no more paths from node 1 to node 6 with unused capacity, even though several other branches in

3

1 2 2

Subtract 2

Add 2

Old Path

1

3 0 4

New Path

1

2

6

1

2

6

FIGURE M8.3 Capacity Adjustment for Path 1–2–6 Iteration 1

The process is repeated.

We continue until there are no more paths with unused capacity.

Z09_REND3161_13_AIE_M08.indd 22 31/10/16 1:58 PM

M8.3 MAxIMAL-FLOW PROBLEM  M8-23

the network do have unused capacity. The maximum flow of 500 cars per hour is summarized in the following table:

PATH FLOW (CARS PER HOUR)

1–2–6 200

1–2–4–6 100

1–3–5–6 200

Total 500

You can also compare the original network to the final network to see the flow between any of the nodes.

This maximal-flow problem can be solved using QM for Windows. Select Networks from the Module drop-down menu. Then click File—New and select Maximal Flow as the type of network. In the screen that appears, enter the number of arcs and click OK. The input screen will allow you to enter the starting node, the ending node, and the capacity in each direction for each arc. When the problem is solved, one additional column labeled Flow is added to the table, and this column contains the optimal solution.

1

1

1

1

3

1

Subtract 1

Add 1

Old Path

1

2

6

4

0

2 10

4 0

0

0 2 0

1

0 3

2

1 6

2 4

0

New Network

1

2

6

5

4

3

FIGURE M8.4 Second Iteration for Waukesha Road System

0

2

8

4 0

0

0 2 0

1

2

3 0

3 4

2 4

2 1

2

6

5

4

3

FIGURE M8.5 Third and Final Iteration for Waukesha Road System

Z09_REND3161_13_AIE_M08.indd 23 31/10/16 1:58 PM

M8.4 Shortest-Route Problem

The objective of the shortest-route problem is to find the shortest distance from one location to another. In a network, this often involves determining the shortest route from one node to each of the other nodes.

Shortest-Route Technique Every day, Ray Design, Inc., must transport beds, chairs, and other furniture items from the fac- tory to the warehouse. This involves going through several cities. Ray Design would like to find the route with the shortest distance. The road network is shown in Figure M8.6.

The shortest-route technique can be used to minimize total distance from any starting node to a final node. The technique is summarized in the following steps.

Steps of the Shortest-Route Technique

1. Find the nearest node to the origin (plant). Put the distance in a box by the node. 2. Find the next-nearest node to the origin (plant), and put the distance in a box by the node.

In some cases, several paths will have to be checked to find the nearest node. 3. Repeat this process until you have gone through the entire network. The last distance at

the ending node will be the distance of the shortest route. You should note that the distance placed in the box by each node is the shortest route to this node. These distances are used as intermediate results in finding the next-nearest node.

Looking at Figure M8.6, we can see that the nearest node to the plant is node 2, with a distance of 100 miles. Thus, we will connect these two nodes. This first iteration is shown in Figure M8.7.

Now we look for the next-nearest node to the origin. We check nodes 3, 4, and 5. Node 3 is the nearest, but there are two possible paths. Path 1–2–3 is nearest to the origin, with a total distance of 150 miles (see Figure M8.8).

We repeat the process. The next-nearest node is either node 4 or node 5. Node 4 is 200 miles from node 2, and node 2 is 100 miles from node 1. Thus, node 4 is 300 miles from the origin. There are two paths for node 5, 2–5 and 3–5, to the origin. Note that we don’t have to go all the way back to the origin because we already know the shortest route from node 2 and node 3 to the

The shortest-route technique minimizes the distance through a network.

The steps of the shortest-route technique.

100

100 200

100

100

50 150

200

40

Plant

Warehouse

1

2

3

4

5

6

FIGURE M8.6 Roads from Ray Design’s Plant to Warehouse

We look for the nearest node to the origin.

100

100 200

100

100

50 150

200

40

Plant

Warehouse

1

2

3

4

5

6

100 FIGURE M8.7 First Iteration for Ray Design

M8-24  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 24 31/10/16 1:58 PM

M8.4 SHORTEST-ROUTE PROBLEM  M8-25

origin. The minimum distances are placed in boxes by these nodes. Path 2–5 is 100 miles, and node 2 is 100 miles from the origin. Thus, the total distance is 200 miles. In a similar fashion, we can determine that the path from node 5 to the origin through node 3 is 190 (40 miles between node 5 and 3 plus 150 miles from node 3 to the origin). Thus, we pick node 5 going through node 3 to the origin (see Figure M8.9).

The next-nearest node will be either node 4 or node 6, as the last remaining nodes. Node 4 is 300 miles from the origin (300 = 200 from node 4 to node 2 plus 100 from node 2 to the origin). Node 6 is 290 miles from the origin 1290 = 100 + 1902. Node 6 has the minimum distance, and because it is the ending node, we are done (refer to Figure M8.10). The shortest route is path 1–2–3–5–6, with a minimum distance of 290 miles. This problem can be solved in QM for Windows.

1

2

3

4

5

6

100

100 200

100

100

50 150

200

40

100

150

FIGURE M8.8 Second Iteration for Ray Design

1

2

3

4

5

6

100

100 200

100

100

50 150

200

40

100

150 190

FIGURE M8.9 Third Iteration for Ray Design

1

2

3

4

5

6

100

100 200

100

100

50 150

200

40

100

150

290

190

FIGURE M8.10 Fourth and Final Iteration for Ray Design

Z09_REND3161_13_AIE_M08.indd 25 31/10/16 1:58 PM

M8-26  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

In this module, we explored several special algorithms for solving some network problems. We saw how to develop an initial solution to the transportation problem with the north- west corner method. The stepping-stone path method was used to calculate improvement indices for the empty cells. Improved solutions were developed using a stepping-stone path. The spe- cial cases of the transportation problem included degeneracy, unbalanced problems, and multiple optimal solutions.

We presented the Hungarian method for solving assign- ment problems. When an assignment problem is unbalanced, dummy rows or columns are used to balance the problem. Assignment problems with maximization objectives were also presented. Other special-purpose algorithms for solving the maximal-flow problem and the shortest-route problems were also presented.

Summary

Glossary

Arc A line in a network that may represent a path or route. An arc or branch is used to connect the nodes in a network.

Balanced Assignment Problem An assignment problem in which the number of rows is equal to the number of columns.

Balanced Transportation Problem The condition under which total demand (at all destinations) is equal to total supply (at all sources).

Degeneracy A condition that occurs when the number of occupied squares in any solution is less than the number of rows plus the number of columns minus 1 in a transporta- tion table.

Destination A demand location in a transportation problem. Dummy Destination An artificial destination added to a

transportation table when total supply is greater than total demand. The demand at the dummy destination is set so that total supply and demand are equal. The transportation cost for dummy destination cells is zero.

Dummy Rows or Columns Extra rows or columns added in order to “balance” an assignment problem so that the num- ber of rows equals the number of columns.

Dummy Source An artificial source added to a transporta- tion table when total demand is greater than total supply. The supply at the dummy source is set so that total demand and supply are equal. The transportation cost for dummy source cells is zero.

Flood’s Technique Another name for the Hungarian method. Hungarian Method A matrix reduction approach to solving

the assignment problem. Improvement Index The net cost of shipping one unit on a

route not used in the current transportation problem solution.

Matrix Reduction The approach of the assignment method that reduces the original table of assignment costs to a table of opportunity costs.

Maximal-Flow Problem A network problem with the objec- tive of determining the maximum amount that may flow from the origin or source to the final destination or sink.

Node A point in a network, often represented by a circle, that is at the beginning or end of an arc.

Northwest Corner Rule A systematic procedure for establishing an initial feasible solution to the transportation problem.

Opportunity Cost In an assignment problem, this is the additional cost incurred when the assignment with the lowest possible cost in a row or column is not selected.

Shortest-Route Problem A network problem with the ob- jective of finding the shortest distance from one location to another.

Sink The final node or destination in a network. Source An origin or supply location in a transportation prob-

lem. Also, the origin or beginning node in a network. Stepping-Stone Method An iterative technique for moving

from an initial feasible solution to an optimal solution in transportation problems.

Transportation Problem A specific case of LP concerned with scheduling shipments from sources to destinations so that total transportation cost is minimized.

Transportation Table A table summarizing all transporta- tion data to help keep track of all algorithm computations. It stores information on demands, supplies, shipping costs, units shipped, origins, and destinations.

Solved Problems

Solved Problem M8-1 Don Yale, president of Hardrock Concrete Company, has plants in three locations and is currently working on three major construction projects, located at different sites. The shipping costs per truck- load of concrete, plant capacities, and project requirements are provided in the accompanying table.

a. Formulate an initial feasible solution to Hardrock’s transportation problem using the northwest cor- ner rule.

Z09_REND3161_13_AIE_M08.indd 26 31/10/16 1:58 PM

M8.4 SHORTEST-ROUTE PROBLEM  M8-27 SOLVED PROBLEMS  M8-27

b. Then evaluate each unused shipping route (each empty cell) by applying the stepping-stone method and computing all improvement indices. Remember to do the following: 1. Check that supply and demand are equal. 2. Load the table via the northwest corner method. 3. Check that there are the proper number of occupied cells for a “normal” solution—namely,

Number of rows + Number of columns - 1 = Number of occupied cells. 4. Find a closed path to each empty cell. 5. Determine the improvement index for each unused cell. 6. Move as many units as possible to the cell that provides the most improvement (if there is one). 7. Repeat steps 3 through 6 until no further improvement can be found.

TO

FROM PROJECT

A PROJECT

B PROJECT

C PLANT CAPACITIES

PLANT 1 $10 $4 $11 70

PLANT 2 $12 $5 $8 50

PLANT 3 $9 $7 $6 30

PROJECT REQUIREMENTS 40 50 60 150

Solution

a. Northwest corner solution:

Initial cost = 401+102 + 301+42 + 201+52 + 301+82 + 301+62 = +1,040

TO

FROM PROJECT

A PROJECT

B PROJECT

C PLANT CAPACITIES

PLANT 1 $10

40

$4

30

$11

70

PLANT 2 $12 $5

20

$8

30 50

PLANT 3 $9 $7 $6

30 30

PROJECT REQUIREMENTS 40 50 60 150

b. Using the stepping-stone method, the following improvement indices are computed:

Path: plant 1 to project C = +11 - +8 + +5 - +4 = ++4 (closed path: 1C to 2C to 2B to 1B)

TO

FROM PROJECT

A PROJECT

B PROJECT

C PLANT CAPACITIES

PLANT 1

40 30 - + 70

PLANT 2

20 + 30 - 50

PLANT 3

30 30

PROJECT REQUIREMENTS 40 50 60 150

11

8

6

4

5

7

10

12

9

Path: plant 1 to project C

Z09_REND3161_13_AIE_M08.indd 27 31/10/16 1:58 PM

M8-28  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Path: plant 2 to project A = +12 - +5 + +4 - +10 = ++1 (closed path: 2A to 2B to 1B to 1A)

TO

FROM PROJECT

A PROJECT

B PROJECT

C PLANT CAPACITIES

PLANT 1

40 - + 30 70 PLANT 2

+ - 20 30 50

PLANT 3

30 30

PROJECT REQUIREMENTS

40

50

60

150

Path: plant 3 to project A = +9 - +6 + +8 - +5 + +4 - +10 = +0 (closed path: 3A to 3C to 2C to 2B to 1B to 1A)

TO

FROM PROJECT

A PROJECT

B PROJECT

C PLANT CAPACITIES

PLANT 1

40 -

30 +

70

PLANT 2 12

- 20

+ 30 50

PLANT 3

+ 7

- 30 30 PROJECT REQUIREMENTS

40

50

60

150

Path: plant 3 to project B = +7 - +6 + +8 - +5 = ++4 (closed path: 3B to 3C to 2C to 2B)

TO

FROM PROJECT

A PROJECT

B PROJECT

C PLANT CAPACITIES

PLANT 1 10

40

4

30

11

70

PLANT 2 12

20 -

30 +

50

PLANT 3 9

+ - 30 30 PROJECT REQUIREMENTS

40

50

60

150

Path: plant 2 to project A

Path: plant 3 to project A

Path: plant 3 to project B

10

12

4

5

10

5

4

8

69

7

5

6

8

11

11

5558

679

M8-28  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 28 31/10/16 1:58 PM

M8.4 SHORTEST-ROUTE PROBLEM  M8-29

Since all indices are greater than or equal to zero (all are positive or zero), this initial solution pro- vides the optimal transportation schedule—namely, 40 units from 1 to A, 30 units from 1 to B, 20 units from 2 to B, 30 units from 2 to C, and 30 units from 3 to C.

Had we found a path that allowed improvement, we would move all units possible to that cell and then check every empty cell again. Because the plant 3 to project A improvement index was equal to zero, we note that multiple optimal solutions exist.

Solved Problem M8-2 The initial solution found in Solved Problem M8-1 was optimal, but the improvement index for one of the empty cells was zero, indicating another optimal solution. Use a stepping-stone path to develop this other optimal solution.

Solution Using the plant 3 to project A stepping-stone path, we see that the lowest number of units in a cell where a subtraction is to be made is 20 units from plant 2 to project B. Therefore, 20 units will be subtracted from each cell with a minus sign and added to each cell with a plus sign. The result is shown here:

TO

FROM PROJECT

A PROJECT

B PROJECT

C PLANT CAPACITIES

PLANT 1

20 50 70

PLANT 2

50 50

PLANT 3

20 10 30

PROJECT REQUIREMENTS

40

50

60

150

Solved Problem M8-3 Prentice Hall, Inc., a publisher headquartered in New Jersey, wants to assign three recently hired col- lege graduates—Jones, Smith, and Wilson—to regional sales districts in Omaha, Dallas, and Miami. But the firm also has an opening in New York and would send one of the three there if it were more economical than a move to Omaha, Dallas, or Miami. It will cost $1,000 to relocate Jones to New York, $800 to relocate Smith there, and $1,500 to move Wilson. What is the optimal assignment of personnel to offices?

OFFICE

HIREE OMAHA MIAMI DALLAS

JONES $800 $1,100 $1,200

SMITH $500 $1,600 $1,300

WILSON $500 $1,000 $2,300

10 114

8812

679

SOLVED PROBLEMS  M8-29

Z09_REND3161_13_AIE_M08.indd 29 31/10/16 1:58 PM

M8-30  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Solution

a. The cost table has a fourth column to represent New York. To balance the problem, we add a dummy row (person) with a zero relocation cost to each city.

OFFICE

HIREE OMAHA MIAMI DALLAS NEW YORK

JONES $800 $1,100 $1,200 $1,000

SMITH $500 $1,600 $1,300 $800

WILSON $500 $1,000 $2,300 $1,500

DUMMY 0 0 0 0

b. Subtract the smallest number in each row and cover zeros (column subtraction will give the same numbers and therefore is not necessary).

OFFICE

HIREE OMAHA MIAMI DALLAS NEW YORK

JONES 0 300 400 200

SMITH 0 1,100 800 300

WILSON 0 500 1,800 1,000

DUMMY 0 0 0 0

c. Subtract the smallest uncovered number (200) from each uncovered number, add it to each square where two lines intersect, and cover all zeros.

OFFICE

HIREE OMAHA MIAMI DALLAS NEW YORK

JONES 0 100 200 0

SMITH 0 900 600 100

WILSON 0 300 1,600 800

DUMMY 200 0 0 0

d. Subtract the smallest uncovered number (100) from each uncovered number, add it to each square where two lines intersect, and cover all zeros.

OFFICE

HIREE OMAHA MIAMI DALLAS NEW YORK

JONES 0 0 100 0

SMITH 0 800 500 100

WILSON 0 200 1,500 800

DUMMY 300 0 0 100

M8-30  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 30 31/10/16 1:58 PM

M8.4 SHORTEST-ROUTE PROBLEM  M8-31

e. Subtract the smallest uncovered number (100) from each uncovered number, add it to squares where two lines intersect, and cover all zeros.

OFFICE

HIREE OMAHA MIAMI DALLAS NEW YORK

JONES 100 0 100 0

SMITH 0 700 400 0

WILSON 0 100 1,400 700

DUMMY 400 0 0 100

f. Since it takes four lines to cover all zeros, an optimal assignment can be made at zero squares. We assign

Dummy (no one) to Dallas Wilson to Omaha Smith to New York Jones to Miami Cost = +0 + +500 + +800 + +1,100 = +2,400

Solved Problem M8-4 PetroChem, an oil refinery located on the Mississippi River south of Baton Rouge, Louisiana, is designing a new plant to produce diesel fuel. Figure M8.11 shows the network of the main process- ing centers along with the existing rate of flow (in thousands of gallons of fuel). The management at PetroChem would like to determine the maximum amount of fuel that can flow through the plant, from node 1 to node 7.

Solution Using the maximal-flow technique, we arbitrarily choose path 1–5–7, which has a maximum flow of 5. The capacity are then adjusted, leaving the capacity from 1 to 5 at 0 and the capacity from 5 to 7 also at 0. The next path arbitrarily selected is 1–2–4–7, and the maximum flow is 3. When capaci- ties are adjusted, the capacity from 1 to 2 and the capacity from 4 to 7 are 1, and the capacity from 2 to 4 is 0. The next path selected is 1–3–6–7, which has a maximum flow of 1, and the capacity from 3 to 6 is adjusted to 0. The next path selected is 1–2–5–6–7, which has a maximum flow of 1. After this, there are no more paths with any capacity. Arc 5–7 has capacity of 0. While arc 4–7 has a capacity of 1, both arc 2–4 and arc 5–4 have a capacity of 0, so no more flow is available through

1

3

2

4

5

6

7 4

5 8

3 30

0 3 1

1 6

0 1

2 1

3

3 4

2 1

0

0

4

5

FIGURE M8.11

SOLVED PROBLEMS  M8-31

Z09_REND3161_13_AIE_M08.indd 31 31/10/16 1:58 PM

M8-32  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

node 4. Similarly, while arc 6–7 has a capacity of 4 remaining, the capacity for arc 3–6 and the capacity for arc 5–6 are 0. Thus, the maximum flow is 10 15 + 3 + 1 + 12. The flows are shown in Figure M8.12.

Solved Problem M8-5 The network of Figure M8.13 shows the highways and cities surrounding Leadville, Colorado. Leadville Tom, a bicycle helmet manufacturer, must transport his helmets to a distributor based in Dillon, Colorado. To do this, he must go through several cities. Tom would like to find the shortest way to get from Leadville to Dillon. What do you recommend?

Solution The problem can be solved using the shortest-route technique. The nearest node to the origin (node 1) is node 2. Give this a distance of 8 and put this in a box next to node 2. Next, consider nodes 3, 4, and 5, since there is an arc to each of these from either node 1 or node 2, and both of these have their distances established. The nearest node to the origin is 3 (coming through node 2), so the distance to put in the box next to node 3 is 14 18 + 62. Then consider nodes 4, 5, and 6. The node nearest the origin is node 4, which has a distance of 18 (directly from node 1). Then consider nodes 5 and 6. The node with the least distance from the origin is node 5 (coming through node 2), and this distance is 22. Next, consider nodes 6 and 7, and node 6 is selected, since the distance is 26 (coming through node 3). Finally, node 7 is considered, and the shortest distance from the origin is 32 (coming through node 6). The route that gives the shortest distance is 1–2–3–6–7, and the distance is 32. See Figure M8.14 for the solution.

1

3

2

4

5

6

7 4,0

00

5,000 1,000

3,000

1,000

1,000

2, 00

0

1,000

3,000

5,000

FIGURE M8.12

6

12

14

12

10

16

8 18

16 6

8

3

Leadville Dillon

2 5

7

64

1

FIGURE M8.13

6

12

14

12

10

16

8 18

16 6

8

3

Leadville Dillon

2 5

7

64

1

8 22

18 26

14 32

FIGURE M8.14

M8-32  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 32 31/10/16 1:58 PM

Self-Test

●● Before taking the self-test, refer to the learning objectives at the beginning of the module, the notes in the margins, and the glossary at the end of the module.

●● Use the key at the back of the book to correct your answers. ●● Restudy pages that correspond to any questions that you answered incorrectly or material you feel uncertain about.

1. If the total demand equals the total supply in a transportation problem, the problem is a. degenerate. b. unbalanced. c. balanced. d. infeasible.

2. In a transportation problem, what indicates that the minimum cost solution has been found? a. All improvement indices are negative or zero. b. All improvement indices are positive or zero. c. All improvement indices are equal to zero. d. All cells in the dummy row are empty.

3. An assignment problem may be viewed as a transportation problem with a. a cost of $1 for all shipping routes. b. all supplies and demands equal to 1. c. only demand constraints. d. only supply constraints.

4. If the number of filled cells in a transportation table does not equal the number of rows plus the number of columns minus 1, then the problem is said to be a. degenerate. b. unbalanced. c. optimal. d. a maximization problem.

5. If a solution to a transportation problem is degenerate, then a. a dummy row or column must be added. b. it will be impossible to evaluate all empty cells without

removing the degeneracy. c. there will be more than one optimal solution. d. the problem has no feasible solution.

6. If the total demand is greater than the total capacity in a transportation problem, then a. the optimal solution will be degenerate. b. a dummy source must be added. c. a dummy destination must be added. d. both a dummy source and a dummy destination must

be added.

7. The Hungarian method is a. used to solve assignment problems. b. a way to develop an initial solution to a transportation

problem. c. also called Vogel’s approximation method. d. used only for problems in which the objective is to

maximize profit. 8. In an assignment problem, it may be necessary to add

more than one row to the table. a. False b. True

9. When using the Hungarian method, an optimal assignment can always be made when every row and every column has at least one zero. a. False b. True

10. The first step of the maximal-flow technique is to a. select any node. b. pick any path from the start to the finish with some flow. c. pick the path with the maximum flow. d. pick the path with the minimal flow. e. pick a path where the flow going into each node is

greater than the flow coming out of each node. 11. In which technique do you connect the existing solution

to the nearest node that is not currently connected? a. maximal tree b. shortest route c. maximal flow d. minimal flow

12. In the shortest-route technique, the objective is to determine the route from an origin to a destination that passes through the fewest number of other nodes. a. True b. False

13. Adjusting the flow capacity numbers on a path is an important step in which technique? a. minimal flow b. maximal flow c. shortest route

Discussion Questions and Problems

Discussion Questions M8-1 What is a balanced transportation problem? Describe

the approach you would use to solve an unbalanced problem.

M8-2 The stepping-stone method is being used to solve a transportation problem. The smallest quantity in a cell with a minus sign is 35, but two different cells with

minus signs have 35 units in them. What problem will this cause, and how should this difficulty be resolved?

M8-3 The stepping-stone method is being used to solve a transportation problem. There is only one empty cell having a negative improvement index, and this index is -2. The stepping-stone path for this cell indicates that the smallest quantity for the cells with minus

DISCUSSION QUESTIONS AND PROBLEMS  M8-33

Z09_REND3161_13_AIE_M08.indd 33 31/10/16 1:58 PM

signs is 80 units. If the total cost for the current solu- tion is $900, what will the total cost be for the im- proved solution? What can you conclude about how much the total cost will decrease when developing each new solution for any transportation problem?

M8-4 Explain what happens when the solution to a trans- portation problem does not have m + n - 1 oc- cupied squares (where m = number of rows in the table and n = number of columns in the table).

M8-5 What is the enumeration approach to solving assign- ment problems? Is it a practical way to solve a 5 row * 5 column problem? A 7 * 7 problem? Why?

M8-6 How could an assignment problem be solved using the transportation approach? What condition will make the solution of this problem difficult?

M8-7 You are the plant supervisor and are responsible for scheduling workers to jobs on hand. After estimating the cost of assigning each of five available workers in your plant to five projects that must be completed immediately, you solve the problem using the Hun- garian method. The following solution is reached, and you post these job assignments:

Jones to project A Smith to project B Thomas to project C Gibbs to project D Heldman to project E

The optimal cost was found to be $492 for these assignments. The plant general manager inspects your original cost estimates and informs you that in- creased employee benefits mean that each of the 25 numbers in your cost table is too low by $5. He sug- gests that you immediately rework the problem and post the new assignments.

Is this necessary? Why? What will the new opti- mal cost be?

M8-8 Sue Simmons’s marketing research firm has local representatives in all but five states. She decides to expand to cover the whole United States by transfer- ring five experienced volunteers from their current locations to new offices in each of the five states. Simmons’s goal is to relocate the five representa- tives at the least total cost. Consequently, she sets up a 5 * 5 relocation cost table and prepares to solve it for the best assignments by use of the Hungarian method. At the last moment, Simmons recalls that although the first four volunteers did not pose any objections to being placed in any of the five new cities, the fifth volunteer did make one restriction. That person absolutely refused to be assigned to the new office in Tallahassee, Florida—fear of southern roaches, the representative claimed! How should Sue alter the cost matrix to ensure that this assign- ment is not included in the optimal solution?

M8-9 Describe the steps of the maximal-flow technique. M8-10 What are the steps of the shortest-route technique? M8-11 Describe a problem that can be solved by the

shortest-route technique. M8-12 Is it possible to get alternate optimal solutions with

the shortest-route technique? Is there an automatic way of knowing if you have an alternate optional solution?

Problems M8-13 The management of the Executive Furniture Cor-

poration decided to expand the production ca- pacity at its Des Moines factory and to cut back production at its other factories. It also recognizes a shifting market for its desks and revises the

Data for Problem M8-13

NEW WAREHOUSE REQUIREMENTS

NEW FACTORY CAPACITIES

Albuquerque (A) 200 desks Des Moines (D) 300 desks

Boston (B) 200 desks Evansville (E) 150 desks

Cleveland (C) 300 desks Fort Lauderdale (F) 250 desks

Table for Problem M8-13

TO FROM

ALBUQUERQUE

BOSTON

CLEVELAND

DES MOINES 5 4 3

EVANSVILLE 8 4 3

FORT LAUDERDALE 9 7 5

Note: means the problem may be solved with QM for Windows; means the problem may be solved with Excel QM;

and means the problem may be solved with QM for Windows and/or Excel QM.

M8-34  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 34 31/10/16 1:58 PM

requirements at its three warehouses. (See the data table on the previous page.)

(a) Use the northwest corner rule to establish an initial feasible shipping schedule and calculate its cost. (See the transportation table on the pre- vious page.)

(b) Use the stepping-stone method to test whether an improved solution is possible.

(c) Explain the meaning and implications of an im- provement index that is equal to 0. What decisions might management make with this information? Exactly how is the final solution affected?

M8-14 The Hardrock Concrete Company has plants in three locations and is currently working on three major construction projects, each located at a dif- ferent site. The shipping costs per truckload of concrete, daily plant capacities, and daily project requirements are provided in the table on this page.

(a) Formulate an initial feasible solution to Hard- rock’s transportation problem using the north- west corner rule. Then evaluate each unused shipping route by computing all improvement indices. Is this solution optimal? Why?

(b) Is there more than one optimal solution to this problem? Why?

M8-15 Hardrock Concrete’s owner has decided to in- crease the capacity at his smallest plant (see Problem M8-14). Instead of producing 30 loads of concrete per day at plant 3, that plant’s capac- ity is doubled to 60 loads. Find the new optimal

solution using the northwest corner rule and stepping-stone method. How has changing the third plant’s capacity altered the optimal shipping assignment? Discuss the concepts of degeneracy and multiple optimal solutions with regard to this problem.

M8-16 The Saussy Lumber Company ships pine flooring to three building supply houses from its mills in Pineville, Oak Ridge, and Mapletown. Determine the best transportation schedule for the data given in the table on this page. Use the northwest corner rule and the stepping-stone method.

M8-17 The Krampf Lines Railway Company specializes in coal handling. On Friday, April 13, Krampf had empty cars at the following towns in the quantities indicated:

TOWN SUPPLY OF CARS

Morgantown 35

Youngstown 60

Pittsburgh 25

By Monday, April 16, the following towns will need coal cars as follows:

TOWN DEMAND FOR CARS

Coal Valley 30

Coaltown 45

Coal Junction 25

Coalsburg 20

Data for Problem M8-14

TO

FROM PROJECT A PROJECT B PROJECT C PLANT CAPACITIES

PLANT 1 $10 $4 $11 70

PLANT 2 12 5 8 50

PLANT 3 9 7 6 30

PROJECT REQUIREMENTS

40 50 60 150

Table for Problem M8-16

TO

FROM

SUPPLY HOUSE 1

SUPPLY HOUSE 2

SUPPLY HOUSE 3

MILL

CAPACITY (TONS)

PINEVILLE $3 $3 $2 25

OAK RIDGE 4 2 3 40

MAPLETOWN 3 2 3 30

SUPPLY HOUSE DEMAND (TONS)

30 30 35 95

DISCUSSION QUESTIONS AND PROBLEMS  M8-35

Z09_REND3161_13_AIE_M08.indd 35 31/10/16 1:58 PM

Using a railway city-to-city distance chart, the dis- patcher constructs a mileage table for the preced- ing towns. The result is shown in the table on this page. Minimizing total miles over which cars are moved to new locations, compute the best ship- ment of coal cars.

M8-18 An air conditioning manufacturer produces room air conditioners at plants in Houston, Phoenix, and Memphis. These are sent to regional distributors in Dallas, Atlanta, and Denver. The shipping costs vary, and the company would like to find the least- cost way to meet the demands at each of the dis- tribution centers. Dallas needs to receive 800 air conditioners per month, Atlanta needs 600, and Denver needs 200. Houston has 850 air condition- ers available each month, Phoenix has 650, and Memphis has 300. The shipping cost per unit from Houston to Dallas is $8, to Atlanta is $12, and to Denver is $10. The cost per unit from Phoenix to Dallas is $10, to Atlanta is $14, and to Denver is $9. The cost per unit from Memphis to Dallas is $11, to Atlanta is $8, and to Denver is $12. How many units should be shipped from each plant to each regional distribution center? What is the total cost for this?

M8-19 Finnish Furniture manufactures tables in facilities located in three cities—Reno, Denver, and Pitts- burgh. The tables are then shipped to three retail stores located in Phoenix, Cleveland, and Chi- cago. Management wishes to develop a distribu- tion schedule that will meet the demands at the lowest possible cost. The shipping cost per unit

from each of the sources to each of the destina- tions is shown in the following table:

TO

FROM PHOENIX CLEVELAND CHICAGO

RENO 10 16 19

DENVER 12 14 13

PITTSBURGH 18 12 12

The available supplies are 120 units from Reno, 200 units from Denver, and 160 units from Pitts- burgh. Phoenix has a demand of 140 units, Cleve- land has a demand of 160 units, and Chicago has a demand of 180 units. How many units should be shipped from each manufacturing facility to each of the retail stores if cost is to be minimized? What is the total cost?

M8-20 Finnish Furniture has experienced a decrease in the demand for tables in Chicago; the demand has fallen to 150 units (see Problem M8-19). What special condition would exist? What is the minimum-cost solution? Will there be any units remaining at any of the manufacturing facilities?

M8-21 Consider the transportation table on this page. Find an initial solution using the northwest corner rule. What special condition exists? Explain how you will proceed to solve the problem.

M8-22 The B. Hall Real Estate Investment Corporation has identified four small apartment buildings in which it would like to invest. Mrs. Hall has

Table for Problem M8-17

TO

FROM COAL VALLEY COALTOWN COAL JUNCTION COALSBURG

MORGANTOWN 50 30 60 70

YOUNGSTOWN 20 80 10 90

PITTSBURGH 100 40 80 30

Table for Problem M8-21

TO

FROM

DESTINATION

A

DESTINATION

B

DESTINATION

C SUPPLY

SOURCE 1 $8 $9 $4 72

SOURCE 2 5 6 8 38

SOURCE 3 7 9 6 46

SOURCE 4 5 3 7 19

DEMAND 110 34 31 175

M8-36  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 36 31/10/16 1:58 PM

approached three savings and loan companies re- garding financing. Because Hall has been a good client in the past and has maintained a high credit rating in the community, each savings and loan company is willing to consider providing all or part of the mortgage loan needed on each prop- erty. Each loan officer has set differing interest rates on each property (rates are affected by the neighborhood of the apartment building, condi- tion of the property, and desire by the individual savings and loan to finance various-size build- ings), and each loan company has placed a maxi- mum credit ceiling on how much it will lend Hall in total. This information is summarized in the table on this page.

Each apartment building is equally attractive as an investment to Hall, so she has decided to purchase all buildings possible at the lowest total payment of interest. From which savings and loan companies should she borrow to purchase which buildings? More than one savings and loan can fi- nance the same property.

M8-23 The J. Mehta Company’s production manager is planning for a series of 1-month production peri- ods for stainless steel sinks. The demand for the next 4 months is as follows:

MONTH

DEMAND FOR STAINLESS STEEL SINKS

1 120

2 160

3 240

4 100

The Mehta firm can normally produce 100 stain- less steel sinks in a month. This is done during regular production hours at a cost of $100 per sink. If demand in any 1 month cannot be satisfied by regular production, the production manager has three other choices: (1) he can produce up to 50 more sinks per month in overtime but at a cost of $130 per sink; (2) he can purchase a limited num- ber of sinks from a friendly competitor for resale (the maximum number of outside purchases over

the 4-month period is 450 sinks, at a cost of $150 each); or (3) he can fill the demand from his on- hand inventory. The inventory carrying cost is $10 per sink per month. Back orders are not permit- ted. Inventory on hand at the beginning of month 1 is 40 sinks. Set up this “production smoothing” problem as a transportation problem to minimize cost. Use the northwest corner rule to find an ini- tial level for production and outside purchases over the 4-month period.

M8-24 In a job shop operation, four jobs may be per- formed on any of four machines. The hours re- quired for each job on each machine are presented in the following table. The plant supervisor would like to assign jobs so that total time is minimized. Find the best solution.

MACHINE

JOB W X Y Z

A12 10 14 16 13

A15 12 13 15 12

B2 9 12 12 11

B9 14 16 18 16

M8-25 Four automobiles have entered Bubba’s Repair Shop for various types of work, ranging from a transmission overhaul to a brake job. The experi- ence level of the mechanics is quite varied, and Bubba would like to minimize the time required to complete all of the jobs. He has estimated the time in minutes for each mechanic to complete each job. Billy can complete job 1 in 400 minutes, job 2 in 90 minutes, job 3 in 60 minutes, and job 4 in 120 minutes. Taylor will finish job 1 in 650 minutes, job 2 in 120 minutes, job 3 in 90 min- utes, and job 4 in 180 minutes. Mark will finish job 1 in 480 minutes, job 2 in 120 minutes, job 3 in 80 minutes, and job 4 in 180 minutes. John will complete job 1 in 500 minutes, job 2 in 110 min- utes, job 3 in 90 minutes, and job 4 in 150 min- utes. Each mechanic should be assigned to just one of these jobs. What is the minimum total time required to finish the four jobs? Who should be assigned to each job?

Table for Problem M8-22

PROPERTY (INTEREST RATES) (%)

SAVINGS AND LOAN COMPANY

HILL ST.

BANKS ST.

PARK AVE.

DRURY LANE

MAXIMUM CREDIT LINE ($)

FIRST HOMESTEAD 8 8 10 11 80,000

COMMONWEALTH 9 10 12 10 100,000

WASHINGTON FEDERAL 9 11 10 9 120,000

LOAN REQUIRED TO PURCHASE BUILDING

$60,000

$40,000

$130,000

$70,000

DISCUSSION QUESTIONS AND PROBLEMS  M8-37

Z09_REND3161_13_AIE_M08.indd 37 31/10/16 1:58 PM

M8-26 Baseball umpiring crews are currently in four cities where three-game series are beginning. When these are finished, the crews are needed to work games in four different cities. The distances (miles) from each of the cities where the crews are currently working to each of the the cities where the new games will begin are shown in the following table:

TO

FROM

KANSAS CITY

CHICAGO

DETROIT

TORONTO

Seattle 1,500 1,730 1,940 2,070

Arlington 460 810 1,020 1,270

Oakland 1,500 1,850 2,080 X

Baltimore 960 610 400 330

The X indicates that the crew in Oakland cannot be sent to Toronto. Determine which crew should be sent to each city to minimize the total distance traveled. How many miles will be traveled if these assignments are made? To see how much better this solution is than the assignments that might have been made, find the assignments that would give the maximum distance traveled.

M8-27 Roscoe Davis, chairman of a college’s business department, has decided to apply a new method in assigning professors to courses next semes- ter. As a criterion for judging who should teach each course, Professor Davis reviews the past two years’ teaching evaluations (which were filled out by students). Since each of the four professors taught each of the four courses at one time or an- other during the two-year period, Davis is able to record a course rating for each instructor. These ratings are shown in the following table. Find the best assignment of professors to courses to maxi- mize the overall teaching rating.

COURSE

PROFESSOR STATISTICS MANAGEMENT FINANCE ECONOMICS

Anderson 90 65 95 40

Sweeney 70 60 80 75

Williams 85 40 80 60

McKinney 55 80 65 55

M8-28 The hospital administrator at St. Charles General must appoint head nurses to four newly estab- lished departments: urology, cardiology, orthope- dics, and obstetrics. In anticipation of this staffing problem, she had hired four nurses: Hawkins, Condriac, Bardot, and Hoolihan. Believing in the quantitative analysis approach to problem solv- ing, the administrator has interviewed each nurse, considered his or her background, personality, and talents, and developed a cost scale ranging from 0 to 100 to be used in the assignment. A 0 for Nurse Bardot being assigned to the cardiology unit implies that she would be perfectly suited to that task. A value close to 100, on the other hand, would imply that she is not at all suited to head that unit. The accompanying table gives the com- plete set of cost figures that the hospital admin- istrator felt represented all possible assignments. Which nurse should be assigned to which unit?

DEPARTMENT

NURSE UROLOGY CARDIOLOGY ORTHOPEDICS5OBSTETRICS5

Hawkins 28 18 15 75

Condriac 32 48 23 38

Bardot 51 36 24 36

Hoolihan 25 38 55 12

M8-29 The Fix-It Shop (see Section M8.2) has added a fourth repairman, Davis. Solve the cost table on this page for the new optimal assignment of work- ers to projects. Why did this solution occur?

PROJECT

WORKER 1 2 3

Adams $11 $14 $6

Brown 8 10 11

Cooper 9 12 7

Davis 10 13 8

M8-30 The XYZ Corporation is expanding its market to include Texas. Each salesperson is assigned to potential distributors in one of five different areas. It is anticipated that the salesperson will spend about 3 to 4 weeks in the assigned area. A

Table for Problem M8-30

AUSTIN/SAN ANTONIO

DALLAS/FT. WORTH

EL PASO/WEST TEXAS

HOUSTON/ GALVESTON

CORPUS CHRISTI/RIO GRANDE VALLEY

Erica 5 3 2 3 4

Louis 3 4 4 2 2

Maria 4 5 4 3 3

Paul 2 4 3 4 3

Orlando 4 5 3 5 4

M8-38  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 38 31/10/16 1:58 PM

statewide marketing campaign will begin once the product has been delivered to the distributors. The five salespeople who will be assigned to these ar- eas (one person for each area) have rated the ar- eas on the desirability of the assignment as shown in the table on the previous page. The scale is 1 (least desirable) to 5 (most desirable). Which as- signments should be made if the total of the rat- ings is to be maximized?

M8-31 Bechtold Construction is in the process of install- ing power lines to a large housing development. Steve Bechtold wants to minimize the total length of wire used, which will minimize his costs. The housing development is shown as a network in

Figure M8.15. Each house has been numbered, and the distances between houses are given in hundreds of feet. What do you recommend?

M8-32 The city of New Berlin is considering making sev- eral of its streets one-way. What is the maximum number of cars per hour that can travel from east to west? The network is shown in Figure M8.16.

M8-33 Transworld Moving has been hired to move the office furniture and equipment of Cohen Proper- ties to its new headquarters. What route do you recommend? The network of roads is shown in Figure M8.17.

M8-34 Because of a sluggish economy, Bechtold Con- struction has been forced to modify its plans for

1

2

4

5

7

63 8 12

14

9 13

11 10

1

3 7 7 4

5

5 332

2

4 4

5

6

7

4

3

3

6 6

5

FIGURE M8.15 Network for Problem M8-31

1 3

4

2

6

5

9

8

7

11

10

12

13

10 0

13010 0

120

70

100 60

100 100

50

40 20

100

40

100

100

200

100

50

50

Old O�ce

New O�ce

FIGURE M8.17 Network for Problem M8-33

8 4

6

3 1

25

7

2

0

0

2

2

2 2 2

0 2

2

2 04

4 3 1

1

2 5

0

1

FIGURE M8.16 Network for Problem M8-32

DISCUSSION QUESTIONS AND PROBLEMS  M8-39

Z09_REND3161_13_AIE_M08.indd 39 31/10/16 1:59 PM

the housing development in Problem M8-31. The result is that the path from node 6 to 7 now has a distance of 7. What impact does this have on the to- tal length of wire needed to install the power lines?

M8-35 The director of security wants to connect secu- rity video cameras to the main control site from five potential trouble locations. Ordinarily, cable would simply be run from each location to the main control site. However, because the envi- ronment is potentially explosive, the cable must be run in a special conduit that is continually air purged. This conduit is very expensive but large enough to handle five cables (the maximum that might be needed). Use the minimal-spanning tree technique to find a minimum distance route for the conduit between the locations noted in

Figure M8.18. (Note that it makes no difference which one is the main control site.)

M8-36 One of our best customers has had a major plant breakdown and wants us to make as many widgets for him as possible during the next few days, until he gets the necessary repairs done. With our gen- eral-purpose equipment, there are several ways to make widgets (ignoring costs). Any sequence of activities that takes one from node 1 to node 6 in Figure M8.19 will produce a widget. How many widgets can we produce per day? Quantities given are number of widgets per day.

M8-37 The road system from the hotel complex on Inter- national Drive (node 1) to Disney World (node 11) in Orlando, Florida, is shown in the network of Figure M8.20. The numbers by the nodes

75

65

50 37

53

56

41

48 23

26

1

2

3

4

5

6

FIGURE M8.18 Network for Problem M8-35

40

110

127 55

32160

70

45

200

1 2

3

5

4

6

FIGURE M8.19 Network for Problem M8-36

1

2 6

7

9

10

11

8

3

4

5

4

15

14 2

15

4

1

3

2 0

3

3

1

0

0

0 8

8

8 8 00

08

2

10

10 0

FIGURE M8.20 Network for Problem M8-37

M8-40  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 40 31/10/16 1:59 PM

represent the traffic flow in hundreds of cars per hour. What is the maximum flow of cars from the hotel complex to Disney World?

M8-38 A road construction project would increase the road capacity around the outside roads from In- ternational Drive to Disney World by 200 cars per hour (see Problem M8-37). The two paths affected would be 1–2–6–9–11 and 1–5–8–10–11. What impact would this have on the total flow of cars? Would the total flow of cars increase by 400 cars per hour?

M8-39 Solve the maximal-flow problem presented in the network of Figure M8.21. The numbers in the net- work represent thousands of gallons per hour as they flow through a chemical processing plant.

M8-40 Two terminals in the chemical processing plant, represented by nodes 6 and 7, require emergency repair (see Problem M8-39). No material can flow into or out of these nodes. What impact does this have on the capacity of the network?

M8-41 Solve the shortest-route problem presented in the network of Figure M8.22, going from node 1 to node 16. All numbers represent kilometers be- tween German towns near the Black Forest.

M8-42 Due to bad weather, the roads going through nodes 7 and 8 have been closed (see Problem M8- 41). No traffic can get onto or off of these roads.

Describe the impact that this will have (if any) on the shortest route through this network.

M8-43 Grey Construction would like to determine the least expensive way of providing houses it is build- ing with cable TV. It has identified 11 possible branches or routes that could be used to connect the houses. The cost in hundreds of dollars and the branches are summarized in the following table.

(a) What is the least expensive way to run cable to the houses?

BRANCH

START NODE

END NODE

COST ($100s)

Branch 1 1 2 5

Branch 2 1 3 6

Branch 3 1 4 6

Branch 4 1 5 5

Branch 5 2 6 7

Branch 6 3 7 5

Branch 7 4 7 7

Branch 8 5 8 4

Branch 9 6 7 1

Branch 10 7 9 6

Branch 11 8 9 2

1 3

4

2 5

6

7

8

11

13

12 9

10 144

1 1

3

3

2 2

2 1

1 1 4

0

2 2

2 1

6 0

3 1

5 0

6 05

2

1 0

4 41 0

0

3 1 5

1

FIGURE M8.21 Network for Problem M8-39

1 3

4

2

5

6

7

8 12

11

10

9

13

14

15

1615

20

11

8

12

22

12

18

10

10 16

16 12

18

18

20

15

15

25

16

17

14

1810

FIGURE M8.22 Network for Problem M8-41

DISCUSSION QUESTIONS AND PROBLEMS  M8-41

Z09_REND3161_13_AIE_M08.indd 41 31/10/16 1:59 PM

(b) After reviewing cable and installation costs, Grey Construction would like to alter the costs for providing cable TV to its houses. The first branches need to be changed. The changes are summarized in the following table. What is the impact on total costs?

BRANCH START NODE END NODE COST ($100s)

Branch 1 1 2 5

Branch 2 1 3 1

Branch 3 1 4 1

Branch 4 1 5 1

Branch 5 2 6 7

Branch 6 3 7 5

Branch 7 4 7 7

Branch 8 5 8 4

Branch 9 6 7 1

Branch 10 7 9 6

Branch 11 8 9 2

M8-44 In going from Quincy to Old Bainbridge, there are 10 possible roads that George Olin can take. Each road can be considered a branch in the shortest- route problem.

(a) Determine the best way to get from Quincy (node 1) to Old Bainbridge (node 8) that will minimize total distance traveled. All distances are in hundreds of miles.

BRANCH

START NODE

END NODE

DISTANCE (IN HUNDREDS OF MILES)

Branch 1 1 2 3

Branch 2 1 3 2

Branch 3 2 4 3

Branch 4 3 5 3

Branch 5 4 5 1

Branch 6 4 6 4

Branch 7 5 7 2

Branch 8 6 7 2

Branch 9 6 8 3

Branch 10 7 8 6

(b) George Olin made a mistake in estimating the distances from Quincy to Old Bainbridge. The new distances are in the following table. What impact does this have on the shortest route from Quincy to Old Bainbridge?

BRANCH

START NODE

END NODE

DISTANCE (IN HUNDREDS OF MILES)

Branch 1 1 2 3

Branch 2 1 3 2

Branch 3 2 4 3

Branch 4 3 5 1

Branch 5 4 5 1

Branch 6 4 6 4

Branch 7 5 7 2

Branch 8 6 7 2

Branch 9 6 8 3

Branch 10 7 8 6

M8-45 South Side Oil and Gas, a new venture in Texas, has developed an oil pipeline network to transport oil from exploration fields to the refinery and other locations. There are 10 pipelines (branches) in the network. The oil flow in hundreds of gallons and the network of pipelines are given in the following table.

(a) What is the maximum that can flow through the network?

BRANCH

START NODE

END NODE

CAPACITY

REVERSE CAPACITY

FLOW

Branch 1 1 2 10 4 10

Branch 2 1 3 8 2 5

Branch 3 2 4 12 1 10

Branch 4 2 5 6 6 0

Branch 5 3 5 8 1 5

Branch 6 4 6 10 2 10

Branch 7 5 6 10 10 0

Branch 8 5 7 5 5 5

Branch 9 6 8 10 1 10

Branch 10 7 8 10 1 5

(b) South Side Oil and Gas needs to modify its pipe- line network flow patterns. The new data are in the following table. What impact does this have on the maximum flow through the network?

BRANCH

START NODE

END NODE

CAPACITY

REVERSE CAPACITY

FLOW

Branch 1 1 2 10 4 10

Branch 2 1 3 8 2 5

Branch 3 2 4 12 1 10

Branch 4 2 5 0 0 0

Branch 5 3 5 8 1 5

Branch 6 4 6 10 2 10

Branch 7 5 6 10 10 0

Branch 8 5 7 5 5 5

Branch 9 6 8 10 1 10

Branch 10 7 8 10 1 5

M8-42  MODULE 8 • TRANSPORTATION, ASSIGNMENT, AND NETWORK ALGORITHMS

Z09_REND3161_13_AIE_M08.indd 42 31/10/16 1:59 PM

M8-46 Northwest University is in the process of com- pleting a computer bus network that will connect computer facilities throughout the university. The prime objective is to string a main cable from one end of the campus to the other (nodes 1–25) through underground conduits. These conduits are shown in the network of Figure M8.23; the distance between nodes is in hundreds of feet. Fortunately, these underground conduits have re- maining capacity through which the bus cable can be placed.

(a) Given the network for this problem, how far (in hundreds of feet) is the shortest route from node 1 to node 25?

(b) In addition to the computer bus network, a new phone system is being planned. The phone

system would use the same underground con- duits. If the phone system were installed, the following paths along the conduit would be at capacity and would not be available for the computer bus network: 6–11, 7–12, and 17–20. What changes (if any) would you have to make to the path used for the computer bus if the phone system were installed?

(c) The university did decide to install the new phone system before the cable for the com- puter network. Because of unexpected demand for computer networking facilities, an addi- tional cable is needed for node 1 to node 25. Unfortunately, the cable for the first or original network has completely used up the capacity along its path. Given this situation, what is the best path for the second network cable?

1

2

3

4

9

8

7

6

5

10

11

12

13

16

17

15

14 18

19

20

21

24

23

22

25

10 9

10

15

7 6

10

15

17

8 6 20

10 10

8

8

8 5

5

5

5

6

6

6

7

7

20

8

15

FIGURE M8.23 Network for Problem M8-46

Cases

See Chapter 9 for cases relevant to this module.

Bibliography

See Chapter 9 for references relevant to this module.

BIBLIOGRAPHY  M8-43

Z09_REND3161_13_AIE_M08.indd 43 31/10/16 1:59 PM

This page intentionally left blank

  • Cover
  • Title Page
  • Copyright Page
  • About the Authors
  • Brief Contents
  • Contents
  • Preface
  • Chapter 1: Introduction to Quantitative Analysis
    • 1.1. What Is Quantitative Analysis?
    • 1.2. Business Analytics
    • 1.3. The Quantitative Analysis Approach
      • Defining the Problem
      • Developing a Model
      • Acquiring Input Data
      • Developing a Solution
      • Testing the Solution
      • Analyzing the Results and Sensitivity Analysis
      • Implementing the Results
      • The Quantitative Analysis Approach and Modeling in the Real World
    • 1.4. How to Develop a Quantitative Analysis Model
      • The Advantages of Mathematical Modeling
      • Mathematical Models Categorized by Risk
    • 1.5. The Role of Computers and Spreadsheet Models in the Quantitative Analysis Approach
    • 1.6. Possible Problems in the Quantitative Analysis Approach
      • Defining the Problem
      • Developing a Model
      • Acquiring Input Data
      • Developing a Solution
      • Testing the Solution
      • Analyzing the Results
    • 1.7. Implementation—Not Just the Final Step
      • Lack of Commitment and Resistance to Change
      • Lack of Commitment by Quantitative Analysts
    • Summary
    • Glossary
    • Key Equations
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Food and Beverages at Southwestern University Football Games
    • Bibliography
  • Chapter 2: Probability Concepts and Applications
    • 2.1. Fundamental Concepts
      • Two Basic Rules of Probability
      • Types of Probability
      • Mutually Exclusive and Collectively Exhaustive Events
      • Unions and Intersections of Events
      • Probability Rules for Unions, Intersections, and Conditional Probabilities
    • 2.2. Revising Probabilities with Bayes’ Theorem
      • General Form of Bayes’ Theorem
    • 2.3. Further Probability Revisions
    • 2.4. Random Variables
    • 2.5. Probability Distributions
      • Probability Distribution of a Discrete Random Variable
      • Expected Value of a Discrete Probability Distribution
      • Variance of a Discrete Probability Distribution
      • Probability Distribution of a Continuous Random Variable
    • 2.6. The Binomial Distribution
      • Solving Problems with the Binomial Formula
      • Solving Problems with Binomial Tables
    • 2.7. The Normal Distribution
      • Area Under the Normal Curve
      • Using the Standard Normal Table
      • Haynes Construction Company Example
      • The Empirical Rule
    • 2.8. The F Distribution
    • 2.9. The Exponential Distribution
      • Arnold’s Muffler Example
    • 2.10. The Poisson Distribution
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: WTVX
    • Bibliography
    • Appendix 2.1: Derivation of Bayes’ Theorem
  • Chapter 3: Decision Analysis
    • 3.1. The Six Steps in Decision Making
    • 3.2. Types of Decision-Making Environments
    • 3.3. Decision Making Under Uncertainty
      • Optimistic
      • Pessimistic
      • Criterion of Realism (Hurwicz Criterion)
      • Equally Likely (Laplace)
      • Minimax Regret
    • 3.4. Decision Making Under Risk
      • Expected Monetary Value
      • Expected Value of Perfect Information
      • Expected Opportunity Loss
      • Sensitivity Analysis
      • A Minimization Example
    • 3.5. Using Software for Payoff Table Problems
      • QM for Windows
      • Excel QM
    • 3.6. Decision Trees
      • Efficiency of Sample Information
      • Sensitivity Analysis
    • 3.7. How Probability Values Are Estimated by Bayesian Analysis
      • Calculating Revised Probabilities
      • Potential Problem in Using Survey Results
    • 3.8. Utility Theory
      • Measuring Utility and Constructing a Utility Curve
      • Utility as a Decision-Making Criterion
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Starting Right Corporation
    • Case Study: Toledo Leather Company
    • Case Study: Blake Electronics
    • Bibliography
  • Chapter 4: Regression Models
    • 4.1. Scatter Diagrams
    • 4.2. Simple Linear Regression
    • 4.3. Measuring the Fit of the Regression Model
      • Coefficient of Determination
      • Correlation Coefficient
    • 4.4. Assumptions of the Regression Model
      • Estimating the Variance
    • 4.5. Testing the Model for Significance
      • Triple A Construction Example
      • The Analysis of Variance (ANOVA) Table
      • Triple A Construction ANOVA Example
    • 4.6. Using Computer Software for Regression
      • Excel 2016
      • Excel QM
      • QM for Windows
    • 4.7. Multiple Regression Analysis
      • Evaluating the Multiple Regression Model
      • Jenny Wilson Realty Example
    • 4.8. Binary or Dummy Variables
    • 4.9. Model Building
      • Stepwise Regression
      • Multicollinearity
    • 4.10. Nonlinear Regression
    • 4.11. Cautions and Pitfalls in Regression Analysis
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: North–South Airline
    • Bibliography
    • Appendix 4.1: Formulas for Regression Calculations
  • Chapter 5: Forecasting
    • 5.1. Types of Forecasting Models
      • Qualitative Models
      • Causal Models
      • Time-Series Models
    • 5.2. Components of a Time-Series
    • 5.3. Measures of Forecast Accuracy
    • 5.4. Forecasting Models—Random Variations Only
      • Moving Averages
      • Weighted Moving Averages
      • Exponential Smoothing
      • Using Software for Forecasting Time Series
    • 5.5. Forecasting Models—Trend and Random Variations
      • Exponential Smoothing with Trend
      • Trend Projections
    • 5.6. Adjusting for Seasonal Variations
      • Seasonal Indices
      • Calculating Seasonal Indices with No Trend
      • Calculating Seasonal Indices with Trend
    • 5.7. Forecasting Models—Trend, Seasonal, and Random Variations
      • The Decomposition Method
      • Software for Decomposition
      • Using Regression with Trend and Seasonal Components
    • 5.8. Monitoring and Controlling Forecasts
      • Adaptive Smoothing
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Forecasting Attendance at SWU Football Games
    • Case Study: Forecasting Monthly Sales
    • Bibliography
  • Chapter 6 Inventory Control Models
    • 6.1. Importance of Inventory Control
      • Decoupling Function
      • Storing Resources
      • Irregular Supply and Demand
      • Quantity Discounts
      • Avoiding Stockouts and Shortages
    • 6.2. Inventory Decisions
    • 6.3. Economic Order Quantity: Determining How Much to Order
      • Inventory Costs in the EOQ Situation
      • Finding the EOQ
      • Sumco Pump Company Example
      • Purchase Cost of Inventory Items
      • Sensitivity Analysis with the EOQ Model
    • 6.4. Reorder Point: Determining When to Order
    • 6.5. EOQ Without the Instantaneous Receipt Assumption
      • Annual Carrying Cost for Production Run Model
      • Annual Setup Cost or Annual Ordering Cost
      • Determining the Optimal Production Quantity
      • Brown Manufacturing Example
    • 6.6. Quantity Discount Models
      • Brass Department Store Example
    • 6.7. Use of Safety Stock
    • 6.8. Single-Period Inventory Models
      • Marginal Analysis with Discrete Distributions
      • Café du Donut Example
      • Marginal Analysis with the Normal Distribution
      • Newspaper Example
    • 6.9. ABC Analysis
    • 6.10. Dependent Demand: The Case for Material Requirements Planning
      • Material Structure Tree
      • Gross and Net Material Requirements Plans
      • Two or More End Products
    • 6.11. Just-In-Time Inventory Control
    • 6.12. Enterprise Resource Planning
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Martin-Pullin Bicycle Corporation
    • Bibliography
    • Appendix 6.1: Inventory Control with QM for Windows
  • Chapter 7: Linear Programming Models: Graphical and Computer Methods
    • 7.1. Requirements of a Linear Programming Problem
    • 7.2. Formulating LP Problems
      • Flair Furniture Company
    • 7.3. Graphical Solution to an LP Problem
      • Graphical Representation of Constraints
      • Isoprofit Line Solution Method
      • Corner Point Solution Method
      • Slack and Surplus
    • 7.4. Solving Flair Furniture’s LP Problem Using QM for Windows, Excel 2016, and Excel QM
      • Using QM for Windows
      • Using Excel’s Solver Command to Solve LP Problems
      • Using Excel QM
    • 7.5. Solving Minimization Problems
      • Holiday Meal Turkey Ranch
    • 7.6. Four Special Cases in LP
      • No Feasible Solution
      • Unboundedness
      • Redundancy
      • Alternate Optimal Solutions
    • 7.7. Sensitivity Analysis
      • High Note Sound Company
      • Changes in the Objective Function Coefficient
      • QM for Windows and Changes in Objective Function Coefficients
      • Excel Solver and Changes in Objective Function Coefficients
      • Changes in the Technological Coefficients
      • Changes in the Resources or Right-Hand-Side Values
      • QM for Windows and Changes in Right-Hand- Side Values
      • Excel Solver and Changes in Right-Hand-Side Values
    • Summary
    • Glossary
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Mexicana Wire Winding, Inc.
    • Bibliography
  • Chapter 8: Linear Programming Applications
    • 8.1. Marketing Applications
      • Media Selection
      • Marketing Research
    • 8.2. Manufacturing Applications
      • Production Mix
      • Production Scheduling
    • 8.3. Employee Scheduling Applications
      • Labor Planning
    • 8.4. Financial Applications
      • Portfolio Selection
      • Truck Loading Problem
    • 8.5. Ingredient Blending Applications
      • Diet Problems
      • Ingredient Mix and Blending Problems
    • 8.6. Other Linear Programming Applications
    • Summary
    • Self-Test
    • Problems
    • Case Study: Cable & Moore
    • Bibliography
  • Chapter 9: Transportation, Assignment, and Network Models
    • 9.1. The Transportation Problem
      • Linear Program for the Transportation Example
      • Solving Transportation Problems Using Computer Software
      • A General LP Model for Transportation Problems
      • Facility Location Analysis
    • 9.2. The Assignment Problem
      • Linear Program for Assignment Example
    • 9.3. The Transshipment Problem
      • Linear Program for Transshipment Example
    • 9.4. Maximal-Flow Problem
      • Example
    • 9.5. Shortest-Route Problem
    • 9.6. Minimal-Spanning Tree Problem
    • Summary
    • Glossary
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Andrew–Carter, Inc.
    • Case Study: Northeastern Airlines
    • Case Study: Southwestern University Traffic Problems
    • Bibliography
    • Appendix 9.1: Using QM for Windows
  • Chapter 10: Integer Programming, Goal Programming, and Nonlinear Programming
    • 10.1. Integer Programming
      • Harrison Electric Company Example of Integer Programming
      • Using Software to Solve the Harrison Integer Programming Problem
      • Mixed-Integer Programming Problem Example
    • 10.2. Modeling with 0–1 (Binary) Variables
      • Capital Budgeting Example
      • Limiting the Number of Alternatives Selected
      • Dependent Selections
      • Fixed-Charge Problem Example
      • Financial Investment Example
    • 10.3. Goal Programming
      • Example of Goal Programming: Harrison Electric Company Revisited
      • Extension to Equally Important Multiple Goals
      • Ranking Goals with Priority Levels
      • Goal Programming with Weighted Goals
    • 10.4. Nonlinear Programming
      • Nonlinear Objective Function and Linear Constraints
      • Both Nonlinear Objective Function and Nonlinear Constraints
      • Linear Objective Function with Nonlinear Constraints
    • Summary
    • Glossary
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Schank Marketing Research
    • Case Study: Oakton River Bridge
    • Bibliography
  • Chapter 11: Project Management
    • 11.1. PERT/CPM
      • General Foundry Example of PERT/CPM
      • Drawing the PERT/CPM Network
      • Activity Times
      • How to Find the Critical Path
      • Probability of Project Completion
      • What PERT Was Able to Provide
      • Using Excel QM for the General Foundry Example
      • Sensitivity Analysis and Project Management
    • 11.2. PERT/Cost
      • Planning and Scheduling Project Costs: Budgeting Process
      • Monitoring and Controlling Project Costs
    • 11.3. Project Crashing
      • General Foundry Example
      • Project Crashing with Linear Programming
    • 11.4. Other Topics in Project Management
      • Subprojects
      • Milestones
      • Resource Leveling
      • Software
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Southwestern University Stadium Construction
    • Case Study: Family Planning Research Center of Nigeria
    • Bibliography
    • Appendix 11.1: Project Management with QM for Windows
  • Chapter 12: Waiting Lines and Queuing Theory Models
    • 12.1. Waiting Line Costs
      • Three Rivers Shipping Company Example
    • 12.2. Characteristics of a Queuing System
      • Arrival Characteristics
      • Waiting Line Characteristics
      • Service Facility Characteristics
      • Identifying Models Using Kendall Notation
    • 12.3. Single-Channel Queuing Model with Poisson Arrivals and Exponential Service Times (M/M /1)
      • Assumptions of the Model
      • Queuing Equations
      • Arnold’s Muffler Shop Case
      • Enhancing the Queuing Environment
    • 12.4. Multichannel Queuing Model with Poisson Arrivals and Exponential Service Times (M/M/m)
      • Equations for the Multichannel Queuing Model
      • Arnold’s Muffler Shop Revisited
    • 12.5. Constant Service Time Model (M/D/1)
      • Equations for the Constant Service Time Model
      • Garcia-Golding Recycling, Inc.
    • 12.6. Finite Population Model (M/M/1 with Finite Source)
      • Equations for the Finite Population Model
      • Department of Commerce Example
    • 12.7. Some General Operating Characteristic Relationships
    • 12.8. More Complex Queuing Models and the Use of Simulation
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: New England Foundry
    • Case Study: Winter Park Hotel
    • Bibliography
    • Appendix 12.1: Using QM for Windows
  • Chapter 13: Simulation Modeling
    • 13.1. Advantages and Disadvantages of Simulation
    • 13.2. Monte Carlo Simulation
      • Harry’s Auto Tire Example
      • Using QM for Windows for Simulation
      • Simulation with Excel Spreadsheets
    • 13.3. Simulation and Inventory Analysis
      • Simkin’s Hardware Store
      • Analyzing Simkin’s Inventory Costs
    • 13.4. Simulation of a Queuing Problem
      • Port of New Orleans
      • Using Excel to Simulate the Port of New Orleans Queuing Problem
    • 13.5. Simulation Model for a Maintenance Policy
      • Three Hills Power Company
      • Cost Analysis of the Simulation
    • 13.6. Other Simulation Issues
      • Two Other Types of Simulation Models
      • Verification and Validation
      • Role of Computers in Simulation
    • Summary
    • Glossary
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Alabama Airlines
    • Case Study: Statewide Development Corporation
    • Case Study: FB Badpoore Aerospace
    • Bibliography
  • Chapter 14: Markov Analysis
    • 14.1. States and State Probabilities
      • The Vector of State Probabilities for Grocery Store Example
    • 14.2. Matrix of Transition Probabilities
      • Transition Probabilities for Grocery Store Example
    • 14.3. Predicting Future Market Shares
    • 14.4. Markov Analysis of Machine Operations
    • 14.5. Equilibrium Conditions
    • 14.6. Absorbing States and the Fundamental Matrix: Accounts Receivable Application
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: Rentall Trucks
    • Bibliography
    • Appendix 14.1: Markov Analysis with QM for Windows
    • Appendix 14.2: Markov Analysis with Excel
  • Chapter 15: Statistical Quality Control
    • 15.1. Defining Quality and TQM
    • 15.2. Statistical Process Control
      • Variability in the Process
    • 15.3. Control Charts for Variables
      • The Central Limit Theorem
      • Setting x--Chart Limits
      • Setting Range Chart Limits
    • 15.4. Control Charts for Attributes
      • p-Charts
      • c-Charts
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
    • Appendix 15.1: Using QM for Windows for SPC
  • Appendices
    • Appendix A: Areas Under the Standard Normal Curve
    • Appendix B: Binomial Probabilities
    • Appendix C: Values of e L for Use in the Poisson Distribution
    • Appendix D: F Distribution Values
    • Appendix E: Using POM-QM for Windows
    • Appendix F: Using Excel QM and Excel Add-Ins
    • Appendix G: Solutions to Selected Problems
    • Appendix H: Solutions to Self-Tests
  • Index
  • Module 1: Analytic Hierarchy Process
    • M1.1. Multifactor Evaluation Process
    • M1.2. Analytic Hierarchy Process
      • Judy Grim’s Computer Decision
      • Using Pairwise Comparisons
      • Evaluations for Hardware
      • Determining the Consistency Ratio
      • Evaluations for the Other Factors
      • Determining Factor Weights
      • Overall Ranking
      • Using the Computer to Solve Analytic Hierarchy Process Problems
    • M1.3. Comparison of Multifactor Evaluation and Analytic Hierarchy Processes
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
    • Appendix M1.1: Using Excel for the Analytic Hierarchy Process
  • Module 2: Dynamic Programming
    • M2.1. Shortest-Route Problem Solved Using Dynamic Programming
    • M2.2. Dynamic Programming Terminology
    • M2.3. Dynamic Programming Notation
    • M2.4. Knapsack Problem
      • Types of Knapsack Problems
      • Roller’s Air Transport Service Problem
    • Summary
    • Glossary
    • Key Equations
    • Solved Problem
    • Self-Test
    • Discussion Questions and Problems
    • Case Study: United Trucking
    • Bibliography
  • Module 3: Decision Theory and the Normal Distribution
    • M3.1. Break-Even Analysis and the Normal Distribution
      • Barclay Brothers Company’s New Product Decision
      • Probability Distribution of Demand
      • Using Expected Monetary Value to Make a Decision
    • M3.2. Expected Value of Perfect Information and the Normal Distribution
      • Opportunity Loss Function
      • Expected Opportunity Loss
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
    • Appendix M3.1: Derivation of the Break-Even Point
    • Appendix M3.2: Unit Normal Loss Integral
  • Module 4: Game Theory
    • M4.1. Language of Games
    • M4.2. The Minimax Criterion
    • M4.3. Pure Strategy Games
    • M4.4. Mixed Strategy Games
    • M4.5. Dominance
    • Summary
    • Glossary
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
  • Module 5: Mathematical Tools: Determinants and Matrices
    • M5.1. Matrices and Matrix Operations
      • Matrix Addition and Subtraction
      • Matrix Multiplication
      • Matrix Notation for Systems of Equations
      • Matrix Transpose
    • M5.2. Determinants, Cofactors, and Adjoints
      • Determinants
      • Matrix of Cofactors and Adjoint
    • M5.3. Finding the Inverse of a Matrix
    • Summary
    • Glossary
    • Key Equations
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
    • Appendix M5.1: Using Excel for Matrix Calculations
  • Module 6: Calculus-Based Optimization
    • M6.1. Slope of a Straight Line
    • M6.2. Slope of a Nonlinear Function
    • M6.3. Some Common Derivatives
      • Second Derivatives
    • M6.4. Maximum and Minimum
    • M6.5. Applications
      • Economic Order Quantity
      • Total Revenue
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
  • Module 7: Linear Programming: The Simplex Method
    • M7.1. How to Set Up the Initial Simplex Solution
      • Converting the Constraints to Equations
      • Finding an Initial Solution Algebraically
      • The First Simplex Tableau
    • M7.2. Simplex Solution Procedures
      • The Second Simplex Tableau
      • Interpreting the Second Tableau
      • The Third Simplex Tableau
      • Review of Procedures for Solving LP Maximization Problems
    • M7.3. Surplus and Artificial Variables
      • Surplus Variables
      • Artificial Variables
      • Surplus and Artificial Variables in the Objective Function
    • M7.4. Solving Minimization Problems
      • The Muddy River Chemical Corporation Example
      • Graphical Analysis
      • Converting the Constraints and Objective Function
      • Rules of the Simplex Method for Minimization Problems
      • First Simplex Tableau for the Muddy River Chemical Corporation Problem
      • Developing a Second Tableau
      • Developing a Third Tableau
      • Fourth Tableau for the Muddy River Chemical Corporation Problem
      • Review of Procedures for Solving LP Minimization Problems
    • M7.5. Special Cases
      • Infeasibility
      • Unbounded Solutions
      • Degeneracy
      • More Than One Optimal Solution
    • M7.6. Sensitivity Analysis with the Simplex Tableau
      • High Note Sound Company Revisited
      • Changes in the Objective Function Coefficients
      • Changes in Resources or RHS Values
    • M7.7. The Dual
      • Dual Formulation Procedures
      • Solving the Dual of the High Note Sound Company Problem
    • M7.8. Karmarkar’s Algorithm
    • Summary
    • Glossary
    • Key Equations
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
  • Module 8: Transportation, Assignment, and Network Algorithms
    • M8.1. The Transportation Algorithm
      • Developing an Initial Solution: Northwest Corner Rule
      • Stepping-Stone Method: Finding a Least-Cost Solution
      • Special Situations with the Transportation Algorithm
      • Unbalanced Transportation Problems
      • Degeneracy in Transportation Problems
      • More Than One Optimal Solution
      • Maximization Transportation Problems
      • Unacceptable or Prohibited Routes
      • Other Transportation Methods
    • M8.2. The Assignment Algorithm
      • The Hungarian Method (Flood’s Technique)
      • Making the Final Assignment
      • Special Situations with the Assignment Algorithm
      • Unbalanced Assignment Problems
      • Maximization Assignment Problems
    • M8.3. Maximal-Flow Problem
      • Maximal-Flow Technique
    • M8.4. Shortest-Route Problem
      • Shortest-Route Technique
    • Summary
    • Glossary
    • Solved Problems
    • Self-Test
    • Discussion Questions and Problems
    • Bibliography
    1. 2017-01-21T10:17:10+0000
    2. Preflight Ticket Signature