Formulate the LP for finding the shortest distance from City $1$ to City $6.($Let xij represent the flow from node i to node j$.)$

Min

s$.$t$.$

Node $1$ Flows

Node $2$ Flows

Node $3$ Flows

Node $4$ Flows

Node $5$ Flows

Node $6$ Flows

xij $>0$ for all i and jDraw the network for this problem.

$($i$)$

Formulate the LP for finding the shortest distance from City $1$ to City $6.($Let $x_{ij}$ represent the flow from node $i$ to node $j.)$

Min

s$.$t$.$

Node $1$ Flows

Node $2$ Flows

Node $3$ Flows

Node $4$ Flows

Node $5$ Flows

Node $6$ Flows

$x_{ij}>0$ for all i and $j$