Question: please help with this problem, thank you! Consider the following shortest-route problem involving seven cities. The distances between the cities are given below. begin{tabular}{|c|c|} hline



Consider the following shortest-route problem involving seven cities. The distances between the cities are given below. \begin{tabular}{|c|c|} \hline Path & Distance \\ \hline 1 to 2 & 5 \\ \hline 1 to 3 & 11 \\ \hline 1 to 4 & 6 \\ \hline 2 to 3 & 5 \\ \hline 2 to 5 & 4 \\ \hline 3 to 4 & 6 \\ \hline 3 to 5 & 2 \\ \hline 3 to 6 & 3 \\ \hline 4 to 6 & 7 \\ \hline 5 to 7 & 8 \\ \hline 6 to 7 & 4 \\ \hline \end{tabular} Draw the network for this problem. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7 Flows xj>0 for all / and
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
