Problem 1 (15 points) 1000= 1 5 3 2 4 1500- 3 5 /=1600 7 =400 6 10 =600 Node 4 has 50 units The above network shows two production facilities which supply a part to two distributors. In turn, the distributors fill demand required by 3 customers. Quantity available or needed is written next to each node. Also, the cost of transporting one unit is indicated on the arcs of the network. Formulate this transshipment problem in LP and solve with software. Modify the network as needed to match formulation. What is total available units in this network?_14_ what is total units needed in this network? 20 (1 point) Define DVs (I recommend double-subscript notation to save space)] (1 point) Objective function (Min or Max)? (8 points) Constraints: (5 points) Optimal Values for and DVs. Populate table. Use a cell for each DV in this fashion: DV name = value Z=