Document information
- University
- Politecnico di Milano
- Degree programme
- Mobility Engineering
- Subject
- Finance and Management of Infrastructure Investments
- Classification
- Exam · Full exam
- Content
- Solution only
- Original format
- Text
- Searchable text
Full exam for Finance and Management of Infrastructure Investments in the Mobility Engineering degree programme at Politecnico di Milano. The document covers: Activity Immediate Predecessor Duration (Weeks) Duration Reduction (Crashing) Total Crashing Cost (€) A - 3 1 28 000€ B - 6 3 6 000€ C A 4 2 42 000€ D A 3 2 40 000€ E D 4 3 75 000€ F D 2 1 11 000€ G E,F 2 1 32 000€ H B,C,G 2 - - Exercise 1 The following project is assigned.
Full exam for Finance and Management of Infrastructure Investments in the Mobility Engineering degree programme at Politecnico di Milano. The document covers: Activity Immediate Predecessor Duration (Weeks) Duration Reduction (Crashing) Total Crashing Cost (€) A - 3 1 28 000€ B - 6 3 6 000€ C A 4 2 42 000€ D A 3 2 40 000€ E D 4 3 75 000€ F D 2 1 11 000€ G E,F 2 1 32 000€ H B,C,G 2 - - Exercise 1 The following project is assigned.
Import quality: text was extracted directly from the original document.
Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.
Activity Immediate Predecessor Duration (Weeks) Duration Reduction (Crashing) Total Crashing Cost (€) A - 3 1 28 000€ B - 6 3 6 000€ C A 4 2 42 000€ D A 3 2 40 000€ E D 4 3 75 000€ F D 2 1 11 000€ G E,F 2 1 32 000€ H B,C,G 2 - - Exercise 1 The following project is assigned. Identify the critical path. Consider the possibility to crash the activities as shown in the following table. Identify the optimal solution according to a crashing programme. A penalty of 30 000€ for each week of delay is applied in case the project is not concluded before week 8. At the end of each step of the crashing algorithm write which is the margin gained and the critical path/s. 3 74 C 8 125 0 66 B 6 126 3 63 D 3 60 6 104 E 6 100 6 82 F 8 102 The critical path is A-D-E-G-H. The project duration is 14 weeks. Solution 0 33 A 0 30 10 122 G 10 120 12 142 H 12 140 Exercise 1 The following project is assigned. Identify the critical path. Consider the possibility to crash the activities as shown in the following table. Identify the optimal solution according to a crashing programme. A penalty of 30 000€ for each week of delay is applied in case the project is not concluded before week 8. At the end of each step of the crashing algorithm write which is the margin gained and the critical path/s. Activity Immediate Predecessor Duration (Weeks) Duration Reduction (Crashing) Total Crashing Cost (€) Unitary Crashing Cost A - 3 1 28 000€ 28 000€ B - 6 3 6 000€ 2 000€ C A 4 2 42 000€ 21 000€ D A 3 2 40 000€ 20 000€ E D 4 3 75 000€ 25 000€ F D 2 1 11 000€ 11 000€ G E,F 2 1 32 000€ 32 000€ H B,C,G 2 - - Crash D, as it is the most convenient activity. Indeed, A is less convenient, E is not economically convenient, as crashing it by 3 weeks would produce a project duration reduction of only two weeks (and…
First page of the document.