Question: a. Create a spreadsheet model for this problem. b. What is the optimal solution? c. Suppose that no more than 1,000 units of blood can

a. Create a spreadsheet model for this problem. b. What is the optimal solution? c. Suppose that no more than 1,000 units of blood can be transported over any one arc. What is the optimal solution to this revised problem? The blood bank wants to determine the least expensive way to transport available blood donations from Pittsburgh and Staunton to hospitals in Charleston, Roanoke, Richmond, Norfolk, and Suffolk. The supply and demand for donated blood is shown in Figure 5.36 along with the unit cost of shipping along each possible arc. FIGURE 5.36 Network flow model for the blood bank
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
