1. 1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE METHODS FOR BUSINESS 8e QUANTITATIVE METHODS FOR BUSINESS 8e

2. 2 2 Slide Chapter 18 Multicriteria Decision Problems n Goal Programming n Goal Programming: Formulation and Graphical Solution n Scoring Models n The Analytic Hierarchy Process n Establishing Priorities Using AHP n Using AHP to Develop an Overall Priority Ranking

3. 3 3 Slide Goal Programming n Goal programming may be used to solve linear programs with multiple objectives, with each objective viewed as a "goal". n In goal programming, d i + and d i -, deviation variables, are the amounts a targeted goal i is overachieved or underachieved, respectively. n The goals themselves are added to the constraint set with d i + and d i - acting as the surplus and slack variables. n 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.

4. 4 4 Slide Goal Programming n For each priority level, the objective function is to minimize the (weighted) sum of the goal deviations. n Previous "optimal" achievements of goals are added to the constraint set so that they are not degraded while trying to achieve lesser priority goals.

5. 5 5 Slide Goal Programming Approach n Step 1: Decide the priority level of each goal. n Step 2: Decide the weight on each goal. If a priority level has more than one goal, for each goal i decide the weight, w i, to be placed on the deviation(s), d i + and/or d i -, from the goal. If a priority level has more than one goal, for each goal i decide the weight, w i, to be placed on the deviation(s), d i + and/or d i -, from the goal. n Step 3: Set up the initial linear program. Min w 1 d 1 + + w 2 d 2 - s.t. Functional Constraints, s.t. Functional Constraints, and Goal Constraints and Goal Constraints n Step 4: Solve this linear program. If there is a lower priority level, go to step 5. Otherwise, a final optimal solution has been reached.

6. 6 6 Slide Goal Programming Approach n 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 w 3 d 3 + + w 4 d 4 - Min w 3 d 3 + + w 4 d 4 - s.t. Functional Constraints, s.t. Functional Constraints, Goal Constraints, and Goal Constraints, and w 1 d 1 + + w 2 d 2 - = k w 1 d 1 + + w 2 d 2 - = k Go to step 4. (Repeat steps 4 and 5 until all priority levels have been examined.)

7. 7 7 Slide Example: Conceptual Products Conceptual Products is a computer company that produces the CP400 and the 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.

8. 8 8 Slide 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.

9. 9 9 Slide Example: Conceptual Products The company has four goals which are given below: Priority 1: Meet a state contract of 200 CP400 machines weekly. (Goal 1) 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 2: Make at least 500 total computers weekly. (Goal 2) Priority 3: Make at least $250,000 weekly. (Goal 3) Priority 3: Make at least $250,000 weekly. (Goal 3) Priority 4: Use no more than 400 man-hours per week. (Goal 4) Priority 4: Use no more than 400 man-hours per week. (Goal 4)

10. 10 Slide Example: Conceptual Products n Variables x 1 = number of CP400 computers produced weekly x 1 = number of CP400 computers produced weekly x 2 = number of CP500 computers produced weekly x 2 = number of CP500 computers produced weekly d i - = amount the right hand side of goal i is deficient d i - = amount the right hand side of goal i is deficient d i + = amount the right hand side of goal i is exceeded d i + = amount the right hand side of goal i is exceeded n Functional Constraints Availability of floppy disk drives: 2 x 1 + x 2 < 1000 Availability of zip disk drives: x 2 < 500 Availability of cases: x 1 + x 2 < 600

11. 11 Slide Example: Conceptual Products n Goals (1) 200 CP400 computers weekly: x 1 + d 1 - - d 1 + = 200 (2) 500 total computers weekly: (2) 500 total computers weekly: x 1 + x 2 + d 2 - - d 2 + = 500 x 1 + x 2 + d 2 - - d 2 + = 500 (3) $250(in thousands) profit: (3) $250(in thousands) profit:.2 x 1 +.5 x 2 + d 3 - - d 3 + = 250.2 x 1 +.5 x 2 + d 3 - - d 3 + = 250 (4) 400 total man-hours weekly: (4) 400 total man-hours weekly: x 1 + 1.5 x 2 + d 4 - - d 4 + = 400 x 1 + 1.5 x 2 + d 4 - - d 4 + = 400 Non-negativity: Non-negativity: x 1, x 2, d i -, d i + > 0 for all i x 1, x 2, d i -, d i + > 0 for all i

