P

ft 117
ie
ment Problems and Tran ti
Ort
Ase
“on Mod ls
pter
cna
Assignment
Problem S

[SYNOPSIS
61 Introduction
‘9 Types of Assignment Problems
63 Hungarian method - for solving assignment probl lem

54. Solved Examples

Review Questions

7 INTRODUCTION
Assignment Problem is a special kind of tran ; :
gach source should have the capacity to fulfil the Meu ae
jesinations. In other words, any operator should be able to peclorm, ° ee
regardless of his skills, although the cost will be more if the job does n rte .
with the worker’s skill. The assignment model deals with the allocation ome
which the objective is to assign the number of “origin” the same number of
destinations’ at a minimum total cost. The assignment is made on a one to one
basis. used for assigning
method is a scheduling method
Thus, Assignment with
g components on a one to one basis
individual jobs to individual processin
for accomplishing all of the jobs.
the goal of minimizing the total cost or time
[5.2 TYPES OF ASSIGNMENT PROBLEMS]
Type of Problem
Unbalanced
Balanced
Minimization Maximization
Minimization Maximization
ee to Convert to
Solve Convert to Baie
Minimization Balanced
directly
Solve snr
Solve
Solve
 ch (T.Y.B.yMS.‘ ¢,
Operations Resear
118
Sy
Problem: ! the number of jobs ig equ
(1) Balanced Assignment is termed as Balanceq Aen by
8 the problem 7 Coluin
ign,
number of operators then “0 bet oe number of
=
Problem i.e. Number of rows
Probl 1 ianment Problemsm j ey |
(2) Unbalanced ofAssignment then
operators lant j.e.Number of rows # Number toon
the number
ment Proble of dummy to
Unbalanced Assi
ny
number
iisarya8
necess lu
m is unbalanced, quare matrix. Th @ values 2S 4afp yi |
te: If the proble
No , d such that theaecost mauassumed to be zero.
— . ow(s)/col
coh
re teeism indicate th © Problem
nking Absen
4
ords
Minimization Keyw
(3)
Time, Cost, Distances Ra |
.
9 y

pe-
minimization ty vity ete si
K e yw ordsl, : Performance score, Producti
Maxiti, mizSaalets,i Income leve
o n '
4( ) Prof
on type.
of maximizati should
.

in order to be solved,
. .

is
,

o b l e m
,

p r e p r o b l e m , be
: A s s i g n m ent techniqu
Note
mini mized
and Balanced mmy row or col
umn.
nced - We add either a du
If it is not Bala is forme
d - We conve
rt to minimized using Regret table (it
If is maximize
t in the mat rix and subtracting all element form jy
elem en
selecting highest
NT
- F O R S O L V I NG ASSIGNME
METHO D
5.3 HUNGARIAN
PROBLEMS
(Minimization an
Assignment Problems
Steps for Solving
Maximization): ed or unbalanced. If the problen
1: Ide nti fy wh et he r the p roblem is balanc
Step
e forth to balance it du
mmy is required.
is not balanced, henc tion or Maximization
ec ki ng the pr ob le m whether i t is of Minimiza
Step 2: Ch 3.
problem, than go to step
type. If it is Minimization imization
za ti on Pr ob le m, then convert the max
But if it is Maximi converting into
Reg ret Mat rix or Op po rtunity Loss Matrix. For
table into e. After
nee d to sub tra ct hig hes t value from all the profits valu
Regret Matrix, we
converting, move to step 3.
Wher eas,
Minimizat ion problem.
(ae If cost, time, etc is given, then it is
if profit, sales, production, etc is given
then it is Maximization problems)
nimization. For row minimization, wé will tke
Step 3: Next step is Row Mi
tract it from all values of that row.
least value from each row and sub
ion". Fat
p 4: Aft er row min imi zat ion next step is, Column Minimizat
Ste h column
st value from eac
column minimization, we will take lea
subtract it from all values of that column.

ail
assignment Problems 119

Testing for optimality. For optimality, we will cover maximum zeroes from
step 5: rows and columns. After it, check whether the number lines is equal to size
of matrix, for instance, 4 x 4 or 5 x 5, If the number lines is equal to size
of matrix, it is an optimal solution, than go to step 6.
But if the number lines is not equal to matrix size then, Identify the minimum
yalue of undeleted cell values. Obtain the next matrix by following method:
e Copy the entries on the lines but not on the intersection points of the
present matrix as such without any modification to the corresponding
positions of the next matrix.
e Copy the entries at the intersection points of the present matrix after
adding the minimum undeleted cell value to the corresponding
positions of the next matrix.
e Subtract the minimum undeleted cell value from all the undeleted cell values
and then copy them to the corresponding positions of the next matrix.
Select Least
Uncovered element

Subtract Add at
from uncovered Intersection

Note : Single line covered elements remain as it is.

Step 6: Last step is doing assignment. For doing assignment, examine all the
rows with single zeroes, if we get the zeroes, we give assignment in tuat
Row. After giving assignment we cancel all the remaining zeroes in that
columns and rows. Treat the solution as marked by the squares as the
optimal solution.
MINIMIZATION: (Consider for Example)

Ex. (1) In a plant, four machines are to be assigned four jobs on a one to one
basis. The cost in thousands for each machine is given. Find optimal
solution to minimize the total cost.
Machines
Jobs 1 = 4
A 120 100 80 90
B 80 90 110 70
c . 110 | 140 120 100
D 90 90 80 90

Solution:
Step 1: Identify whether the problem is balanced or unbalanced. In the
it is
problem, number of jobs is equal to number of machine. Thus,
balanced problem.
Maximization
Step 2: Checking the problem whether it is of Minimization or
type. Cost is given, therefore it is minimization problem.
will take
Step 3: Next step is Row Minimization. For row minimization, we
least value from each row and subtract it from all values of that row.
After subtraction, table will look like this:
 Operations Research (T.Y.B
120 . Ms Se

Row Minimization
Machines
Jobs

10
inimizati
Step 4: After row minimiza
inimization next least
i take step is, Col ee caluien ae 7 Colt,
value from
. : 1 S subtas
minimization, we w
tab le will loo k like thc ct
from all val ues o: f that2
at a
C colu mn. Min
iee imi
Afte
e r zat
sub i
tra ‘onon,
cti

2 4
10 0 10
10 40 0
30 20 0
0 0 10
imality. For optisali
Step 5: Testing for opine mality, we wi ill cover maxoes
imum Zer0es fy,
it, check whether the number line ‘om
rows and (Copy same table of column s IS equal to 5
minimization for optimality)
of matrix.
Testing for Optimality
Machines , 2 3 a
Jobs
[A | 10 | © 10
| B p 10 40 0 |
jc 0 30 20 0
[| »D oe
.. Number of lines = 4
. Matrix Size = 4 (4 Rows x 4 Col
umn)
.. It is Optimal Solution.
Step 6: When solution is optimal,
last step is doing assignment.
assignment, examine all the For doing
rows with single zeroes, if
We give assignment in we get the zeroes,
tha t Row. After giving assignment we cancel al
the remaining zero
es in that colu mns and
marke d by the square rows. Treat the solution 4
s as the opti mal
solution.
Doing Assignment
 121
Assi gnment Problems
Optimum Assignment Schedule
Jobs Machines | Cost (in ‘000)
A 3 80
B 1 80
C 4 100
D 2 90
| 350
Minimum Cost = Rs. 3,50,000

nment that will result in the

Ex. (2) The following matrix. Find the optimum assig
minimum man-hours needed.
Job
oOo
ww

0
>

Man
sj pBlolo!

CO| ~I3} Ov} OO

A] GO] DO} ee

slanfr}r}]
aalaloal

unbalanced. In the
Step 1: Identify whether the problem is balanced or
Thus, it is
problem, number of jobs is equal to number of man.
balanced problem.
Minimization or Maximization
Step 2: Checking the problem whether it is of
type. It is minimization problem.
For row minimization, we will take
Step 3: Next step is Row Minimization.
all values of that row.
least value from each row and subtract it from
After subtraction, table will look like this:
Row Minimization

Job D
A B Cc
Man
3 1 0 6
1
5 7 0 4
2
0 1 3
3 2
0 2 2 3
4
step is, Column Minimization. For
Step 4: After row minimization next umn and
t value from each col
column minimization, we will take leas will
subtract it from all values of that colum
n. After subtraction, table
look like this:
 Operations Research (T.y BMgBM «
j Q Mh,
122 jnimization

0
|lolo
N/K
2 mum oer,
tim ali ty. For opt imality, we will cover maxi
_ op
Step 5: Testing for k wh et he r th e nu mb er lines ig eau eS fr,
ch ec
rows and columns. After it, of column minimization for optimality tog
tabl e
of matrix. (Copy same tion
Column Minimiza
A B Cc
Job
Man
1 3 1
5 7
2
3
4
+ Number of lines = 3
x 4 Column)
+. Matrix Size = 4 (4 Rows
+. Itis Not Optimal Solution.
to reduce the further solution,
Hence, solution is not optimal, we need
as follows:
The procedure for reduction are
value (value which is not covered)
We need to identify the smallest open
any line). The minimum open value is 1
:. We change 1
1 from all open value. But at the
e For changing, we need to subtract
intersection (where two lines intersect), weneed to add this 1. Res
all other value will remain same.
After making change, the table (matrix) will look like this:

Job
A B Cc D
Man

1 2 0 0
2 4 6 (

3 2 3
0 + 4
4
. Number of lines = 4
.. Matrix Size = 4 (4 Rows x 4
.. It is Optimal Solution.
. . .

oumn)
Cc
 oblems 123
Assignment Pr
Step 6: When solution is optimal, last step is doing assignment. For doing
assignment, examine all the rows with single zeroes, if we get the zeroes,
we give assignment in that Row. After giving assignment we cancel all
the remaining zeroes in that columns and rows. Treat the solution as
marked by the squares as the optimal solution.
Doing Assignment
Job
Man A B Cc D

1 Lo 8
2 Lol 2K
3 & Lo]
4 Lo] ros
Optimum Assignment Schedule
Man Job Time
ee: B Le
2 C 2
3 D 7
4 A 5
17

Minimum Time = 17 hours

CASES (UNBALANCED AND _ PROHIBITED) IN

SPECIAL
ASSIGNMENT PROBLEMS:
auto Parts, four
Ex. (3) In the modification of a plant layout of a factory BMS
ne shop.
new machines M1, M2, M3 and M4 are to be installed ina machi
le for the
There are five vacant places A, B, C, D and E which are suitab
at C and M3
installation. Because of extra large size, M2 cannot be placed
e in
cannot be placed at A. The cost of installing machines location-wis
hundred rupees is as follows:

Shops A B C D E
Machines
M, 9 1 |i | 10 | 1
M, 2 | 9 : 10 9
M; : n|wmfi 7
M, 4 | 8 12 7 8
Find the optimal assignment.
124 M
Operations Research (TYRBag .
SSI
No. of rows ¥ No. of columns

:. Problem is not balanced. In order to balance it, we 2d 8 dum

toy,
Cc pS
| Shops

Machines ay) PB Po} el |

15 | lo i
M, M 10 |
M, pv
14 1] :
MM 12 7 :
M, 0 0 ;
Dummy Pp

columns
No. of rows = No. of

. Problem is balanced
nimization type.
The problem is of mi
Row Minimization
<< sho ps |, A | B C
0

a
Machines
eH

M,
CO} On} nr} Zl a
A) Ol} py
wlo

Re]

M,
Oo} A]

=n
Zl

[
OlN|

CO}

SO};

Dummy
Column Minima

Shops
A B
OQ

