Beginners Guide to TikTok for Search - Rachel Pearson - We are Tilt __ Bright...
Least Cost Method
1. HOW TO SOLVE USING THE
LEAST-COST METHOD?
By: Ianne Lae N. Loretizo
2. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400
II 7 11 10 14
500
III 13 8 8 7
600
DEMAND
(pcs) 325 425 475 275 1500 = 1500
SOURCE
3. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500
III 13 8 8 7
600
DEMAND
(pcs) 325 425 475 275 1500 = 1500
SOURCE
400
4. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500
III 13 8 8 7
600
DEMAND
(pcs) 325 425 25 475 275 1500 = 1500
SOURCE
400
5. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500
III 13 8 8 7
600
DEMAND
(pcs) 325 425 25 475 275 1500 = 1500
SOURCE
400
6. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500
III 13 8 8 7
600
DEMAND
(pcs) 325 0 425 25 475 275 1500 = 1500
SOURCE
400
325
7. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500
III 13 8 8 7
600
DEMAND
(pcs) 325 0 425 25 475 275 1500 = 1500
SOURCE
400
325
8. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175
III 13 8 8 7
600
DEMAND
(pcs) 325 0 425 25 475 275 1500 = 1500
SOURCE
400
325
9. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175
III 13 8 8 7
600
DEMAND
(pcs) 325 0 425 25 475 275 0 1500 = 1500
SOURCE
400
325
275
10. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175
III 13 8 8 7
600 325
DEMAND
(pcs) 325 0 425 25 475 275 0 1500 = 1500
SOURCE
400
325
275
11. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175
III 13 8 8 7
600 325
DEMAND
(pcs) 325 0 425 25 475 275 0 1500 = 1500
SOURCE
400
325
275
12. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175
III 13 8 8 7
600 325 0
DEMAND
(pcs) 325 0 425 25 475 275 0 1500 = 1500
SOURCE
400
325
275
325
13. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175
III 13 8 8 7
600 325 0
DEMAND
(pcs) 325 0 425 25 475 150 275 0 1500 = 1500
SOURCE
400
325
275
325
14. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175
III 13 8 8 7
600 325 0
DEMAND
(pcs) 325 0 425 25 475 150 0 275 0 1500 = 1500
SOURCE
400
325
275
325
150
15. EXAMPLE: LEAST-COST METHOD
(GREEDY METHOD)
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175 25 0
III 13 8 8 7
600 325 0
DEMAND
(pcs) 325 0 425 25 0 475 150 0 275 0 1500 = 1500
SOURCE
400
325
275
325
150
25
16. FOR THE FINAL SOLUTION:
DESTINATIO
A B C D
SUPPLY (pcs)
I 8 6 12 9
400 0
II 7 11 10 14
500 175 25 0
III 13 8 8 7
600 325 0
DEMAND
(pcs) 325 0 425 25 0 475 150 0 275 0 1500 = 1500
SOURCE
400
325
275
325
150
25
Total Cost = (400x6) + (325x7) + (25x11) + (150x10) + (325x8) + (275x7)
17. FOR THE FINAL SOLUTION:
• TC = (400x6) + (325x7) + (25x11) + (150x10) + (325x8) +
(275x7)
• $10,975 is the total cost needed to obtain an initial
feasible solution for a transportation problem