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

Experimental design and methodology , Case Study - Experimental Design ...

Case Study - Experimental Design Dental Clinic A leading dental clinic  with  three well qualified  dentists is seriously  considering  keeping  in touch  with  its  pat

Understandibg concepts, what are the preconceptions do you bring to the stu...

what are the preconceptions do you bring to the study of research

Preparation of visual aids , Preparation of visual Aids ,Handouts and Feedb...

Preparation of visual Aids ,Handouts and Feedback Forms It is   always  better to prepare  visual  aids much  in advance of the presentation. Leaving  them for the  last mo

Decision theory, the following table gives place under different states of ...

the following table gives place under different states of nature Strategies States of nature s1 s2 s3 A 10000 3000 2000 B

Linear Programing, 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

Trade literature - classification of documents, Trade Literature: Trad...

Trade Literature: Trade literature consists of documents that give information on the processes and materials involved in the manufacture of a product, various types of produc

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

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