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 (-). 14 12 Let Bij 10 1 if the arc from node i to node j is on the shortest route otherwise Min + *13+ + + + X25 *12 + *32 + x56 +| + x 25 X53 + X35 + L + Jx14 + |x46 + L x65+c + x23 + x52 + L x67 + + X + + + | x57 +c + + s.t. Flow Out Flow In X12 + x14 Node 1 Node 2 X23+ ] x13 + X25 X35 + + + *32 + ] X23 + Node 3 x32 + + + + + Node 4 +46 + X52 + Node 5 X25 + X65 *35+ C + X57 Node 6 X65 + X67 X46 + + Node 7 x57+ - x67 + Xij 2 0 for all i and i Optimal Solution: Variable Value X12 X13 X14 X23 X25 X32 X35 X46 X52 X53 X56 X57 X65 X67 Shortest Route: 1-2-5-7 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!