SBE10 CP21

SBE10 CP21 - Chapter 21 Decision Analysis Chapter 21...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Chapter 21 Decision Analysis Chapter 21 Decision Analysis Case Problem: Lawsuit Defense Strategy 1. Decision Tree To find the optimal decision strategy, we must fold the tree back computing expected values at the chance nodes and choosing the least cost alternative at the decision nodes. Shown below are the values computed at each node. CP - 74 4 2 1 Allied Accepts John's Offer of $750,000 Allied Counteroffers with $400,000 0.3 $750 John Accepts Allied's Counteroffer 3 $400 John Rejects Allied's Counteroffer Allied Loses Damages of $1,500,000 Allied Loses Damages of $750,000 Allied Wins No Damages 0.10 0.4 0.5 0.2 Allied Accepts John's Counteroffer 0.5 John Counteroffers with $600,000 5 Allied Rejects John's Counteroffer 0.3 Allied Loses Damages of $1,500,000 Allied Loses Damages of $750,000 Allied Wins No Damages 0.5 0.20 $1500 $750 $0 $600 $1500 $750 $0
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Chapter 21 Decision Analysis Node Value 1 670 2 670 3 825 4 600 5 825 Shown below is the decision tree with all nonoptimal branches eliminated. 2.
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/26/2009 for the course QM 3342 taught by Professor Unknown during the Spring '09 term at Troy.

Page1 / 2

SBE10 CP21 - Chapter 21 Decision Analysis Chapter 21...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online