LP = linear program

An automation project has the following activities and related data: Activity. Time (Weeks) Immediate Activity Predecessor Crash Most Most Most Cost Maximum Optimistic likely Pessimistic ($000) Crashable (a) (m) (c) per weeks week A None 4. 6 00 1 1 B None 4 5 6 5 1 1 2 3 2 2 1 4 7 4 2 0 B 1 3 5 1 2. 3 B 4. 5 12 1 G CE 9 16 3 2 N 00 H DF 6 16 2. 1 13a. (10 points) Compute the Expected Value Ext) and Variance V(t) for all activities. (5 points deducted for any error). 13b. (10 points) There are three critical paths: ACG, BEG, and BFG, all with expected project completion time E(T)-18 weeks. Compute the variance of project completion time for each path. (5 points deducted for any error) 4. We will assume that the project completion time is normally distributed with mean E/T)-18 weeks, and variance V(T) approximated by the maximum of the variances of the three individual critical paths. 14a(5 points) Compute the probability that the project can be completed in 19 weeks. 14b.(5 points) Determine the time X in weeks for which there is a 90% probability that the project can be completed on or before X 14. (10 points) List all alternatives and the respective costs for shortening the project by one week and identify the best alternative that has the minimum cost (5 points deducted for each missing or incorrect alternative). 15a (10 points) Formulate the linear program for minimizing the cost of shortening the project by one week. (5 points deducted for any missing part of the formulation 15b. (10 points) Solve 15a with an LP software, An automation project has the following activities and related data: Activity. Time (Weeks) Immediate Activity Predecessor Crash Most Most Most Cost Maximum Optimistic likely Pessimistic ($000) Crashable (a) (m) (c) per weeks week A None 4. 6 00 1 1 B None 4 5 6 5 1 1 2 3 2 2 1 4 7 4 2 0 B 1 3 5 1 2. 3 B 4. 5 12 1 G CE 9 16 3 2 N 00 H DF 6 16 2. 1 13a. (10 points) Compute the Expected Value Ext) and Variance V(t) for all activities. (5 points deducted for any error). 13b. (10 points) There are three critical paths: ACG, BEG, and BFG, all with expected project completion time E(T)-18 weeks. Compute the variance of project completion time for each path. (5 points deducted for any error) 4. We will assume that the project completion time is normally distributed with mean E/T)-18 weeks, and variance V(T) approximated by the maximum of the variances of the three individual critical paths. 14a(5 points) Compute the probability that the project can be completed in 19 weeks. 14b.(5 points) Determine the time X in weeks for which there is a 90% probability that the project can be completed on or before X 14. (10 points) List all alternatives and the respective costs for shortening the project by one week and identify the best alternative that has the minimum cost (5 points deducted for each missing or incorrect alternative). 15a (10 points) Formulate the linear program for minimizing the cost of shortening the project by one week. (5 points deducted for any missing part of the formulation 15b. (10 points) Solve 15a with an LP software