Machines
M,
zea

M,
Mz
GaN

M,
Dummy | U U

. Number of lines = 5

. Matrix Size = 5 (5 Rows x 5 Column)

. It is Optimal Solution.
,
 er
signment Problems

Doing Assign ment

Shops |.)
Machines B Cc D E
M, | fo)
M, [ol
M; &
od
M, (0)

Dummy & ¥ fol % %

Optimum Assignment
Schedule
|Machines Shops | Cost (in 00)
|
M, A 9
M, B 9
M3 E 7
M, D 7
Dummy C 0
32
The optimum cost is Rs. 3,200.
MAXIMIZATION: (Consider for Example)
Ex. (4) A company has to appoint one sales executive in each of
the four areas.
Profit potentials of executive is as follows. Find o ptima
l assignment of
executive and area.
Areas
Executives Ay A, As Ae
E, 70 54 56 74
E, 56 68 58 80
E; 70 48 64 66
Ey 49 64 50 56

No. of rows = No. of columns

. Problem is balanced
Problem is of maximization. Hence, we prepare a regret table.
Regret Table

Areas A; Ag As Ay
Executives
E, 10 26 24 6
E, 24 12 22 0
E; 10 32 16 14
ra E, iL 16 30 24
 126 Operations Research (Ty

In order to prepare the regret table, we select the highest elem S$ Sy

subtract all the other elements from it. ent.
Row Minima 'e
Areas A, A, A,
Executives A,
E, 4 20 18 6
E, 24 12 22 5
E; 0 22 6 z

E, 16 0 14 8
Column Minima
Areas
Executives As ms As A,
E, 4 20 12
E, 24 12 16
E; 8 22 8
E, t6 0 8
—_
.. Number of lines = 3

.. Matrix Size = 4 (4 Rows x 4 Column)

.. It is Not Optimal Solution.

Change =4 (least value from all the uncovered elements). Subtract
4 j,
all the uncovered elements and add 4 at the points of intersection.
Areas
Executive my Aa As Aa

E, 0 16 8 0
E, 20 8 12 )
E3 @ 2 6 7-8
Ex 1 6 8 Fe

.. Number of lines = 4

.. Matrix Size = 4 (4 Rows x 4 Column)

.. It is Optimal Solution,
 o

blems
signment Pro
Doing Assignment
Areas
“s Ag A; Ay
Executives
[0] Ww
E,

E Lol
E; ~ mn
Ey [0|

Optimum Assignment Schedule

Executives | Areas Profit
E A, 70
E, Ag 80
Es A3 64
E, Ay - 64
278
———
Maximum Profit = Rs. 278|
to maximise total profit.
Ex. (5) Find the optimal assignment for man and jobs
Profit is given in thousand.
Profit (in Rs’000)
Job
A B Cc
Man ~~

1 60 67 90

2 80 83 95

3 70 72 82

4 85 95 110

No. of rows # No. of columns

“. Problem is no t balanced. In order to balance

it, we add a dummy column.

Profit (in Rs’000)

A B Cc
Job
Dummy
Man
60 67 90 0
1
80 83 95 0
2
70 "72 82 0
3
95 110 0
| 4 85
 128 Operations Research (Ty B
Ms
Hence, we Prepare a regret ta ,
Problem is of maximization.
le, A
Regret Table wae

Cc Dumm,

[50 20 | iio~
[30 15 [lig~
p40 [28 Tiipn—~
[25 | [110
[oO |
Row Minimization

See Job A B Cc
a,
Dumn,
y [
Man ~~ |
30 23 0 99-
1
Be

12 10 0 82
r— 2
r 4 25 15 0 110
Minimization te
Column
Job
A B Cc | Dummy my |
| as a
| 1 18 13 0 8
; 2 3 2 0 13
O € } 0
3
4 13 5 28
-. Number of lines = 2
+ Matrix Size = 4 (4 Rows x 4 Column)
|
. It is Not Optimal Solution.
| Change = 2]
i . c
Job |
Dummy
Man

1 16 11 0 6 |
. = 0 -—_—
| 3 0 8 @
L 4 11 3 26
.. Number of lines = 3
. Matrix Size = 4 (4 Rows x 4 Column)
.. It is Not Optimal Solution.
| Change = 3]
 129
Assign’
Job
Man A B C | Dummy

1 13 8 0 3
2 1 0 B 1
3 Qu h & 9

4 8 3
_ Number of lines = 3
.. Matrix Size = 4 (4 Rows x 4 Column)
[t is Not Optimal Solution.

Job
Man A B C | Dummy

1 12 $ 0 2

2 q p 3 10
3 | 6 0
4 U 22
*, Number of lines = 4
+. Matrix Size = 4 (4 Rows x 4 Column)
-, It is Optimal Solution.
Doing Assignment
Job
Man a B c Drurciiny

1 [o|
2 lo] | &
3 K [0]
4 lol | -«
Optimum Assignment Schedule
Man Job Profit (in Rs. ‘000)

1 C 90
2 A 80
3 Dummy 0
4 B 95
265

Optimal Profit = Rs. 2,65,0

00
130eee Operations Research
(TYR M
[5.4 SOLVED EXAMPLES 5. .

S
(1) Four jobs are to be assigned to four workers on one to }
each assignment is given in Rs. Thousands. Find optimal Asis, ¢
Assignn, Oy
and worker to minimize total cost. (MU, 4. of
Jobs A B c eo ay
Workers
Sunil 4 6 4 |2
dainil 12 ° 6 |5
Anil 3 | 3 :
Swapnil 6 9 3 —
CATE
No. of rows = No. of columns

. Problem is balanced and hence it is a minimization problem.

Row Minimization

Jobs
— A B Cc D
Workers we
Sunil 2 4 2 0
Jainil 6 0 1 0
Anil 0 6 1 0
Swapnil 4 3 1 0
Column Minimization

Jobs
A B C D
Workers

Sunil 2 0
Jainil i ) ) )
Anil 5 ) )
Swapnil 3 0 0

”. Number of lines = 4

. Matrix Size = 4 (4 Rows x 4 Column)

.. It is Optimal Solution.
 ait Problems 131
Assign™
Doing Assignment
Job A
B -
Workers c . D

Sunil Lol
Jainil LO] &
Anil L0] « &
Swapnil Lo] *K
Optimum Assignment Schedule

| Workers Job | Cost (in Rs. ‘000)

Sunil D 2
Jainil B 5
Anil A 3
Swapnil Cc 3
13

Optimal Cost = Rs. 13, 000]

(2) There are four machines M,, Mz, Mg and M,. There are five jobs P,Q, R, S
and T. Cost of doing each job on each machine is given below (in Rs.
Hundred’s).

Machine M, cannot process job R and Machine M; cannot process Job P.

Find optimal assignment of machines and jobs to minimize total cost.
(MU, April, 2017)

Jobs P Q R S T

From

M, 9 11 is 10 11
M, 12 9 - 10 9
M; - 4. JI 14 11 7
My 14 8 12 | 7 8
Solution!
No. of rows # No. of columns
Problem is not balanced. In order to balance it, we add a dummy column. It
is also a prohibited problem.
132
Operations Research Cr .
; BM
Jobs P Q R as
From T
M, 9 11 15 |4;
M, 12 9 M ee
M; M 11 14 faa
M, 14 8 27
Dummy 0 0 0 oop
Row Minimization oS
Jobs P Q R | st
From '
M, 0 2 6 Li. | =4
M, 3 0 M 1 Pe
M; M 4 7 4 an
M, 7 1 5 0 Po
Dummy 0 0 0 0 [0
|
Column Minimization
Jobs P Q R s |Tl
From
M, 0 2 6 1 2
M, 8 0 M lL )
M, M a 7 4 D
M, Y l 5 0 1
Dummy 0 0 0 0 0
“. Number of lines = 5 -
. Matrix Size = 5 (5 Rows x 5 Column)
.. It is Optimal Solution.

Doing Assignment
Jobs P Q R S T
From
M, Lo]
M, Lal | =
M3
M, [oJ|
Dummy “ w Lo | 8 &
 133
ignment Problems

Optimum Assignment Schedule

Workers Job Cost (in Rs. ‘00)

M, P 9
M, Q 9
M; T 7
M, S 7
Dummy R 0
32

Optimal Cost = Rs. 3,200]

(3) Asale manager has to assign to four territories whose profit performance
(in Rs. Lakhs) are given below. Assign the salesmen sales territories so as to
maximise profit. (MU, April, 2016)
Territories
Ti T, Ts; T,

Salesmen

S 30 22 23 32

SO 23 29 24 35
S; 30 19 27 28

Sy 19 27 20 23

No. of rows = No. of columns

. Problem is balanced
Problem is of maximization. Hence, we prepare a regret table.
Regret Table
Territories
T, T; T,
T;

Salesmen

S 5 13 12 3

S, 12 6 11 0

S; 5 16 8 7

S, 16 8 15 12
 Operations Research
(TYR
“3.M 8, %,
Row Minimization
Territories
T Te T; _,
Salesmen q

2 10 9 |™~N
wlolu os
0 11 3 >

S, i: 8 0 7 |L a
_
Column Minimization
<I | ——~
Territories T. Ts T
T; 4
Salesmen
2 10 6 | own
S,
So 12 6 8
0—_
S; Q—+_Ht+—_—__

Sa 8— 0 4

+ Number of lines = 3
umn)
+ Matrix Size = 4 (4 Rows x 4 Col

. It is Not Optimal Solution.

]
Territories T,
T; T, Ts
Salesmen

Sy 9 8 4 9
S: 10 ¢ | 9
s p e 8
pe 4 6
Sa
_ Number of lines = 4
. Matrix Size = 4 (4 Rows x 4 Column)
~. It is Optimal Solution.
Doing Assignment

[ Territories
aia oe

qh t
™’

Salesmen ~~_
S, Lo]
Se
S3 &
S; [0]

ar
 135
assignmentProbl
Optimum Assignment Schedule
Salesmen | Territory | Profit (in Lakhs)

S, T; 30
So Ts 35

Ss T; 27
S, Tp 27
119

hs
Optimal Profit = 13,000 Lak

(4) Five salesmen are to be assigned to five territories. Based on past

performance, the following table shows the annual sales (in Rs. Lakh) that
can be generated by each salesmen in. each territory. Find optimal
assignment to maximise sales. (MU, April, 2015)
Territories
: Ti T, T; T, Ts
Salesmen

Si 26 14 10 12, 9
S, 31 27 30 14 16

S3 15 18 16 25 30

Sa 17 12 21 30 25

Ss 20 19 25 16 10

No. of rows = No. of columns

”. Problem is balanced

Problem is of maximization. Hence, we prepare a regret table.

Regret Table
Territories se T T tT T
Salesmen ~~_ : : ° . °
S; 5 17 21 19 22
S» 0 4 1 17 15
S3 16 13 15 6 1
Sq 14 19 10 1 6
Ss 11 12 6 15 21
 Operations Research (T
136 ‘YB M
‘Sen, .
Row Minimization
Pee \
Territories Ti Tp T; T Ps
4 T,
Salesmen
S, 0 12 16 a
17

257
S3
0
15 | 12
4
14
1
a.
5 a
po
13 | 18 9 0 Pl
a
Ss ee
6 0
|S
5 9 [ES ts,

Column Minimization
T, r, a
Territories 1, T,
5
Salesmen ~

ee Wl|
S: D | 14 5
S; 15 8
13 14 9 0
S,
S; 5 | 2 | ° 9 | i
. Number of lines = 5
)
. Matrix Size = 5 (5 Rows X 9 Column
, It is Optimal Solution.
. Doing Assignment
Territories
q th Ts Ts T;
Salesmen
(0 ] |
S,
S, « | |
Ss oO] |
5, [0]
S; 10]

Optimum Assignment Schedule

Salesmen | Territory | Sales (in Lakhs)
S; T, %6
Sp T, 27

Ss Ts 30
Ss T, 30
95 |
|Ss | OT |
—

| Optimal Sales = Rs. 138 Lakhs

 ; ent Problems
gam 137

which four contractors have

(5) A project work consist of four major jobs for
gubmitted tenders. The tenders amount quoted in thousands of rupees are
iven in the matrix.
g
Jobs
Jt Je J; Ja
Contractor
C; 15 29 35 20

C, a | 27 | 33 7
Cy 17 25 37 15
Ce 14 | 31 39 21
Find the assignment which minimize total cost of project. Hence, find the
minimum cost.
sommes
No. of rows = No. of columns

Problem is balanced. It is minimization problem.

Row Minimization

‘Jobs
I Je Js Js
Contractor
) C, 0 14 20 5
C, 4 10 16 0
C3 2 10 22 0
C, 0 i 25 7

