wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Solve the following maximal assignment problem:
Branch ManagerMonthly Business
(Rs. lakh)
ABCD
P111199
Q13161110
R1217138
S16141612

Open in App
Solution

Maximal assingment problem
A B C D
P 1111 99
Q 1316 11 10
R 12 17 13 8
S 16 14 16 12
To convert this problem into minimisation problem, subtract all th element from maximum value i.e. 17
Our new matris
A B C D
P 6 6 8 8
Q 4 1 6 7
R 5 0 4 9
S 1 3 1 5
Now reduce minimum value of row from all elements

A B C D
P0022
Q 3056
R 5049
S0305
Now subtract minimum value of column from all elements
A B C D
P0020
Q 3054
R 5047
S0303
Number of crossing line(bolded row and column)=3
But order of matrix =4
3<4 (not optimal solution)
Now subtract uncrossed minimum element from uncrossed(unbolded element) and add at the T - point(Junction of bolded row and bolded column)
A B C D
P0320
Q 0021
R 2014
S0603
Number of crossing line(bolded row and column)=4
But order of matrix =4
4=4 (optimal solution)
assigmnrnt of job
PD
QQ
RB
SC
So maximum time 9+13+17+12=51

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Types of Linear Programming Problem
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon