Decision making under uncertainty - is sensitivity analysis of any use?

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

Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

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

Linear Programming. Solving LP Models Using MS Excel, 18

LECTURES ON REAL OPTIONS: PART I BASIC CONCEPTS

Summary of specified general model for CHP system

Chapter 4. SDP - difficulties. 4.1 Curse of dimensionality

Linear Programming Notes V Problem Transformations

Linear Programming Notes VII Sensitivity Analysis

PERPETUITIES NARRATIVE SCRIPT 2004 SOUTH-WESTERN, A THOMSON BUSINESS

4.6 Linear Programming duality

Optimization under uncertainty: modeling and solution methods

Vector and Matrix Norms

Solution: The optimal position for an investor with a coefficient of risk aversion A = 5 in the risky asset is y*:

COMP6053 lecture: Relationship between two variables: correlation, covariance and r-squared.

Refinery Planning & Scheduling - Plan the Act. Act the Plan.

Decision Making under Uncertainty

MANAGEMENT SCIENCE COMPLEMENTARY COURSE. IV Semester BBA. (2011 Admission) UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION

Module1. x y 800.

AP Physics 1 and 2 Lab Investigations

Inventory Management. NEELU TIWARI Jaipuria Institute of Management, Vasundhara Gzb.

Profit Forecast Model Using Monte Carlo Simulation in Excel

Linear Programming Supplement E

Financial Markets. Itay Goldstein. Wharton School, University of Pennsylvania

Risk and Uncertainty. Managerial Economics: Economic Tools for Today s Decision Makers, 4/e

The Graphical Method: An Example

Duality in Linear Programming

Efficient Curve Fitting Techniques

Simple linear regression

MISSING DATA TECHNIQUES WITH SAS. IDRE Statistical Consulting Group

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering, Indian Institute of Technology, Delhi

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method

Exact Nonparametric Tests for Comparing Means - A Personal Summary

Solving Linear Programs

1 Error in Euler s Method

1.1 Introduction. Chapter 1: Feasibility Studies: An Overview

The Mathematics 11 Competency Test Percent Increase or Decrease

4. Continuous Random Variables, the Pareto and Normal Distributions

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

IAS Leases. By:

Solving simultaneous equations using the inverse matrix

Elasticity. I. What is Elasticity?

CORRELATIONAL ANALYSIS: PEARSON S r Purpose of correlational analysis The purpose of performing a correlational analysis: To discover whether there

Mathematical finance and linear programming (optimization)

Constructing a TpB Questionnaire: Conceptual and Methodological Considerations

7.6 Approximation Errors and Simpson's Rule

Chapter 4 DECISION ANALYSIS

Basic Components of an LP:

Estimating Risk free Rates. Aswath Damodaran. Stern School of Business. 44 West Fourth Street. New York, NY

Chapter 6. Commodity Forwards and Futures. Question 6.1. Question 6.2

Simple Linear Programming Model

Blending petroleum products at NZ Refining Company

Market Simulators for Conjoint Analysis

Fundamentals of Decision Theory

LAB 4 INSTRUCTIONS CONFIDENCE INTERVALS AND HYPOTHESIS TESTING

Special Situations in the Simplex Algorithm

Session 7 Bivariate Data and Analysis

3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Building and Using Spreadsheet Decision Models

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:

A Review of Cross Sectional Regression for Financial Data You should already know this material from previous study

Portfolio Optimization & Monte Carlo Simulation

SU 8: Responsibility Accounting and Performance Measures Financial Measures

A Short Guide to Significant Figures

Chapter 011 Project Analysis and Evaluation

Recall this chart that showed how most of our course would be organized:

99.37, 99.38, 99.38, 99.39, 99.39, 99.39, 99.39, 99.40, 99.41, cm

Financial Mathematics and Simulation MATH Spring 2011 Homework 2

One Period Binomial Model

MTH6120 Further Topics in Mathematical Finance Lesson 2

A joint control framework for supply chain planning

Practical Guide to the Simplex Method of Linear Programming

Introduction to Regression and Data Analysis

Statistical tests for SPSS

The problem with waiting time

Paper P1 Performance Operations Post Exam Guide March 2011 Exam. General Comments

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

No Solution Equations Let s look at the following equation: 2 +3=2 +7

Standard Deviation Estimator

RISK MITIGATION IN FAST TRACKING PROJECTS

Pricing I: Linear Demand

Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1

Business Valuation under Uncertainty

EdExcel Decision Mathematics 1

CHAPTER 6 FINANCIAL FORECASTING

Evaluating the Lead Time Demand Distribution for (r, Q) Policies Under Intermittent Demand

