Vogel approximation methods, Operation Research

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







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
Related Questions
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

Regression Line The line  of regression  is the  line  which give the best  estimate  to the  values  of one  variable  for any  specific  values  of other  variable. For t

Annotated bibliography   In  this  bibliography each  is followed  by a one sentence or  one  paragraph  description of the content  of the work  cited. For  example Bndypad

history of modi

Preparation of Script   The most  tedious  and arduous takes is  the  preparation of the  script. While  you have  all the ideas and  points  will should  stored  up in the  mi

There is no unique set of problems which can be solved by using operations Research Models r techniques. Several operations Research Models or techniques can be grouped into some b

Rank Methods Spearman s When the variables  under  consideration are  not capable  of quantitative  measurement but can  be arranged  in serial  order( ranks) we find  correla

You are required to analyse the case study, as indicated under these headings: 1. Identify FIVE persons, bodies, organisations or groups in the case study. 2. For EACH of the

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

Among other limitations of O. R the followings deserve mention: a. Basis: The operational researchers must be unbiased. An attempt to shoehorn result sin to a confirmation of ma