SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION



Similar documents
Chapter 6: Sensitivity Analysis

Linear Programming Notes V Problem Transformations

Linear Programming I

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

4.6 Linear Programming duality

Linear Programming. Solving LP Models Using MS Excel, 18

Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood

Linear Programming Supplement E

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

Sensitivity Analysis with Excel

Practical Guide to the Simplex Method of Linear Programming

Nonlinear Programming Methods.S2 Quadratic Programming

Issues in Information Systems Volume 14, Issue 2, pp , 2013

What is Linear Programming?

OPRE 6201 : 2. Simplex Method

Mathematical finance and linear programming (optimization)

3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

Solving Linear Programs using Microsoft EXCEL Solver

Spreadsheets have become the principal software application for teaching decision models in most business

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Linear Programming Notes VII Sensitivity Analysis

Fairfield Public Schools

56:171 Operations Research Midterm Exam Solutions Fall 2001

Duality in Linear Programming

Study Guide 2 Solutions MATH 111

Linear Programming Sensitivity Analysis

1 Solving LPs: The Simplex Algorithm of George Dantzig

Philadelphia University Faculty of Information Technology Department of Computer Science --- Semester, 2007/2008. Course Syllabus

IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

Bachelor's Degree in Business Administration and Master's Degree course description

Special Situations in the Simplex Algorithm

Equations, Inequalities & Partial Fractions

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Using EXCEL Solver October, 2000

Multiple Optimization Using the JMP Statistical Software Kodak Research Conference May 9, 2005

Module1. x y 800.

Summary of specified general model for CHP system

Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

Problem of the Month: Digging Dinosaurs

Chapter 2 Solving Linear Programs

Introduction to Engineering System Dynamics

Chapter 13: Binary and Mixed-Integer Programming

Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

Linear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.

Constrained optimization.

Chapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem

Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities

5.1 Identifying the Target Parameter

Solving Linear Programs

Grade Level Year Total Points Core Points % At Standard %

Intro to Data Analysis, Economic Statistics and Econometrics

Introductory Notes on Demand Theory

Chapter 10: Network Flow Programming

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

1 Review of Least Squares Solutions to Overdetermined Systems

Nan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA

Chapter Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling

Gautam Appa and H. Paul Williams A formula for the solution of DEA models

STRATEGIC CAPACITY PLANNING USING STOCK CONTROL MODEL

CORE Assessment Module Module Overview

Introduction to Support Vector Machines. Colin Campbell, Bristol University

Chapter 1 INTRODUCTION. 1.1 Background

Zeros of a Polynomial Function

Building and Using Spreadsheet Decision Models

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

A Cross-Functional View of Inventory Management, Why Collaboration among Marketing, Finance/Accounting and Operations Management is Necessary

Polynomial Operations and Factoring

K 1 < K 2 = P (K 1 ) P (K 2 ) (6) This holds for both American and European Options.

Performance Management (F5) December 2014 to June 2015

4 UNIT FOUR: Transportation and Assignment problems

Linear Equations and Inequalities

EXCEL SOLVER TUTORIAL

Proximal mapping via network optimization

ECON 201 Section 002 Principles of Microeconomics Fall 2014 Tuesday & Thursday 1-2:15, Cuneo, Room 002

The Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy

Improving proposal evaluation process with the help of vendor performance feedback and stochastic optimal control

24. The Branch and Bound Method

R&D cooperation with unit-elastic demand

Introduction to Linear Programming (LP) Mathematical Programming (MP) Concept

GENERALIZED INTEGER PROGRAMMING

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Performance Management (F5) September 2015 to June 2016

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

FIN FINANCIAL INSTRUMENTS SPRING 2008

Standard Form of a Linear Programming Problem

Lecture 1: Systems of Linear Equations

3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Linear Programming. April 12, 2005

Fundamentals Level Skills Module, Paper F5

Linear Programming. Before studying this supplement you should know or, if necessary, review

Simplex method summary

Features: NEW!! EIM Version 3 Spreadsheets!

South Carolina College- and Career-Ready (SCCCR) Algebra 1

Transcription:

SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL SUMMARY Martina Briš, B.Sc.(Econ) Faculty of Economics in Osijek 87 Decision making is an integral part of operations management. It may be useful to a decision maker to have some indication of how sensitive an alternative choice might be to the changes in one or more of those values. Unfortunately, it is not possible to explore all the possible combinations of all the variables in a typical problem. In spite of this, there are some elements that a decision maker can use to assess the sensitivity of assumption probabilities. One of the tools useful for the analysis in some decision making problems is sensitivity analysis. It provides a range of feasibility over which the choice of alternative remains the same. Successful decision making consists of several steps, the first and most important being carefully defining the problem. Given that linear problems can be extensive and complex, they are solved by using sophisticated computer methods. This paper will present software solutions available for personal computers (Lindo, POM). For a manager taking the decision, however, a solution model is only part of the answer. Sensitivity analysis offers a better understanding of the problem, different effects of limitations and what if questions. The insights obtained are frequently much more valuable that a specific numerical answer. One of the advantages of linear programming lies in the fact that it provides rich information on sensitivity analysis as a direct part of the solution. Key words: feasibility range, linear programming, Lindo, POM, optimum solution, optimum range, sensitivity analysis.. ON SENSITIVITY ANALYSIS Sensitivity analysis is a process of varying input parameters of a model within allowed area and observing the resulting changes in the model solution. It explores how changes in the model output can be qualitatively and quantitatively attributed to different change sources. The purpose of sensitivity analysis is to indicate the sensitivity of simulation to uncertainties in the values of input data in the model.

88 Martina Briš Sensitivity analysis attempts to establish how the model depends on the attributed values, on its structure and on the assumptions it is based on. It is an important method for testing the quality of a given model, and it is also used for checking the reliability of the analysis. Sensitivity analysis was originally devised to deal only with uncertainties in input variables and model parameters. Over time the analysis was expanded, insecurity was included also in the model structure, its assumptions and specifications. Generally speaking, sensitivity analysis is used to increase the reliability of a given model and its predictions by providing understanding of how model variables react to the input changes, whether they are data used for adjustments in the model structure, or factors, i.e. independent model variables. Sensitivity analysis can be used to determine the following: Similarity of the model with the observed process, Quality of the model definition, Factors contributing the most to output variables, Areas in the input factor space for which there is maximum variation, Optimum area in the space of factors, which are used in subsequent exploration of adjustments, Interaction between factors. Using sensitivity analysis is popular in financial applications, risk analysis, neural networks, and in all the areas where models are developed. Sensitivity analysis can also be used in model-based policy assessment studies. Sensitivity analysis can be useful in different cases: when identifying key assumptions, or when comparing alternative model structures, when initiating future data collections, establishing important criteria, optimizing resource allocation, simplifying a model, etc.. LINEAR PROGRAMMING Linear programming methods are the most important instrument in operations research, and one of the disciplines in mathematical optimizing. Each linear programming method consists of the following: a) LINEAR OBJECTIVE FUNCTION The objective of optimizing comes to the foreground here. It can be maximizing profits, but also minimizing costs. The objective is chosen depending on the problem structure. The objective function is a set that should meet the requirements of the decision maker. Sensitivity analysis Wikipedia, The free encyclopedia, http://en.wikipedia.org/wiki/sensitivity_analysis (0.0.007.)

SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL 89 b) LINEAR RESTRICTIONS They come from the environment of the decision maker and impose certain restrictions / conditions in terms of achieving the objective. The real limitation is the product of multiplication of time required to make one unit with the quantity. This product of multiplication must not be bigger than available capacity. The restrictions are always specified in the form of equations or inequations. c) CONDITIONS FOR VARIABLE NON-NEGATIVITY for example, negative quantities of products cannot be produced. THE GENERAL MATHEMATICAL FORMULA FOR LINEAR PROGRAMMIN IS AS FOLLOWS: max Z = c x + cx +... + c n x a a a x + a x+ + ajxj +... n... + a x b x + ax+ + ajxj +... n n... + a x b n n M M M M M x + a x +... + a x +... + a m m mj j mn x n b x 0, x 0, xn 0 where: m is the number of restrictions, n is the volume of particular activities, x j is the unknown activity j (structural variable), a ij are technical coefficients which indicate how many units of a resource (restriction) are being spent for producing a unit x j, b i is the size of the restricting factor, c j is the profit per unit j. m Barković, D.: Operacijska istraživanja, Ekonomski fakultet u Osijeku, Osijek, 00, p. 58.

