Vogel approximation methods, Operation Research

Assignment Help:

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.


Related Discussions:- Vogel approximation methods

Linear programming problem, A paper mill produces two grades of paper viz.,...

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

Automation, whatdo you mean by automation

whatdo you mean by automation

Determining sample size for estimating poportions, Determining Sample Size ...

Determining Sample Size for Estimating poportions It is  necessary  to determining  the sample size for a  problem involving  proportions. This deals  with the percentage of f

lp-model and markov decision problem, The supply of a certain good is insp...

The supply of a certain good is inspected periodically. If an order is placed of size x >0 (integer), the ordering costs are 8+2. x. The delivery time is zero. The demand is stoc

Lp model, A company produce three sizes of windows fans small,medium and la...

A company produce three sizes of windows fans small,medium and large. The manager has formulated an LP model for production.

#title, WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

Linear programimg, Solve the following Linear Programming Problem using Si...

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

Panel sampling - sampling decisions, Panel Sampling Here the initial  s...

Panel Sampling Here the initial  samples are down  on random  basis  and information  from  these is collected  on regular  basis. Itis  semi permanent sample where members may

Big M method, Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd