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: Titolo presentazione sottotitolo • Milano, XX mese 20XX Exam September 2022 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
Full exam for Finance and Management of Infrastructure Investments in the Mobility Engineering degree programme at Politecnico di Milano. The document covers: Titolo presentazione sottotitolo • Milano, XX mese 20XX Exam September 2022 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
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.
Titolo presentazione sottotitolo • Milano, XX mese 20XX Exam September 2022 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 20 000€ for each week of delay is applied in case the project is not concluded before week 11. 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 (€) A - 2 1 5 000€ B - 4 - - C A 5 1 3 000€ D A 3 2 22 000€ E B 5 3 54 000€ F C,D,E 4 1 31 000€ G F 3 2 36 000€ 2 75 C 4 92 0 44 B 0 40 2 53 D 6 94 9 134 F 9 130 4 95 E 4 90 The critical path is B-E-F-G. The project duration is 16 weeks. Solution 0 22 A 2 42 13 163 G 13 160 Exercise 1 Activity Immediate Predecessor Duration (Weeks) Duration Reduction (Crashing) Total Crashing Cost (€) Unitary crashing cost (€) A - 2 1 5 000€ 5 000€ B - 4 - - - C A 5 1 3 000€ 3 000€ D A 3 2 22 000€ 11 000€ E B 5 3 54 000€ 18 000€ F C,D,E 4 1 31 000€ 31 000€ G F 3 2 36 000€ 18 000€ 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 20 000€ for each week of delay is applied in case the project is not concluded before week 11. At the end of each step of the crashing algorithm write which is the margin gained and the critical path/s. Crash G, as it is the most convenient activity. Solution The critical path is B-E-F-G. The project duration is 14 weeks. Benefit = 40 000 – 36 000 = 4 000€ 2 75 C 4 92 0 44 B 0 40 2 53 D 6 94…
First page of the document.