90 Martina Briš.. Computer software LINDO and POM for Windows In order to explain sensitivity analysis, we shall use here the following problem in linear programming: max Z = 300x + 500x x + x 70 x + x 50 3x 80 x, 0 To achieve the optimum solution we have used the widely available software for linear programming LINDO and POM for Windows. The name LINDO is an acronym for Linear INteractive Discrete Optimization. The term discrete means skipping from one to another basic solution instead of circling within the permissible area seeking the optimum solution (if there is one). 3 This software has an emphasis on operations research. It is a specialized programme which covers the topics such as linear/non-linear programming and combinatorial optimizations. It is not really intended for solving managerial problems; rather, it is more suitable as a learning tool for the methods of finding solutions in operations research, as well as for learning how to formulate an optimization problem in mathematical terms. This software could not be easily incorporated into the curriculum of the Operations Management course. In contrast, software intended for studying operations management covers the same, if not a larger scope of material, and is generally well suited for solving the problems from one or several course books dealing with operations management. The software with an emphasis on operations management is called POM for Windows. The name POM is the acronym for Production and Operations Management. This programme offers elementary solutions for a wide range of operating problems. It contains several modules connected to operations research. The additional modules are assignation, linear programming, simulation, transport, etc. Within the POM software, the user first has to select the desired module, or the window for entering the data will not open. After that, parameters are selected that will be used in the formulation, and finally, the data are entered. 3 Barković, D.: Operacijska istraživanja u investicijskom odlučivanju, Ekonomski fakultet u Osijeku, Osijek, 004., str. 3.

SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL 9 3. AN EXAMPLE OF SENSITIVITY ANALYSIS Both software programmes presented here use a simplex table. The majority of information required for sensitivity analysis is contained in the final simplex table. This and the data from the initial problem is sufficient to perform an analysis. Figures and indicate the solutions provided by those two software programmes. Figure. SOLUTION WITH A COPIED PROBLEM LP FROM THE INITIAL WINDOW (LINDO PROGRAMME)

9 Martina Briš Figure. TWO WAYS OF SHOWING THE SOLUTION (POM for Windows) After running the programme, the computer printout of sensitivity analysis for this particular problem shows us that the optimum solutions are: x = 30, and x = 0 at which the maximum profits of $49,000.00 are achieved. OPTIMUM SOLUTION is that combination of products which can result in the highest profit, i.e. the lowest cost (depending on the optimization objective). As stated above, sensitivity analysis is a means for assessing the scope and effectiveness of potential changes on parameters of LP model. a) COEFFICIENT CHANGES IN THE LINEAR OBJECTIVE FUNCTION OPTIMUM RANGE is the range of values over which optimum values of decision

SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL 93 making variables will not be changed. (upper part of the table Ranging) We differentiate LOWER BOUND and UPPER BOUND which indicates that the optimum solution will not change if the profit coefficient is moving between the lower and upper limit. x 50-500 x 300-600 The optimum solution remains, x = 30, and x = 0, however, the profit is no longer $49,000.00. If the profit per unit x is increased from 300 to 350, the total profit is then: 350 30 + 500 0 = $55,500.00 since we receive $50.00 of additional profit per product unit x. Let us assume that we have to report to our supervisor on the quantities of particular products our company should produce in order to maximize profits. Our superviser could pose the following problem for us: our engineers have found the way of increasing the profit for the product x from $500.00 to $550.00, and we should think about this and propose a new product mix. We do not really need time for considering this and can answer immediately. The optimum product mix remains x = 30, and x = 0 because the profit of $550.00 is within optimality limits (which is observable from the LOWER UPPER BOUND). The profit will be changed as we are now earning additional 50 dollars per product x. The profit will increase by 50 0 = $,000.00. We cannot use sensitivity analysis to evaluate the changes in several coefficients simultaneously. b) CHANGES IN RESTRICTION VALUES FEASIBILITY RANGE is the range of values for RHS (right-hand side) restrictions over which dual prices remain the same. Dual values or shadow prices are defined as the amount at which the values of the objective function will be changed with the change of one unit in the value of restriction. Dual values are marginal values for restrictions in our problem. A marginal value is the amount we are prepared to pay for an additional resource unit. This is not the original sales price for a resource but the price we need to pay in order to get more of a resource. (lower part of the table Ranging)

