QUANTITATIVE TECHNIQUES-II PROBLEM WITH MAXIMISATION & UNBALANCED

PRESENTED BY
 TUFAIL KHAN

DEFINATION
 When the given cost matrix is not a square matrix, the assignment problem is called a unbalanced problem.

.RESTRICTIONS ON ASSIGNMENTS  Sometimes it may happen that a particular resource (say a man or machine) cannot be assigned to performed a particular activity (say territory or job). the cost of performing that particular activity by a particular resource is considered to be very large so as to prohibit the entry of this pair of resource-activity into the final solution.  In such cases.

 SUBTRACT AT UNOCCUPIED CELL. . MINIMUM ELEMENT OF UNOCCUPIED CELL ADD TO INTERSECT.STEPS  SUBTRACT MINIMUM VALUE OF ROWS FROM EACH OF ROWS.  SUBTRACT MINIMUM VALUE OF COLUMN FROM EACH OF COLUMN.  COMPARING THE VALUES OF “0” TO THE ORIGINAL MATRIX.  ITERATION CONTINUES.  ALLOCATE 0 BY FINDING SINGLE 0.

UNBALANCED PROBLEM 1 A B C D 25 34 20 20 2 18 25 17 28 3 32 21 20 20 4 20 12 32 16 5 21 17 16 27 .

Assumed here 0(F) 1 A 25 2 18 3 32 4 20 5 21 B C D E 34 20 20 0 25 17 28 0 21 20 20 0 12 32 16 0 17 16 13 0 .

STEP-1 SUBTRACT MINIMUM VALUE OF ROWS FROM EACH OF ROWS 1 2 3 4 5 6 A B C D E 4 0 8 0 1 2 8 7 8 5 7 15 0 4 4 14 6 2 7 0 10 6 2 7 6 0 2 6 6 3 F 0 0 0 0 0 0 .

STEP-2 SUBTRACT MINIMUM VALUE OF COLUMN FROM EACH OF COLUMN 1 A B C D F 7 22 4 4 0 2 0 13 1 12 0 3 14 9 4 4 0 4 2 0 16 0 0 5 3 5 0 11 0 .

STEP-3 SUBTRACT AT UNOCCUPIED CELL. MINIMUM ELEMENT OF UNOCCUPIED CELL ADD TO INTERSECT 1 A B C D 7 18 4 0 2 0 9 1 8 3 14 5 4 0 4 6 0 20 0 5 3 1 0 7 E 0 0 0 4 0 .

A2 = 18 B4 =12 STEP-6 COMPARING THE VALUES OF ORIGINAL MATRIX A2+B4+C5 +D1+E3 0 TO THE C5 =16 D1 =20 E3 = 0 18+12+16+20+0= 66 .

E. .. The Problem May Be To Assign Persons To The Job In Such A Way That The Expected Profit Is Maximized. Such Maximization Problem May Be Solved By Converting Into Minimization Problem.Maximization case  Some Time The Assignment Problem Deals With The Maximization Of The Objective Function I.

(MaX) PROBLEM Which Is The Maximization Problem. 1 2 3 4 A B C 1 5 3 8 7 5 4 6 4 1 5 2 D 3 1 6 3 . We Will Solve The Problem By Converting Into Minimization Problem.

.SOLUTION OF PROBLEM  Step......  Subtracting Each Element Of The Above Matrix From The Greatest Element Of The Matrix. 1. Greatest Element Is 8 1 A B C D 2 8 7 5 1 3 4 6 4 6 4 1 5 2 3 1 5 3 3 .

After Converting into Minimization Problem Job 1 Plant A 7 2 0 3 4 4 7 B C D 3 5 5 1 3 7 2 4 2 3 6 5 .

We Get The Following Matrix.. Step…….2. 1 A B C D 7 2 2 3 2 0 0 0 5 3 4 1 1 0 4 7 2 3 3 .  Subtracting The Minimum Element Of Each Row From All The Elements Of The Corresponding Row.

 Step………3.  Subtracting The Minimum Element Of Each Column From All The Elements Of The Corresponding Column. 1 A 5 2 0 3 4 4 5 B C D 0 0 1 0 0 5 1 1 0 0 1 1 . We Get The Following Matrix.

1 A 5 2 0 3 4 4 5 B C D 0 0 1 0 0 5 M=4 C. In This Step We Draw Minimum Number Of Cut Line To Cover All Zeros At Least Once.Step……..L=4 1 1 0 0 1 1 . We Get The Following Matrix.4.

Then Subtract To The Minimum Element Of Unoccupied Row Or Column And Add To The Same Element On Cross Cut Lines. When Matrix =! Cut Line If M=!C.In case. And Then After Repeat Step …4 .L.

We Get The Following Matrix.5. 1 2 3 4 A B C D 5 0 0 00 1 0 0 00 00 5 4 1 1 00 5 0 0 1 1 .  In This Step We Allocate Zero Assignment To The Minimum Number Of Zeros.Step……. According To The Row Or According To The Column Then.

Answer…… In The Above Table There Is An Assignment In Each Row And Each Column. Hence The Optimal Assignment For Maximum Profit Is … A—2=8. C—1=3. B—4=5. D—3=6.=22 .

Sign up to vote on this title
UsefulNot useful