An Introduction to Management Science 13th Edition by David Anderson,Dennis Sweeney ,Thomas Williams ,Jeffrey Camm, Kipp Martin

Exercise 24

Consider the following project network. Note that the normal or expected activity times are denoted T i , i = A, B, … ,I. Let x i = the earliest finish time for activity i. Formulate a linear programming model that can be used to determine the length of the critical path.