Scribd
Upload
19 views

Group 4

The document describes a transportation problem involving three plants and three warehouses. The plants have weekly capacities and the warehouses have demands. The costs of transporting between plants and warehouses are given. The problem is formulated as a linear program and solved using the North-West corner method and Least Cost method.

Uploaded by

Anik Saha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views

Group 4

The document describes a transportation problem involving three plants and three warehouses. The plants have weekly capacities and the warehouses have demands. The costs of transporting between plants and warehouses are given. The problem is formulated as a linear program and solved using the North-West corner method and Least Cost method.

Uploaded by

Anik Saha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

PREMIER UNIVERSITY, CHITTAGONG.

FACULTY OF BUSINESS STUDIES.


Course Title : Operation Research
Assignment On : Transportation Problem
SUBMITED TO:
Mr. Touhidul Islam
Lecturer,
Department of Management
Premier University, Chittagong
SUBMITTED BY:
Name ID
Reya Roy 1503210108488
Nafija Rahman 1503210108504
Anita Saha 1503210108505
Hasi Barua 1503210108624
Meher Nigar 1503210108566

Batch : 32nd
Program : BBA
Semester : 5th Submission Date : 02/07/2018
Transportation Problem
Problem: 1
A manufacturing company has three plants from which
they supply the required raw materials to three
different locations. Supplies are made to the
warehouse based on their demand .The current
capacity of the three plants is as follows:

Plant Weekly Capacity


(cubic yards)
Plant –A 100
Plant –B 200
Plant –c 200
The current figures for the warehouses are:
Warehouse Demand (pieces per week)
Warehouse-1 50
Warehouse-2 150
Warehouse-3 300
The manager has estimated the cost per cubic
yard to transport the demanded supplies over each of
the possible routs as follows:
To Warehouse 1 Warehouse 2 Warehouse 3
From
Plant A $4 $2 $8
Plant B $5 $1 $9
Plant C $7 $6 $3

Requirements:
a. Formulate the problem and show the network
representation.
b. Construct the liner programming model for the
c. Find the feasible solution for the problem by
applying the following methods:
1. North –west corner method
2. Least cost method /intuitive approach
Solution
Requirement–(a)
Formulate the problem/General expression of the LP
model. And show the network representation.
To Warehouse Warehouse Warehous Weekly
From 1 2 e3 capacity supply
plant-A X11 C11 X12 C12 X13 C13 S1

Plant-B X21 C21 X22 C22 X23 C23 S2

plant-C X31 C31 X32 C32 X33 C32 S3

Deman D1 D2 D3
d

Where,
Ci j=Cost per unit to transport origin ‘i’ to
destination
Xi j=Quantity shipped from origin ‘i’ to destination
“j”
Si=Supply from origin “i”
Dj= Demand for destination “j”
Now, general LP format of Transportation
problem.
Minimize(z)=C11x11+C12X12+C13X13+C21X21+C22X22+
C23X23+C31X31+C32X32+C33X33
Subject to,
Row 1: X11+X12+X13=S1
Row 2: X21+X22+X23=S2 Supply
Row 3: X31+X32+X33=S3
Column 1: X11+X21+X31=D1
Column 2: X12+X22+X32=D2 Demand
Column 3: X13+X23+X33=D3
All variables >0
Show the network
Weekly Capacity Demand
100 P- A W-1 50
200 P- B W-2 150
200 P- C W-3 300
Requirement (b):
The linear programming model for the
problem:
To Warehouse Warehouse Warehouse Supply
From 1 2 3
Plant A $4 $2 $8 100
Plant B $5 $1 $9 200

Plant C $7 $6 $3 200

Demand 50 150 300 500


500
Requirement (C-1): Initial feasible solution :
Using the North West corner method :
To Warehouse Warehouse Warehouse Supply
1 2 3
From
Plant- A 50 4 50 2 - 8 100/50/0

Plant-B - 5 100 1 100 9 200/100/0

Plant-C - 7 - 6 200 3 200/0


Demand 50/0 150/100/0 300/200/0 500
500
Allocation:
X11=50
X12=50
X22=100
X23=100
X33=200
The total cost is found by multiplying the
quantities in completed cells. By assessing
unit cost and then summing those amount.
Total Cost = (50*4)+(50*2)+(100*1)+(100*9)+(200*3)
=200+100+100+900+600
=$1900(Answer)
Requirement (C-b): Initial feasible solution
using Least cost method.
To Warehous Warehous Warehouse Supply
e e 3
From 1 2

Plant-A 50 4 - 2 50 8 100/50/
0
Plant- B - 5 150 1 50 9 200/50/
0
Plant- C - 7 - 6 200 3 200/0
Deman 50/0 150/0 300/100/50 500
d / 500
o
Allocation:
X11=50
X13=50
X22=150
X23=50
X33=200
The total cost is found by multiplying the
quantity in completed cells. By the cell unit
cost and then summing those amount.
Total cost = (50*4)+(50*8)+(150*1)+(50*9)+(200*3)
=200+400+150+450+600

=$1800(Answer)

You might also like