This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall 2008 Homework 2 Homework 2 Solutions 1. As suggested in the problem, we will introduce nodes [ i,k ], corresponding to k months having elapsed at end of phase i . We have a node [ i,k ] for every value of k at which the i th phase could be completed by hiring some combination of crews for phases up to and including i . The resulting graph is in the picture below. The arcs represent hiring the crew of a particular size to execute a particular phase of the project (the arc costs indicate which crew is being hired). When crews of two different sizes can complete the phase in the same amount of time, the cheaper crew will be hired (otherwise, we would have, for example, two copies of the arc from [0 , 0] to [1 , 1], with costs 2 and 3 million dollars). While providing both arcs is not a mistake, it is clear that only the cheaper of the two could be a part of the shortest path....
View
Full
Document
This note was uploaded on 11/12/2009 for the course ENGRD 2700 taught by Professor Staff during the Spring '05 term at Cornell University (Engineering School).
 Spring '05
 STAFF

Click to edit the document details