Vogel’s approximation method (VAM) Assignment Help

Assignment Help: >> Transportation Problem in Linear Programming >> Vogel’s approximation method (VAM)

Vogel's approximation method (VAM)

Vogel's Approximation Method is the most preferred method over the above two methods as it usually results in an optimal or a near optimal solution. The method is explained below.

Step 1: Calculate a penalty for each row and column of the transportation table. The penalty for a row/column is the difference between the least cost and the next least cost of that row/column.

Step 2: Identify the row or column with the largest penalty value and assign the possible quantity of products to that cell having the least unit cost in that row or column. In case of a tie, select the row or column that has minimum cost.

Step 3: Adjust the supply and requirement values after the allocation is made.

Step 4: Delete that row or column where the supply or requirement is zero.

Step 5: Calculate the values of penalty to all the rows and columns for the reduced transportation problem and repeat the same procedure till the entire requirement has been met.

Problem 

Distances between factory and its warehouses and demand at each warehouse are given in the table.

Table: Transportation Table

Factory/Warehouse                 

W1

W2

W3

Supply

F1

16

22

14

200

F2

18

14

18

150

F3

8

14

16

100

Demand

175

125

150

 


Solve Problem using Vogel's Approximation method.

Solution

Step 1: Compute the penalty for each row and column of the transportation problems.  The penalty for the first row is, (16 - 14) = 2. Similarly the values of penalty for the second and the third row are 4 and 6.

 

W1

W2

W3

Supply

 

Penalty

F1

16

22

14

200

 

2

F2

18

14

18

150

 

4

F3

8

14

16

100

 

6

Demand

175

125

150

 

 

8

0

2

Similarly, the values of penalty for the first, second and the third columns are 8, 0 and 2 respectively.

Step 2: Identify the row or column with the largest penalty value. (Here the first column with a penalty value of 8).

Step 3: The cell with the least cost is chosen and the possible number of goods is assigned to that cell. Therefore, assign 100 to the cell (F3, W1).

Step 4: If the remaining row supply or column demand is zero, remove that row/column.

Now, the transportation problem can be reduced to (refer table below):

 

w1

w2

w3

Supply

Penalty

F1

16

22

14

200

       2

F2

18

14

18

150

       4

Demand

75

125

150

 

Penalty

2

8

4

Step 5: The process is repeated for the reduced transportation problem till the entire supply at the factories is assigned to satisfy the demand at different warehouses.

Now, the 'W2' column has the highest penalty, i.e. 8. Therefore, assign 125 units to the cell (F2, W2) since the cell has the least cost in the 'W2' column.

Then the transportation problem can further be reduced (Refer table below).

 

W1

W3

Supply

Penalty

F1

16

14

200

2

F2

18

18

25

0

Demand

75

150

 

Penalty

2

4

Now, the 'W3' column has the highest penalty, i.e. 4. Assign 150 units to the cell (F1, W3) since the cell has the least cost. Then remove the 'W3' column and the remaining units are assigned to the cells (F1, W1) and (F2, W1). Thus, 50 units are assigned to the cell (F1, W1) and 25 units to the cell (F2, W1).

Since the number of cells occupied is 5, i.e., (3+3-1), the solution obtained is a feasible solution. Thus, the cost associated with the solution is, (50 × 16) + (25 × 18) + (100 × 8) + (125 × 14) + (150 × 14) = Rs.5,900.

The solution obtained by this method is the same as that obtained by the least cost method.                   

Email based Operations Management assignment help - homework help at Expertsmind

Are you searching Operations Management expert for help with Vogel’s approximation method (VAM) questions?  Vogel’s approximation method (VAM) topic is not easier to learn without external help?  We at www.expertsmind.com offer finest service of Operations Management assignment help and Operations Management homework help. Live tutors are available for 24x7 hours helping students in their Vogel’s approximation method (VAM) related problems. We provide step by step Vogel’s approximation method (VAM) question's answers with 100% plagiarism free content. We prepare quality content and notes for Vogel’s approximation method (VAM) topic under Operations Management theory and study material. These are avail for subscribed users and they can get advantages anytime.

Why Expertsmind for assignment help

  1. Higher degree holder and experienced experts network
  2. Punctuality and responsibility of work
  3. Quality solution with 100% plagiarism free answers
  4. Time on Delivery
  5. Privacy of information and details
  6. Excellence in solving Operations Management questions in excels and word format.
  7. Best tutoring assistance 24x7 hours

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd