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 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 "0". For negative values enter "minus" sign (-). 2. 5 7 13 11 3 10 18 19 6 4 Let tij 1 if the arc from node i to node j is on the shortest route otherwise Min X12 + X13 + X14 + X23 + X25 + X32 + X35 + X46 + X52 + X53 + X56 + X57 + X65 + X67 s.t. Flow Out Flow In Node 1 X12 + X13 + Jx14 Node 2 X23 + X25 + X12 + X32 + X52 Node 3 X32 + X35 + X13 + *23 + X53 Node 4 X46 + X14 III Node 5 X52 + X53 + X56 + X57 + x25 + X35 + X65 Node 6 X65 + X67 + X45 + X56 Node 7 + X57 + X67 Xij 2 0 for all i andj Optimal Solution: Variable Value X12 X13 X14 X23 X25 X32 X35 X46 X52 1-2-5-6-7 X53 1-3-5-6-7 X56 1-4-6-7 X57 1-3-5-7 X65 1-4-6-5-7 X67 1-2-5-7 Shortest Route: 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!