12. 12 Slide Example: Conceptual Products n Objective Functions Priority 1: Minimize the amount the state contract is not met: Min d 1 - Priority 1: Minimize the amount the state contract is not met: Min d 1 - Priority 2: Minimize the number under 500 computers produced weekly: Min d 2 - Priority 2: Minimize the number under 500 computers produced weekly: Min d 2 - Priority 3: Minimize the amount under $250,000 earned weekly: Min d 3 - Priority 3: Minimize the amount under $250,000 earned weekly: Min d 3 - Priority 4: Minimize the man-hours over 400 used weekly: Min d 4 + Priority 4: Minimize the man-hours over 400 used weekly: Min d 4 +

13. 13 Slide Example: Conceptual Products n Formulation Summary Min P 1 ( d 1 - ) + P 2 ( d 2 - ) + P 3 ( d 3 - ) + P 4 ( d 4 + ) s.t. 2 x 1 + x 2 < 1000 s.t. 2 x 1 + x 2 < 1000 + x 2 < 500 + x 2 < 500 x 1 + x 2 < 600 x 1 + x 2 < 600 x 1 + d 1 - - d 1 + = 200 x 1 + d 1 - - d 1 + = 200 x 1 + x 2 + d 2 - - d 2 + = 500 x 1 + x 2 + d 2 - - d 2 + = 500.2 x 1 +.5 x 2 + d 3 - - d 3 + = 250.2 x 1 +.5 x 2 + d 3 - - d 3 + = 250 x 1 +1.5 x 2 + d 4 - - d 4 + = 400 x 1 +1.5 x 2 + d 4 - - d 4 + = 400 x 1, x 2, d 1 -, d 1 +, d 2 -, d 2 +, d 3 -, d 3 +, d 4 -, d 4 + > 0 x 1, x 2, d 1 -, d 1 +, d 2 -, d 2 +, d 3 -, d 3 +, d 4 -, d 4 + > 0

14. 14 Slide Example: Conceptual Products n Graphical Solution, Iteration 1 To solve graphically, first graph the functional constraints. Then graph the first goal: x 1 = 200. Note on the next slide that there is a set of points that exceed x 1 = 200 (where d 1 - = 0).

15. 15 Slide Example: Conceptual Products n Functional Constraints and Goal 1 Graphed 1000 800 800 600 600 400 400 200 200 200 400 600 800 1000 1200 200 400 600 800 1000 1200 2x 1 + x 2 < 1000 Goal 1: x 1 > 200 x 1 + x 2 < 600 x 2 < 500 Points Satisfying Goal 1 x1x1x1x1 x2x2x2x2

16. 16 Slide Example: Conceptual Products n Graphical Solution, Iteration 2 Now add Goal 1 as x 1 > 200 and graph Goal 2: x 1 + x 2 = 500. Note on the next slide that there is still a set of points satisfying the first goal that also satisfies this second goal (where d 2 - = 0).

17. 17 Slide Example: Conceptual Products n Goal 1 (Constraint) and Goal 2 Graphed 1000 800 800 600 600 400 400 200 200 200 400 600 800 1000 1200 200 400 600 800 1000 1200 2x 1 + x 2 < 1000 Goal 1: x 1 > 200 x 1 + x 2 < 600 x 2 < 500 Points Satisfying Both Goals 1 and 2 x1x1x1x1 x2x2x2x2 Goal 2: x 1 + x 2 > 500

18. 18 Slide Example: Conceptual Products n Graphical Solution, Iteration 3 Now add Goal 2 as x 1 + x 2 > 500 and Goal 3:.2 x 1 +.5 x 2 = 250. Note on the next slide that no points satisfy the previous functional constraints and goals and satisfy this constraint. Thus, to Min d 3 -, this minimum value is achieved when we Max.2 x 1 +.5 x 2. Note that this occurs at x 1 = 200 and x 2 = 400, so that.2 x 1 +.5 x 2 = 240 or d 3 - = 10.

19. 19 Slide Example: Conceptual Products n Goal 2 (Constraint) and Goal 3 Graphed 1000 800 800 600 600 400 400 200 200 200 400 600 800 1000 1200 200 400 600 800 1000 1200 2x 1 + x 2 < 1000 Goal 1: x 1 > 200 x 1 + x 2 < 600 x 2 < 500 Points Satisfying Both Goals 1 and 2 x1x1x1x1 x2x2x2x2 Goal 2: x 1 + x 2 > 500 Goal 3:.2x 1 +.5x 2 = 250 (200,400)

