$j=1,2,3,4.)$

$($a$)$ Draw the network representation of this problem. What kind of problem is this?

This is a transshipment problem.

This is a minimal spanning tree problem.

This is a maximal flow problem.

This is a shortest path problem.

This is a transportation problem.

$($b$)$ Formulate an LP model to determine the least expensive shipping plan to fill the demands at the stores.

MIN :

Subject to:

Flow from Warehouse $1$

Flow from Warehouse $2$

Flow from Warehouse $3$

Flow to Store $1$

Flow to Store $2$

Flow to Store $2$

Flow to Store $3$

Flow to Store $4$

$x_{iJ}0$

$($c$)$ Solve the problem using Solver.

$(x_{{11}^{\text{'}}},x_{{12}^{\text{'}}},x_{{13}^{\text{'}}}{x}_{{14}^{\text{'}}}{x}_{{21}^{\text{'}}},x_{{22}^{\text{'}}}{x}_{{23}^{\text{'}}},x_{{24}^{\text{'}}}{x}_{{31}^{\text{'}}},x_{{32}^{\text{'}}}{x}_{{33}^{\text{'}}}{x}_{34})=$

modified problem?

Assign arbitrarily small costs such as $$0\mathrm{.}01$ to the arcs representing these flows.

Assign arbitrarily large costs such as $$999$ to the arcs representing these flows.

$($e$)$ What is the optimal solution to the modified problem?

$j=1,2,3,4.)$

$($a$)$ Draw the network representation of this problem. What kind of problem is this?

This is a transshipment problem.

This is a minimal spanning tree problem.

This is a maximal flow problem.

This is a shortest path problem.

This is a transportation problem.

$($b$)$ Formulate an LP model to determine the least expensive shipping plan to fill the demands at the stores.

MIN :

Subject to:

Flow from Warehouse $1$

Flow from Warehouse $2$

Flow from Warehouse $3$

Flow to Store $1$

Flow to Store $2$