decision analysis - PowerPoint PPT Presentation

1 / 74
About This Presentation
Title:

decision analysis

Description:

Title: decision analysis Author: John S. Loucks IV Last modified by: Toshiyuki Sueyoshi Created Date: 4/17/1996 5:08:12 PM Document presentation format – PowerPoint PPT presentation

Number of Views:89
Avg rating:3.0/5.0
Slides: 75
Provided by: John1575
Category:

less

Transcript and Presenter's Notes

Title: decision analysis


1
EMGT 501 HW Solutions Problem
13- 10 Problem 13 - 21
2
13.10 a.b.
Payoffs ( in thousands of )
640
1000
High 0.2
2
Medium 0.5
700
Low 0.3
300
Battle Pacific
1
High 0.3
460
800
4
Medium 0.4
400
Space Pirates
Low 0.3
200
3
With Com 0.6
High 0.5
1600
724
5
Medium 0.3
800
Without Com 0.4
Low 0.2
400
1120
3
13.10 b. cont.
Node 2 EV .2(1,000K) .5(700K) .3(300K)
640,000 Node 4 EV .3(800K)
.4(400K) .3(200K)
460,000 Node 5 EV .5(1,600K) .3(800K)
.2(400K) 1,120,000 Node 3
EV .6(460K) .4(1,120K)
724,000 Recommendation Space Pirates (724K)
is better than Battle Pacific (640K).
4
13.10 c.
  • Outcome and Probability
  • 1600K (0.4)(0.5)0.2
  • 800K (0.6)(0.3)(0.4)(0.3)0.3
  • 400K (0.6)(0.4)(0.4)(0.2)0.32
  • 200K (0.6)(0.3)0.18

5
13.10 c.
.30
Probability
.20
.10

400
800
1200
1600
Profit
6
13.10 d.
EV(Node 1) 640K EV(Node 2) P(Node 4)460K
P(Node 5)1120K Let P(Node 4) p EV(Node 2)
460p 1120(1 p) -660p 1120 If 640 gt -660p
1120, then recommendation is changed. So, p gt
0.7273
7
13.21 a.
d1 Purchase land d2 Do not purchase
land EV(d1)(600K)(0.5)(-200K)(0.5)200K EV(d2)
0 Recommendation d1(purchase) Expected Value
200,000
8
13.21b
EV(d1H) Vs1P(s1H) Vs2P(s2H)
(600K)(0.18) (-200K)(0.82) -56K EV(d2H)
0 EV(d1L) Vs1P(s1L) Vs2P(s2L)
(600K)(0.89) (-200k)(0.11) 512K EV(d2L)
0 If the investor predicts H, then d2 is selected
with EV(d2H) 0. Meanwhile, he predicts L, then
d1 is selected with EV(d1L) 512K
9
13.21b
EV with SI EV(d1L)P(L) EV(d2H)P(H)
(512K)(0.45) 0(0.55)
230.4k
10
13.21 c.
EVSI 230,400-200,00030,400. Since the cost
is 10,000. The investor should purchase the
option.
11
Home Work 14-3 14-14 Due Day Nov 18 (noon) 08
12
Chapter 14Multicriteria Decisions
  • Goal Programming
  • Goal Programming Formulation
  • Scoring Models
  • Analytic Hierarchy Process (AHP)
  • Establishing Priorities Using AHP
  • Using AHP to Develop an Overall Priority Ranking

13
Goal Programming
  • Goal programming may be used to solve linear
    programs with multiple objectives, with each
    objective viewed as a "goal".
  • In goal programming, di and di- , deviation
    variables, are the amounts a targeted goal i is
    overachieved or underachieved, respectively.
  • The goals themselves are added to the constraint
    set with di and di- acting as the surplus and
    slack variables.

14
Goal Programming
  • One approach to goal programming is to satisfy
    goals in a priority sequence. Second-priority
    goals are pursued without reducing the
    first-priority goals, etc.
  • For each priority level, the objective function
    is to minimize the (weighted) sum of the goal
    deviations.
  • Previous "optimal" achievements of goals are
    added to the constraint set so that they are not
    degraded while trying to achieve lesser priority
    goals.

