Problem 6-23 (Algorithmic) Find the shortest route from node 1 to node 7 in the network shown. If the constant is "1" it must be entered in the box. If your answer is zero enter "O. For negative values enter "minus" sign () 13 20 12 1 if the arc from node i to node j is on the shortest route otherwise Let zij = 5 X X25 3 X X23+ 5 X x52+ 3 X X67 18 X x14+ 9 X X13+ 4X X35 + 6 X X57+ 7 X X12+ 3 X x32 2 X x56 Min 4 X X53 2 X X65 Flow Out Flow In X12+ x23+ x32+ X46 X52+ X57 x65+ Node 1 Node 2 Node 3 Node 4 Node 5 x13 + X25 X35 X14 X12+ X13 + x14 x32 t X52 x23 X53 x53 + x56 + x25 + X35 t X65 Node 6 x67 X46 + x56 Node 7 X57 t X67 xij 2 0 for all and j Optimal Solution: Variable Value x12 x13 x14 X23 X25 X32 Shortest Route Length Problem 6-23 (Algorithmic) Find the shortest route from node 1 to node 7 in the network shown. If the constant is "1" it must be entered in the box. If your answer is zero enter "O. For negative values enter "minus" sign () 13 20 12 1 if the arc from node i to node j is on the shortest route otherwise Let zij = 5 X X25 3 X X23+ 5 X x52+ 3 X X67 18 X x14+ 9 X X13+ 4X X35 + 6 X X57+ 7 X X12+ 3 X x32 2 X x56 Min 4 X X53 2 X X65 Flow Out Flow In X12+ x23+ x32+ X46 X52+ X57 x65+ Node 1 Node 2 Node 3 Node 4 Node 5 x13 + X25 X35 X14 X12+ X13 + x14 x32 t X52 x23 X53 x53 + x56 + x25 + X35 t X65 Node 6 x67 X46 + x56 Node 7 X57 t X67 xij 2 0 for all and j Optimal Solution: Variable Value x12 x13 x14 X23 X25 X32 Shortest Route Length