Quantitative Analysis/Statistics M/C Homework-Need it now-Time sensitive
|
200 180 100 90 none of the above |
shortest time path through the network. path with the fewest activities. path with the most activities. longest time path through the network. none of the above. |
40 percent 95 percent 70 percent 90 percent none of the above |
a single ticket seller who could service a customer in two minutes. two ticket sellers each of whom could service a customer in three minutes. The two situations produce the same wait times. |
$500 $700 $900 $1,100 insufficient information to answer the question |
the decoupling function the translucent function an inflation hedge allows for quantity discounts to avoid stockouts and shortages |
0.43 1.67 0.57 1.33 none of the above |
the origin. a corner point of the feasible region. the highest point of the feasible region. the lowest point in the feasible region. none of the above. |
616.9 618.4 620.3 622.9 625.5 |
0.43 0.57 0.75 0.25 0.33 |
$26.00 $106.00 $16.00 $10.60 none of the above |
5 6 7 12 none of the above |
balking. reneging. cropping. blithering. none of the above. |
10.5 11.5 12.5 13.5 14.5 |
quantity discount model. safety stock model. planned shortage model. production run model. none of the above. |
Arrivals come from an infinite, or very large, population. Arrivals are Poisson distributed. Arrivals are treated on a first-in, first-out basis and do not balk or renege. Service rates follow the normal distribution. The average service rate is faster than the average arrival rate. |
0.25 0.50 0.75 2.25 3.00 |
A-C-E-H B-C-E-H B-D-F-H B-D-G-H B-C-F-H |
23 days 19 days 22 days 25 days 20 days |
0.67 minutes 0.50 minutes 0.75 minutes 0.33 minutes 1.33 minutes |
the values for all of the decision variables will remain the same. other values will change, but the original corner point remains optimal. a new corner point will become optimal. none of the above. |
2 4 5 15 none of the above |
Arrivals that are independent of each other are random. Random arrivals cannot be predicted exactly. The Poisson distribution is often used to represent arrival pattern. The exponential distribution is often used to represent arrival patterns. |
degree to which members of the queue renege. sequence in which members of the queue arrived. degree to which members of the queue are orderly and quiet. sequence in which members of the queue are serviced. all of the above. |
0.643 0.250 0.750 0.143 |
single-channel, multiphase system. single-channel, single-phase system. multichannel, multiphase system. multichannel, single-phase system. none of the above. |
optimistic time (a). most likely time (m). deterministic time (d). pessimistic time (b). none of the above. |
single-channel, multiphase system. single-channel, single-phase system. multichannel, multiphase system. multichannel, single-phase system. none of the above. |
objective of a business. constraint of operations management. goal of management science. objective of linear programming. both a and d. |
same product mix, different total profit. different product mix, same total profit as before. same product mix, same total profit. different product mix, different total profit. |
0
438435527
MultipleChoice
81
0
0
438435528
MultipleChoice
45
0
438435529
438435520
MultipleChoice
8
0
438435530
MultipleChoice
10
MultipleChoice
0
438435531
MultipleChoice
63
0
438435532
MultipleChoice
32
18
0
438435533
MultipleChoice
44
0
438435534
MultipleChoice
40
0
438435535
MultipleChoice
24
0
438435536
MultipleChoice
29
0
438435537
MultipleChoice
73
0
0
438435538
MultipleChoice
74
0
438435539
438435521
MultipleChoice
9
0
438435540
MultipleChoice
49
MultipleChoice
0
438435541
MultipleChoice
69
0
438435543
MultipleChoice
15
65
0
438435544
MultipleChoice
19
0
438435545
MultipleChoice
2
0
438435546
MultipleChoice
20
0
438435548
MultipleChoice
86
0
438435549
MultipleChoice
21
0
0
438435550
MultipleChoice
57
438435522
MultipleChoice
78
0
438435523
MultipleChoice
90
0
438435524
MultipleChoice
77
0
438435525
MultipleChoice
38
0
438435526
MultipleChoice
30