20. 20 Slide A Scoring Model for Job Selection n 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 Chicagofinancial analyst for an investment firm in Chicago accountant for a manufacturing firm in Denveraccountant for a manufacturing firm in Denver auditor for a CPA firm in Houstonauditor for a CPA firm in Houston

21. 21 Slide A Scoring Model for Job Selection n The student made the following comments: “The financial analyst position provides the best opportunity for my long-run career advancement.”“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 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.”“I like the management style and philosophy at the Houston CPA firm the best.” n Clearly, this is a multicriteria decision problem.

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

23. 23 Slide A Scoring Model for Job Selection n Steps Required to Develop a Scoring Model Step 1: List the decision-making criteria. Step 1: List the decision-making criteria. Step 2: Assign a weight to each criterion. Step 2: Assign a weight to each criterion. Step 3: Rate how well each decision alternative satisfies each criterion. Step 3: Rate how well each decision alternative satisfies each criterion. Step 4: Compute the score for each decision alternative. 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. Step 5: Order the decision alternatives from highest score to lowest score. The alternative with the highest score is the recommended alternative.

24. 24 Slide A Scoring Model for Job Selection n Mathematical Model S j =   w i r ij S j =   w i r ij iwhere: r ij = rating for criterion i and decision alternative j S j = score for decision alternative j

25. 25 Slide A Scoring Model for Job Selection n Step 1: List the criteria (important factors). Career advancementCareer advancement LocationLocation ManagementManagement SalarySalary PrestigePrestige Job SecurityJob Security Enjoyable workEnjoyable work

26. 26 Slide A Scoring Model for Job Selection n Five-Point Scale Chosen for Step 2 Importance Weight Importance Weight Very unimportant1 Very unimportant1 Somewhat unimportant2 Somewhat unimportant2 Average importance3 Average importance3 Somewhat important4 Somewhat important4 Very important5 Very important5

27. 27 Slide A Scoring Model for Job Selection n Step 2: Assign a weight to each criterion. Criterion Importance Weight Career advancementVery important5 LocationAverage importance3 ManagementSomewhat important4 SalaryAverage importance3 PrestigeSomewhat unimportant2 Job securitySomewhat important4 Enjoyable workVery important5

28. 28 Slide A Scoring Model for Job Selection n Nine-Point Scale Chosen for Step 3 Level of Satisfaction Rating Level of Satisfaction Rating Extremely low1 Extremely low1 Very low2 Very low2 Low3 Low3 Slightly low4 Slightly low4 Average5 Average5 Slightly high6 Slightly high6 High7 High7 Very high8 Very high8 Extremely high9 Extremely high9

29. 29 Slide A Scoring Model for Job Selection n Step 3: Rate how well each decision alternative satisfies each criterion. Decision Alternative Decision Alternative Analyst Accountant Auditor Analyst Accountant Auditor Criterion Chicago Denver Houston Criterion Chicago Denver Houston Career advancement864 Location387 Management569 Salary675 Prestige754 Job security476 Enjoyable work865

30. 30 Slide A Scoring Model for Job Selection n Step 4: Compute the score for each decision alternative. Decision Alternative 1 - Analyst in Chicago Decision Alternative 1 - Analyst in Chicago Criterion Weight ( w i ) Rating ( r i 1 ) w i r i 1 Criterion Weight ( w i ) Rating ( r i 1 ) w i r i 1 Career advancement 5 x 8 =40 Location 3 3 9 Management 4 520 Salary 3 618 Prestige 2 714 Job security 4 416 Enjoyable work 5 840 Score 157

31. 31 Slide A Scoring Model for Job Selection n Step 4: Compute the score for each decision alternative. S j =   w i r ij S j =   w i r ij i S 1 = 5(8)+3(3)+4(5)+3(6)+2(7)+4(4)+5(8) = 157 S 2 = 5(6)+3(8)+4(6)+3(7)+2(5)+4(7)+5(6) = 167 S 3 = 5(4)+3(7)+4(9)+3(5)+2(4)+4(6)+5(5) = 149

