This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with  largest penalty is chosen for  allocation. Then the cell with  lowest cost form  the selected row  column  is allocated the  maximum  possible.

After this the  row  or column whose supply or demand is exhausted is exhausted is deleted  and the  penalties are again calculated for the shrunken table. The  procedure continue still full  demand supply  is exhausted. Here penalty of each row column = ( second lowest - lowest  costs of that  row / column.

Posted Date: 4/1/2013 6:38:32 AM | Location : United States

Ask an Expert

Related Discussions:- Vogel approximation methods, Assignment Help, Ask Question on Vogel approximation methods, Get Answer, Expert's Help, Vogel approximation methods Discussions

Write discussion on Vogel approximation methods
Your posts are moderated

Write your message here..

Related Questions

Operation Research, A paper mill produces two grades of paper viz., X and Y... A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Summary report - report writing presentation, Summary  Report The  r... Summary  Report The  report  format  suggested  above  does  not  contain  any  summary  section. This exclusion  is deliberate. The summary  should  not be  prepared until t

Why the dual formulation?, Dual formulation is done for a number of r... Dual formulation is done for a number of reasons. The solution to a Dual problem provides all essential information about the solution to the Primal problem. A so

Mode of presentation - report writing presentation, Mode  of Presentation... Mode  of Presentation A strategy  needs to be  chalked out for  a satisfactory  rendering of the  topic. The  man oeuvres are going  t vary  with a  change in the  manner  of

C++ programs, C++ code for assignment problem C++ code for assignment problem

Linear programming problem, Solve the following Linear Programming Problem ... Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Disadvantage of standard deviation - measure of dispersion, Disadvantage ... Disadvantage  of standard Deviation It is not  easy  to understand  and calculate. It gives  more  weight  to the extremes  and less  to the items   nearer to mean. Since

Calculate, A paper mill produces two grades of paper viz X and Y. Because o... A paper mill produces two grades of paper viz X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in

Vam, how to solve it how to solve it

Theoretical framework, Ask questiAvatars are virtual characters that can be... Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as