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

Higher order table, Higher Order  Table   When  three  or more  charac...

Higher Order  Table   When  three  or more  characteristics are represented in the same  table such a table  is called  higher order table. The  need  for such  a table arises

Application of operation reserch., how i make project report on "applicatio...

how i make project report on "application of or".i want help from you.can you give me idea to complete this report..

Non-governmental organisation, Name the feature which is not normally assoc...

Name the feature which is not normally associated with a Non-Governmental Organisation (NGO)?  Government funded is the organisation.

Sampling decision, Normal 0 false false false EN-IN X...

Normal 0 false false false EN-IN X-NONE X-NONE

Small sample - hypothesis testing , Small Sample The central limit ...

Small Sample The central limit  theorem does not work well  with small  samples  even if  the  population  in non Gaussian. So  we cannot  rely on the central limit theorem

LINEAR PROGRAMMING, SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=...

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0

Linear programming model, formulate the linear programming model of the tab...

formulate the linear programming model of the table above

BIG M, Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 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