Consider the following layouts:
Layout 1:
Trip Matrix Distance Matrix
1 2 3 4 5 1 2 3 4 5
1 0 8 13 0 0 1 0 4 8 12 16
2 5 0 3 3 8 2 4 0 4 8 12
3 3 12 0 4 0 3 8 4 0 4 8
4 3 0 0 0 5 4 12 8 4 0 4
5 0 8 4 10 0 5 16 12 8 4 0
Layout 2:
Trip Matrix Distance Matrix
1 2 3 4 5 1 2 3 4 5
1 0 8 13 0 0 1 0 7 8 12 14
2 5 0 3 3 8 2 7 0 5 6 7
3 3 12 0 4 0 3 8 5 0 4 9
4 3 0 0 0 5 4 12 6 4 0 6
5 0 8 4 10 0 5 14 7 9 6 0
Layout 3
Trip Matrix Distance Matrix
1 2 3 4 5 1 2 3 4 5
1 0 8 13 0 0 1 0 4 8 12 14
2 5 0 3 3 8 2 4 0 4 8 10
3 3 12 0 4 0 3 8 4 0 2 8
4 3 0 0 0 5 4 12 8 2 0 4
5 0 8 4 10 0 5 14 10 8 4 0
Layout 4:
Trip Matrix Distance Matrix
1 2 3 4 5 1 2 3 4 5
1 0 8 13 0 0 1 0 5 8 11 13
2 5 0 3 3 8 2 5 0 4 8 11
3 3 12 0 4 0 3 8 4 0 4 8
4 3 0 0 0 5 4 11 8 4 0 5
5 0 8 4 10 0 5 13 11 8 5 0
Layout 5
Trip Matrix Distance Matrix
1 2 3 4 5 1 2 3 4 5
1 0 8 13 0 0 1 0 4 12 12 4
2 5 0 3 3 8 2 4 0 3 4 4
3 3 12 0 4 0 3 12 3 0 4 4
4 3 0 0 0 5 4 12 4 4 0 3
5 0 8 4 10 0 5 4 4 4 3 0
Total 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 2
Refer 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 .91
QUESTION 3
Revenue = 2280*X1 + 1515*X2
Subject to:
8X1 + 5X2 <= 32850
3.1X1 + 2.6X2 <= 15000
X1 + 2X2 <= 7000
X2 <= 2800
X1 and X2 >= 0
What is the optimal number of X1?
QUESTION 4
Revenue = 2280*X1 + 1515*X2
Subject to:
8X1 + 5X2 <= 32850
3.1X1 + 2.6X2 <= 15000
X1 + 2X2 <= 7000
X2 <= 2800
X1 and X2 >= 0
What is the optimal number of X2?
QUESTION 5
Revenue = 2280*X1 + 1515*X2
Subject to:
8X1 + 5X2 <= 32850
3.1X1 + 2.6X2 <= 15000
X1 + 2X2 <= 7000
X2 <= 2800
X1 and X2 >= 0
What is the maximum revenue? (note: do not input dollar sign and do not separate the thousand digits with commas)
QUESTION 6
Consider the following manufacturing process:
Performance Time Task Must Follow
Task (in minutes) This Task
A 1 —
B 1 A
C 2 A
D 1 C
E 3 C
F 1 C
G 1 D, E, F
H 2 B
I 1 G, H
13
Cycle time is 3.33 minutes
What is the theoretical minimum number of stations?
QUESTION 7
Consider the following manufacturing process:
Performance Time Task Must Follow
Task (in minutes) This Task
A 1 —
B 1 A
C 2 A
D 1 C
E 3 C
F 1 C
G 1 D, E, F
H 2 B
I 1 G, H
13
Cycle time is 3.33 minutes
What 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%)
TAKE ADVANTAGE OF OUR PROMOTIONAL DISCOUNT DISPLAYED ON THE WEBSITE AND GET A DISCOUNT FOR YOUR PAPER NOW!