CHAPTER 16: MANAGING BOND PORTFOLIOS

Chapter 9. Systems of Linear Equations

Conn Valuation Services Ltd.

Expected Utility Asset Allocation

Chapter 2 Solving Linear Programs

Chapter 11 Monte Carlo Simulation

Sensitivity Analysis with Excel

STRATEGIC CAPACITY PLANNING USING STOCK CONTROL MODEL

Week 4: Standard Error and Confidence Intervals

sensitivity analysis. Using Excel 2.1 MANUAL WHAT-IF ANALYSIS 2.2 THRESHOLD VALUES

Transcription:

Decision making under uncertainty - is sensitivity analysis of any use? Stein W. Wallace Molde University College 1

Decision making under uncertainty Sensitivity analysis Parametric optimization What-if -analysis Scenario analysis Do these work? 2

Mathematical programming, especially linear programming and related network and combinatorial methods, usually form the OR/MS deterministic subfield. It is time to recognize that this categorization is restrictive and does not serve the field well. Those of us who work in the area are, in a sense, blessed and lucky. We have in the linear programming mathematical model and in its solution by the simplex method a readily available analysis that answers important data sensitivity questions and, at the same time, yields critical related economic information. Coupling such an analysis with computationally simple studies provides a rather nondeterministic view of the modelling situation. Thus, those of us who teach and practice mathematical programming have the means of emphasizing and answering concerns about validity, robustness, uncertain data, base case and scenario analysis, and in achieving the truism that modeling is more about gaining insight than in producing numbers. We can and do cut across the dichotomy. 3 (Saul Gass - 1997)

In all LP models the coefficients of the objective function and the constraints are supplied as input data or as parameters to the model. The optimal solution obtained by the simplex method is based on the values of these coefficients. In practice the values of these coefficients are seldom known with absolute certainty, because many of them are functions of some uncontrollable parameters. For instance, future demands, the cost of raw materials, or the cost of energy resources cannot be predicted with complete accuracy before the problem is solved. Hence the solution of a practical problem is not complete with the mere determination of the optimal solution. Each variation in the values of the data coefficients changes the LP problem, which may in turn affect the optimal solution found earlier. In order to develop an overall strategy to meet the various contingencies, one has to study how the optimal solution will change with changes in the input (data) coefficients. This is known as sensitivity analysis or post-optimality analysis. 4 (Ravindran, Phillips and Solberg 1987)

Example You have two lots of land that you can develop Developing the land Building the plant now Building the plant later Lot 1 600 200 220 Lot2 100 600 660 Plants produce one unit of a good sold at price p, presently unknown 5

Nine possible solutions No 9 is to do nothing 6

Sensitivity analysis Sample (or construct) possible futures, and solve for each of these possible futures. Compare (combine) solutions to find an overall solution. p < 700 : Do nothing Delayed construction is never used 700 < p < 800 P > 800 No other scenario solutions are possible Flexibility has no value 7

Assume p can take on two different values Pr(p=210)=Pr(p=1250)=0.5 Expected value p=730 Deterministic problem: Use p=730 and get Decision 4 with profit 730-700=30 Expected value of scenario solutions: Decision 4: -700+0.5*210+0.5*1250=30 Decision 9: 0 Decision 7: -1500+0.5*2*210+0.5*2*1250= -40 8

Decision Invest Income if Income if Expected p=210 p=1250 profit 1 600 0 1030-85 2 800 210 1250-70 3 100 0 590 195 4 700 210 1250 30 Expected profit for all scenarios Delayed construction used whenever profitable 5 1300 210 2280-55 6 900 210 1840 125 7 1500 420 2500-40 8 700 0 1620 110 9 0 0 0 0 9

A continuous example max 3x + 2 y + z x y ξ 1 ξ Substitutes with demand summing to one x + y + z 1 Production capacity x, y, z 0 10

We can find the optimal solution for all possible demands x y z = = 1 t = t 0 for t [ 0,1] All scenario solutions are infeasible when you try to calculate the expected performance Optimal solution: x = y = 0, z = 1 11

What do we see? All scenario solutions have x+y=1, forcing z=0. That is exactly what we do not want. We have solved all possible problems All scenario solutions have the same optimal basis. The optimal solution has a different optimal basis. The space spanned by scenario solutions does not contain the optimal solution 12

Connections to options Scenario solutions disregard flexibility. Options (= flexible alternatives) are worthless in a deterministic analysis, unless they are free. We do not have follow-up (recourse) decisions as required. 13

The IQ of hindsight After the fact one of the scenario solutions will turn out to be best The stochastic programming solution is hardly ever best Be careful with how decision makers are evaluated 14