15
Goal Programming Formulation
  • Step 1 Decide the priority level of each goal.
  • Step 2 Decide the weight on each goal.
  • If a priority level has more than one goal,
    for each goal i decide the weight, wi , to be
    placed on the deviation(s), di and/or di-, from
    the goal.

16
Goal Programming Formulation
Step 3 Set up the initial linear
program. Min w1d1 w2d2-
s.t. Functional Constraints,
and Goal Constraints Step 4 Solve the current
linear program. If there is a lower priority
level, go to step 5. Otherwise, a final solution
has been reached.
17
Goal Programming Formulation
  • Step 5 Set up the new linear program.
  • Consider the next-lower priority level goals
    and formulate a new objective function based on
    these goals. Add a constraint requiring the
    achievement of the next-higher priority level
    goals to be maintained. The new linear program
    might be
  • Min w3d3 w4d4-
  • s.t. Functional Constraints,
  • Goal
    Constraints, and
  • w1d1 w2d2-
    k
  • Go to step 4. (Repeat steps 4 and 5 until all
    priority levels have been examined.)

18
Example Conceptual Products
  • Conceptual Products is a computer company that
  • produces the CP400 and CP500 computers. The
  • computers use different
  • mother boards produced
  • in abundant supply by the
  • company, but use the same
  • cases and disk drives. The
  • CP400 models use two floppy disk drives and no
    zip
  • disk drives whereas the CP500 models use one
  • floppy disk drive and one zip disk drive.

19
Example Conceptual Products
  • The disk drives and cases are bought
  • from vendors. There are 1000 floppy disk
    drives, 500 zip disk drives, and 600 cases
    available to Conceptual Products on a weekly
    basis. It takes one hour to manufacture a CP400
    and its profit is 200 and it takes one and
    one-half hours to manufacture a CP500 and its
    profit is 500.

20
Example Conceptual Products
  • The company has four goals
  • Priority 1 Meet a state contract of 200
    CP400 machines weekly. (Goal 1)
  • Priority 2 Make at least 500 total
    computers weekly. (Goal 2)
  • Priority 3 Make at least 250,000 weekly.
    (Goal 3)
  • Priority 4 Use no more than 400 man-hours
    per week. (Goal 4)

21
Goal Programming Formulation
  • Variables
  • x1 number of CP400 computers produced
    weekly
  • x2 number of CP500 computers produced
    weekly
  • di- amount the right hand side of goal i
    is deficient
  • di amount the right hand side of goal i is
    exceeded
  • Functional Constraints
  • Availability of floppy disk drives 2x1
    x2 lt 1000
  • Availability of zip disk drives
    x2 lt 500
  • Availability of cases x1 x2 lt
    600

22
Goal Programming Formulation
  • Goals
  • (1) 200 CP400 computers weekly
  • x1 d1- - d1 200
  • (2) 500 total computers weekly
  • x1 x2 d2- - d2 500
  • (3) 250(in thousands) profit
  • .2x1 .5x2 d3- - d3 250
  • (4) 400 total man-hours weekly
  • x1 1.5x2 d4- - d4 400
  • Non-negativity
  • x1, x2, di-, di gt 0 for all i

23
Goal Programming Formulation
  • Objective Functions
  • Priority 1 Minimize the amount the state
    contract is not met Min d1-
  • Priority 2 Minimize the number under 500
    computers produced weekly Min d2-
  • Priority 3 Minimize the amount under
    250,000 earned weekly Min d3-
  • Priority 4 Minimize the man-hours over 400
    used weekly Min d4

24
Goal Programming Formulation
  • Formulation Summary
  • Min P1(d1-) P2(d2-) P3(d3-) P4(d4)
  • s.t. 2x1 x2
    lt 1000
  • x2
    lt 500
  • x1 x2
    lt 600
  • x1 d1- -d1
    200
  • x1 x2 d2-
    -d2 500
  • .2x1 .5x2
    d3- -d3 250
  • x11.5x2
    d4- -d4 400
  • x1, x2, d1-, d1, d2-,
    d2, d3-, d3, d4-, d4 gt 0

25
Scoring Model for Job Selection
  • A graduating college student with a double
    major
  • in Finance and Accounting has received
  • the following three job offers
  • financial analyst for an investment
  • firm in Chicago
  • accountant for a manufacturing
  • firm in Denver
  • auditor for a CPA firm in Houston

