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

Problem 6-23 (Algorithmic) Find the shortestProblem 6-23 (Algorithmic) Find the shortestProblem 6-23 (Algorithmic) Find the shortestProblem 6-23 (Algorithmic) Find the shortest

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 nega values enter "minus" sign (-). 12 7 6 18 6 7 18 3 S 1 if the arc from node i to node j is on the shortest route Let mig = 0 otherwise Min 12 x12 + 6 *13+ 3 x14 + 7 X23 + 6 x25 + 7 x32 + 6 X35 + 3 x46+ 6 x52 + 6 x53 + 4 X56 + 18 x57 + 4 X65 + 18 x67 s.t. Flow Out Flow In Node 1 1 x12 + 1 *13+ 1 X14 1 + -1 x12 + -1 x32 + Node 2 1 x23 + 1,x25 0 0 X X52 + + -1 X13 + -1 X23+ Node 3 1 x32 + 1 x35 0 0 X X53 Node 4 1|x46 + 1 X X14 = 0 1 x53 + 1 x56 + + -1 x25 + -1 X35 + Node 5 1 x52 + 1 X57 = 0 0 0 X X65 Node 6 1 x65 + 1 X67 + -1 4x46 + -1 X56 = ov Node 7 + 1 x57 + 1 x67 -1 X xij 20 for all i and Optimal Solution: Variable Value X12 X13 X14 X23 X25 X32 X35 X46 X52 X53 X56 X57 X65 X67 Shortest Route: 1-2-5-7 X Shortest Route: 1-2-5-7 X Length =

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!