GEOG 3LT3 Lecture 15: GEOG 3LT3
2 May 2018
School
Department
Course
Professor
November 14, 2016
- This is the same table from the end of last class
- We can use this table to solve “the problem”
- (-) values indicate an unsatisfied amount at a place
- Store A needs 500, B needs 400 and C needs 400 as well
- Warehouse I has 800 units and II has 600 units
- A has the highest demand for the good
- Algorithm – identify the pivot column (one with the most – value)
- We can send items only from the places with 1s (From Evan: I don’t know if he
means from a warehouse or not, because don’t some of the stores have 1s?)
- The next step is to identify the pivot element (This is the element associated with
the lowest cost)
oWe choose the one with the lowest shipping cost
▪Our pivot element here is the 1 under U3 on the table (circled, edit!
was circled I took the picture after he erased the circle to move on
cause he was in the way the whole time otherwise, note he also
made changes to the table that we started with, or ended with at
the end of the last class)
- Transform the pivot column into a unit column, we do that by converting every
single value in this column with the exception of the pivot element into a 0
oTo do this R4 – R1 this will give us 0
oBut then he wrote R7+500R1 = 0 (I don’t know why he did this and he did
not say why he did)
oHe then used this same formula for every R7 element which changed the
table
oThe new R7 for iteration 1 = 800 + 500(-1) = 300 (therefore after the
warehouse loses 500 to A then there is only 300 left in warehouse I)
oThe cost of moving 500 units from I to A cost 8000 dollars
find more resources at oneclass.com
find more resources at oneclass.com
Document Summary
This is the same table from the end of last class. We can use this table to solve the problem (-) values indicate an unsatis ed amount at a place. Store a needs 500, b needs 400 and c needs 400 as well. Warehouse i has 800 units and ii has 600 units. A has the highest demand for the good. Algorithm identify the pivot column (one with the most value) We can send items only from the places with 1s (from evan: i don"t know if he means from a warehouse or not, because don"t some of the stores have 1s?) We also have to settle the unsatis ed demand at c (iteration 3) For c we use r6 because it has the lowest transportation cost/unit. 200 + 400(-1) = - 200 (i believe this is supposed to be the unsatis ed demand still at c (so we must get the rest of the units from the other warehouse.