Column Minimization
Jobs
Ji Jz J3
Contractor
C, 4 4

C,
C;
C,
. Number of lines = 3
-. Matrix Size = 4 (4 Rows x 4 Column)
. It is Not Optimal Solution.
 Operations Research (T.Y.B.M5 5
138

Jobs
Ji Jo Js J,
Contractor
(
C,
(

-, Number of lines = 4
”. Matrix Size =
4 (4 Rows x 4 Column)

:. It is Optimal Solution.
Doing Assignment
eee
ee
Ji Jo Js

Contractor
8 ow
% | 35) BI

C,
C, Lo} lo]x
Cy
Cy lo]
Optimum Assignment Schedule
Contractor | Jobs Cost (in Rs. ‘000)
C Jy 29
C, Js 33
C; Jq 15
Cy J; 14
91

[Minimum Cost = Rs. 91,000]

(6) Ina plant, four employees are assigned four jobs on one to one basis. The
cost in thousands for each employee is as follows. Find optimal solution to
minimize total cost.
Job Cost (in thousand — Rs.)
Employee P Q R S

A 60 50 40 45
B 40 45 59 30
C 55 70 60 50
D 45 45 40 45
Ass
No. of rows = No. of columns
problem is balanced. It is minimization problem.
Row Minimization
Job
P Q R S
Employee
rT A 20 10 0 5
B 10 15 25 0
Cc 5 20 10 0
D 5 5 0 9
Column Minimization
Job P Q R S
Employee
A +5 a 6 5
B 5 10 25 )
Cc 0 15 10 wT
D 0 0 0 D
. Number of lines = 4
.. Matrix Size = 4 (4 Rows x 4 Column)
”. It is Optimal Solution.
Doing Assignment
Job
Employee P Q * °
A. LO]
B Lo]
C Lo] A
D KX Dl *«
Optimum Assignment Schedule
Employee Job Cost
A R 40
B S 30
Cc P 55
D Q 45
170
Minimum Cost = Rs. 1,70,000)
140 Operations Research (Ty B Ms

(7) A job production has 4 jobs which can be manufactured op, four sc)
Ur tyi
The processing cost of each job for each machine is given belo,
Machine M, M, M,
Jobs %
J; 31 25 33 23>
J, 25 24 23 2
Js 19 21 23 2a
Jy 38 36 34
How the jobs to be assigned so that the processing Cost Shy
minimum? Wd,

No. of rows = No. of columns

Problem is balanced. It is minimization problem.
Row Minimization

Machine
| ee M 1 M. 2 M 3 M,

Ji 6 0 8 4
Jp 4 3 zZ 0
ds 0 2 4 5
Ja 4 2 0 6
Column Minimization

Machine
M; M;
Jobs

Ji
Jp
Js
J
. Number of lines = 4

“. Matrix Size = 4 (4 Rows x 4 Column)

. It is Optimal Solution.
 Problems 141
| Assignment

: Doing Assignment
"~~... ig Ma
alech
ine
M, M, M; M,
Jobs
Ji [0]

Js [0]
Jy [0]
Optimum Assignment Schedule
Jobs Machine | Cost

Ji M, 25
Jp My 21
Js M; 19
Ja M3 34
99

Minimum Cost = Rs. 99

(8) The quantity of different products (in units) produced by the workers per
day are given in the following matrix along with the profit in Rs. Per unit.
Formulate a Profit Matrix and find the optimal assignment of workers to
product which will maximize the profit. (MU, April, 2018)
Quantity of Products in Units
Worker
Pencil | Rubber Pen Ink

30 40 100 50
Amit

25 70 140 30
Sumit

Vinit 40 90 130 60

Punit 35 45 120 40

Profit in Rs. Per Unit 4 2 1 3

142 Operations Research (T.YB Mis g,
7 MS. .
|

Profit Matrix

Product
Pencil
Workers

= 180 x3
|1 130
1= 0
99 x2
EET
. of columns
No. of rows = No
ed
Problem is balanc ar e a regret table. (Fo,
,
nc e, we pr ep
mization. He
Problem is 0 f maxi lue of rows and columns .) Th Thusu tet
lue i.e 180 from al | the va
subtract highest va
le.
get the following tab
Regret Matrix
| Pen ik |
Pencil | Rubber

| 100 80 30
60
Amit
| 40 40 30
| go 0
0 50
20
40 | 90 60 50
Row Minimization

Product .
/—~__ Pen Ink
| Pencil | Rubber |
Workers
30 70 50 0
Amit
40 0 0 50
Sumit
20 0 50 0
Vinit
0 50 20 20
Punit
Column Minimization

[~ Product Pen Ink

Pencil | Rubber |
Workers

Amit 30 70 59—}+—-0-

Sumit 40 6 §—|—59

Vin t 20—| 8
8,502
Punit 0 50 0 20 |
.. Number of lines = 4
. Matrix Size = 4 (4 Rows x 4 Column)
. It is Optimal Solution.
Assi gnment Problems 143

Doing Assignment
Product ;
Workers Pencil | Rubber | Pen Ink

Amit [0]

Sumit SQ [0]
[ 0] ’ 4
Vinit
Punit fol
- Optimum Assignment Schedule
Workers | Product | Profit

Amit | Ink 150

Sumit Pen 140
Vinit Rubber | . 180
Punit Pencil — 140
610

Maximum Profit = Rs. 610

using
(9) PQR Ltd. produces 4 different products viz pen, ink, pencil and rubber
of
4 workers viz., Alok, Satish, Vaze and Rathod, who are capable
a
producing any of the four products and they work effectively for 7 hours
day. The time (in minutes) required for producing each of the product are
given in the following matrix along with the profit (Rs. Per unit)

Products Pen | Ink Pencil | Rubber

Workers
10 14 12
Alok
7 5 3 4
Satish
6 7 10 10
Vaze
20 10 15 15
Rathod
3 2 4 1
Profit (Rs. / unit)
ize the
Find out the assignment of workers to product which will maxim
(MU, April 2004)
profit.
 144 Operations Research (TY. BM Ss
"Se ay
CATES
The workers can effectively work for 7 hours a day. i.e. 420 Minute
We can thus find the no. of units of each product that each worker,; hy dy

a day. © Prog Ug

Profit Matrix
Products . si
Pen Ink Pencil Rub}
Workers er

m6 [210 [2014 [ay~

yy

Alok 7x3 |42x2 |30x4 |35y,

= 210 = 84 =120 . | =35

420 420 420 “| 420

7 5 3 “q.
. Satish 60x3 |84x2 |140x4 | 105,
F = 180 = 168 = 560 = 105

420 420 420 420

6 7 10 10.
Vaze . Jox3 |60x2 |42x4 |a2xy
= 210 = 120 = 168 = 42

420. | 420 420 | 420

20 10 15 15
Rathod aix3 |42x2 |28x4 |28x1
= 63 = 84 = 112 = 28
Since No. of rows = No. of columns
Problem is balanced.
The problem is of maximization.
Regret Table
Products |
Pen Ink Pencil | Rubber
Workers
Alok 350 476 440 525
Satish 380 392 0 455
Vaze 350 440 392 518
Rathod 497 476 448 532
sign ment Problems 145

Row Minima

Products p
en Ink Pencil | Rubber
Workers
0 126 90 175
Alok
380 392 0 455
Satish

28 0 84
Rathod 49
Column Minima

Products
Pen ink Pencil Rubber
Workers
98 9 1
Alok
380 364 371
Satish
62 4
Vaze

Number of lines = 3

Matrix Size = 4 (4 Rows x 4 Column)

It is Not Optimal Solution.

Products Pencil Rubber

, Pen Ink
Workers
( 36 90 29
Alok
380 302 ( 309
Satish
( 0 42 22
Vaze
TI 0 62 0
Rathod

Number of lines = 4
lumn)
Matrix Size = 4 (4 Rows x 4 Co
It is Optimal Solution.
Doing Assignment

ink Pencil Rubber

product Pen
Wo rk er s

Alok (0|
Satish [0]
Vaze ® (0]
Rathod x
146 Operations Research ( TYBy
MUS. ¢
em,
Optimal Assignment Schedule
Worker | Product | Profit
Alok Pen 210
Satish Pencil 560
Vaze Ink 120
Rathod | Rubber 28
918

Total profit = Rs. 918

(10) A company has 4 machines to do 3 jobs. Each job can be assigng

ed ing,
one machine. The cost of each job-machine combination j; Given On
Din th
table below in Rupees.
Job Profit Per Unit (Rs.)
From

A
B
C
Find an optimal assignment which will minimize the cost.
Answer the following questions with justification:

(1) Is there any alternate optimal assignment?

(2) Is it possible to maintain the same minimum cost as per optimal solution i|
Job B is assigned to either Machine II or Machine III?

(3) Does any machine remain idle as per optimal assignment?

(M.U., April 200)

No. of rows # No. of columns

Problem is not balanced. In order to balance it, we add a dummy
column.
It is a minimization type of problem.

IV |
Job I
From Il Il

A 2 12 14
B 4 6 8
C 5 7 2
Dummy 0 0 0
sth gnment Problems 147
Row Minimization
Job
From
A

oOo; Oo; o

oO; F/B)on
B
C
Dummy 0
Column Minimization

Job
From
A
aS
oO

OD] Ny] NM] &

B oO) p] plo
aS
2

{
C
3S
—

Dummy 6
+, Number of lines = 2
+. Matrix Size = 4 (4 Rows x 4 Column)
+ Tt is Not Optimal Solution.

Job

From
A
OD] po] dO] &

\d|.plolr
slLolala

B
C
Dummy
Number of lines = 3
umn)
Matrix Size = 4 (4 Rows x 4 Col
_ +. tis Not Optimal Solution.
Change = 2

Job
From ~
l Cn |-
Pots
wNororTror.

B i} ¢
C
oS