26
Scoring Model for Job Selection
  • The student made the following comments
  • The financial analyst position
  • provides the best opportunity for my
  • long-run career advancement.
  • I would prefer living in Denver
  • rather than in Chicago or Houston.
  • I like the management style and
  • philosophy at the Houston CPA firm
  • the best.
  • Clearly, this is a multicriteria decision.

27
Scoring Model for Job Selection
  • Considering only the long-run career
  • advancement criterion
  • The financial analyst position in
  • Chicago is the best decision alternative.
  • Considering only the location criterion
  • The accountant position in Denver
  • is the best decision alternative.
  • Considering only the style criterion
  • The auditor position in Houston is the best
    alternative.

28
Steps Required to Develop a Scoring Model
  • Step 1 List the decision-making criteria.
  • Step 2 Assign a weight to each criterion.
  • Step 3 Rate how well each decision alternative
    satisfies each criterion.
  • Step 4 Compute the score for each decision
    alternative.
  • Step 5 Order the decision alternatives from
    highest score to lowest score. The
    alternative with the highest score is the
    recommended alternative.

29
Scoring Model for Job Selection
  • Mathematical Model
  • Sj S wi rij
  • i
  • where
  • rij rating for criterion i and decision
    alternative j
  • Sj score for decision alternative j

30
Scoring Model Step 1
  • List of Criteria
  • Career advancement
  • Location
  • Management
  • Salary
  • Prestige
  • Job Security
  • Enjoyable work

31
Scoring Model Step 2
  • Five-Point Scale Chosen
  • Importance Weight
  • Very unimportant 1
  • Somewhat unimportant 2
  • Average importance 3
  • Somewhat important 4
  • Very important 5

32
Scoring Model Step 2
  • Assigning a Weight to Each Criterion
  • Criterion Importance Weight
  • Career advancement Very important 5
  • Location Average importance 3
  • Management Somewhat important 4
  • Salary Average importance 3
  • Prestige Somewhat unimportant 2
  • Job security Somewhat important 4
  • Enjoyable work Very important 5

33
Scoring Model Step 3
  • Nine-Point Scale Chosen
  • Level of Satisfaction Rating
  • Extremely low 1
  • Very low 2
  • Low 3
  • Slightly low 4
  • Average 5
  • Slightly high 6
  • High 7
  • Very high 8
  • Extremely high 9

34
Scoring Model Step 3
  • Rate how well each decision alternative satisfies
    each criterion.
  • Decision Alternative
  • Analyst Accountant Auditor
  • Criterion Chicago Denver
    Houston
  • Career advancement 8 6 4
  • Location 3 8 7
  • Management 5 6 9
  • Salary 6 7 5
  • Prestige 7 5 4
  • Job security 4 7 6
  • Enjoyable work 8 6 5

35
Scoring Model Step 4
  • Compute the score for each decision alternative.
  • Decision Alternative 1 - Analyst in
    Chicago
  • Criterion Weight (wi ) Rating
    (ri1) wiri1
  • Career advancement 5 x 8 40
  • Location 3 3 9
  • Management 4 5 20
  • Salary 3 6 18
  • Prestige 2 7 14
  • Job security 4 4 16
  • Enjoyable work 5 8 40
  • Score 157

36
Scoring Model Step 4
  • Compute the score for each decision alternative.
  • S1 5(8)3(3)4(5)3(6)2(7)4(4)5(8) 157
  • S2 5(6)3(8)4(6)3(7)2(5)4(7)5(6) 167
  • S3 5(4)3(7)4(9)3(5)2(4)4(6)5(5) 149

37
Scoring Model Step 4
  • Compute the score for each decision alternative.
  • Decision Alternative
  • Analyst Accountant Auditor
  • Criterion Chicago Denver
    Houston
  • Career advancement 40 30 20
  • Location 9 24 21
  • Management 20 24 36
  • Salary 18 21 15
  • Prestige 14 10 8
  • Job security 16 28 24
  • Enjoyable work 40 30 25
  • Score 157 167
    149

