(2) Find an optimal solution for the following transportation problem. To Valley Town Junction Burg FROM (V) (T) () (B)

[answerhappygod]

2 Find An Optimal Solution For The Following Transportation Problem To Valley Town Junction Burg From V T B 1 (87.6 KiB) Viewed 24 times

2 Find An Optimal Solution For The Following Transportation Problem To Valley Town Junction Burg From V T B 2 (63.96 KiB) Viewed 24 times

2 Find An Optimal Solution For The Following Transportation Problem To Valley Town Junction Burg From V T B 3 (42.32 KiB) Viewed 24 times

2 Find An Optimal Solution For The Following Transportation Problem To Valley Town Junction Burg From V T B 4 (31.55 KiB) Viewed 24 times

(2) Find an optimal solution for the following transportation problem. To Valley Town Junction Burg FROM (V) (T) () (B) Supply Macon $6 $7 (M) 300 50 350 York $3 $2 150 250 200 600 $14 $9 (Y) Perry (P) Demand 250 250 300 200 250 450 1,200 The above feasible plan is obtained by applying the Northwest Corner Rule (e.g., 300 from M to V, etc.), and its total cost = 300($6) +50($8) + 150($10) +250($2) +200($9) +250($12) = $9,000. Using the Stepping-Stone method to find an optimal plan. The improvement indices below are determined as follows: To Valley Town Junction Burg FROM (V) (T) (J) (B) Supply (row M first, then rows Y and P) Macon MJ: 7-2+10-8-1 (M) 50 350 MB: 4-9+10-8--3 York YV: 3-10+8-6=-5 (Y) 150 250 200 600 PV: 14-12+9-10+8-6-3 Perry PT: 4-12+9-10--9* (P) 250 250 PJ: 9-12+9-2=4 Demand 300 200 250 450 1,200 *the "most negative index" We focus on cell PT (index=-9). Its closed path is: PT to PB to YB to YT, and back to PT. To increase the quantity in PT, we need to adjust PB down, YB up, and YT down. Therefore, the next improved plan is: TO Valley Town Junction Burg Part (b) Find the indices (show steps) Supply Row M first, then rows Y and P FROM (V) (T) (B) 50 350 600 250 1,200 Asterisk the "most negative index" (show steps). Dart (al Find the indicac/ehow.ctane) 300 $6 $3 $14 300 $6 $3 $14 $8 $10 $4 $8 $10 $4 $8 Macon (M) York Perry (P) 150 Demand 300 200 Part (a) Find the new TC- Part (c) Determine the next improved plan. Tal Vollau Toum $10 $4 $7 $2 $9 $7 $2 $9 250 250 Junction 350 100 450 $4 $9 $12 $4 $9 $12 $4 $9 $12 Dura
Part (c) Determine the next improved plan. ΤΟ Valley Town FROM (V) (T) Part (e) Find the indices (show steps) Supply Row M first, then rows Y and P Macon (M) 350 York (Y) 600 Perrv (P) 250 Demand 300 200 1,200 Asterisk the "most negative index" Part (d) Find the new TC= (show steps). Part (f) Is the current solution optimal? Explain I (hint: see Online Module 8, p.M8-4). (3) A project was planned using PERT. Its expected completion time was determined to be 64 days. The variance of the critical path is 26. What is the probability the project will be completed within 59 days (5 decimal places)? Let X-the project completion time. P(X__ _000)- Please show how you use the Normal Curve Table to obtain your answer in the space below. (4) Perform a project management analysis for the data given below to determine ES, EF, LS, LF, and slack for each activity, the total project completion time, and the critical path. Activity Time (weeks) Predecessors Activity Time (weeks) Predecessors A 5 E 3 B B 4 F 5 B C 2 A G 9 C.E D A H 6 D.F $6 $3 $14 $8 $10 $4 Junction (J) 250 S7 $2 $9 Burg (B) $4 $9 $12 450
(3) A project was planned using PERT. Its expected completion time was determined to be 64 days. The variance of the critical path is 26. What is the probability the project will be completed within 59 days (5 decimal places)? Let X-the project completion time. P(X__000)= Please show how you use the Normal Curve Table to obtain your answer in the space below. (4) Perform a project management analysis for the data given below to determine ES, EF, LS, LF, and slack for each activity, the total project completion time, and the critical path. Activity Time (weeks) Predecessors Activity Time (weeks) Predecessors A 5 E 3 B B 4 F - B 5 C 2 A G 9 C,E D 1 A H 6 D. F (a) Draw a network with t, ES, EF, LS, and LF (follow the same format as Figure 11.5 on p.394).
(b) Complete the following table (similar in format to Table 11.3 on p.396). LS Activity Time (weeks) ES EF LF Slack A I B C D E F G H (c) Identify the critical path(s): (d) Based on your analysis, the project completion time is: weeks and the least critical activity is: Critical?