Scribd
Upload
4 views

Ass 2

Uploaded by

alex91911alex
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Ass 2

Uploaded by

alex91911alex
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Practice Sheet-II

Course & Semester : BCA & IV Subject & Subject Code : Optimization Methods & BMAS 0153

Topic : Transportation Problem Session : 2023-2024

Q.1: An organization has four destinations (D1, D2, D3 and D4) and three sources (S1, S2 and S3)
for supply of goods. The transportation cost per unit is given below. The total availability is 700
units which exceeds the cumulative demand of 600 units. Find the optimal transportation scheme
for this condition using the Vogel’s Approximation Method.
Destination Supply
D1 D2 D3 D4
S1 13 17 19 16 250
Source
S2 17 19 16 15 200
S3 15 17 17 16 250
Demand 100 150 250 100

Q.2: Distances between factory and its warehouses and demand at each warehouse are given in the
following table. Calculate the values of penalty to all the rows and columns for the reduced
transportation problem and repeat the same procedure till the entire requirement has been met.
Solve this problem using Least cost method or VAM.
Factory/Warehouse W1 W2 W3 Supply
F1 16 22 14 200
F2 18 14 18 150
F3 8 14 16 100
Demand 175 125 150
Q.3: Solve the following transportation problem where the cell entries denote the unit transportation
costs by (i) North West Corner Rule (ii) Row minima rule (iii) Column minima rule.
Destination
A B C
1 2 4 7 5
Source

2 3 3 1 8
3 5 4 7 7
4 1 6 2 14
Demand 7 9 18
Q.4: Determine the optimum basic feasible solution to the following transportation problem.
A B C Available
I 50 30 220 1
II 90 45 170 3
III 250 200 50 4
Required 4 2 2
Q.5: Find the solution by vogel’s approximation method, also find optimal solution using MODI
method
Destination Supply
D1 D2 D3 D4 D5
S1 5 8 6 6 3 8
Source
S2 4 7 7 6 5 5
S3 8 4 6 6 4 9
Demand 4 4 5 4 8

You might also like