Project Management

Consider a project consisting of activities A, B, . . . , K. The information available on each activity can be found in Table 1. First, we are given the number of days required to perform it. Second, we have information on the predecessor activities, i.e., which activities need to be completed before that activity can start. Note that activities can be performed in parallel, as long as the predecessors constraints are not violated.

Find the critical activities, i.e., the activities that define the shortest time needed to complete the project.

This is a forum for the AMPL modeling language and system. If you have formulated a solution to your problem as a mathematical optimization problem, and you are trying to express your formulation as a model in the AMPL language, then you can post questions about your model here.

General instructions on how to solve your problem are outside the scope of this forum, but you can consult the Wikipedia article on the Critical Path Method and many other online sources of information.