TOPIC: Linear Programming using assignment method and network models

Given below is a set of tasks with normal and crash time and corresponding, mal and crashed costs. Activity Predecessors Normal Crash Time (Weeks) Time (Weeks) 2 Normal Cost H Crash Cost A None 1 B None 3 1 2 1 D B 4 P22,000 P23,080 30,000 34,000 26,000 27.000 48,000 49,000 58,000 30,000 30,500 3 E 4 2 56,000 F 3 2 G DE 5 2 H EG 2 80,000 16,000 1 86,000 19,000 1. Draw the network diagram. List all possible paths and calculate their total completion time (normal and crash time) 3. Identify the Optimal Completion Time (OCT) and Optimal Crash Completion Time (OC-CT), Critical Path (CP), Critical Activities (CA) and Non-Critical Activities (NCA). 4. Complete the columns for reduced time and additional cost. 5. How much is the additional cost per period for activity D? 6. How much is the normal cost allocated for period 5 (59 week) only? 7. How much is the total normal cost allocated for the first five periods? 8. How much is the total normal cost of the project? Which activities should be crashed if the desired completion time for the project is 11 weeks? 10. How much is the total additional cost for the project if the normal completion time is reduced to 12 weeks