# Unit 3: Transportation and Assignment Models: Transportation Model: Introduction: The transportation problem is one of the subclasses of LPPs

in which the objective is to transport various quantities of a single homogeneous commodity that are initially stored at various orgins to different destinations in such a way that the transportation cost is minimum. To achieve this objective we must know the amount and location of available supplies and the quantities demanded. In addition we must know the costs that result from transporting one unit of commodity from various Orgins to various destinations. Initial Basic Feasible Solution: 3 methods: a. North West Corner Rule. (NWCR) b. Least Cost Method. (LCM) or Matrix minima Method. c. Vogel’s Approximation Method. 2. To find out Optimal Solution – MODI Method or Modified Distribution Method. 3. Unbalanced Transportation Problem: If ∑ai ≠ ∑ bj, the problem is said to be Unbalanced Transportation Problem. Convert this into a balanced one by introducing Dummy source or with zero cost vectors and solve them. Maximisation in Transportation Problem. Problems: 1. Solve the following transportation problem by NWCR. Orgin / Destinatio n O1 O2 O3 O4 Demand D1 12 20 14 6 75 D2 25 6 18 9 200 D3 15 12 13 12 125 D4 17 10 15 18 50 Supply 100 125 175 50 450

2. Obtain the Initial Basic Feasible Solution of a transportation problem whose cost and rim requirement table is given below: Orgin / Destinatio n O1 O2 O3 O4 D1 2 3 5 1 D2 7 3 4 6 D3 4 1 7 2 Supply 5 8 7 14

Solve the following Transportation Problem using L. Orgin / D1 D2 Destinatio n O1 1 2 O2 4 3 O3 0 2 Demand 4 6 Vogel’s Approximation Method: 1.C.Demand 7 9 18 34 Least Cost Method: 1.P Using LCM. Find the IBFS using VAM: Orgin / Destinatio n O1 O2 O3 Demand D1 3 4 1 120 D2 3 2 5 80 D3 4 4 3 75 D4 1 2 2 25 Supply 100 125 75 300 D3 3 2 2 8 D4 4 0 1 6 Supply 6 8 10 24 Home work: 1. Obtain an IBFS to the following T. Obtain the initial Solution for the following Transportation Problem using (1) NWCR (2) LCM (3) VAM Orgin / D1 Destination O1 O2 O3 O4 2 3 5 1 D2 7 3 4 6 D3 4 1 7 2 Supply 5 8 7 14 .M Orgin / Destinatio n O1 O2 O3 O3 Demand D1 12 20 14 6 75 D2 25 6 18 9 200 D3 15 12 13 12 125 D4 17 10 15 18 50 Supply 100 125 175 50 450 2.

the problem is said to be Unbalanced Transportation Problem. Then it become minimization one. Solve the following TP to maximize the profit: Orgin / Destinatio n O1 O2 O3 Demand D1 40 44 38 40 D2 25 35 38 20 D3 22 30 28 60 D4 33 30 30 30 Supply 100 30 70 Conversion of maximization to minimization: The given problem is of maximization type. Solve the following LPP by Using NCW. LCM. Let us convert this into minimization type by subtracting all the cost elements from the highest cost element.Demand 7 9 18 34 Unbalanced Transportation Problem: If ∑ai ≠ ∑ bj. Convert this into a balanced one by introducing Dummy source or with zero cost vectors and solve them. Orgin / D1 Destinatio n O1 11 O2 21 O3 8 Demand 30 Maximization in TP: D2 20 16 12 25 D3 7 20 18 35 D4 8 12 9 40 Supply 50 40 70 1. 1. . and VAM.