Least cost methods, Operation Research

The NW  corner  rule  described  earlier considers only  the availability  and supply  requirements  in making  assignments. It takes  no account  of the shipping  costs  given  in the tableau. It  is therefore  not a sound methods as it ignores the very factor (cost )  which  is sought  to be minimized. The least  cost methods and the Vogel  Approximation  methods  consider the  transportation  costs while  making  allocations.

As the  name suggests of all the routs ( that  is combination of  sources  and destination) select  the one  where transportation cost is the least. Now  consider  the supply available at the  corresponding source and demand at  the corresponding destination and put the lower of the two as the quantity to be transported through that route. After this delete the source destination whichever is satisfied. Consider the remaining routes and again choose the one with the smallest cost and make assignments. Continue in this manner until all the unit are  assigned.

Posted Date: 4/1/2013 6:36:35 AM | Location : United States







Related Discussions:- Least cost methods, Assignment Help, Ask Question on Least cost methods, Get Answer, Expert's Help, Least cost methods Discussions

Write discussion on Least cost methods
Your posts are moderated
Related Questions
Telephone calls arrive at a switchboard in a Poisson process at the rate of 2 per minute. A random one-tenth of the calls are long distance. (a) What is the probability of at least

how i do project in linear programming

can u send me some assigment problems

a question was given but i cannot identify the alternatives and i do not know how to calculate the right amount of payoff.what are the right ways to calculate the payoff table.

Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=28 2??1+12??2=24 ??1,??2=0 a. A basic solution of the constraint equations of this problem has how many basic variables,

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

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

Find a minimum cost spanning arborescence rooted,

assignment problem through c programming

Discuss the methodology of operation research