1000- 1500 = 195 3 5 (8 points) Constraints: 4 (1 point) Objective function (Min or Max)? 3 7 Node 4 has 50 units 6 10 -

[answerhappygod]

1000 1500 195 3 5 8 Points Constraints 4 1 Point Objective Function Min Or Max 3 7 Node 4 Has 50 Units 6 10 1 (45.61 KiB) Viewed 40 times

1000- 1500 = 195 3 5 (8 points) Constraints: 4 (1 point) Objective function (Min or Max)? 3 7 Node 4 has 50 units 6 10 -1600 -400 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? What is total units needed in this network? (1 point) Define DVS (I recommend double-subscript notation to save space). =600 (5 points) Optimal Values for Z and DVs. Populate table. Use a cell for each DV in this fashion: DV name=value Z=