94 Martina Briš Dual values indicate that we will not be willing to engage an additional unit of restriction 3, since we are left with 0 units already when producing the optimum product mix. 0 30 + 3 0 80 60 80 These are UNTIED RESTRICTIONS which have either slack or surplus 4. An additional unit of such a restriction would result only in the increase of slack or surplus, and not in the increase of profits (or decrease of costs). Unlike untied restrictions, TIED RESTRICTIONS force us to go beyond the optimum point. They have a certain amount for dual values (different from 0), and slack/surplus is 0. An additional unit of this restriction can enable us to increase the total profit (or decrease the total cost) by finding a new optimum solution. Dual values 00 and 00 indicate that we will be willing to pay $00.00 for each additional unit of restriction, and $00.00 for each additional unit of restriction. We should not be prepared to pay more than $00.00 for the restriction, because if we get one unit of restriction more, the profit will rise by only $00.00. Marginal values help in determining resource prices and making decisions on the purchase of new resources. The purchase of additional units will change the optimum solution. Dual values are not viable for unlimited supply of restrictions. From LOWER UPPER BOUND we can see that the dual value for restriction is valid in the range from 50 to 0. We cannot use the feasibility range to evaluate the changes on more than one restriction simultaneously. Let us assume that our boss says that he can acquire 30 additional units of restriction for $75.00 per unit. We would immediately advise him to buy all the 30 units since the quantity to date, i.e. 70 + 30 = 00, which is within lower and upper limit. Each additional unit within feasibility range adds $00.00 of profit. The total increase in profits will be 30 ($00.00 - $75.00) = $3,750.00 On the other hand, if our boss were to tell us he can acquire 0 additional units of restriction 3 for only $0.50, we would advise him not to buy any additional units of restriction 3 as 80 + 0 = 00, which is within feasibility range, and in that case the 4 SLACK is an ADDITIONAL VARIABLE, it is an unused resource. SURPLUS is the production surplus.

SENSITIVITY ANALYSIS AS A MANAGERIAL DECISION MAKING TOOL 95 dual value is 0. We already have 0 units more than we need (slack), and if we buy additional 0 units, our surplus will rise to 40 units. The restriction is 80, and we have: 60 => SLACK 0 => SURPLUS 4. CONCLUSION Decision makers are often concerned with more things than just a solution to a problem. He or she could benefit from the results of sensitivity analysis in several ways. While preparing the problem for processing by means of linear programming, a decision maker could use subjective assumptions for particular parameters (e.g. restriction coefficients, objective function coefficients and values of right-hand side restrictions). It is understandable that a decision maker wishes to know how sensitive the optimum solution is to the changes in values of one or more parameters. If the solution is relatively insensitive to reasonable changes, the decision maker can have more confidence in the application of his solution. In contrast, if the solution is sensitive to changes, he or she will want to determine much more precise assumptions on the basis of parameters in question. The problem related to sensitivity analysis includes specific changes in parameters. For example, there can be a change in price which can alter the objective function coefficient. Furthermore, a change in the production process can require a change in the coefficient of one of the restrictions. Sensitivity analysis can provide an adequate insight into the problem for the decision maker. The third possibility is the question whether the purchase of high quantities of a resource would be beneficial. This question often arises when large quantities of resources are not used in the optimum solution; by adding more of other resources it is possible to achieve a disproportionate increase in the objective function value. There are obviously numerous reasons why a decision maker may want to use sensitivity analysis.

96 Martina Briš 5. REFERENCES. Barković, D.: Operacijska istraživanja, Ekonomski fakultet u Osijeku, Osijek, 00.. Barković, D.: Operacijska istraživanja u investicijskom odlučivanju, Ekonomski fakultet u Osijeku, Osijek, 004. 3. Bonini, Ch. P., Hausman, W.H., Bierman, H.: Quantitative Analysis for Management, Irwin/McGraw-Hill, New York, 997. 4. Stevenson, W. J.: Production/Operations Management, Irwin, New York, 993. INTERNET SITES: http://www.lindo.com (7 January 007) http://en.wikipedia.org/wiki/sensitivity_analysis (0 January 007) http://sensitivity-analysis.jrc.ec.europa.eu/forum/docs/overview.html (0 Janu ary 007) http://eu.wiley.com ( January 007) http://www.llnl.gov/casc/nsde/sensitivity.html (5 January 007) http://www.hearne.com.au (5 January 007) http://www.indiana.edu/~statmath/math/lindo/overview.html (30 January 007)