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

Operation research, different classification of models in operation researc...

different classification of models in operation research

OR models, Explain why it may be advantageous to build models to help in so...

Explain why it may be advantageous to build models to help in solving a decision problem.

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

Merits - correlation regression analysis , Merits a.It is simple  to ...

Merits a.It is simple  to understand  and easy  to calculate. b.It is very  useful  in the  case of data which  are of  qualitative nature  like  intelligence  honesty  be

Linear programming , the application areas of linear programming

the application areas of linear programming

Strategies and od intervention techniques, QUESTION 1 Change strategies...

QUESTION 1 Change strategies and OD intervention techniques follow from diagnosis. An inappropriate intervention due to a faulty diagnosis may be very costly to an organization

A paper mill, A paper mill products two grade of paper viz., X & Y. Because...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Llp, 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

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