Least cost methods, Operation Research

Assignment Help:

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.


Related Discussions:- Least cost methods

Research abstracts, Research Abstracts Abstracts of researches comp...

Research Abstracts Abstracts of researches completed are available from the followings publications: a. ICSSR Research Abstracts: contain abstracts of research projects

Liner proggraming , A paper mill products two grade of paper viz., X & Y. B...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Data management, Data Management As your  research project progresses ...

Data Management As your  research project progresses you will  quickly  gather more  and more  data. These need  to be managed in such  a way that they  can be  accesses and

Duality, maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Short question, write down any two assumption of L.P

write down any two assumption of L.P

Assignment 2012, Problem 1 (Problem 23, page 507) At a machine tool plant, ...

Problem 1 (Problem 23, page 507) At a machine tool plant, five jobs must be completed each day. The time it takes to do each job depends on the machine used to do the job. If a mac

Scope, explain the significant and scope of operation research in scientifi...

explain the significant and scope of operation research in scientific management

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

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

Find the maximum and minimum values, Problems based on solution of a given ...

Problems based on solution of a given LPP when it has multiple optimal solution: 1.    Find the maximum and minimum values of 5x+2y, subject to the constraints -2x-3y ≤ -6

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