Consider the following shortest-route problem involving six cities with the distances given.Draw the network for this problem and formulate the LP for finding the shortest distance from City 1 to City 6. $$\begin{array} { c c }
\text { Path } & \text { Distance } \
\hline 1 \text { to } 2 & 3 \
1 \text { to } 3 & 2 \
2 \text { to } 4 & 4 \
2 \text { to } 5 & 5 \
3 \text { to } 4 & 3 \
3 \text { to } 5 & 7 \
4 \text { to } 6 & 6 \
5 \text { to } 6 & 2
\end{array}$$

Question

Consider the following shortest-route problem involving six cities with the distances given.Draw the network for this problem and formulate the LP for finding the shortest distance from City 1 to City 6. $$\begin{array} { c c } 
\text { Path } & \text { Distance } \
\hline 1 \text { to } 2 & 3 \
1 \text { to } 3 & 2 \
2 \text { to } 4 & 4 \
2 \text { to } 5 & 5 \
3 \text { to } 4 & 3 \
3 \text { to } 5 & 7 \
4 \text { to } 6 & 6 \
5 \text { to } 6 & 2
\end{array}$$

Quizplus · Accepted Answer

The Answer of Consider the following shortest-route problem involving six cities with the distances given.Draw the network for this problem and formulate the LP for finding the shortest distance from City 1 to City 6. $$\begin{array} { c c } 
\text { Path } & \text { Distance } \
\hline 1 \text { to } 2 & 3 \
1 \text { to } 3 & 2 \
2 \text { to } 4 & 4 \
2 \text { to } 5 & 5 \
3 \text { to } 4 & 3 \
3 \text { to } 5 & 7 \
4 \text { to } 6 & 6 \
5 \text { to } 6 & 2
\end{array}$$

Consider the Following Shortest-Route Problem Involving Six Cities with the Distances