Comments

## Note: Important point to remember for VAM - Case of

Tie

If the "smallest cost" in a row or column are repeating, then difference for that row or column is "0".

In VAM, we have to select the row or column which is having higher difference

- But if there is a tie in selection, then we have to select the row or column which contains minimum cost.
- In case there's a tie in minimum cost too, select the cell in which maximum allocation can be done.

The given problem is already balanced.

→ Select row/column with highest difference. In the same row/column, select the cell with minimum cost, then allocate smallest value of demand or supply in that cell.

→ Here, we have [3] as the highest difference. Selecting column with [3] as column difference and finding cell with minimum cost.

→ As we can see here "1" in the second row is the minimum cost in this last column with highest difference of [3].

→ So, allocating 10 to "1"(min. cost) with highest column difference.

→ Remove the row/column whose supply or demand is fulfilled and prepare new matrix as shown below.

→ Check that here, we have multiple highest difference as "[2]".

→ * [Tie]* We have to select the row/column which has minimum cost included. (check note above for this step).

→ So, selecting first column with highest column difference as [2] and minimum cost as "1" and allocating same as we have done in

→ Repeat the procedure until all allocations are done.

→ You may get * [Tie]* again in this and further steps. Just repeat

##### Modified Distribution Method (MODI) | Transportation Problem | Transportation Model

##### Stepping Stone | Transportation Problem | Transportation Model

##### Vogel’s Approximation Method (VAM) | Method to Solve Transportation Problem | Transportation Model

##### Transportation Model - Introduction

##### North West Corner Method | Method to Solve Transportation Problem | Transportation Model

##### Least Cost Method | Method to Solve Transportation Problem | Transportation Model

##### Assignment Model | Linear Programming Problem (LPP) | Introduction

##### Critical Path Method [CPM] - Steps and Introduction | Network Analysis | Operation Research

##### Crashing Special Case - Multiple (Parallel) Critical Paths

##### Crashing Special Case - Indirect cost less than Crash Cost

##### Basics of Program Evaluation and Review Technique (PERT)

##### Numerical on PERT (Program Evaluation and Review Technique)

##### Network Analysis - Dealing with Network Construction Basics

##### Construct a project network with predecessor relationship | Operation Research | Numerical

##### Graphical Method | Methods to solve LPP | Linear Programming

##### Basics of Linear Programming

##### Linear Programming Problem (LPP) Formulation with Numericals

## Comments:

All comments that you add will await moderation. We'll publish all comments that are topic related, and adhere to our Code of Conduct.

Want to tell us something privately? Contact Us

## Post comment