View stunning SlideShares in full-screen with the new iOS app!Introducing SlideShare for AndroidExplore all your favorite topics in the SlideShare appGet the SlideShare app to Save for Later — even offline
View stunning SlideShares in full-screen with the new Android app!View stunning SlideShares in full-screen with the new iOS app!
GYAN GANGA INSTITUTE OF TECHNOLOGY AND MANAGEMENT, BHOPAL GROUP NAME:- ELITE Guided by: Prof. Lokesh Payasi Presented by: Krati Barman Poonam Patel Nisha Johari Tikaram Sahu Ankit Jain Prathrna Yadav TRANSPORTATION MODEL & ASSIGNMENT MODEL
“ The transportation problem is to transport various amounts of a single homogenous commodity, which are initially stored at various origins , to different destinations in such a way that the total transportation cost is a minimum”.
Row minima method consists in allocation as much as possible in the lowest cost cell of the first row so that either the capacity of the first plant is exhausted or the requirement at distribution centre is satisfied or both.
Column Minima Method consist in allocating as much as possible in the lowest cost cell of the first column so that either the demand of the first distribution centre is satisfied or the capacity of the plant is exhausted or both.
In this method, each allocation is made on the basis of the opportunity (or penalty or extra) cost that would have been incurred if allocations in certain cells with minimum unit transportation cost were missed. In this method allocations are made so thet the penalty cost is minimized.
The Name “assignment problem” originates from the classical problem where the objective is to assign a number of origins (Job) to the equal number of destinations (Persons) at a minimum cast (or maximum profit).