Академический Документы
Профессиональный Документы
Культура Документы
Learning Objective :
Introduction
Today I am going to discuss about Transportation problem.
1
of a particular product should be transported from each supply
origin to each demand destinations to that the total prevailing
demand for the company’s product is satisfied, while at the same
time the total transportation costs are minimized.
Let P denote the plant (factory) where the goods are being
manufactured & W denote the warehouse (godown) where the
2
finished products are stored by the company before shipping to
various destinations.
Either,
xij ≥ for all values of I and j (ie; x11, x12, … all such values are ≥ 0)
Such type of problems where supply and demand are exactly equal
are known as Balanced Transportation Problem. Supply (from various
sources) are written in the rows, while a column is an expression for the
demand of different warehouses. In general, if a transportation problem
has m rows an n column, then the problem is solvable if there are exactly
(m + n –1) basic variables.
A transportation problem is said to be unbalanced if the supply
and demand are not equal.
3
(i) If Supply < demand, a dummy supply variable is
introduced in the equation to make it equal to demand.
Likewise, if demand < supply, a dummy demand variable is introduced in
the equation to make it equal to supply.
Factories B C D M Supply
A 6 8 8 5 30
E 5 11 9 7 40
K 8 9 7 13 50
Demand 35 28 32 25
Table 1
The problem is to determine the name of product, no. of units of
product to be transported from each factory to various district
centers at minimum cost .
Factories B C D M Supply
Table 2
Xij = No. of unit of product transported from ith factory to jth district
centre.
4
+ 5x21 + 11x22 + 9x23 + 7x24
+ 8x31 + 9x32 + 7x33 + 13x34
subject to :
x11 + x12 + x13 + x14 = 30
x21 + x22 + x23 + x24 = 40
x31 + x32 + x33 + x34 = 50
x11 + x21 + x31 = 35
x12 + x22 + x32 = 28
x13 + x23 + x33 = 32
x14 + x24 + x34 = 25
xij ≥ 0
Feasible condition:
Total supply = total demand.
Or ∑ ai = ∑ bj = K(say) i= 1,2,…..,n and j = 1,2,….,n
Things to know:
5
occupiedcell.
The solution that satisfies both the above mentioned conditions are
called a non-degenerate basic feasible solution.
6
Step 4. Updating the solution
Repeat Step 3 until the optimal solution is arrived at.