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

Decision analysis models, These models deal with the selection of an opt...

These models deal with the selection of an optimal course of action given the possible pay offs and their associated probability of occurrence. These models are broadly

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

What is the temperature of water leaving the chillier, A water chillier wit...

A water chillier with a capacity of 30 TR cools 20 m 3 /hr. water entering at 12 o C what is the temp. of water leaving the chillier. A reversible engine has an ideal thermal ef

Linear programimg, Solve the following Linear Programming Problem using Si...

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 programming, How do I set this problem up for Excel: A National Cred...

How do I set this problem up for Excel: A National Credit Union has $250,000 available to invest in a 12 month commitment. The money can be placed in Treasury notes yielding an 8%

Lpp using sipmle method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Linear programming problems, A paper mill produces two grades of paper viz....

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

Problems, can u send me some assigment problems

can u send me some assigment problems

Ge, Ask question #Minimum 100 words what can engineer planner do in métallu...

Ask question #Minimum 100 words what can engineer planner do in métallurgie accepted#

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