38
Scoring Model Step 5
  • Order the decision alternatives from highest
  • score to lowest score. The alternative with the
    highest
  • score is the recommended alternative.
  • The accountant position in Denver has the highest
    score and is the recommended decision
    alternative.
  • Note that the analyst position in Chicago ranks
    first in 4 of 7 criteria compared to only 2 of 7
    for the accountant position in Denver.
  • But when the weights of the criteria are
    considered, the Denver position is superior to
    the Chicago job.

39
Scoring Model for Job Selection
  • Partial Spreadsheet Showing Steps 1 - 3

40
Scoring Model for Job Selection
  • Partial Spreadsheet Showing Formulas of Step 4

41
Scoring Model for Job Selection
  • Partial Spreadsheet Showing Results of Step 4

42
Analytic Hierarchy Process
  • The Analytic Hierarchy Process (AHP), is a
    procedure designed to quantify managerial
    judgments of the relative importance of each of
    several conflicting criteria used in the decision
    making process.

43
Analytic Hierarchy Process
  • Step 1 List the Overall Goal, Criteria, and
    Decision Alternatives
  • Step 2 Develop a Pairwise Comparison Matrix
  • Rate the relative importance between each pair
    of decision alternatives. The matrix lists the
    alternatives horizontally and vertically and has
    the numerical ratings comparing the horizontal
    (first) alternative with the vertical (second)
    alternative.
  • Ratings are given as follows
  • . . . continued

------- For each criterion, perform steps 2
through 5 -------
44
Analytic Hierarchy Process
  • Step 2 Pairwise Comparison Matrix (continued)
  • Compared to the second
  • alternative, the first alternative is
    Numerical rating
  • extremely preferred
    9
  • very strongly preferred
    7
  • strongly preferred
    5
  • moderately preferred
    3
  • equally preferred
    1

45
Analytic Hierarchy Process
  • Step 2 Pairwise Comparison Matrix (continued)
  • Intermediate numeric ratings of 8, 6, 4, 2 can
    be assigned. A reciprocal rating (i.e. 1/9, 1/8,
    etc.) is assigned when the second alternative is
    preferred to the first. The value of 1 is always
    assigned when comparing an alternative with
    itself.

46
Analytic Hierarchy Process
  • Step 3 Develop a Normalized Matrix
  • Divide each number in a column of the pairwise
    comparison matrix by its column sum.
  • Step 4 Develop the Priority Vector
  • Average each row of the normalized matrix.
    These row averages form the priority vector of
    alternative preferences with respect to the
    particular criterion. The values in this vector
    sum to 1.

47
Analytic Hierarchy Process
  • Step 5 Calculate a Consistency Ratio
  • The consistency of the subjective input in the
    pairwise comparison matrix can be measured by
    calculating a consistency ratio. A consistency
    ratio of less than .1 is good. For ratios which
    are greater than .1, the subjective input should
    be re-evaluated.

------- For each criterion, perform steps 2
through 5 -------
48
Analytic Hierarchy Process
Step 6 Develop a Priority Matrix After steps
2 through 5 has been performed for all criteria,
the results of step 4 are summarized in a
priority matrix by listing the decision
alternatives horizontally and the criteria
vertically. The column entries are the priority
vectors for each criterion.
49
Analytic Hierarchy Process
  • Step 7 Develop a Criteria Pairwise Development
    Matrix
  • This is done in the same manner as that used to
    construct alternative pairwise comparison
    matrices by using subjective ratings (step 2).
    Similarly, normalize the matrix (step 3) and
    develop a criteria priority vector (step 4).
  • Step 8 Develop an Overall Priority Vector
  • Multiply the criteria priority vector (from
    step 7) by the priority matrix (from step 6).

50
Determining the Consistency Ratio
  • Step 1
  • For each row of the pairwise comparison matrix,
    determine a weighted sum by summing the multiples
    of the entries by the priority of its
    corresponding (column) alternative.
  • Step 2
  • For each row, divide its weighted sum by the
    priority of its corresponding (row) alternative.
  • Step 3
  • Determine the average, ?max, of the results of
    step 2.

