Develop a network model and a linear programming formulation of this problem.

$($i$)$

network model $($Submit a file with a maximum size of $1$ MB$.)$

No file chosen

This answer has not been graded yet.

$($ii$)$

linear programming formulation

Let xij $=$ number of units i shipped to client j$,$ using the indices from the given table. $($It may be necessary to combine plants or distributors in a single node in order to solve this problem. Use index number $5$ for this type of node. Enter "DNE" in any unused answer blanks.$)$

Max

s$.$t$.$

Orders from Clifton Springs

Incorrect: Your answer is incorrect.

Orders from Danville

Orders from$/$for Dummy Node

Orders for D$1$

Orders for D$2$

Orders for D$3$