Statistics
Consider the following layouts:Layout 1:Trip Matrix Distance Matrix1 2 3 4 5 1 2 3 4 51 0 8 13 0 0 1 0 4 8 12 162 5 0 3 3 8 2 4 0 4 8 123 3 12 0 4 0 3 8 4 0 4 84 3 0 0 0 5 4 12 8 4 0 45 0 8 4 10 0 5 16 12 8 4 0Layout 2:Trip Matrix Distance Matrix1 2 3 4 5 1 2 3 4 51 0 8 13 0 0 1 0 7 8 12 142 5 0 3 3 8 2 7 0 5 6 73 3 12 0 4 0 3 8 5 0 4 94 3 0 0 0 5 4 12 6 4 0 65 0 8 4 10 0 5 14 7 9 6 0Layout 3Trip Matrix Distance Matrix1 2 3 4 5 1 2 3 4 51 0 8 13 0 0 1 0 4 8 12 142 5 0 3 3 8 2 4 0 4 8 103 3 12 0 4 0 3 8 4 0 2 84 3 0 0 0 5 4 12 8 2 0 45 0 8 4 10 0 5 14 10 8 4 0Layout 4:Trip Matrix Distance Matrix1 2 3 4 5 1 2 3 4 51 0 8 13 0 0 1 0 5 8 11 132 5 0 3 3 8 2 5 0 4 8 113 3 12 0 4 0 3 8 4 0 4 84 3 0 0 0 5 4 11 8 4 0 55 0 8 4 10 0 5 13 11 8 5 0Layout 5Trip Matrix Distance Matrix1 2 3 4 5 1 2 3 4 51 0 8 13 0 0 1 0 4 12 12 42 5 0 3 3 8 2 4 0 3 4 43 3 12 0 4 0 3 12 3 0 4 44 3 0 0 0 5 4 12 4 4 0 35 0 8 4 10 0 5 4 4 4 3 0Total cost for Layout 1 is)Total cost for Layout 2 is)Total cost for Layout 3 is)Total cost for Layout 4 is)Total cost for Layout 5 is)The best layout is layout (input just a single digit number)QUESTION 2Refer to the problem A.23 in your textbook (Louisiana Scratch Off Bingo)The expected value for Scratch A is)The expected value for Scratch B is)The expected value for Scratch C is)The expected value of the whole game is : ( )Note: input only numbers in the following format 0.91, not .91QUESTION 3Revenue = 2280*X1 + 1515*X2Subject to:8X1 + 5X2 <= 328503.1X1 + 2.6X2 <= 15000X1 + 2X2 <= 7000X2 = 0What is the optimal number of X1?QUESTION 4Revenue = 2280*X1 + 1515*X2Subject to:8X1 + 5X2 <= 328503.1X1 + 2.6X2 <= 15000X1 + 2X2 <= 7000X2 = 0What is the optimal number of X2?QUESTION 5Revenue = 2280*X1 + 1515*X2Subject to:8X1 + 5X2 <= 328503.1X1 + 2.6X2 <= 15000X1 + 2X2 <= 7000X2 = 0What is the maximum revenue? (note: do not input dollar sign and do not separate the thousand digits with commas)QUESTION 6Consider the following manufacturing process:Performance Time Task Must FollowTask (in minutes) This TaskA 1 —B 1 AC 2 AD 1 CE 3 CF 1 CG 1 D, E, FH 2 BI 1 G, H13Cycle time is 3.33 minutesWhat is the theoretical minimum number of stations?QUESTION 7Consider the following manufacturing process:Performance Time Task Must FollowTask (in minutes) This TaskA 1 —B 1 AC 2 AD 1 CE 3 CF 1 CG 1 D, E, FH 2 BI 1 G, H13Cycle time is 3.33 minutesWhat is the operating efficiency? (Note: you need to know whether it is possible to breakdown this process into the minimum theoretical number of workstations before you can answer the main question. Please, input your answer in percentage format with percentage sign and ONE decimal digit!, e.g. 43.1%)