51
Determining the Consistency Ratio
  • Step 4
  • Compute the consistency index, CI, of the n
    alternatives by CI (?max - n)/(n - 1).
  • Step 5
  • Determine the random index, RI, as follows
  • Number of Random Number of
    Random
  • Alternative (n) Index (RI) Alternative
    (n) Index (RI)
  • 3 0.58 6
    1.24
  • 4 0.90 7
    1.32
  • 5 1.12 8
    1.41
  • Step 6
  • Compute the consistency ratio CR CR/RI.

52
Example Gill Glass
  • Designer Gill Glass must decide
  • which of three manufacturers
  • will develop his "signature
  • toothbrushes. Three factors
  • are important to Gill (1) his costs
  • (2) reliability of the product and, (3)
    delivery time
  • of the orders.
  • The three manufacturers are Cornell Industries,
  • Brush Pik, and Picobuy. Cornell Industries
    will sell
  • toothbrushes to Gill Glass for 100 per gross,
    Brush
  • Pik for 80 per gross, and Picobuy for 144 per
    gross.

53
Example Gill Glass
  • Hierarchy for the Manufacturer Selection Problem

Overall Goal
Select the Best Toothbrush Manufacturer
Cost
Reliability
Delivery Time
Criteria
Cornell Brush Pik Picobuy
Cornell Brush Pik Picobuy
Cornell Brush Pik Picobuy
Decision Alternatives
54
Pairwise Comparison MatrixCost
Gill has decided that in terms of price,
Brush Pik is moderately preferred to Cornell and
very strongly preferred to Picobuy. In turn
Cornell is strongly to very strongly preferred
to Picobuy.
55
Pairwise Comparison MatrixCost
  • Since Brush Pik is moderately preferred to
    Cornell, Cornell's entry in the Brush Pik row is
    3 and Brush Pik's entry in the Cornell row is
    1/3.
  • Since Brush Pik is very strongly preferred to
    Picobuy, Picobuy's entry in the Brush Pik row is
    7 and Brush Pik's entry in the Picobuy row is
    1/7.
  • Since Cornell is strongly to very strongly
    preferred to Picobuy, Picobuy's entry in the
    Cornell row is 6 and Cornell's entry in the
    Picobuy row is 1/6.

56
Pairwise Comparison MatrixCost
  • Cornell Brush Pik Picobuy
  • Cornell 1 1/3 6
  • Brush Pik 3 1 7
  • Picobuy 1/6 1/7 1

57
Normalized Matrix Cost
  • Divide each entry in the pairwise comparison
    matrix by its corresponding column sum. For
    example, for Cornell the column sum 1 3 1/6
    25/6. This gives
  • Cornell
    Brush Pik Picobuy
  • Cornell 6/25 7/31 6/14
  • Brush Pik 18/25 21/31 7/14
  • Picobuy 1/25 3/31 1/14

58
Priority Vector Cost
  • The priority vector is determined by averaging
    the row entries in the normalized matrix.
    Converting to decimals we get
  • Cornell ( 6/25 7/31 6/14)/3
    .298
  • Brush Pik (18/25 21/31 7/14)/3
    .632
  • Picobuy ( 1/25 3/31 1/14)/3
    .069

59
Checking Consistency
  • Multiply each column of the pairwise comparison
    matrix by its priority
  • 1 1/3
    6 .923
  • .298 3 .632 1 .069
    7 2.009
  • 1/6 1/7
    1 .209
  • Divide these number by their priorities to get
  • .923/.298 3.097
  • 2.009/.632 3.179
  • .209/.069 3.029

60
Checking Consistency
  • Average the above results to get ?max.
  • ?max (3.097 3.179 3.029)/3
    3.102
  • Compute the consistence index, CI, for two terms.
  • CI (?max - n)/(n - 1) (3.102
    - 3)/2 .051
  • Compute the consistency ratio, CR, by CI/RI,
    where RI .58 for 3 factors
  • CR CI/RI .051/.58 .088
  • Since the consistency ratio, CR, is less than
    .10, this is well within the acceptable range for
    consistency.

61
Pairwise Comparison MatrixReliability
  • Gill Glass has determined that for reliability,
  • Cornell is very strongly preferable to Brush Pik
    and
  • equally preferable to Picobuy. Also, Picobuy is
  • strongly preferable to Brush Pik.

