00:01
So we're given some data for a project and we have the activity, the predecessors, the number of times, the maximum crash and the crash cost per week.
00:08
We're to determine how much to crash each activity so that to complete the project in 21 weeks at minimum cost and we can use either linear programming or and calculations.
00:20
So for this we have a starting point right here.
00:34
I'm going to be using and calculations of course and this is connected here.
00:42
Here we have g, we have 13, e of 7, c of 4, f of 5, 20, 18, 20, 25, 25, d of 2, 16, 16, b of 7, right and the a of 9...