The table below gives supply and demand of the revised textbook example for the Pear Disk...

 

Transcribed Image Text:

The table below gives supply and demand of the revised textbook example for the Pear Disk Drive Corporation. (all numbers below are in thousands) Production 60 145 125 Plant Sunnyvale Dublin Bangkok The unit shipping cost from each plant to each warehouse is: TO Teaneck 420 990 1420 FROM Sunnyvale Dublin Bangkok Sunnyvale 250 Dublin 1280 Bangkok 1550 Amarillo 250 1280 1550 100 (a) Using the table below, complete the Greedy Heuristic method to minimize the shipping cost. (12 pts) -- draw the table on your own paper and fill in your answers. Amarillo Teaneck Chicago Sioux Falls 420 990 Warehouse Amarillo Teaneck Chicago Sioux Falls 1420 84 380 1440 1660 Requirement 100 84 77 69 Chicago 380 1440 1660 Sioux falls 280 1520 1730 280 1520 1730 69 (b) Let x denote the number of products shipped from plant i to warehouse j (i = 1,2,3; j = 1,2,3,4; assign indices to plants / warehouses in the order as they appear in the first table). If a linear programming method is used to find out the optimal shipping arrangements, write out the two linear constraints that are related with x24 (i.e., product amount shipped from Dublin to Sioux Falls). (4 pts) (c) If the demand in Teaneck is increased to 94 (all other remain unchanged), we will have an unbalanced problem. In this case, write out again the two linear constraints that are related with.x24. (4 pts) 60 145 125 The table below gives supply and demand of the revised textbook example for the Pear Disk Drive Corporation. (all numbers below are in thousands) Production 60 145 125 Plant Sunnyvale Dublin Bangkok The unit shipping cost from each plant to each warehouse is: TO Teaneck 420 990 1420 FROM Sunnyvale Dublin Bangkok Sunnyvale 250 Dublin 1280 Bangkok 1550 Amarillo 250 1280 1550 100 (a) Using the table below, complete the Greedy Heuristic method to minimize the shipping cost. (12 pts) -- draw the table on your own paper and fill in your answers. Amarillo Teaneck Chicago Sioux Falls 420 990 Warehouse Amarillo Teaneck Chicago Sioux Falls 1420 84 380 1440 1660 Requirement 100 84 77 69 Chicago 380 1440 1660 Sioux falls 280 1520 1730 280 1520 1730 69 (b) Let x denote the number of products shipped from plant i to warehouse j (i = 1,2,3; j = 1,2,3,4; assign indices to plants / warehouses in the order as they appear in the first table). If a linear programming method is used to find out the optimal shipping arrangements, write out the two linear constraints that are related with x24 (i.e., product amount shipped from Dublin to Sioux Falls). (4 pts) (c) If the demand in Teaneck is increased to 94 (all other remain unchanged), we will have an unbalanced problem. In this case, write out again the two linear constraints that are related with.x24. (4 pts) 60 145 125

Answer rating: 100% (QA)

a Greedy Heuristic Method to Minimize Shipping Cost Step 1 Find the minimum shipping cost in each row and allocate the corresponding quantity to the d... View the full answer