Vogel’s Approximation Method (VAM) Step-I:  Compute the penalty values for each row  and each column. The penalty will be ...
An example for Vogel’s Method <ul><li>Find the IBFS of the following transportation problem by using Penalty Method. </li>...
Step 1: Compute the penalties in each row and    each column .
Step 2: Identify the largest penalty and choose least cost cell to corresponding this penalty
Step-3: Allocate the amount 5 which is minimum of corresponding row supply and column demand and then cross out column2
Step-4: Recalculate the penalties
Step-5:   Identify the largest penalty and choose least cost cell to corresponding this penalty
Step-6: Allocate the amount 5 which is minimum of corresponding row supply and column demand, then cross out column3
Step-7: Finally allocate the values 0 and 15 to corresponding cells and cross out column 1
Solution of the problem <ul><li>Now the Initial Basic Feasible Solution of the transportation problem is  </li></ul><ul><l...
Upcoming SlideShare
Loading in...5
×

Vam

5,671

Published on

Published in: Technology, Business
0 Comments
4 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
5,671
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
196
Comments
0
Likes
4
Embeds 0
No embeds

No notes for slide

Vam

  1. 1. Vogel’s Approximation Method (VAM) Step-I: Compute the penalty values for each row and each column. The penalty will be equal to the difference between the two smallest shipping costs in the row or column. Step-II: Identify the row or column with the largest penalty. Find the first basic variable which has the smallest shipping cost in that row or column. Then assign the highest possible value to that variable, and cross-out the row or column which is exhausted. Step-III: Compute new penalties and repeat the same procedure until all the rim requirements are satisfied.
  2. 2. An example for Vogel’s Method <ul><li>Find the IBFS of the following transportation problem by using Penalty Method. </li></ul>O1 O2 Demand
  3. 3. Step 1: Compute the penalties in each row and each column .
  4. 4. Step 2: Identify the largest penalty and choose least cost cell to corresponding this penalty
  5. 5. Step-3: Allocate the amount 5 which is minimum of corresponding row supply and column demand and then cross out column2
  6. 6. Step-4: Recalculate the penalties
  7. 7. Step-5: Identify the largest penalty and choose least cost cell to corresponding this penalty
  8. 8. Step-6: Allocate the amount 5 which is minimum of corresponding row supply and column demand, then cross out column3
  9. 9. Step-7: Finally allocate the values 0 and 15 to corresponding cells and cross out column 1
  10. 10. Solution of the problem <ul><li>Now the Initial Basic Feasible Solution of the transportation problem is </li></ul><ul><li>X 11 =0, X 12 =5, X 13 =5, and X 21 =15 and </li></ul><ul><li>Total transportation cost = (0x6)+(5x7)+(5x8)+(15x15) </li></ul><ul><li>= 0+35+40+225 </li></ul><ul><li>= 300. </li></ul>
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×