Dummy L
-. Number of lines = 4
mn)
+. Matrix Size = 4 (4 Rows x 4 Colu
-. Itis Optimal Solution.
 148 Operations
Research (T
Doing Assignment y. Ms
Sy,
Job
From : I Ill
A [o] V
B & [0 ] x
C AR &
Dummy _| *
Optimal Assignment Schedule

From Job | Cost

A I 9
B ll 6
C i 9
Dummy IV 0
24

Optimal Cost = Rs. 24

Ans:
.
Yes, there is an alternate optimal solution
Alternate Assignment

Job | I
" e WV
From
A (0|
B & yw | Lol
Cc x | «
Dummy x lo |

Alternate Assignment Schedule

From Job Cost
A I 9
B Il 8
C Ill 7
Dummy IV 0
24
,
Optimal Cost = Rs. 24
same minimum cost as pa! opt
Yes, it is possible to maintain the He
Machine II or Machine Ill.
solution if Job B is assigned to either
machine
In both the alternate solutions, Job D is assigned to
machine IV remains idle.

eae
 Introduction ee
Types of Transportation Problems
63 Terminologies in Transportation Problems
64 Solving Transportation Problem=
oe
65 Solved Problems
m
6.6 Special Cases in Transportation Proble
ae ee :
67 Case Studies -
==
» ReviewQuestions
| _--_——

Ff INTRODUCTION:
Transportation problem is a special kind of linear programming problem in
which goods are transported from a set of sources to a set of destinations subject
to the supply and demand of the source and destination, respectively, such that
the total cost of transportation is minimized.
Thus transportation problem deal with a special class of linear programming
problem in which the objective is to transport a single commodity from several
sources (also called as origin or supply or capacity centres) to different
‘destinations’ (also known as demand or requirement centres) at a minimum total
cost.
The given information in the problem is (a) The Total Supply at the Origin,
(b) The total quantity demanded by the destinations, and (c) The cost of shipping
_aunit of goods from a known origin to known destination.

[6.2 TYPES OF TRANSPORTATION PROBLEMS]

Type of Problems
| |
Unbalanced
Balanced
Maximization
. .

Maximization Minimization
Minimization
ini

| Convert
Solve Conver to Convert to
Minimization Balanced =e
Convert to
weinsteibon
Solve Solve

Solve
 ly
:
Research (T
154
Operations . ‘By

—.
fy Ay pore lem
a sic Solution
= Total Demand 10 _nainst the} nitial Baf techniques
Balanced — Total supply + Total Demand
availabl
supply pix ree types © techniques available to find the Initial Basic Feasible
Unbalanced — Total
ords T
Minimization keyw Absenteeism e (NWCR)
tance, Ra g,
nk in jon
“West Corner Rul od (MMM)
Time, Cost, Dis . orth Matrix Minima Meth
Method (LCCM) /
got?
on ke yw or ds : etc cel l
Maximiza ti ormance scor e eas t Cos t
come level, perf proximation Method
(VAM)
Profit, Sales, In vogel’ s Ap
TRANS
NOLOGIES IN
ah :
ortation proble ms whoimi se main
g,
tio
o n: Tra nsp ! e cal led min zin Nct iye : '
(1) Minimiz ati goods ar ex. ( 43gun
of sh ip pi ng ze its. It has
minimize the cos t maximi :
t transportation cost is as follows:
objective is to e uni
An alternative 15 units. Th
in! .

xi mi za ti on : max i kin g Profi 4 ad

se
(2) Ma
ch cas e the pro blems are cal f led Warehou
pping goods, in whi
shi where the ce
Unbalanced: In a case Plants
Balanced and FS # I g
(3) al to the demand
ble for shi ppi ng at the origins is equ
availa
destinations, the transportation problemm is isuncal
led balanced, Jn a CasMa e Whethe
, the pro ble balanced.
ent
the quantities are differ m is unbalanced, - Feasible Solu
tion by:y:
Wh en a transportation proble Fini 4
Initial Basic M
(4) Dummy: dummy va ie) umm (b) Least C
demand and supply. A North West Corn
er Rule.
variable is used to even out e, if tota l ar a rable ; (a)
use or store. For exampl proximation Method
simply a fictional wareho (c) Vogel's Ap
uses is 35 units, but tota
l demand at all stores is only 39 om
wareho of 5 units, The call
» We
itional demand
create a fictional store with an add
, the isndetiy

eee Set
shipping to the fictional
store is usually zero. Now
Mn @) IBFS by NWCR:
problem becomes balanced.
occupied cells is equal to m ad
(5) Basic feasible solution: If the number of
constraint equations, ‘satisfying all i,
1 ie. number of independent
conditions.
(6) Degenerate Solution: If the number of occupied cells is less than m+n
then the solution is known as degenerate solution, otherwise non degeneraty
Cc
egio|g [20|| 120 | |40
| |
|
oa | |
solution.
from certain
(7) Prohibited routes: When it is not possible to transport goods
sources to certain destinations due to unfav ourab le weath er conditi ons, roa
Demand 5 | 8 | 7 | 15 a
hazards etc. the problem can be handled by assign ing a very large costsy
Mor infinity to each of the routes which are not possible. Note: Arrows are given for an understanding purpese only.
Students are not expected to draw an arrow.
[6.4 SOLVING TRANSPORTATION PROBLEM] Total Cost = (5 x 38) + (2 x 60) + (60 x 6) + (80 x 4) + (120 x 3) + (40 x 15)
The procedure consists of two phases. The phases are aS follows: = 190 + 120 + 360 + 320 + 340 + 600
= 1950 ,
(I) Finding the initial basic feasible solution in the first phase (IBFS).
(Il) Optimization of the initial basic feasible solution is the second phase. .. IBFS = 1950
 157

106
Operations Research ( T.Y.B
Follow explanation to solve above IBFS b NWweR 3M S,
: ty S | Supply
FE
(1) Check whether demand is equal to supply, if it is
to add dummy. Here it is equal i.e 35, Thetis equ We | 60 100 24
® 7
most north-west corner (upper left Rabi ae
top
) cell of the 60 | 80 120
transportation table, i.e cell AP Q 10
N 20 |120 | [40 18 "
North West

7 1 35
5 [as
sao x3) + (80 x2) + 20 8) + G97) + 408) + 247
=( + 168
Ww 4g0 + 160 + 160 + 560 + 320
otal cost
and tie,
(2) Allocate value to the current northwest corner cell 2 1788
with respect to the current a from
the supply and demand values
Supply jg ce
corner cell. For instance, Demand is 5 and LCCM:
ed, + So in xplanation to solve above IBFS by
supply remains 2 units. Then the column of P is exhaust
ww 2:
follo er demand is equal to supply, if it is not equal, we need
wheth
of the
(3) Now the next North West column is AQ. Demand is 8 ang 5 (1) Checkid dummy. Here i t is equal i.e 35. So, find the minimum
row A js Bika toad trix, ie. find the matrix minimum. Here,
now is 2. Hence, we allocate 2 units. Thus, now alues in the cost ma
sted
supply is 18. Thus, we put
and now demand remains 6 units. .minim um matrix is 20. Demand is 8 and
Q is exhausted and supply remains
g in cell cQ. N low the column
(4) The next North West column is BQ. Demand is 6 units now and
supply is 10 units. Hence, we allocate 6 units. Thus, now column of 10.
value is 24.
Minimum Value. The next minimum i, eail
Q is exhausted and now supply remains 4. (2) Find th e¢ next
Demand is 15 and supply is 7. Thus, we can give 7
units in cell AS.
The next North West column is BR. Demand is 7 units now and
(5) and demand remains 8.
Now row A is exhausted
supply is 4 units. Hence, we allocate 4 units. Thus, now row B js
e any
The next mini mum value is 38 i.e AP cell. We cannot allocat
exhausted and now demand remains 3. (3)
y aus ted . Hen ce, we find next
unit because, row A
is alread exh
(6) The next North West column is CR. Demand is 3 units now and
minimum value.
supply is 18 units. Hence, we allocate 3 units. Thus, now column R is CS. Demand is 8, but supply
exhausted and now supply remains 15. (4) The next minimum value is 40 in cell s
put 8 units and now supply remains 2 unit
remains 10. Hence, we
and
(7) The next North West column is CS. Demand is 15 units now and column S is exhausted.
units, Thus, now both
supply is also 15 units. Hence, we allocate 15 in Cell AQ and BQ. We can’t
(5) Now, the next minimum value is 60 i.e
column S and row C is exhausted. exhausted, thus we
allocate in both as A and Q both are already
(8) After completion, we calculate Total Cost. ee choose next minimum value.
 Operations Research (T.
YBuMs,
158
is 80 in cell BR and CP. When Ii ses n
tatio OO
minimum value
(6) Next 4
quantity. Demand ae mo Vr we
check where we can give higher R ig
7 units in cell BR. Noy £ ck whether dema nd isis equal supplS y, if it is 5 not equal, we need.
equal i.eto 35.
for CP is 5. Thus, we give i Col ly ang 1 e ummy- Here it . DO, we will calcul;
wise and column wise. (Penalty is the. ditierence
3.
exhausted and supply remains mR © a 'e}

least and second least value in a row/column. Ifthe

ji

(7) Next cell is CP demand is 5 but supply remains 2, Thus foween

row; . We pu be. imum values are equal then the penalty is zer
units in CP cell and demand now remains 3 and two min latete penalty for row wisewise ii.e e f for row A. Theo |
Cis exhaucessd, secon d least is 38. So the difference be e ee
ini um cost iiss 100i in cell Il AR, but A :is exhausteq @) ie firs t calcula
4 and
between least
(8) The next minim se a ce
jhenge number
we find next minimum value. econ d least value is 14. Hence ‘ we write first penalty as 14.
. also calcul ate penalt ies for row B and C. We get 20 and
We iiss al 1, we
(9) The next minimum value is 120 in BS and CR. a penalties for row B and C respectively.
in both as C and S are already exhausted. Thus, we mio
Nd ney, 8) after, calculating a an for none will now calculate penalty
minimum value. In co lumn P, the minimum value is 38 and
: . jumn wise also.
#
er and minimum value is 80. The difference betwe en both is 42
GLY The value me re BP. The demand iS 3 un ee we give, 42 in row penalty 1. Thus, we do same for Q,R, and
and supply is also 3 uinits. Thus, we give 3 units in cell Bpisi its
both row P and column B is exhaus ted. Now g, We get penalties, 40, 20 and 16 respectively.
y in rows
4) After calculating penalties, select maximum value of penalt
(11) After completion, we calculate Total Cost. . ng
we select 42 i.e column P. After selecti column
ms and d column
columns 1
s.. Thus
(c) IBFS by VAM P look for minimum value, i.e 38 cell AP. Demand is 5 and supply is
arehouse s_ |Suppl Row Penalties 7, Hence we give 5 units in cell AP and then, the column P is
PPV on MW exhausted. .
Plants
again and we get
[ 24] After giving allocation repeat the whole step 5 we get 40, 20
®) penalties iin rows, 36, 20 and 20. In colum
id 20. n penalties,
A
2) ’
and 16. Thus, again we value ie 40,
select maximum penalty
10
column Q.
20. The demand is 8 and
(6) We select least value in column Q i.e
Cc 18 supply is 18. Thus, we give 8 units in cell CQ the column Q is
7 15 35 ; " exhausted and supply remains 10.
D 4 5 8
oman 35 (7) The next again we calculate the penalties we get penalties in row 76,

42t | 40 20 16 40, 80 and in and in column 20 and 16. Thus, we select maximum
- |4ot! 20 16 value of penalty i.e 80 - row C.
Column
Penalties 20. 16
:
(8) In that row C we select least value from remaining ie 40. The
, 20 ‘ 96 T demand is 15 but the supply is 10. Hence we give 10 in cell CS.
Total Cost = (38 x 5) + (8 x 20) + (20 x 8) + (BO x 7) + (24 x 2) + (120 x 3) + 40x10 © Ne the ra C is exhaustedant demand remalts 5,
~ 190 + 640 + 160 + 490 + 48 + 360 + 400 ow again we calculate penalties from row wise and column wise we
ee get 76, 40 and 20, 96 respectively. Now we select maximum penalty
value i.e 96 — column S. Thus in S we select least value from
.IBFS = 1718 remaining i.e 24. The demand is 5, but the supply is 2. Hence we
give 2 units in cell AS. The demand remains 3. Now, the cell A is
exhausted.
 TyR M —f