32. 32 Slide A Scoring Model for Job Selection n Step 4: Compute the score for each decision alternative. Decision Alternative Decision Alternative Analyst Accountant Auditor Analyst Accountant Auditor Criterion Chicago Denver Houston Criterion Chicago Denver Houston Career advancement403020 Location 92421 Management202436 Salary182115 Prestige1410 8 Job security162824 Enjoyable work403025 Score 157 167 149 Score 157 167 149

33. 33 Slide A Scoring Model for Job Selection n 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.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.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.But when the weights of the criteria are considered, the Denver position is superior to the Chicago job.

34. 34 Slide A Scoring Model for Job Selection n Partial Spreadsheet Showing Steps 1 - 3

35. 35 Slide A Scoring Model for Job Selection n Partial Spreadsheet Showing Formulas for Step 4

36. 36 Slide A Scoring Model for Job Selection n Partial Spreadsheet Showing Results of Step 4

37. 37 Slide 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. 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.

38. 38 Slide Analytic Hierarchy Process n Step 1: List the Overall Goal, Criteria, and Decision Alternatives n 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... continued ------- For each criterion, perform steps 2 through 5 -------

39. 39 Slide Analytic Hierarchy Process n Step 2: Pairwise Comparison Matrix (continued) Compared to the second alternative, the first alternative is: Numerical rating extremely preferred 9 extremely preferred 9 very strongly preferred 7 very strongly preferred 7 strongly preferred 5 strongly preferred 5 moderately preferred 3 moderately preferred 3 equally preferred 1 equally preferred 1

40. 40 Slide Analytic Hierarchy Process n 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.

41. 41 Slide Analytic Hierarchy Process n Step 3: Develop a Normalized Matrix Divide each number in a column of the pairwise comparison matrix by its column sum. n 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.

42. 42 Slide Analytic Hierarchy Process n 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. n 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.

43. 43 Slide Analytic Hierarchy Process n 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). n Step 8: Develop an Overall Priority Vector Multiply the criteria priority vector (from step 7) by the priority matrix (from step 6).

44. 44 Slide Determining the Consistency Ratio n 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. n Step 2: For each row, divide its weighted sum by the priority of its corresponding (row) alternative. n Step 3: Determine the average, max, of the results of step 2.

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

46. 46 Slide Example: Gill Glass Designer Gill Glass must decide which of three manufacturers will develop his "signature" toothbrushes. Three factors seem 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. 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.

47. 47 Slide Example: Gill Glass n Hierarchy for the Manufacturer Selection Problem Select the Best Toothbrush Manufacturer Cost Cost ReliabilityReliability Delivery Time Cornell Brush Pik PicobuyCornell PicobuyCornell PicobuyCornell PicobuyCornell PicobuyCornell Picobuy Overall Goal Criteria DecisionAlternatives

48. 48 Slide Example: Gill Glass n Forming the Pairwise Comparison Matrix For Cost 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 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 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.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.

49. 49 Slide Example: Gill Glass n Pairwise Comparison Matrix for Cost Cornell Brush Pik Picobuy Cornell Brush Pik Picobuy Cornell 1 1/3 6 Cornell 1 1/3 6 Brush Pik 3 1 7 Picobuy 1/6 1/7 1

50. 50 Slide Example: Gill Glass n Normalized Matrix for 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 Brush Pik Picobuy Cornell 6/25 7/31 6/14 Cornell 6/25 7/31 6/14 Brush Pik 18/25 21/31 7/14 Picobuy 1/25 3/31 1/14

51. 51 Slide Example: Gill Glass n Priority Vector For 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 Cornell: ( 6/25 + 7/31 + 6/14)/3 =.298 Brush Pik: (18/25 + 21/31 + 7/14)/3 =.632 Brush Pik: (18/25 + 21/31 + 7/14)/3 =.632 Picobuy: ( 1/25 + 3/31 + 1/14)/3 =.069 Picobuy: ( 1/25 + 3/31 + 1/14)/3 =.069

52. 52 Slide Example: Gill Glass n Checking Consistency Multiply each column of the pairwise comparison matrix by its priority:Multiply each column of the pairwise comparison matrix by its priority: 1 1/3 6.923 1 1/3 6.923.298 3 +.632 1 +.069 7 = 2.009.298 3 +.632 1 +.069 7 = 2.009 1/6 1/7 1.209 1/6 1/7 1.209 Divide these number by their priorities to get:Divide these number by their priorities to get:.923/.298 = 3.097.923/.298 = 3.097 2.009/.632 = 3.179 2.009/.632 = 3.179.209/.069 = 3.029.209/.069 = 3.029

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

