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

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

Reference books - classification of documents, Reference Books: Defini...

Reference Books: Definition According to William  Katz (1969) a Reference book generally has the following qualities:  It is a miscellany of information organised for quick

Plz get the ans , #questioA paper mill produces two grades of paper viz., X...

#questioA 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

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 assign

What do you understand by the term queueing theory, Question: (a) (i) W...

Question: (a) (i) What do you understand by the term ‘queueing theory'? Give two real life examples to illustrate your answer. (ii) Outline the five components involved in

Simple method, solve the LPP using simple method, maximize z= 3x1+2x2 subje...

solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints

How to solve operation research optimization questions, how to solve operat...

how to solve operation research optimization questions

Non measurable human factors, Operation research makes no allowance for in...

Operation research makes no allowance for intangible factors such as skill attitude vigor of the management people in taking decisions but in many instances success or fail

Goal programming, A farmer in the Midwest has 1,000 acres of land on which ...

A farmer in the Midwest has 1,000 acres of land on which she intends to plant corn, wheat, and soybeans. Each acre of corn costs $100 for preparation, requires 7 worker-days of la

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

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