Professional Documents
Culture Documents
Transportation 1
Transportation 1
D E F G AVAILABLE
A 11 13 17 14 250
B 16 18 14 10 300
C 21 24 13 10 400
DEMAND 200 225 275 250
SOLUTION
D E F G FORMULA AVAILABLE
A 25 225 0 0 250 250
B 175 0 0 125 300 300
C 0 0 275 125 400 400
FORMULA 200 225 275 250 950
DEMAND 200 225 275 250 950
TP COST 12075
C
C1
Fo
DE
Q.3 Obtain an optimal solution of an unbalanced tranportation problem
using mx solver without adding dummy row or column.
D E F G AVAILABLE
A 11 13 17 14 250
B 16 18 14 10 300
C 21 24 13 10 250
DEMAND 200 225 275 250
SOLUTION
D E F G Formula AVAILABLE
A 225 25 0 0 250 250
B 0 200 25 75 300 300
C 0 0 250 0 250 250
Formula 225 225 275 75 800
DEMAND 200 225 275 250 950
TP COST 10750
DEMAND
Q.2 Obtain an optimal solution of an unbalanced tranportation problem
using mx solver.
D E F G AVAILABLE
A 11 13 17 14 250
B 16 18 14 10 300
C 21 24 13 10 250
DEMAND 200 225 275 250
SOLUTION
As Σai ≠ Σbj
D E F G AVAILABLE
A 11 13 17 14 250
B 16 18 14 10 300
C 21 24 13 10 250
C1 0 0 0 0 150
DEMAND 200 225 275 250 950
D E F G Formula AVAILABLE
A 175 75 0 0 250 250
B 25 0 25 250 300 300
C 0 0 250 0 250 250
C1 0 150 0 0 150 150
Formula 200 225 275 250 950
DEMAND 200 225 275 250 950
TP COST 9400
Q.4 A company have two factories 1 & 2. 1&2 can produce upto 150 & 200
products per day respectively. Products are to be shipped to the customer 1 &
customer 2. Each customer require atleast 130 products per day. It may be
cheaper to the firstship to transfer centre 1 or 2& then to the final customer.
T1 T2 C1 C2
F1 8 13 25 28
F2 15 12 26 25
T1 0 6 16 17
T2 6 0 14 16
Solution
Original transportation table
C1 C2 AVAILABLE
F1 25 28 150
F2 26 25 200
DEMAND 130 130
As Σai ≠ Σbj
C1 C2 C3 AVAILABLE
F1 25 28 0 150
F2 26 25 0 200
130 130 90 350
TP COST 6370