STEP-7

aut Steb C.ckuaug o wod)

t

Mumbai 92
Chenna
Delhi
Dummy Klkada
Tlc

MANIMIZATION ROBLeM
TEP-1
Maximuaaion enveu Lnta Miinut,
ushlem
fuut of all highut Valu Lelecd u
butahle given QLution) he lalu
hublitable_ll he dedu in highaf Valu

TEP2
Balanred Kuthlem
 RANKA

&Tep
Next Sleb T number t minimum nu
egualJo wmbe ofbum n

SeP6 awd aludate

kast Slkb Auign to wk
Mamum

STe-1 cblem ConvexHi ume minimizat'evt

Maimum
Pushlem
Higheal Vaus 12

Table 1
Caxge ensignment
Ainblant 1 2
3

2
X 3 2
2

Srep-2
Balanaed Boblenm

Toble 2
 S22
ent Probt
The
optimal assignment is:
Mr. A to Mumbai Cost 22,000
Cost 16,000
MaiTakan Mr. B to Chennai
Mr. C to Delhi
Dummy to Kolkata
Cost 10,000
Cost 0
h o Total Cost 48,000
Example 11: Four different airplanes are to be assigned to
handle thre
consignments with a view to maximize profit. The profit matrix is args
thousands of rupees): as
follows
Airplane Cargo Consignments
II III
W 8 11 12
X 9 10 10
10 10 10
12 8 9
Find the optimal assignment. (R.U. M.B.A., 2002)
Solution: As the given assignment problem is a maximizing problem, it can he
onverted to a minimizing problem simply by subtracting all its entries from the
the
aYinum entru af tha tok1 ( 12 Tho olotro nnet octe
 t RATKA
Aplant Caugo Coruyn munml

(
2 (

reP 3
Kelated Je Kou
(Table 3)
Aixplona Couuge (omsignmenl
Jum.my
X 2 2
2
2
0
3

TeP-y
Reladed (elum
Table u)
Aplant (aMge maign mnd
2
wmmy
X
2
2
1 2
3

STEP-S
Nexi Skp
 RANKA

CTable
Avplane Ccuge ouiqnment
2 3 um mY
y 1
X
2 1 O
C
2 3
TEP=_6
ALugm Jo wHk

Ainplam Caxgo onsigmman1 Max proft

12

TP 34

Tl2 BalaneLd
Tl2&teP-1 Peblen
Table )
Machines Jebs
J J2 3 JS
m
 Lssigmen Problems

The ptimal assignment will be as

3
0 shown bclow
M
1
9
1
OJ Time 10 hours
0 0
0,J Time 11
0
OJ hours
Time 6
O4J Time 9
hours
hus there is an increase of 2 hours Total time 36 hours
in time hours
needed for
Some Typical Examples completing the jobs.
ame/1: The captain Of a
cricket team has
ions to five batsmen. The average to
pos.
areas follows
runs scored by each allot five middle batting
batsman at these
positions
Batsman
Batting positions
I II
III IV V
P 40 40 35 25 50
Q 42 30 16 25 27
50 48 40 60 50
20 19 20 18 5
T 58 60 59 55
53
(i) Find the assignment of batsmen to positions, which would give the maximum
aumber of runs. (MGS, Univ, Bikaner M.Com., (F) 2018)
(ii) If another batsman 'U' with the following average runs in batting positions
s given below
I II IV V
Batting position:
52 38 50 49
Average runs: 45
in the team? If who so,
is added to the team. Should he be included to play
(M.D.U. Ajmer 2012)
ll be replaced by him?
Let us
Solution : (i) The given problem is a maximization assignment problem.
all the elements
st convert it into a minimization assignment problem by subtracting then
element of the matrix i.e. 60. The matrix
the given matrix irom the largest
uces to:
Batting Positions
Batsman V
II IV
10
20 20 25 35
P 35 33
 STeP-)
Maxmi2alien bueblem ComVel inls
imaoti
PAcblem
Aughest Valu 0 CTable A
Bal&man Bating
20 20 25 3S
yy 3S 33
12
2 3s
2

STER-2
Balanced Pucblem CTable 2
Batsman Batig io
20 25 10
30 33
12 20
S (35
2

STe?-3
Related KoLD CTable 3
Catiman Baring fasiio
TI
IS 2
 RANKA

12
10
S
(O
STeP-
Related Jo column. CTade u)
bats manm 8aing ANti16
1 25
0 2 7
10 12 19
2

STe?-S
Next Sieb Table S)
Katsmam Bating tien

6 21
6
2 19
12 19
3
2

STEP- ASi91Me Wk
Last Steb
u7u
Baling osifiou SO
Balsman
 A RANKA

2
60

20

1/R 232
When ' balsman add.
SteP 1
Maximiaahen psuo blem COnueuiUnte
DMcble m minmiaati
highest valu 60 Table 1
atman Bating eitien
I 1
20 25 3
30 3S 33
12 20
2
3
S 7
22

eP-2
Kalanced YobleYm
Table2)
Bat sman
Bating sithie
(Dumn
26 2S 35
18 30 35 33
20
 ANKA

41
2
IS 8 22

STef3
Related do ubus 1able 3)
al&manm
TL
3S
96 33
18 30 35
(2 20

S 8 22

STEP-Y
Table 4)
Kelated Jo telumn
Bating fositien
Batsman
3S
20 26
8 43 35
16 30 3
2
31
38
O
13
 uAE ANKA

Srer S
Nexd Sieb Table 5)
Salsman kaling ai hn

I TIT
S 21 3S
B 21 35 23
S
3S 38 36 2
T
1

STE?- CTable&)
Next3hb
at&man BatingYssihem
TL
12 30
22 3S 30 23
S 6
30 3.3 31 37
13

