Consider the Following Shortest-Route Problem Involving Seven Cities

question 44

Essay

Consider the following shortest-route problem involving seven cities.The distances between the cities are given below.Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7.
$$\begin{array} { l c } \text { Path } & \text { Distance } \\\hline 1 \text { to } 2 & 6 \\1 \text { to } 3 & 10 \\1 \text { to } 4 & 7 \\2 \text { to } 3 & 4 \\2 \text { to } 5 & 5 \\3 \text { to } 4 & 5 \\3 \text { to } 5 & 2 \\3 \text { to } 6 & 4 \\4 \text { to } 6 & 8 \\5 \text { to } 7 & 7 \\6 \text { to } 7 & 5\end{array}$$

---

Definitions:

Bright Mineral Pigments

Natural minerals used to produce vivid colors in paintings and other artworks.

Native Japanese Subjects

Refers to the indigenous people of Japan and their societal roles, cultures, and histories prior to extensive foreign influence.

Supply-of-loanable-funds

The availability of funds for borrowing, influenced by savings and influenced by interest rates in the financial market.

Demand-for-loanable-funds

The desire or willingness of consumers and businesses to borrow money at given interest rates, often depicted in economics as a curve.