# Binary Integer Programming

Consider the following activity-on-arc project network, where the 12 arcs (arrows) represent the 12 activities (tasks) that must be performed to complete the project and the network displays the order in which the activities need to be performed. The number next to each arc (arrow) is the time required for the corresponding activity. Consider the problem of finding the longest path (the largest total time) through this network from start (node 1) to finish (node 9), since the longest path is the critical path. Formulate a BIP model for this problem.

See attached file for full problem description.

© BrainMass Inc. brainmass.com October 9, 2019, 7:11 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/binary-integer-programming-110715

#### Solution Preview

Please see attached file.

Consider the following activity-on-arc project network, where the 12 arcs (arrows) represent the 12 activities ...

#### Solution Summary

A BIP model is formulated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.