STeP-7
Next 3teb CTable
ot smon tatimg niHan

30
1 30 30 3
0
28 2 31
11 3
S- 13

STEP8
Nest &teb Table 8)
atSman BaBing asitien
TT

21 23
22 2S 23 34 2s
13 13 6
3

STE29
atep signJe wk
Batsman dating esitita Ku
SO
2
T 60

T
 5 29

Atnncnt will be
R S
IV
U
Dummy
S0 42 60 59 52
a s

33n U should be included in the team at position II and he will

Hene
S. Tolal runs will be
263.
halsnman
e
J a e

: Five lathes are to be allotted to five operators (one for cach). The
Eam

table gives weckly output figures (in pieces)

AWAu17ng

Weekly Output (in Lathes)

Onrator

L L L3 L4 Ls
20 22 27 32 36
P
19 23 29 34 40

R
23 28 35 39 34
21 24 31 37 42
24 28 31 36 41
T

Profit per piece is 7 25. Find the maximum profii per week.
2003; MBA (Evec.) 2018)
(R.U. M.B.A.,
a maximization problem. Let us convert
Solution: The given assignment problem is
all the elements of the given table
trom
an opportunity loss matrix by subtracting
ato
highest element of the table that is 42.
Opportunity Loss Table

L Ls
erators
L L
10
P 22 20 15
23 19 13
R 14 7 0
19
S 21 18
Lubtract the
11
 RANKA
STEP 9
Mac hine
M Sobs
M
2
M3
My JS
mS J3
M J2
J6
Tl
STeP-
Maaimiz2atien ueblem (ue Lnls
Puoblem munim
hgheat valu u2
Table 1
Lu Weekly Cudpu!
22
L2 l3
20 Is o
23 19 13
9
S
6

STEP-3
Related Jo ou Tabl 3)
Opetot oe Weekly ubh
L L
(16
 RANYA
21
11
16
2
T 3

STCP
elated e column Table u)
Obexato weekly Cuthu
L
3
6

STEP
Next Steb Table S)
Chevatok Week ly Oudput
L
L3 Ls
3 2

STCP
Nect Ste CTable &)
 RANKA

Obexatox Out pus

L
Weckly Lu LS
L3
3
2 2
2
2
2 2
T 3

STEP-7
Siep_Asin de woek
Last
Weekly Outpus To tul
Cpeualo L
20
LS
3
L3 37
L 2
L2

week: 160 X
160 2
x2

aimum uofi bex

Conveut tlo minima

STe
aimizahon
Þuoblem
bMoble (Table 10
5.26 Assignment Problem
Example 14 Four operators O, O, O3 and O4 are available to a manao.

w ager
has to assign to these four operators. iven the time
jobs J, Jz, Ja and J needea
e r e n t operators to perform differcnt jobs in the matrix given below

Jobs

Operators J3
J J2
10
O1 12 10

O 14 12 15 11

16
Os 10

O4 8 10 9

) How should the manager assign the jobs so that total time needed for all
the jobs is minimum? (R.U. M.Com. (F) 2015
(i) If Job J, is not to be assigned to operator O, what should be the revised

assignment and how much additional time will be required?

(R.U. M.B.A., 2002; R.U. M.Com., ABST 209
Solution: (1) The final total opportunity cost matrix and the assignmentsare
given below:
3 1 J 0 Optimal Solution: O1J1 10 hours

2 2 0 OJ2 12 hours

1 10 O3J4 4 hours

2 0 0 04J3 8 hours

Total time 34 hours

() When Job J2 is not to be assigned to operator O, it becomes an assignmen
problem with impossible assignment. To solve this problem put an infinite cost (say M) in
cell (2 2). The cost matrix will be then as follows

12 10 10 8
14 M 15 11
6 10 16
10 9
The different table relating to the solution will be as follows:

4 2 2 0 I130 6II 0-01

M 4 0 2 M 20 M 1 0
2
2 6 12 0 1 4 10 0 3 9

1 3 2 10-0- 0101
 The optimal assignment will be as shown below
30 0 1 OJ Time 10 hours
1 M 1 0 O2J Time 11 hours
0 3 9 0 O3 J Time 6 hours

2 0 0J3 Time 9 hours

Total time 36 hours
1 ima needed for complcting the jobs