Question: Please help with this question Problem 6-23 (Algorithmic) Find the shortest route from node 1 to node 7 in the network shown. If the constant


Please help with this question
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 "0". For negative values enter "minus" sign (-). 6 12 7 6 18 4 6 3 18 3 3 Let = { if the arc from node i to node ; is on the shortest route 0 otherwise Min 7 X X12 + X13+ X14 + x23 + X25 + X32 + + X35 + X 46 + X52 + X53 + X56 + X57 + X65 + X67 sit. Flow Out Flow In Node 1 X12 + X 13+ = X14 Node 2 X23 + X25 + X12 + X32 + X52 Node 3 X32 + X35 + X13 + X23 + X53 Node 4 X 46 + X14 = HIITTI Node 5 X52 + X53 + X56 + + X25+ X35 + X65 X57 Node 6 X65 + X67 + X46 + X56 Node 7 + X57 + X67 Xij 2 0 for all i and; ptimal Solution: Variable Value X12 X13 X14 X23 X25 X32 X35 X46 X52 X53 X56 X57 X65 X67 Shortest Route: 1-4-6-7 Length =Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