An example A MIP model has been made to support the development of oil and gas fields in addition to the transportation infrastructure in the North Sea. The model takes more than one hour to run. 50 runs have been made with different levels of demand, prices, and field sizes. 15

In 80% of all cases, the gas pipe from A to B has a diameter of 24. In the other cases it is larger. Hence, we can conclude that 24 is a lower bound. In all cases, field C is developed between 2010 and 2020. Hence, we can safely assume that we have found a time interval in which the field is developed. Choosing 2015 is clearly a good approximation. 16

Subfields D and E compete for the same production capacity at a platform. In all cases subfield D is chosen. Hence, we can safely disregard subfield E in the analyses to follow. Does anything change if we are able to make these statements for all scenarios and not just the 50 chosen? 17

The conclusions based on sensitivity analysis may be good or correct The arguments leading to the conclusions are false. 18

Option values All decision have embedded option values, positive or negative A decision opens and closes doors The higher variance, the higher option value If we underestimate the randomness, we underestimate the option values Scenario analysis gives no value to options 19

Organizational issues The float of information in an organization randomness is often lost between departments Will result in reduced randomness and hence reduced value of flexibility. 20

Board rooms Leaders want clear advise and explanations Results in randomness being suppressed and hence flexibility being undervalued 21

Discount rates Many companies use very high discount rates to express that only very profitable projects will be accepted Investments in flexibility normally have costs early and potential income late Results in reduced option values and incorrect investments in accepted projects 22

Subjective issues Over confidence in own estimates reduces option values Hindsight learning - we have problems seeing that other scenarios could have happened bad learning 23

Flexibility is often important, but... Disregarded by methods Lost in organizations Undervalued by individuals 24

Regret and robust solutions Expected value solutions may have a large variance. We may be risk averse. Maybe we regret not having made another decision? We especially hate large regrets. 25

Limits on the regret We may choose to maximize expected profit with a bound on the largest regret Maximize the expected profit minus a function of the variance Examples To follow Markowitz mean-variance model 26

Regret for the nine possible solutions If we limit regret to maximum 500, we will choose Decision 4, and the expected profit will drop from 195 to 30. 27

Alternative Buy insurance (an option) against high prices High prices happen with 50% probability Pay 10 (plus a fee) to get 20 if prices are high The expected profit for Decision 3 is now 195 minus the insurance fee, and the maximal regret is down to 500. 28

Time related entities Period = time step in model Stage = point in time where it makes sense to make a new decision New information is needed to make new decisions New information is only interesting if new decisions can be made 29

How many stages? Enough to capture all the important consequences of the first stage solution Enough to capture a time span similar to the real decision problem 30

Correct use of sensitivity analysis A priori analysis, under uncertainty, of decisions that eventually will be made under certainty. Analysis of changes in deterministic parameters. 31

Mathematical programming, especially linear programming and related network and combinatorial methods, usually form the OR/MS deterministic subfield. It is time to recognize that this categorization is restrictive and does not serve the field well. Those of us who work in the area are, in a sense, blessed and lucky. We have in the linear programming mathematical model and in its solution by the simplex method a readily available analysis that answers important data sensitivity questions and, at the same time, yields critical related economic information. Coupling such an analysis with computationally simple studies provides a rather nondeterministic view of the modelling situation. Thus, those of us who teach and practice mathematical programming have the means of emphasizing and answering concerns about validity, robustness, uncertain data, base case and scenario analysis, and in achieving the truism that modeling is more about gaining insight than in producing numbers. We can and do cut across the dichotomy. (Saul Gass - 1997)

In all LP models the coefficients of the objective function and the constraints are supplied as input data or as parameters to the model. The optimal solution obtained by the simplex method is based on the values of these coefficients. In practice the values of these coefficients are seldom known with absolute certainty, because many of them are functions of some uncontrollable parameters. For instance, future demands, the cost of raw materials, or the cost of energy resources cannot be predicted with complete accuracy before the problem is solved. Hence the solution of a practical problem is not complete with the mere determination of the optimal solution. Each variation in the values of the data coefficients changes the LP problem, which may in turn affect the optimal solution found earlier. In order to develop an overall strategy to meet the various contingencies, one has to study how the optimal solution will change with changes in the input (data) coefficients. This is known as sensitivity analysis or post-optimality analysis. (Ravindran, Phillips and Solberg 331987)

The sad conclusion Sensitivity analysis, and its relatives, are not theoretically valid methods for analyzing decision making under uncertainty. They can lead to arbitrarily bad conclusions. Methods like stochastic programming and (real) option theory are needed. 34