1. IENG 212 Modeling and Optimization
Name: Uğur
Surname: ASLAN
No:131882

2. I will talk about transportation models and show example.

3. Transportation Models

4. Transportation Models

5. Basic feasible solution can be obtained by three methods, they are
North - west corner method,
Least - cost cell method,
Vogel's Approximation Method, generally known as VAM.

6. NORTH-WEST Corner Method
Albuquerque
Boston
Cleveland
Capacity
Des Moines 5 4 3
100
Evansville 8
300
Fort Lauderdale 9 7
Demand
200
700

7. Step1 Start from the left hand side top corner or cell and make allocations depending on the availability and requirement constraint.

8. Step 2 By satisfying availability and requirement constraints fill the other cells.
Z=100 8+1004+1007+2005= =4200 $

9. LEAST COST method
Identify the lowest cost cell in the given matrix. In this particular example it is 3. Make allocations to this cell. After filling search for lowest cost cell. Proceed this way until all allocations are made.
Z=3009+2004+1003+1003= =4100 $

10. Vogel’s Approximation Method (VAM)
Step 1: For each row and column find the difference between the two lowest unit shipping costs.

11. Step 2 Assign as many units as possible to the lowest-cost square in the row and column selected.

12. Step 3 Eliminate the column or row that has been satisfied.

14. Z= 1005+2004+1003+2009+1005= =3900 $

15. Thank you for watching and listening.
Any questions?