This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1) The model for the transportation problem consists of 18 decision variables, representing the number of barrels of wastes transported from each of the 6 plants to each of the 3 waste disposal sites: = Number of Barrels transported per week from plant ‘ i ’ to the jth waste disposal site, where i = 1, 2, 3, 4, 5, 6 and j = A, B, C. The objective function of the manager is to minimize the total transportation cost for all shipments. Thus the objective function is the sum of the individual shipping costs from each plant to each waste disposal site: Minimize Z = 12+ 15+ 17+ 14+ 9+ 10+ 13+ 20 +11 +17 +16 +19 +7 +14 +12 +22 +16 +18 The constraints in the model are the number of barrels of wastes available per week at each plant and the number of barrels of wastes accommodated at each waste disposal site. There are 9 constraints one for each plant supply and one for each waste disposal site’s demand. The six supply constraints are: + + = 35 + + = 26 + + = 42 + + = 53 + + = 29 + + = 38 As an example, here the supply constraint + + = 35 represents the number of barrels transported from the plant Kingsport to all the three waste disposal sites. The amount transported from Kingsport is limited to the 35 barrels available. The three demand constraints are: + + ++ + ≤ 65 + + + + + ≤ 80 + ++ + + ≤ 105 Here the demand constraint + + ++ + ≤ 65 represents the number of barrels transported to the waste disposal site Whitewater from all the six plants. The barrel of wastes that can accommodate in the waste disposal site Whitewater is limited to 65 barrels. The demand constraints are ≤ inequalities because the total demand (65+80+105) = 250 exceeds the total supply (26+42+53+29+38) = 223. The linear programming model for the transportation problem is summarized as follows: Minimize Z = 12+ 15+ 17+ 14+ 9+ 10+ 13+ 20 +11 +17 +16 +19 +7 +14 +12 +22 +16 +18 Subject to + + = 35 + + = 26 + + = 42 + + = 53 + + = 29 + + = 38 + + ++ + ≤ 65 + + + + + ≤ 80 + ++ + + ≤ 105 2) Because the transportation model is formulated as a linear programming model, it can be solved with Excel Solver. The spreadsheet solution is shown in the following table....
View
Full
Document
This note was uploaded on 02/10/2012 for the course MAT 540 taught by Professor Dralexander during the Spring '11 term at Strayer.
 Spring '11
 Dralexander

Click to edit the document details