An Application of Linear Programming
description
Transcript of An Application of Linear Programming
![Page 1: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/1.jpg)
12 - 1
An Application of Linear Programming
Lesson 12
The Transportation Model
![Page 2: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/2.jpg)
12 - 2
Minimize transportation costs between Supplying Locations (Factories) and Demand Locations (Warehouses).
Demand Location B
Demand Location C
Demand Location A
Demand Location D
Supply Location 1
Supply Location 2
Supply Location 3
The Problem
![Page 3: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/3.jpg)
12 - 3
The transportation cost per unit between Factory and Warehouse are shown in the cost matrix table below:
The Cost Matrix
WarehouseFactory A B C D
1 4 7 7 12 12 3 8 83 8 10 16 5
The transportation cost to ship 1 unit of product between Factory 1 and Warehouse A is 4.
![Page 4: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/4.jpg)
12 - 4
The factory capacity (supply units per period) and the warehouse demand (units per period that can be handled) are shown in the following tables:
Factory Capacity & Warehouse Demand
Factory Supply1 1002 2003 150
Total 450
WarehouseA B C D Total
Demand 80 90 120 160 450
![Page 5: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/5.jpg)
12 - 5
The three previous tables can be summarized in one matrix as follows:
Summary Matrix
WarehouseFactory A B C D Supply
1 4 7 7 1 1002 12 3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 6: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/6.jpg)
12 - 6
Once the initial allocation is made, there are methods for obtaining an optimal solution which involve still further steps - these are discussed in the section “Testing for Optimality”pages 393 though 405.
Although, the manual solution to the transportation model is relatively straightforward, it is time consuming. The transportation model can also be optimally solved by Linear Programming.
An Optimal Solution
![Page 7: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/7.jpg)
12 - 7
let xi, j be the quantity shipped from factory i to warehouse j
minimize 4x1,A x1,B x1,C x1,D 12x2,A x2,B x2,C x2,D 8x3,A x3,B x3,C x3,D
7 7 1
3 8 8
10 16 5
The LP Formulation
WarehouseFactory A B C D Supply
1 4 7 7 1 1002 12 3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 8: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/8.jpg)
12 - 8
. Supply Constraints (rows)
. Demand Constraints (columns)
subject to x x x x 100
x x x x 200
x x x x 150
1,A 1,B 1,C 1,D
2,A 2,B 2,C 2,D
3,A 3,B 3,C 3,D
subject to x x x 80
x x x 90
x x x 120
x x x
1,A 2,A 3,A
1,B 2,B 3,B
1,C 2,C 3,C
1,D 2,D 3,D
160
The LP Formulation
![Page 9: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/9.jpg)
12 - 9
![Page 10: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/10.jpg)
12 - 10
Transportation LP
Enter Transportation LP formulation in green cells
![Page 11: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/11.jpg)
12 - 11
The total cost of the optimum solution is 2,300.
Shipments are:
from supplier 1 send 10 to receiver C, 90 to receiver D
from supplier 2 send 90 to receiver B, 110 to receiver C
from supplier 3 send 80 to receiver A
Transportation LP
Tools, Solver, Solve
Calculates the LP solution.
![Page 12: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/12.jpg)
12 - 12
Unequal Supply & Demand
Consider the following situation showing cost per unit between supply and demand (receiving) location where the supply and the demand are unequal.
DemandSupply A B Supply
1 9 6 752 5 3 75
80 90 TotalTotal Demand 170 Supply
150
In this case the ability of the demand (receiving) locations is 20 more than the supply locations.
![Page 13: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/13.jpg)
12 - 13
Unequal Supply & Demand
DemandSupply A B Supply
1 9 6 752 5 3 75
Dummy 2080 90 Total
Total Demand 170 Supply170
In this case we must balance the supply and demand by introducing a Dummy Supply Location for 20 units.
Note: No cost is entered for the Dummy location. Now, the problem can be solved using the Linear Programming solution for the Transportation Problem as shown on the next slide.
![Page 14: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/14.jpg)
12 - 14
Transportation LP
![Page 15: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/15.jpg)
12 - 15
Evaluating Alternatives
Example: A company that specializes in nonferrous casting currently has 3 Warehouses (receiving locations) and two casting foundry factories (supply locations). The shipping cost, factory capacity and warehouse capacity are summarized in the following table.
Warehouse
Foundry A B C Supply
1 17 10 6 30
2 7 12 14 20Demand 25 10 40 Total
Total Demand 75 Supply50
![Page 16: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/16.jpg)
12 - 16
Business conditions have been good and the company will build a new foundry to meet future business requirements. They are considering 2 locations: Chicago and Detroit. The new foundry will be designed to produce 2,500 nonferrous casts per month. The new foundry will be shipping their product to the current warehouses. The accounting department has determined the shipping costs from Detroit and Chicago to the existing warehouses and summarized them in the table below:
Evaluating Alternatives
Warehouse New
Foundry A B CDetroit 10 8 15
Chicago 12 13 5
Which location should they choose? Detroit or Chicago?
![Page 17: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/17.jpg)
12 - 17
To answer this question we must consider the Transportation Problem Solution for both Detroit and Chicago then evaluate the results:
Detroit – Transportation Problem
Evaluating Alternatives
Warehouse SupplyFactory Demand A B C Supply
1 17 10 6 302 7 12 14 20
Detroit 10 8 15 25Demand 25 10 40 Total
Total Demand 75 Supply75
![Page 18: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/18.jpg)
12 - 18
Warehouse SupplyFactory Demand A B C Supply
1 0 0 30 302 20 0 0 20
Detroit 5 10 10 25Demand 25 10 40 Total
Total Demand 75 Supply75
Total Cost 600
Detroit – Solution
Evaluating Alternatives
![Page 19: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/19.jpg)
12 - 19
Evaluating Alternatives
Chicago – Transportation Problem Warehouse Supply
Factory Demand A B C Supply
1 17 10 6 302 7 12 14 20
Chicago 12 13 5 25Demand 25 10 40 Total
Total Demand 75 Supply75
![Page 20: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/20.jpg)
12 - 20
Chicago – Solution Warehouse Supply
Factory Demand A B C Supply
1 17 10 6 302 7 12 14 20
Chicago 12 13 5 25Demand 25 10 40 Total
Total Demand 75 Supply75
Total Cost 520
Evaluating Alternatives
Best
![Page 21: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/21.jpg)
12 - 21
Homework
Read and understand all material in the chapter.
Discussion and Review Questions
Recreate and understand all classroom examples
Exercises on chapter web page
![Page 22: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/22.jpg)
12 - 22
A heuristic (intuitive) argument can be made for the solution to this problem. It follows the steps below:
. Identify the cell with the lowest cost
. Allocate as many units as possible to that cell and cross out the row or column (or both) that is exhausted by this assignment
. Find the cell with the next lowest cost from among the feasible cells. Repeat the second and third steps until all units have been allocated
Appendix: A Heuristic Solution
![Page 23: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/23.jpg)
12 - 23
Lets take a look at how the heuristic is applied to this problem
. Identify the cell with the lowest cost
A Heuristic Solution
WarehouseFactory A B C D Supply
1 4 7 7 1 1002 12 3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 24: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/24.jpg)
12 - 24
. Allocate as many units as possible to that cell
A Heuristic Solution
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 25: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/25.jpg)
12 - 25
. And cross out the row or column (or both) that is exhausted by this assignment
A Heuristic Solution
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 26: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/26.jpg)
12 - 26
. Find the cell with the next lowest cost from among the feasible cells
A Heuristic Solution
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 27: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/27.jpg)
12 - 27
. Allocate as many units as possible to that cell
A Heuristic Solution
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 28: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/28.jpg)
12 - 28
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
. And cross out the row or column (or both) that is exhausted by this assignment
A Heuristic Solution
![Page 29: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/29.jpg)
12 - 29
. Find the cell with the next lowest cost from among the feasible cells
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 8 10 16 5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
A Heuristic Solution
![Page 30: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/30.jpg)
12 - 30
. Allocate as many units as possible to that cell
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
A Heuristic Solution
![Page 31: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/31.jpg)
12 - 31
. And cross out the row or column (or both) that is exhausted by this assignment
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
A Heuristic Solution
![Page 32: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/32.jpg)
12 - 32
. Find the cell with the next lowest cost from among the feasible cells … In this case there is a tie … choose one arbitrarily.
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
A Heuristic Solution
![Page 33: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/33.jpg)
12 - 33
. Allocate as many units as possible to that cell
A Heuristic Solution
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 80/8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 34: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/34.jpg)
12 - 34
. And cross out the row or column (or both) that is exhausted by this assignment
A Heuristic Solution
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 80/8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
![Page 35: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/35.jpg)
12 - 35
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 8 8 200 Total 3 80/8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
. Find the cell with the next lowest cost from among the feasible cells
A Heuristic Solution
![Page 36: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/36.jpg)
12 - 36
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 110/8 8 200 Total 3 80/8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
. Allocate as many units as possible to that cell
A Heuristic Solution
![Page 37: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/37.jpg)
12 - 37
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 110/8 8 200 Total 3 80/8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
. And cross out the row or column (or both) that is exhausted by this assignment
A Heuristic Solution
![Page 38: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/38.jpg)
12 - 38
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 110/8 8 200 Total 3 80/8 10 16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
. Find the cell with the next lowest cost from among the feasible cells
A Heuristic Solution
![Page 39: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/39.jpg)
12 - 39
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 110/8 8 200 Total 3 80/8 10 10/16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
. Allocate as many units as possible to that cell
A Heuristic Solution
![Page 40: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/40.jpg)
12 - 40
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 110/8 8 200 Total 3 80/8 10 10/16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
. And cross out the row or column (or both) that is exhausted by this assignment … The distribution cost is 80*8
+ 90*3 + 110*8 + 10*16 +100*1 + 60*5 = 2,350 per unit
A Heuristic Solution
![Page 41: An Application of Linear Programming](https://reader035.fdocuments.in/reader035/viewer/2022062518/5681434a550346895dafc39e/html5/thumbnails/41.jpg)
12 - 41
The Heuristic Solution … Cost = 2,350
The Linear Programming Optimum Solution … Cost = 2,300
WarehouseFactory A B C D Supply
1 4 7 7 100/1 1002 12 90/3 110/8 8 200 Total 3 80/8 10 10/16 60/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
WarehouseFactory A B C D Supply
1 4 7 10/7 90/1 1002 12 90/3 110/8 8 200 Total 3 80/8 10 16 70/5 150 Supply
Demand 80 90 120 160 450 Total Demand 450
Heuristic vs LP Solution