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

Linear programming, #questiona paper mill produce two grades of x&y.becouse...

#questiona paper mill produce two grades of x&y.becouse of raw material reswtriction

Linear Programming Problem, 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

Operation, #question.A paper mill produces two grades of paper viz., X and ...

#question.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 grad

Steps of field study, Festinger and Katz have described followings six ste...

Festinger and Katz have described followings six steps in the conduct to a field study. a. Preliminary Planning :Deciding scope and objectives of study and the time table

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

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

Purchasing, need of detailed information about the topic

need of detailed information about the topic

Periodical article - report writing presentation , Periodical Article ...

Periodical Article A periodical is a publication that is  published  periodically like  a newspaper a magazine  and a journal. Usually  periodicals have  volume numbers  and n

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

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