62
Pairwise Comparison MatrixReliability
  • Cornell Brush Pik Picobuy
  • Cornell 1 7 2
  • Brush Pik 1/7 1 5
  • Picobuy 1/2 1/5 1

63
Normalized MatrixReliability
  • Divide each entry in the pairwise comparison
    matrix by its corresponding column sum. For
    example, for Cornell the column sum 1 1/7
    1/2 23/14. This gives
  • Cornell
    Brush Pik Picobuy
  • Cornell 14/23 35/41 2/8
  • Brush Pik 2/23 5/41 5/8
  • Picobuy 7/23 1/41 1/8

64
Priority Vector Reliability
  • The priority vector is determined by averaging
    the row entries in the normalized matrix.
    Converting to decimals we get

  • Cornell (14/23 35/41 2/8)/3
    .571
  • Brush Pik ( 2/23 5/41 5/8)/3
    .278
  • Picobuy ( 7/23 1/41 1/8)/3
    .151
  • Checking Consistency
  • Gill Glass responses to reliability could be
    checked for consistency in the same manner as was
    cost.

65
Pairwise Comparison MatrixDelivery Time
  • Gill Glass has determined that for delivery
    time, Cornell is equally preferable to Picobuy.
    Both Cornell and Picobuy are very strongly to
    extremely preferable to Brush Pik.

66
Pairwise Comparison MatrixDelivery Time
  • Cornell
    Brush Pik Picobuy
  • Cornell 1 8 1
  • Brush Pik 1/8 1 1/8
  • Picobuy 1 8 1

67
Normalized MatrixDelivery Time
  • Divide each entry in the pairwise comparison
    matrix by its corresponding column sum.
  • Cornell
    Brush Pik Picobuy
  • Cornell 8/17 8/17 8/17
  • Brush Pik 1/17 1/17 1/17
  • Picobuy 8/17 8/17 8/17

68
Priority VectorDelivery Time
  • The priority vector is determined by averaging
    the row entries in the normalized matrix.
    Converting to decimals we get

  • Cornell (8/17 8/17 8/17)/3
    .471
  • Brush Pik (1/17 1/17 1/17)/3
    .059
  • Picobuy (8/17 8/17 8/17)/3
    .471
  • Checking Consistency
  • Gill Glass responses to delivery time could be
    checked for consistency in the same manner as was
    cost.

69
Pairwise Comparison MatrixCriteria
  • The accounting department has determined that
    in terms of criteria, cost is extremely
    preferable to delivery time and very strongly
    preferable to reliability, and that reliability
    is very strongly preferable to delivery time.

70
Pairwise Comparison MatrixCriteria
  • Cost
    Reliability Delivery
  • Cost 1 7
    9
  • Reliability 1/7 1 7
  • Delivery 1/9 1/7 1

71
Normalized MatrixCriteria
  • Divide each entry in the pairwise comparison
    matrix by its corresponding column sum.

Cost Reliability Delivery Cost
63/79 49/57 9/17 Reliability
9/79 7/57 7/17 Delivery 7/79
1/57 1/17
72
Priority VectorCriteria
  • The priority vector is determined by averaging
    the row entries in the normalized matrix.
    Converting to decimals we get

  • Cost (63/79 49/57 9/17)/3
    .729
  • Reliability ( 9/79 7/57 7/17)/3
    .216
  • Delivery ( 7/79 1/57 1/17)/3
    .055

73
Overall Priority Vector
  • The overall priorities are determined by
    multiplying the priority vector of the criteria
    by the priorities for each decision alternative
    for each objective.
  • Priority Vector
  • for Criteria .729 .216
    .055
  • Cost Reliability Delivery
  • Cornell .298 .571
    .471
  • Brush Pik .632 .278 .059
  • Picobuy .069 .151 .471

74
Overall Priority Vector
  • Thus, the overall priority vector is
  • Cornell (.729)(.298) (.216)(.571)
    (.055)(.471) .366
  • Brush Pik (.729)(.632) (.216)(.278)
    (.055)(.059) .524
  • Picobuy (.729)(.069) (.216)(.151)
    (.055)(.471) .109
  • Brush Pik appears to be the overall
    recommendation.
Write a Comment
User Comments (0)
About PowerShow.com