Operations Research
160 :
“MLS, Sem, ‘on problem 161
(10)Now, if we observe, only supply 10 i.e row B ig pa My
~*~ ) ria ti o"oH 5 Lid. company has three factories
‘
and four warehouses. The
can balance by giving 7 units in cell BR and 3 unite oa
demand for R is 7 and for S is 3. ™ in colBg (2) Th e op vation cost is as follows:
tra .
(11) After completion, we calculate total cost. * &
We Ws W. Supply

Note: If there is tie in Max. penalty, check where minimum

give there. But if there is tie in Min. cost, check wh,
Cost t jig less a2 | 50 | 26 |
supply value) is higher and give he the ,. a
allocation (demand and
re,
Summary: 54 36 82 19

IBFS Methods Cost 10 12 15 43

(a) NWCR Cost Rs.1950 43
Solution by:
(b) LCCM Cost Rs.1788 Find Initi al Basic Feasible
(c) VAM Cost Rs.1718 Corner Method (b) Least Cost Method
a North West
Conclusion: .
tion Method
)
Vogel’s Approxima
0)
VAM gives lowest optimal solution cost, generally in all metho
for finding IBFS. The answers given by the NWCR and LCM are hig
ds avaiiay,
by NWCeM
her Cost, A
the answer given by the VAM is least cost. Although the answers giv
comparatively low to NWCM. But the answer of VAM is the lowest,
en by Len, i 1BFSWarehous Wi W2 Ws Wa Supply
Thus, VAMis
considered as the best method for finding IBFS.
CHECK RIM CONDITION: (Requirement Condition) (Test of
6 @ ie [s2_| [50 | [267) 7,
Degeneracy) [ 34 - [36 | 28 | 46 13
After finding cost by IBFS methods, we should check rim Condition ;
ie
degeneracy. For checking degeneracy, we use formula: [64| [54 ay ae 9
(1) [m+n — 1 =No. of occupied (allocated) cells |
Where,
m = Number of rows
Demand 6 10 12 a
n = Number of columns
(2) Closed Loop Should not be formed. RIM Condition (Checking For Degeneracy)
If the above condition is satisfied, the solution is non-degenerate. If not, the No. of occupied cells =m+n-—-—1
solution is degenerate and we remove this degeneracy by introducing an 6 =3+4-1
“Epsilon” (e) at the least cost.
Note : Closed loop in formed when you join two allocation with straight lines
loop “No degeneracy
only and come back to the original cell. In RIM condition we want closed c oe
olal Cost = (6 x 42) + (5 x 32) + (5 x 36) + (8 x 28) + (4
NOT tobe formed. x 36) + (15 x 82)
= 252 + 160 + 180 + 224 + 144 + 1230
Example : Close Loop
= 2190
-. IBFS = 2190
 a
AN
Operations Research (Ty
BM. jem
162 S.

tai” probleTI MAL SOLUTION us ING

(b) IBFS by LCM: 10% P
yegon GOP 163
Mop) HED DISTRIBUTION
METHOD (MODI METHOp,
Warehouse
Factories _ method, We modify the IBFS or given s
di ‘olution if
In sae It is call ed know as U-V method. In th is, » we met
, Ne
to arrive
c 0! Testing for optimality can be thod we fie!
it for optimality-
done by Using u,
yan ed to do

cs.
in the occu pied (allocated) cells, da.

for 2

Demand on-occu pied (unallocated) cells,

the no
For Degeneracy)
RIM Condition (Checking
1
No. of occupied cells =m+n—
“8 6 =3+4-1
.
é r
co nside Exam le:
ForBMS Ltd. company has three factories and four warehouse a
he
-. No degeneracy x
7 on cost is as follows: S. 2
Total Cost = (1 x 34) + (5 x 64) + (10 x 54) + (12 x 28) + (11 x 96), A
= 34 + 320 + 540 + 336 + 286 + 328
82)

= 1844
:. IBFS = 1844
(c) IBFS by VAM:
Warehouse Row Penaltic
g
Factorié: wi w2 w3 W4 =| Supply 1 Tl
IW

Fi [42 [32] [50] @ [26] 11 6

6
l Fe
ee"
Bal [36] 28]
a Boe
7a *[ae],
Bs |e
[a
solution is not optimal, find optimal solution by using modi method. Also, find
Demand 6 | 1 | 12 |] 16 | 33 s the minimum cost.

8 4 8 20 T Esra
30 18 8 36 T The given transportation probiem is of minimization type and balanced. It is
Column Penalties | 30 T | 18 8 - balanced since the Demand = Supply. Also, since the allocations are already
- ist | 8 - given in the problem, we need not calculate by VAM or any other method. .
RIM Condition (Checking For Degeneracy) Step: 1 Check Degeneracy:
No. of occupied cells = m +n —- 1 RIM Condition (Checking For Degeneracy)
=3+4-1 No. of occupied cells =m+n-—1
=3+4-1
.. No degeneracy
Total Cost = (6 x 34) + (3 x 36) + (7 x 54) + (12 x 36) + (11 x 26) + (4 x 46) ‘No degeneracy
IBFS = 204 + 108 + 378 + 432 + 286 + 184
.. IBFS = 1592
 Operations Research
(WRI Se
164
for Optimality:
Step: 2 Testing
for all the occy Pied (aly Ny
v. It can be calculated
Calculate u and
the following formula, Cates ~5=3tV
lculate itwith
only. We can ca Me 2

tion of A: .
aicvla
d for all the unoccupied cells only. We can calculate it with
larehouse P Q ger” be calculate
Plant I a7 ormula,
A 6

B 5

C 5
@
Demand 7
Vv vi =2

(1) Alwaystakeu: =0 negative 4, therefore the solution is not optimal. Thus, if solution is
(2) Now for AQ, cost = 3 med.
otimal Joop need to be for
.3sutv optimal,
)
q the loop (closed path
.38=0t+Vv yep: 4 Trac
; wwe=3

(8) Now for AR, cost = 5 R Ss Supply

&
Q
F .5euty
—el_ BEET

o
"
&
.5=0tV
3 =5
5; [oft [2] [zu]is

es
M
&
(4) Now for AS, cost = 4
w4=utv
4 = 0b Vv De 4 aoe
My =4
(5) Now for BR, cost = 2 Demand 7 | 12 17 9 45
=
“a. 2=utv
fo: ¥ vu=2\/vw=3] w=5 v4=4
wo =utS
sug = -3 Itshould be noted that:
loop
(6) Now for CR, cost
= 8 fa) Only one loop exists for any unused square in the given solution. The
.8=utv on be of four corner loop or six corner loop. Four corner loop has
8=ut5 allocation and six corner loop has 5 allocation. Start loop from
“ug =3
 Operations Research TY.
166
ative yay Ms S Sem.
where the negative A value is. Here, cell CS has ne
ue, thus »
start from cell CS. eo!
gteP” cy): After,
+t table will look like this.
One can take a tum wherever there is an allocation =
i
(b)
Hence, we take tity Not ou
Here, there is an allocation in cell AS.
IM. Aga mas
an allocation in cell AR, thus we again take turn. There jg fs
starting and ain aa ake
crane
in cell BR, but we cannot take turn as the
turn fae attay
need to be same. Hence, we move further and take
ES
(c) After loop, assign (+) or (-) signs alternately at each
square. Assign tiloe -T of fe wd
beginning with a plus sign at the unused ing?
clockwise or anti-clockwise direction.
quantity and negative oan ty
(d) Positive sign represent increase in
decrease in quantity.

Step: 5 Change of value: w=3 v2 =

Only corner values will change, the values which are not in oa Condition (Checking For Degeneracy)
remain same. Therefore, AQ and CP remains
same. P comer, yq
a foccupied cells =mt+n-1
ee 6 =3+4-1
Change = Minimum of Negative Value.

Here, negative value in loop is -9 and -1.

«,No degeneracy.

Hence change - 1 step: 7 After degeneracy, again check for optimality by calculating A

Now, to change value aed this 1 where, there is an ‘+’ (Positive) sign ang
Cell A=Cost-(u+v) |
subtract 1, where there is an ‘-‘ (negative) sign. After, doing the further table
yi
AP A=6-(0+3)=
look like this,
P Q . : Sea BP A=5-(-343)=
Kien a
BQ A=9-(3+3)=
A He Ao Se Se
6 5 4 BS
CQ
A=7-(3+4)=
A=7-(24+3)=
CR A=8-(24+5)=1
S| Ele 2 [2 15
5 Since, no negative A. Therefore, it is an optimal solution.

Cc
» 5
4 Fa:
8 [6 | Step: 8 Calculate the cost.
Tolal Cost = (7 x 5) + (3 x 12) + (2 x 5) + (15 x 2) + (8 x 4) + (1 x 6)
IBFS = 35 + 36 + 10 + 30 +3246
12 17 9 | o = 149
i Demand 7
.. IBFS = 149
168 Operations Research (ty,
BM,
Ex. (2) The BMS Ltd. company has three factories and f
unit transportation cost is as follows: ‘our eho

ee
u
arehouse
Ws W,
Fi 42 32 50 Ze
Fe 34 36 28 ie
64 54
F3 36 82
[36
6 10
Demand 12 15
4a 43
Find IBFS and also find optimum solution using MOD] 12
Methog for te
following transportation problem.

(a) IBFS by VAM:

arehouse
Factories Wi We Ws Ws spi
F; a,a2 a32] Be
50 ,
26, |

F | Bel Bal
F3 7 64zeD 54
[54| aa) mS
36 [a2 -19 A, hence the solution is optimal. Therefore no
re is no negative
Si nce, the
Demand 6 10 | 12 15 3 Joop need to b e formed.
x 46)
43 + (12 x 36) + (11 x 26) + (4
(6 x 34) + (3 x 36) + (7 x 54)
8 4 8 20T («) Total Cost=
30 18 8 36T IBFS = 204 + 108 + 378 + 432 + 286 + 184
Column Penalties
30t 18 8 - ». IBFS = 1592
* 18 t 8 -

RIM Condition (Checking For Degeneracy) 6.5 SOLVED PROBLEMS

No. of occupied cells =m +n-—-1 There are 3 Factories A, B, C and three Markers X, Y and Z. Supply at
(1)
6 =3+4-1 the Factories is 60, 80 and 85 units. Demand at the market places is 75,
110 and 40 units. The supply and Demand of units with unit cost of
Transportation (in Rs.) and the schedule followed from Factories to
~. No degeneracy Markets are given below: (The numbers which are shown in circle
indicates number of units transported from Factories to Markets).
(cost in Rs.) (MU, April, 2018)
 171

otep A. Therefore, it is an optimal solution.

oo ga tive
gx 35) +
(3 x 25) + (5 x 40) + (2 x 40) + (7 x 85)
90
“ 5 + 200 + 80 + 595
po, no r!
4 af? 1160 =
[i IBFS 21160 _| make
‘e solution exist, as there is 0 in cell BY. Thus, we

alte? cell BY-

oe 5| am
Solution. plant I a 6_1---- B..
ate Transportation waliluon Pot,
(b) Find one more optimal altern 5) + 5) -
managerial significance of alte 80
(c) Comment upon fhe 5 jz 1] [2_|
Maton,
optimal Transportation solution.
(4) _._---|---- +4
Cane 12 [7 | 8 | 85
racy)
RIM Condition (Checking For Degene
No. of occupied cells = m +n — 1
— 75 110 40 295
=3+3-1 ;
ae
= 25
5=5 Minimum Negative Value
~. No degeneracy
(a) Testing for Optimality:

Se X Y Z | Supply) iu
Plant I Plantrh~_ |
A 6
a | 6] BB Bl © Juqo
i le Ye PD
B 5
B [2 | 2) 80 [w=-1
| @ EY a @ |@
a C 12 7 (8 | 8 |w=4
c [12 | [7 |
| Ze 4 |
[Demand | 75 | 110 295
Demand 75 110 40
| v | v1 =6 | w=3
Vv, = 6 w= 3 v3=3
L Vv
Cell
cy)
A :5. a > ae 5 ~ rcontin (Checking For Degenera
i llp
‘of occceu +nd
s =im e —1
[By [a=2-(1+3)=02 5 =3+3-1
| _CX [A=12-(4+6)= 5=5
f CZ [a=8-(4+3)=1 q
“No degeneracy
 TYBy . y
Operations Research
172 Sg,

it is an optimal solution.
A. Therefore,
Since, no negative
60) + (5 x 15) F
(2 x 25) + (2 x 40) ) + (7 X 85)
50 + 80 + 595
= (6 x
Total Cost
IBFS = 360 + 75+
= 1160
5 IBFS = 1160

provides a manager a flexi

(c) The existence of alternate solution Selectioy, of anyity Oh
decisionmaking. He can enODEE eens the schedule. cogt.
transportation
above schedule will result in minimum
of the
three factories Fy, F, and F3 with supply of 800 ’ 60 )) a .
(2) A Company has W , vay
unit s res pec tiv ely . The re are for warehouses W, W,,
100 0 . : nd \y {
500 , 700 and 800 respectively. A feasible
with demand 400 , tion
cost dat a). !
oca tio ns and unit
given below. (With all
ribution Metheg
(a) Test the solution for optimality using modified dist
nd optimal solution by Modifying29
(b) Ifthe solution is not optimal, fi (MU, April,
sportation cost.
(c) Find minimum tran ——J , 1)
7
T
0
Ws Ws Supply
From a W:
20 25
dl
A 12 6
| 12

anit
6 11 15
B

| 15 17 7
|

500 L—| 1000 |

C 9

700 800 2400 |

Demand 400 500

CAreere
y)
RIM Condition (Checking For Degenerac
No. of occupied cells =m+n~- 1
6 =3+4-1
6=6

.. No degeneracy
a s>
+2>
 173

qr0" sng f0% optimality ;

: Tes 1

Ws W; [Supply| u
Z f° ™ ma
| 20 25
| mn naireries | 6]
|e pe
+1 | 800 | u, =0
.
F160 - _ {800
t

__ (600) ! — 600 |u, = -6

( 400 + |e
9" 15 7 ;
200 (800) 1000 |u, = -4
a
500 {700 _ —[80 2400
“pe
|
400el
mand_|[w vy = 6 v3 = 21 v4 = 11

a
Cell A = Cost - (u + v)

F,W; 21) =-1

A = 20-(0+
}
FW, A=25-(0+ 11) =14
F,W, A=11-(6+6)=11
F,W, A=12-(6+11)=7
F,W, A=9-(-4+12)=1
+3
6)4=1
A= 15-(-
F;W,

Since, negative A, therefore the solution is not optimal.

loop
loop need to form. Thus, we make
(b) Solution is not optimal. Therefore
from cell F;W3
Minimum negative = 300
Hence, change = 300

To W, W, Ws W; Supply u
From
F, 12 6 20 25 800 <0
_
R |
«.
6 il 15} | 12 600 | uw.=-9
(400)
F 7 7
? . (200) } 800 1000 | u=-3
Pe
tmand | 400 500 700 800 2400
WV [well vw.=6 |v,=20 |v, =10
 Operations Re
search (Ty
174 ' ee
RIM Condition (Checking For Degenera
mtn-1 cy) ; = Z ,
No. of occupied cells =
6 =3+4-1
Row
Penalties
1 TI Iv
:, No degeneracy
A = Cost ~ (u + y)

A= 12-(0+ 11) =]

10) =j5
A= 25-(0+

A= 12-(-5+10)=7
Bh AsA= A=9-(3+1lee )=]
eweTherefore, it 15 -( 6)
3+ = 5
is an optimal seth,
Since, no negative A. n,
x 400) + (15 x 9p
(c) Total Cost = (6 x 500) + (20 x 300) + (6 +07,
200) + (7 x 800)
= 3000 + 6000 + 2400 + 3000 + 3400 + 5609 o n (Checking For Degeneracy)
IBFS M Conditi +n-1
d cells =m +4-1
= 23,400 No‘.
of occupie 6= 34

-. IBFS = 23,400
e factories F,, Fy, Fyt
(3) A company is transporting its units from thre 772) 5310 four
The supp ly and demand of ins
warehouses W;, We, W3 and W,. wi ». No dege
nera cy
below:
transpo rtation cost per unit (in Rs.) are given
lity:
(b) Testing for optima
ue We | Supply
ws Wo Ws | Supply) u

| 5 10
[S|
[4 | [9 | c
om ™
Ey
8 EE
5 x haw
E
Pot
10
eT4 BY oo lune
| 2 1 [ena 2} 6
F;
[ Sa | 15 | 10 | 12 3 | 5 A7
Approximation
(a) Find initial Feasible Solution (IFS) using Vogel's 0 13 50
Method. v3 = 2 v4 = 2
method and find opiinal
(b) Test IFS for optimality using MODI
solution.
(c) Is the solution unique? Comment. (M.U., April 2014
 aes
Operations Research

sarees] SS, oblem

el
tion Pr
te

B,
~
2
\8=
=
= 1200, Suppl ly = 1200
EFpeman balanced problem.
A= 3) =0
5-+(2
Hence itis?
pF bY we
pistt ibution D,
12
A. Therefore, it is an optimal solution
| =
|
no! g i

=
Since, [11 |
| 6
Total Cost = (1x 8) (1 x ) ( * ) ( * ) (15 x 2) +
(1 9 S
9426+ 80+ 4843047
IBFS — | 9 15
1 99
.. [BFS = 199 200 250 350

not u nique solution. This is because,

there is Q ;in ¢
(c) No, it is ell Ey 3 5 2
a Iternate solution .
Therefore, it isan Column Penalties | 3 - 2
lving thing
id er the fo ll ow in g tr an sportation problems invo ization
3 2
Cons of 2
cost (in Rs.):
D, ply
Suppl
RIM Condition (Checking For Degeneracy)
No. of occupie dcells =m+n-1
25 400 6 =3+4-1
12 300
A 500
400 :, No degeneracy
Testing for optimality:
(a) Find the optimal solution to this problem and determine the to
istribution
cost of transportation.
Sources pl b2 D3 D4 |Supply| iu ‘|
(b) Analyse the solution obtained by you and answer the followin
questions: S
8 beepoe 12 | __ 16[6
te
| __ |20
FY
25
[ano
be Ben Beh
(i) Is the optimal solution unique? If there is any altemat

optimal solution, identify it. S | (6| [at 15 [12

(ii) The transport is willing to provide a discount of 25 percent
the freight on the route S,D,, should the offer be accepled? s, EE 400 500 | u,=-4 |
decided to transpot)
(iii) How the cost would be.affected if it is
units from S, to D2? (MLU., April 2014 Demand
;
200 250
350 400 120
200

w=12 |vy=6 |v,=21 |y=11

"8 “a7

Operations Resear ~%
ch TY. Bu y
Cell A = Cost - (u + se Sem, .\y
Sb, y)
A = 20-(02+1) =-
SD,
]
A=25-(0+1
1)=14
SD, A=11-(-6+6
mm )=1
A= 12-(-6+ 11) 1
=7
SD; a
SD, aS
Since, negative A, therefore solution is not optimal. The loop Needto be
€ fy
Minimum Value = 150

Hence, change = 150

“Distribution
Sources D; D, Ds D, |Su Pply i

12 6 20 7
250 w=9
Sp 6 11 15 [12 | |
(200 100 300 Juss
7 9 15 17 |7 —t-——
° (100) ‘(400 500 J u=3
|.)0.
--—————_]

Demand 200 | 250 | 350 | 400

vy,= 11 V2 = 6 v3 = 20 vq4= 10
Vv

RIM Condition (Checking For Degeneracy)

No. of occupied cells =m+n-—1
6 =3+4-1

[6 = 6

. No degeneracy
Cell A = Cost - (u + v)
$,D, A=12- (0+ 11)=1

$,D, A= 25-(0+ 10)=15

S,D, A=11-(-5 + 6) = 10
S.D, A=12- (5+ 10)=7

S;D; A=9-(-34+11=1
S3Dz A = 15-(-3+6) = 12
Since, no negative A. Therefore, it is an optimal solution.
 179
zon? ortation Problem
= (6 x 250) + (20 x 150) + (6 x 200) + (15 x 100) +
(17 x 100) + (7 x 400)
IBFS = 1500 + 3000 + 1200 + 1500 + 1700 + 2800
= 11,700
.. IBFS = 11,700

There is no zero. Therefore, it is unique solution. Thus, it is not an

(b) (i )
alternate solution.
= 25%
Co st of ro ut e S, D4 = 12 per unit. Discount
(ii)

», 25% discount of Rs.12 = ~ x 25

= Rs.3

But actual cost reduction route S2D4 = 7 per unit.

«. The offer should not be accepted.
(iii) Cost of S2D2 = 10 per unit. If decided to transport 50 unit,

. Extra cost = 50 10 = Rs.500

Thus, the cost will increase by Rs.500

Therefore, the new cost = 11,700 + 500
= 12,200
-. New Cost’= 12,200

(5) Mr. Pinto is the production supervisor at Chips and ‘Chips Electronics
Company in Mumbai. On arriving at work on one fine morning, he finds
the following given data. The given data is presented in the form of
matrix of transportation time required from an origin to the destination
with availabilities and requirements as follows:
Department | G | H | I| d| Pallets available
A 13 | 25 | 12] 21 18
B 18 | 23 | 14) 9 27
C 23 | 15 | 12] 13 21
Pallet Required | 14 | 12 | 23 | 17
Find the distribution plan using it as a Transportation problem so as to minimize
the total time required for such a distribution plan. (BMS, MU, Oct. 2003)
er
 A=21-(0+7)=14
A=18-(2 +13) =3
A= 23-(2
+ 15)=6
+ 13) = 10
A = 23-(0
A=13-(0+
7) =6
mal solution.
ye A. 4. Therefore, it is an opti
ive
nega!
ginces no ax 13) + (4% 12) + (10 x 14) + (17 x 9) + (12 x 15) + (9 x 12)
t =
otal °° 152 + 48 + 140 + 153 + 180 + 108
= 104

s = 811
F BFS = 811
Following transportation data of a XYZ company are given below:
( 6) arket Mi M2 M; M, Supply

cy) 20
cking For Degenera 10 10 16
:
RIM Condition (Che W we iB 2 298
a > mee
No. of occupied 17 25
16 6
We | Bs a Bu 5 202

8 21 10 15
.. No degeneracy Ws BY a eal [15 250
Testing for optimality: 175 100 150 750
Demand 325
G H 1 J titnh| «|

Sel
oe (a) Find IBFS by using VAM.

; pe! Soe (b) Test IBFS using MODI method and find optimal solution.
To improve the condition of the markets, it is decided to undertake
ZO [14 [9 |
B [18 advertising campaign. However, due to budget constraints only one
God) market can be chosen at present. Decide in which market the

3} fas] 2} advertising campaign should be undertaken?

| c [©
@ 23 |
14 12
| Demand

va= 12 | a
v v= 13 | w=15
[_
 Operations Research (Try R
YB
ajion Problem si
ae eg ative 4. Therefore, itis an optimal solution,
70" 175 x 6) + (2
OEE, vay got
iol Co
98 x 10) + |
(150 * 15)
)+ ( + (27X
27 x1
8) + 7
(73 )
x 10) 4
__ 9980 + 1050 + 459 + 216 + 730 + 2959
2 1685
» IBFS = 7685
ment campaign
° , market Mz should be selected
vertise since its
(c) ia onsportation
ad
. cost is least i.e. Rs.6.

=GisL. CASES IN TRANPORTATION PROBLEM

668
Problem:
ynbalanced
foll
m eines relating
lowinganddatafreight uction capacities of plants, order from
prodthe
coststo for company manufacturing consumer
ndition (Checking For Degeneracy)
RIM Co ‘ Ls =m tn-1
No. of occupied ce 6 =3+4-1 products isgiven:
Ss Supply
16 20
«, No degeneracy 12 16
lity:
(b) Testing optima 18 25
Market
14
tare . M M2 Ms Ms | Supply
From the above information determine the optimal shipping schedule.
[10 10 | [16 |16 20 Se

(BMS, MU, April 2008)

W Gog)

6 17 [2s3 | mp
We
6
[16 | @® [6 ® [17 |
The given transportation problem is of minimizati

Ee] FL @) Foe
on and unbalanced type.
Totaldemand =15+18+12+14
250 =59
* Dy
Demand 325 175 100 150 La Total Supply = 20+164+25
=i?
=61
w=l v3= 12
[v= 10 We take care of the imbalance by adding a dumm
v
y column. A requirement
equal the difference between demand and suppl
y ie. 2 is introduced

L
Cell A = Cost
- (u + v) accordingly.
WiM2 A=10-(0+1)=9
5 P Q R Ss Dummy |
+
WiMs A=16-(0+ 12) =4 Supply
WiMs A= 20-(0+17)=3
15 13 14 16 0 20
A=16-(5+ 10) =1 Y 16 14 13 12 0 16

= W.Mg A=25-(5 +17) =3 7< ; 19 20 22 18 0 25

Ws3M2 A=21-(-2+
1) = 22 n 15 18 12 14 2 61
 Operations Research (TYR M
MS. s ) _ og Problem
em, “Wy =a 185
D : ort tation
VAM: [Paar |suneiy| Boras
. Cell A = Cost ~ (ay Y
ra| =
184
- 4=15-(+i)=4
a Top pts A=16- (0 + 13) =3
13 1] V
@
]

1/3 A=0-(-1+
(8) =9
m2 18 ® [0 | 25 18
A= 20- (8+ 13) =-1
«|! + 13) = 3
A= 18-(8
wz | 14 2 |, 61 negative 4, therefore, it is not an optimal solution. Hence, to make it
1
4 0 need to be form. There is two negative A, thus, we choose
ry | als herefore, we will make loop from cell ZS
ry | 4t 0 qum negative & T Minimum negative value = 8
7 | . 0
Column
ag 5 0
Penalties

pat[ -| ° Q R s
Dummy
(D) Supply} u

AIM Conditiona (Checking For Degemtnry)

=mtn—
13 14 16 0
ren 1 BD ba | bs | Lo 20 |u=0
No. of occupied
Hl lo
14 Bs fen 13 12

+, No degeneracy epee
20 lon 22 18 0

| Dummy 18 12 14 2 | ol
61
s (D) Supply
v2=13 | v3=14 | w=13 | w=-5
[16 [|0 on
Degeneracy)
RIM Condi ition (Checking For
=m +n— 1
No. of occupied cells
16
B_
- - -[12, Io 7 =3+5-1

Psi+ ] 1\@ Lt os .. No degeneracy

Cell A = Cost- (u + v)
61
14 exe gy XP
XS
A=15-(0+14)=1
A=16-(0+ 13) =3
XD A=0-(0 + (-5)) =5
YP A= 16-(-1+ 14) =3
YQ A= 14-(-1=2
+ 13)
YD A =0-(-1+ (-5)) =6
ZQ A=20-(5 + 13) =2
ZR A=22-(5 +14) =3
 |
Operations Research (T. YBM
Ms. blem
. 187
e it is an optimal soluti
on. a la Profit Matrix
6 Therefor | +( 7
0 ni ative 4 (2Oxx 14
) M,
= x 43) ) + + Market M:
e8 e
= (1 ? Ms Dummy
st
(c) otal Co
am
x warehouse 22 33
+ 285 + 144 4 9 25
934 + 28 + 130 + 72 0
Wi
15 20 iz
We a
= 893 18 17 16
Ws
Thi
io IBFS = 893 vat imization type problem.
. Therefore, we
make regret matrix subtract highest value (i.e 25) _, aerate regret
_ co, it is 3maximize;
t
oblem:
Unbalanced Pr e values,
Maximization e. Regret Matrix
(8) ,
warehous' es W1 W2
, and W3 from hi “
has 3
Aco mpany
Te it 5
kets M1, ’ M2, and M3. Availability at Wareha, Upp}:
r
product to 3 ma Ma rk et requirements are
ion liePblieg
d 10 00 uni ts.
2000, 1500 an
uses toeeac.h TaBi
1000 units. Profit Potential per unit from each wareho
is as follows.
Market Mi M2

Warehouse
25 22 | “a3 |
Wi
15 20 | is |
We
18 17 16
Ws
to maximize the ;
schedule,
optimal transportation
Find
(MU tal ro
» April, 2014

Sarma
zation and unbalanced type.
The given transportation problem is of maximi
1000 Demand 1200 | 1800 | 100 | 500 500
Total demand = 1200 + 1800 + 450
7t 2 5 0
= 4000
- 2 5t 0
Total Supply = 2000 + 1500 + 1000 : 3 2 0
Column Penalties
= 4500
. A requireme
We take care of the imbalance by adding a dummy column RIM Condition (Checking
i.e. 500 is introduce For Degeneracy)
equal to the difference between demand and supply No. of occupied cells = m +
n-1
accordingly.
=3+4-1

No degeneracy
 ion Pr
F, to We ai nd Fs to
f¢ pe jpme' nen!
W2 are not Possible
Fe in duUie to certain

eo 4 BFS using LCM.

0
‘est IB FS by MODI method and calculate the total transportation
costs.

Demand 180

(In case of prohibited problems, allocations are not possible on prohibited

A=7-(7+0)=0
routes)
Since, no negative A. Therefore, it is an optimal solution. But, the
tion exist. Te is 0 in RIM Condition (Checking For Degeneracy)
cell W3Mu, so alternate solu =m+n—-1
+ (1500 x 20) + ( ls
(c) Total Cost = (1200 x 25) + (800 x 23) 300 x 19 No. of occupied cel
+ (200 x 16) + (500 x 0)
5 =3+3-1
= 30,000 + 18,400 + 30,000 + 5,100 + 3.200 4 0
= Rs.86,700 », No degeneracy
(b) Testing for optimality:
.. IBFS = 86,700 Warehouse |
Factories W, W, Ws Supply 1
[ree For calculating total cost, multiple each allocation with
the tespecig]
values in profit matrix. F, ase ---16_| __[M
LM | = 12 200 1 =0

(9) Prohibited Problem:

Consider the following transportation problem: [34] [a | [aa! 160
EY uz = -2
ince
‘actories
| Ww: | We | Ws
| F, | 16 : 12 be tated eeuctd
| F | 14 8 18 Demand 180 | 120 | 150 | ~$°
| Fs | 26 - 16 KW 450
L Demand 180 120 150 MV = 16 | ve =10} v3=12 | ©
 Operations Research (Ty Ms. Sem
blem
ation pe
: 1
ee pes nerate Problem:
cours when
A=M-(0+10)=M rim conditiMuon are ~

era c? a coaiplacei onn ive iti not satisfied,

i Hence, to
A= 18-(2+12)=8 “) gen
pe ie degeneracy, . ginary entry called « (Epsilon). It is
0
1=™M
A=M-(+-10) vem? in least value cost cell. Epsilon is a zero value allocation »its its only
1)0=
+ 12
A= 16-( ation of ‘uw’ and ‘y’,
par 0s eis to facilitate the calcul
Thus, isp te
on is not optimal,
ve b . therefore soluti mpar has 3 plants and 3 warehouses. The supply and demand in
since, nega ti
om cell FsWs , and corresponding transportation costs in Rs. per unit are given
form, ff ve Value = 90 AM : On the basis of past. Experience, following dispatch sch
edule has
Minimum Negati elow
= 90 .
alized
Hence, change Warehouses
vee = Supply
ts in Rs. Per

Fs
I be 26
120
mea
@—|
ace
Ws

M| [16 |
(60)
Supply

160
»
:
ft
|r

s&
u
wm
ms

Ly
:
ants

|
|
(Transportation cos

J
=
12

[of
a
unit)i
ul

[3
a

Le
mM

[20]
[20

E
Capacity
(In Units)

300
~

200

180 120 150 \ ach 450

and|
mand
—p(inDeem 300 300
Demand Units)
12
|v= s generate?
v vi=16 |v2=10 (a) Is the above problem de
the
y) tion to optimality and also find
hecking For Degenerac Please improve the above solu
RIM Condition (C (b)
=mtn-1 total cost.
No. of occupied cells
5 =3+3-1
met
a) RIM Condition (Checking For Degeneracy)
.. No degeneracy No. of occupied cells = m+n—-1
4 =3+3-1
F,W2 A=M-(0+10)=M
4 =5
F,Ws A=18-(-2 + 12) =8
It is a degenerate problem. Hence, to remove degeneracy we place €
FaWi A = 26- 16)4=6
+(
(Epsilon) in cell BI
F3We A=M-(4+10)=M
solution.
Since, no negative A. Therefore, it is an optimal
(120 x 8) + (90 x 16
Total Cost = (140 x 16) + (60 x 12) + (40 x 14) +
= 2240 + 720 + 560 + 960 + 1440
= Rs.5920
~. IBFS = 5920
/ Operations Research (T . —
192 VBMs § em,

SS]
(0) Ten “Warehous es.
ting for optimality: y
|
Supply aN |
(Transportation costs in Rs. Per
Plants unit) Capacity
a en I | @ Units) |
—— we 300

— ee . all Ys

B ) B00) 0) “00 Yas 28

sr 60 90 45 5
| ——_ 0
C op Ug = )

Demand 300 300 300 900 |

(in Units) 200
Vv Vi= 40 V2= 36 V3 = 58

Cell A = Cost - (u + v) |

All A= 70-( = 34
+ 36)0

Alll A=90+-( = 32
58) 0

Cl 40) = 27
A = 60-+(-7

Cll A = 90 -(-7 + 36) = 61

Since, no negative A. Therefore, it is an optimal solution.

_ Total Cost = (300 x 40) + (e x 12) + (300 x 8) + (100 x 30) + (200 x 45)
= 12,000 + 0 + 2400 + 3000 + 9000

= Rs.26,400

.. IBFS = 26,400
 3 warehouse A, B, C and four market places p
warehouses is 8, 9 and 13 units, Demand at the m ’ Q, R, S Supply
arket places is 8,
and 7 units. The following table shows the y
9, 6 tation and a feasible solution to the problem nit cost data of

rans?! ”-(MU,April, 2018)

P Q ln S| Suppi
ply
; a7) Ls) ,
|
. 11
aSeor
12 et

c ® oe
|

x
7 9 i 12 aaa

Demand 8 9 6 7 |
(i) Test the given solution for optimality.

(i) If the given solution is not optimal, find optimal solution using
MODI method and calculate optimal cost of transportation.
From the obtained Optimal Table, answer the following
Questions.

(ii) If3 units are transported from B to P, how will the cost be affected?

(iv) If the transporter from A to R is prepared to reduce the cost by 20%

even if one unit transportation business is given to him. Should the
offer be accepted?

If the management wants to embark on an advertisement campaign

in one of the market place, which one should be selected?

If the transport cost from C to R decreases from Rs. 11 to Rs. 4,

What will happen to transportations solution?

What should be the decrease in the cost of cell A-R so that it can be
used alternatively so that multiple solutions are possible?
 ™~

194 Operations Research (T.Y.B.MS. Sem v

aM)

oblem.
It is a minimization and balanced ty. pe of pr

(i) Testing for optimality:

Market
Warehou

tf ee

Demand
v3 = 16 v4 = 20
vi =1 ve = 17
Vv

[C ell | A = Cost - (u + v)
|__
AP A=19-(0+ 15) =4
AR A = 18-(0 + 16) =2
AS A =17-(0 + 20) = -3
BP A=11-(-11 + 15) =7
BQ A= 12-(-11 + 17) =6
CR A =11-(-8 + 16) =3
, it is not an optimal solution
.
Since, negative A. Therefore
on, using MODI method:
(ii) Finding optimal soluti
solution, loop need to be form,
from cell AS.
Thu s, to ma ke it opt ima l
Minimum Negative Value = 4
Hence, change = 4

Market
Warehou P Q R $

a [19 17 18
, @ : _—
11 12 5
B
©
@ [7 [9 11

Demand 8 9 6 7

v vy =15 |ve=17 |vs=13 |v4=17

 195
oblem
pransporetie” Pr
Cell A = Cost- (u + v)
4
AP A=19-(10 5) =4
0+
AR A= 18-(13) =5
= 1 1 - ( 8 + 1 5 )=4
BP A )=3
BO A=12-(8+17 4
(-83+
CR A=11- 1 ) =6
)=3
CS A=12-(8+17
since, N° negative A. Therefore, it is an optimal solution.

otal Cost. = (4X 17) + (4x 17) + (6X5) + (3 x 9) + (8x 7) + (5 x 9)

= 68 + 68 + 30+ 274+ 56+ 45
= Rs.294
.. IBFS = 294

(ii) The cost of A BP = 4 per unit.

If 3 units are transported,
. Extracost =3 x4
= Rs. 12
.. Cost will increase by Rs.12

”. New Total Cost = 294+ 12

= 306
. New Cost = Rs.306

(iv) The cost of route AR is 5 per unit.

Discount = 20%

2 0% discount 5
of 5 mes
= 100 * 20

= Rs.1
But, actual cost reduction = Rs. 5 per unit.
~ The offer should not be accept
ed.
 Se

7
Operations Resear
ch (TYR Ms
<%§
(v) If management wants to embark on an advertisement CaMpaigy, 8m,
the market place, it should market R, since its transportation oe » 0
le
Rs.5.

(vi) If the transport cost from C to R decreases from Rs. 11 to Re |

. he
reduced by 7 per unit. But, the transport cost from C to Rig
Therefore, the transportation solution will not remain Optimal, Pet

(vii) For route AR, Rs.5 should be decrease in the cost so that it ¢
. an b
alternatively so that multiple solution s are possible . 2 us

« New Cost should become = 18-5

=Rs.13

:. New Cost = Rs.13 or lower

(2) From four warehouse A,B, C and D the stocks are to be transporte
four market are W,X,Y,Z. The supplies from warehouses are 100, 1¢9
ate ] n
150, 250 tons respectively. Whereas the requirement of markets
160, 160, 100 tons respectively. The cost matrix (in Rs. per unit) anda
solution to the problem is given in the following table. (MU, Nov, 2017)
]
arket |
xX Y
Warehouse 7 z
12 4 6 16
A
24 |26 12
B |
16 6 16 8
©
10 8 2 W
D

(i) Is the above solution feasible? Justify.

(ii) Is the above solution non-degenerate? justify.

(iii) Is the solution optimal? Find by using MODI method and also"find
optimal transportation cost.

(v) Is there more than one optimal solution? justify.

-

portation Problem 197

Trot (vi) Calculate the opportunity cost to the route A to Y and C to Y.

(v) What should be the minimum decrease in unit cost of the cell B to
X so that the company can optimally use this route altemately?

vi) If the transport carrier offers discount of 75% on existing cost for
the route A to Z should the management accept the offer. Justify.

() The solution is feasible when demand is equal to supply.

+, The demand (requirement for market) = 180 + 160 + 160 + 100

= 600

-. The supply (supplies from warehouse) = 100 + 100 + 150 + 250

= 600

~, Itis feasible solution.

(ii) RIM Condition (Checking For Degeneracy)

No. of occupied cells =m+n-1

7=44+4-1
7 =7

“. No Degeneracy.

(iii) Testing for optimality:

Market a
Z
Warehouse WwW X Y Supply u

6 16
(106)
2
= 7 = of. 100 |ju,= 14
8 100 .

16 6 16 8

(50) ;
10 8 2 12 250 4
D
(60) me
Dema
nd 180 160 160 100 | Eng 600

ee Vo = v3 = -2 v4 = 6
198 Operations Research
(TY. BM S
S. So
Cell A= Cost-(u+v) Sy
AW A=12-(0+6)=6
AY A=6-(0+ (-2))=8
AZ A= 16-(0+6)=10
BW A=24-(144+6=4
BK A= 26-(14+4)=8
BZ A= 26-(14+6)=6
cw A= 16-(24+6)=8
CY A= 16-(2+(-2)=16
DZ A= 12-(446)=2

Since, no negative A, therefore solution is optimal.

Total Cost = (100 x 4) + (100 x 12) + (50 x 60) + (100 a
(180 x 10) + (10 x 8) + (60 x 2) )s

400 + 1200 + 3000 + 800 + 1800 + 80 + 129

= Rs.7,400
.. IBFS = 7,400
(iv) No, there is not more than one optimal solution as there is no Zero A cog

(v) The opportunity cost of transporting one unit to route AY js 8, and the
opportunity cost of transporting one unit to route CY is 16

(vi) The minimum decrease from B to X should be of Rs. 8, so that the Company
can optimally use this route alternately.

.. New Cost = 26-8

= 18

“. New Cost = 18

(vii) The cost of route AZ is 10 per unit.

Discount = 75%

|
“. 75% discount of 10 = 100 10 * 75

= Rs.7.5
But, actual cost reduction = Rs. 10 per unit.
.. The offer should not be accepted.
 199
Tra asportat
ion Probiem
REVIEW QUESTIONS

pistinguish between Assignment and Transportation Problems.

(J)
Ans.
m
Assignment Proble Transportation Problem
ignment + means allocating (1) Transportation problems are
(1) ee us jobs to various people in concerned with the transportation
he organization in such a way that method or selecting routes for
the overall processing time .is less, transporting the products from the
overall efficiency is high manufacturing plant to the
warehouse or other distribution
centres
(2) Method of solution is Hungarian (2) To find Initial Basic feasible
method solution, we use VAM, LCM or
NWCR. Then we find the optimum
solution using MODI Method
(3) The problem is.unbalanced when (3) The problem is unbalanced when
the number of rows is not equal to total supply is not equal to total
the number of columns. demand.
(4) In assignment problem, only one (4) In transportation method, there are
allocation can be made in a no restrictions multiple allocations
particular row or column can be done in a particular row or
column.

(2) Why is a non-degenerate solution a pre-requisite for eptimality test of a

transportation solution? (BMS MU April 201T)
Ans.

(a) To find optimum solution to a transportation problem, we need to use

the test of optimality using the MODI method.
(b) Calculate the value of “u” and “v” and find the value of opportunity
cost (A) for each empty cell.
(c) If the solution is degenerate, we cannot calculate the values of “u” and
Ohl
Vv.

(d) Hence to proceed further, we need to take an “epsilon” in the solution

to make it non-degenerate.
le) Hence a non-degenerate solution is a pre-requisite for optimality test of
a transportation solution.
 Operations Res
earch (T
principle is applied to prevent a prohibiteg fo .
(3) What Ute L,.
being b “s
transportation solution?
art
Ans.
lutions, some of the routes |
(a) In many practical so
it ed du e to ce rt ai n op er at ional problems x oe
proh ib ch ag fon .
conditions, etc. |
ese
e we de si gn at e ~M’ (maximum cost) to th |
H e n c t Prohibites
(b)
ry high cost of transpor
that they will have a ve in the fin
from being included
ation and "OU |

ev en t th es e ro ut es
pr al optim al Slt
Ce.

(4) What are the tests applied to a transportation solution bef Ore
optimality? testing 5 ;
It

Ans.

(a) Test of feasibility: The solution should be feasible ;

be equal ts Ihe the by
allocations in each row and column will
© demang tr |
supply of that row or column.
(b) Test of non-degeneracy: The solution must be non de
si Generate
|
I

should satisfy the RIM condition:

m + n-—1 = no. of occupied cells where, ° |

m = no. of rows

n = no of columns
If it fails to this test, we introduce an epsilon to remove degeneracy.

(5) How to find an alternate optimum solution in a transportation

solution?

Ans.

(a) Alternate optimum solution or multiple optimum solution means tl

there are two solutions that provide the optimum solution.
there is an altemat
(b) If there is an empty cell having a zero A value,
optimum solution.
from
t a closed loop
(c) To find the altemate optimum solution, construc
the empty cell with zero A.

i
 Probl
-on Proble 201
Tra asp ort ati on m
w will you find an optimum solution to a transportation
6) Ho using the modified distribution method?
problem

Ans.
using the RIM condition i.e. m +
(a) Test the solution for non-degeneracy
q- 1 = nd of occupied cells. If degeneracy exists, remove it by adding
an epsilon.
“v” from the occupied (allocated) cells
ed

(b) Calculate the values of “u” = and

u + v
by using the formula cost
using the formula, A
(c) Calculate opportunity cost (A) for each empty cell :
= Cost - (u + v)
equal tc zero then the solution is
If all A values is greater than or
optimum.
having the most
If not, construct a closed loop from the unallocated cell
negative A value
allocations.
Prepare a new table by changing the
i.e. all A
Repe at the abo ve steps till an optimum solution is obtained
(9)
equal to zero
values should be greater than or
NWCR, LCM and VAM
(7) Distinguish between
Initial Basic
are the methods used to find the
Ans. NWCR, LCM and VAM
ortation problem.
Feasible solution (IBIS) to a transp
t allocating from
Corner Rule: In this method, we star
(a) North West
ceed till all
Nor th Wes t co me r of the transpo rtation table and we pro
the hod is not
the demand and supply values are exhausted. Thi s met
m cost.
ura te sin ce the re is no consideration for minimu
acc
from the
Me th od : In thi s me thod, we st art allocating
(b) Least Cost is more
in the tab le and con tin ue so on. This method
lowest cost nce to lower costs.
as it gives impo rta
accurate as compared to NWCR
the
n m et ho d: In thi s method, we calculate
Vogel’s Approximatio is the difference between
column wise. Penalty
penalties row wise and ple
for tha t par tic ula r ro w or column. The princi
the two lowest cos t
st Pe na lt y, Lo we st cos t” Hence, we start allocating
followed is “Highe cost.
xi mu m pe na lt y an d the corresponding minimum
from the ma lution
bes t me th od to fin d the IBES since the so
VAM is considered the
is accurate.