# Question: Consider the following project network as described in Sec 10 8

Consider the following project network (as described in Sec. 10.8), where the number over each node 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 to finish, since the longest path is the critical path.

(a) What are the stages and states for the dynamic programming formulation of this problem?

(b) Use dynamic programming to solve this problem. However, instead of using the usual tables, show your work graphically. In particular, fill in the values of the various fn*(sn) under the corresponding nodes, and show the resulting optimal arc to traverse out of each node by drawing an arrowhead near the beginning of the arc. Then identify the optimal path (the longest path) by following these arrowheads from the Start node to the Finish node. If there is more than one optimal path, identify them all.

(c) Use dynamic programming to solve this problem by constructing the usual tables for n = 4, n = 3, n = 2, and n = 1.

(a) What are the stages and states for the dynamic programming formulation of this problem?

(b) Use dynamic programming to solve this problem. However, instead of using the usual tables, show your work graphically. In particular, fill in the values of the various fn*(sn) under the corresponding nodes, and show the resulting optimal arc to traverse out of each node by drawing an arrowhead near the beginning of the arc. Then identify the optimal path (the longest path) by following these arrowheads from the Start node to the Finish node. If there is more than one optimal path, identify them all.

(c) Use dynamic programming to solve this problem by constructing the usual tables for n = 4, n = 3, n = 2, and n = 1.

**View Solution:**## Answer to relevant Questions

Consider the following statements about solving dynamic programming problems. Label each statement as true or false, and then justify your answer by referring to specific statements in the chapter. Consider the following integer nonlinear programming problem. Maximize Z = 3x21 – x31 + 5x22 – x32, Subject to x1 + 2x2 ≤ 4 and Sue dynamic programming to solve this problem. Reconsider the Fly-Right Airplane Co. problem introduced in Prob. 12.3-7. A more detailed analysis of the various cost and revenue factors now has revealed that the potential profit from producing airplanes for each customer ...Suppose that a state sends R persons to the U.S. House of Representatives. There are D counties in the state (D > R), and the state legislature wants to group these counties into R distinct electoral districts, each of which ...Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively: Minimize Z = 5x1 + 6x2 + 7x3 + 8x4 + 9x5, Subject to and xj is binary, for j = 1, 2, . . . , 5.Post your question