Question: Network

Solution: Linear Programming Model of the Network

Decision Variables: T1 T2 T3 T4, T5, T6, T7 (time in days)
Objective function Minimize T7 T1
Subject to (s.t.)
Resource Constraints (Only TIME is considered in the given assignment)
1. T2 T1 > 20
2. T3 T1 > 20
3. T4 T1 > 10
4. T6 T2 > 15
5. T6 T3 > 10
6. T7 T3 > 14
7. T5 T3 > 04
8. T5 T4 > 11
9. T7 T5 > 18
10. T7 T6 > 08
11. T3 T4 > 0

Activity a with 20 days time

Activity b with 20 days time
Activity c with 10 days time
Activity d with 15 days time
Activity e with 10 days time
Activity f with 14 days time
Activity g with 04 days time
Activity h with 11 days time
Activity i with 18 days time
Activity j with 08 days time
Dummy Activity with zero time

Positivity Constraints
T1, T2, T3, T4, T5, T6, T7 > 0
The Optimal Solution of the above Linear Program using Management Scientist
Gives the Critical Time = 43 days.