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

Closed lood, give the procedure of tracing a closed loop

give the procedure of tracing a closed loop

Operation research techniques, High Costs are Involved in the Use of O. R...

High Costs are Involved in the Use of O. R Techniques: O. R techniques usually prove very expensive. Services of specialized persons are invariably called for ( and along w

Graphical method- minimization example, Minimization Example  A ...

Minimization Example  A farmer is advised to utilize at least 900 kg of mineral A and 1200 kg of mineral B to increase the productivity of crops in his fields.

Case study and statistical methods, Case Study Methods: It is studying the...

Case Study Methods: It is studying the phenomenon event situation or development through a thorough and detailed analysis or intensive study. The case may be an individual a gr

Graphic , max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x...

max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x1+2x2 X1+x2. >_ o

Linear programming, 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 in

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

Linear programning, b. A paper mill produces two grades of paper viz., X an...

b. 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 pape

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