Select Page

The Vogel’s Approximation Method (VAM) is a technique used to find an initial feasible solution to the transportation problem in Operations Research. It is an improvement over the North-West Corner Rule and provides a better starting solution. Here’s how it works:

Vogel’s Approximation Method (VAM):

  1. Calculate Penalty Costs: For each row and column in the transportation tableau, find the difference between the smallest and second smallest cost (penalty cost). These represent the penalties for not choosing the least-cost option.
  2. Identify the Highest Penalty: Determine the row or column with the highest penalty cost. If there are ties, choose arbitrarily.
  3. Allocate Units: Allocate units from the cell with the least cost in the selected row or column, up to the capacity of either the supply or demand. If a tie occurs, choose arbitrarily.
  4. Update Supply and Demand: Adjust the supply and demand values after allocation. If any supply or demand becomes zero, remove the corresponding row or column from further consideration.
  5. Repeat Steps 1-4: Continue the process until all supply and demand values are exhausted.
  6. Completion: Once all supply and demand values are allocated, the initial feasible solution is obtained.

The VAM method aims to minimize the penalty costs associated with not choosing the least-cost option. By considering penalties, it tends to produce better initial solutions compared to the North-West Corner Rule.

Matrix Minima:

Matrix Minima refers to the smallest values in a given matrix. In the context of the transportation problem, the matrix represents the costs associated with transporting units from sources to destinations. The objective is to minimize the total transportation cost by efficiently allocating units while satisfying supply and demand constraints.

During the solution process, identifying and choosing the matrix minima is crucial as it helps in determining the optimal allocation of units. Techniques like the VAM method focus on selecting the least-cost options based on the matrix minima to achieve an initial feasible solution.