Question: Refer to problem 14. Reformulate that transportation problem as a linear programming model. Data from problem 14 Pennington Hardwood Lumber Supplier has three lumber mills
Data from problem 14
Pennington Hardwood Lumber Supplier has three lumber mills in San Jose, Dayton, and Boston that manufacture pre-cut hardwood. These pre-cut hardwood are shipped to building warehouses in Cleveland, Orlando, Denver, San Diego, and New York for further distribution. The following table shows the production capacity in tons of pre-cut hardwood at each mill, the number of tons of hardwood required at each of the building warehouse, and the shipping costs (in $ per ton). Solve this transportation problem to minimize total costs using Excel Solver.

To San Diego Mill Capacity (in tons) Orlando Denver From New York Cleveland San Jose $21 $13 $22 45 $15 $10 21 9. 50 11 7. Dayton Boston 35 25 12 10 Demand (in tons) 25 20 35 20 30 130
Step by Step Solution
3.45 Rating (171 Votes )
There are 3 Steps involved in it
Min Cost 15SjC1 21SjOr l3SjDe l0SjSd 22SjNv 3DaCl 11DaOr 9DaDe 21DaSd ... View full answer
Get step-by-step solutions from verified subject matter experts
