Show your step-by-step process using THE SPECIAL PURPOSE LINEAR PROGRAMMING: MODI TRANSPORTATION METHOD to solve this problem. XYZ Incorporated has received a contract to supply gravel to three new road projects located at three different locations. Project A needs 174 truckloads, Project B needs 204 truckloads, and Project C needs 143 truckloads. The company has three gravel warehouses located in three different places. Warehouse 1 has 158 truckloads available, warehouse 2 has 184, and warehouse 3 has 179. The cost of transportation from the warehouse to the projects are: from warehouse 1 to Projects A, B, C = Php 4, Php 8, Php 8 per truckload respectively. From warehouse 2 to Projects A, B, C = Php 16, Php 24, Php 16 per truckload respectively. From warehouse 3 to Projects A, B, C = Php 8, Php 16, Php 24 per truckload respectively. The objective is to design a plan of distribution that will Minimize the cost of transportation.
Show your step-by-step process using THE SPECIAL PURPOSE LINEAR PROGRAMMING: MODI TRANSPORTATION METHOD to solve this problem.
XYZ Incorporated has received a contract to supply gravel to three new road projects located at three different locations. Project A needs 174 truckloads, Project B needs 204 truckloads, and Project C needs 143 truckloads. The company has three gravel warehouses located in three different places. Warehouse 1 has 158 truckloads available, warehouse 2 has 184, and warehouse 3 has 179. The cost of transportation from the warehouse to the projects are: from warehouse 1 to Projects A, B, C = Php 4, Php 8, Php 8 per truckload respectively. From warehouse 2 to Projects A, B, C = Php 16, Php 24, Php 16 per truckload respectively. From warehouse 3 to Projects A, B, C = Php 8, Php 16, Php 24 per truckload respectively. The objective is to design a plan of distribution that will Minimize the cost of transportation.
Step by step
Solved in 9 steps