54. 54 Slide Example: Gill Glass 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.

55. 55 Slide Example: Gill Glass n Pairwise Comparison Matrix for Reliability Cornell Brush Pik Picobuy Cornell Brush Pik Picobuy Cornell 1 7 2 Cornell 1 7 2 Brush Pik 1/7 1 5 Picobuy 1/2 1/5 1

56. 56 Slide Example: Gill Glass n Normalized Matrix for Reliability 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 Brush Pik Picobuy Cornell 14/23 35/41 2/8 Cornell 14/23 35/41 2/8 Brush Pik 2/23 5/41 5/8 Picobuy 7/23 1/41 1/8

57. 57 Slide Example: Gill Glass n Priority Vector For 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 Cornell: (14/23 + 35/41 + 2/8)/3 =.571 Brush Pik: ( 2/23 + 5/41 + 5/8)/3 =.278 Brush Pik: ( 2/23 + 5/41 + 5/8)/3 =.278 Picobuy: ( 7/23 + 1/41 + 1/8)/3 =.151 Picobuy: ( 7/23 + 1/41 + 1/8)/3 =.151 n Checking Consistency Gill Glass’ responses to reliability could be checked for consistency in the same manner as was cost.

58. 58 Slide Example: Gill Glass 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.

59. 59 Slide Example: Gill Glass n Pairwise Comparison Matrix for Delivery Time Cornell Brush Pik Picobuy Cornell Brush Pik Picobuy Cornell 1 8 1 Cornell 1 8 1 Brush Pik 1/8 1 1/8 Picobuy 1 8 1

60. 60 Slide Example: Gill Glass n Normalized Matrix for Delivery Time Divide each entry in the pairwise comparison matrix by its corresponding column sum. Cornell Brush Pik Picobuy Cornell Brush Pik Picobuy Cornell 8/17 8/17 8/17 Cornell 8/17 8/17 8/17 Brush Pik 1/17 1/17 1/17 Picobuy 8/17 8/17 8/17

61. 61 Slide Example: Gill Glass n Priority Vector For Delivery 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 Cornell: (8/17 + 8/17 + 8/17)/3 =.471 Brush Pik: (1/17 + 1/17 + 1/17)/3 =.059 Brush Pik: (1/17 + 1/17 + 1/17)/3 =.059 Picobuy: (8/17 + 8/17 + 8/17)/3 =.471 Picobuy: (8/17 + 8/17 + 8/17)/3 =.471 n Checking Consistency Gill Glass’ responses to delivery time could be checked for consistency in the same manner as was cost.

62. 62 Slide Example: Gill Glass 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.

63. 63 Slide Example: Gill Glass n Pairwise Comparison Matrix for Criteria Cost Reliability Delivery Cost Reliability Delivery Cost 1 7 9 Cost 1 7 9 Reliability 1/7 1 7 Delivery 1/9 1/7 1

64. 64 Slide Example: Gill Glass n Normalized Matrix for Criteria Divide each entry in the pairwise comparison matrix by its corresponding column sum. Cost Reliability Delivery Cost Reliability Delivery Cost 63/79 49/57 9/17 Reliability 9/79 7/57 7/17 Delivery 7/79 1/57 1/17

65. 65 Slide Example: Gill Glass n Priority Vector For Criteria 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 Cost: (63/79 + 49/57 + 9/17)/3 =.729 Reliability: ( 9/79 + 7/57 + 7/17)/3 =.216 Reliability: ( 9/79 + 7/57 + 7/17)/3 =.216 Delivery: ( 7/79 + 1/57 + 1/17)/3 =.055 Delivery: ( 7/79 + 1/57 + 1/17)/3 =.055

66. 66 Slide Example: Gill Glass n 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 Priority Vector for Criteria [.729.216.055 ] for Criteria [.729.216.055 ] Cost Reliability Delivery Cost Reliability Delivery Cornell.298.571.471 Brush Pik.632.278.059 Picobuy.069.151.471

67. 67 Slide Example: Gill Glass n Overall Priority Vector (continued) 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.

68. 68 Slide The End of Chapter 18