Sir,(adsbygoogle = window.adsbygoogle || []).push({});

Suppose we are asked to find the basic feasible solution for maximizing transportation cost using Vogel approximation method (VAM). We then write the row penalty and column penalty. Suppose there is tie between 2 penalty values, which should be taken first? I have this doubt because I get 2 different solutions in each case.

If there is a tie we would take that penalty corresponding to which there is minimum cost. If there is a tie again in the minimum cost then we would allocate in the cell where maximum can be allocated, and again if there is a tie, then what?

If I choose randamoly then the ansawer would be different . So tell me what should I do.

**Physics Forums - The Fusion of Science and Community**

# Operational research problem(Vogel Approximation)

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

Have something to add?

- Similar discussions for: Operational research problem(Vogel Approximation)

Loading...

**Physics Forums - The Fusion of Science and Community**