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

Mathematical Model, What is meant by a mathematical model of a real situati...

What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems

Linear progaming, #questA paper mill produces two grades of paper viz., X a...

#questA 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 p

Operations strategy in an organization, 1. Investigate: The Operations Str...

1. Investigate: The Operations Strategy of your organisation or one you are familiar with and answer the following points. Does your chosen organisation have an operations

Linear regression, regression line drawn as y=c + 1075x, when x was 2, and ...

regression line drawn as y=c + 1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

Assignment, Q2.Six Operators are to be assigned to five jobs with the cost ...

Q2.Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignm

Solve the following linear programming graphically, Problem based on graphi...

Problem based on graphical solution of a given LPP when feasible region is bounded. 1.    Solve the following linear programming graphically; Maximize and minimize z = 60x+

Conclusions and recommendations , Conclusions and Recommendations  Con...

Conclusions and Recommendations  Conclusions  should  be drawn with  direct  reference to the objectives  of the study. The  readers should  be able  to read the objectives. T

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

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