INSTITUTE-USB

DEPARTMENT-BBA
Bachelor Of Business Administration
Operation Research(20BAT-263)
Instructor: Dr. Gifty Malhotra

Unbalanced Assignment Operation Research(BAT-308)

DISCOVER . LEARN . EMPOWER
Operation Research(BAT-308)
Problems
 OPERATION RESEARCH
Course Outcome
CO Title Level
Number

CO1 Define and formulate linear programming problems and Understand

appreciate their limitations

CO2 Solve linear programming problems using appropriate Application

techniques and optimization solvers, interpret the results

obtained and translate solutions into directives for action.
CO3 Conduct and interpret post-optimal and sensitivity analysis Analyze
and explain the primal-dual relationship.
CO4 Develop mathematical skills to analyze and solve integer Evaluate

programming and network models arising from a wide range

of applications.
CO5 Understand the usage of game theory and Simulation for Application
Solving Business Problem

https://www.or.tum.de/en/home/
2
 Unbalanced assignment problem

• If the number of persons is different from the number of jobs then the
assignment problem is called as unbalanced problem.
• If the number of jobs is less than the number of persons, introduce one or
more dummy jobs of zero duration to make the unbalanced assignment
problem into balanced assignment problem and
 Unbalanced assignment problem

• If the number of persons is less than number of jobs then introduce one or
more dummy persons with zero duration to modify the unbalanced into
balanced and then the problem is solved using the Hungarian Method.
Example 1:
 A marketing company wants to assign three employees viz. A, B,
and C to four offices located at W, X, Y and Z respectively. The
assignment cost for this purpose is given in Table

Offices

W X Y Z

A 160 220 240 200

Employees

B 100 320 260 160

C 100 200 460 250

Example 1 (contd.)
 Since the problem has fewer employees than offices so that we
have introduce a dummy employee with zero cost of assignment.

Offices
W X Y Z
A 160 220 240 200
Employees

B 100 320 260 160

C 100 200 460 250
D 0 0 0 0

Now the problem becomes balanced. This can be solved by using

Hungarian Method
 Example 2: Unbalanced Assignment Problem

A city corporation has decided to carry out road repairs on main four arteries of the city.
The government has agreed to make a special grant of Rs. 50 lakh towards the cost with
a condition that the repairs be done at the lowest cost and quickest time. If the
conditions warrant, a supplementary token grant will also be considered faviurably. The
corporation has floated tenders and five contractors have sent in their bids. In order to
expedite work only one road will be awarded to only one contractor. Find the best way
of assigning repair work to the contractors and the costs.
If I is necessary to seek supplementary grants, what should be the amount sought?
Which of the five contractors will be unsuccessful in his bid?
Example 2: Unbalanced Assignment Problem

R1 R2 R3 R4
C1 9 14 19 15
C2 7 17 20 19
C3 9 18 21 18
C4 10 12 18 19
C5 10 15 21 16
 METHOD
Number of roads < number of contractors. Therefore in order to
make it a square
matrix, a dummy
road is added
R1 R2 R3 R4 Dummy
C1 9 14 19 15 0
C2 7 17 20 19 0
C3 9 18 21 18 0
C4 10 12 18 19 0
C5 10 15 21 16 0
 METHOD

As each row already contains zero, subtract smallest number from

each column for the elements in that column
R1 R2 R3 R4 Dummy
C1 2 2 1 0 0
C2 0 5 2 4 0
C3 2 6 3 3 0
C4 3 0 0 4 0
C5 3 3 3 1 0
 METHOD
R1 R2 R3 R4 Dummy
C1 2 2 1 0 0
C2 0 5 2 4 0
C3 2 6 3 3 0
C4 3 0 0 4 0
C5 3 3 3 1 0

Examine row and do allocation for rows/columns having one zeros.

Strike off other
zeroes. As there are only four allocations, this solution is not optimal
 METHOD

Examine row and do allocation for rows/columns having one zeros. Strike off other
zeroes. As there are only four allocations, this solution is not optimal

R1 R2 R3 R4 Dummy
C1 2 2 1 0 0
C2 0 5 2 4 0
C3 2 6 3 3 0
C4 3 0 0 4 0
C5 3 3 3 1 0
 METHOD
R1 R2 R3 R4 Dummy
C1 2 2 1 0 1
C2 0 5 2 4 1
C3 1 5 2 2 0
C4 3 0 0 4 1
C5 2 2 2 0 0

Among the remaining cells, 1 is the least, Subtract from the cells that are not covered by line
(Row c3, c5). Add it to cells in intersection of lines. Other remain same.
Reallocation is done. This is not optimal as well
 METHOD

Among the remaining cells, 1 is the least, Subtract from the cells that are not covered by line
(Row c3, c5). Add it to cells in intersection of lines. Other remain same.
Reallocation is done. This is not optimal as well

R1 R2 R3 R4 Dummy
C1 2 2 1 0 0
C2 0 5 2 4 0
C3 2 6 3 3 0
C4 3 0 0 4 0
C5 3 3 3 1 0
 METHOD
R1 R2 R3 R4 Dummy
C1 2 2 1 0 1
C2 0 5 2 4 1
C3 1 5 2 2 0
C4 3 0 0 4 1
C5 2 2 2 0 0

Lines are drawn based on the rules. Minimum value is k=1. Subtract 1 from cells
that are not covered and add to cells that are at intersection. Resultant table is the
second table shown. The allocations are done.
Recommended Text Books:

• Budnik, Frank S. Dennis Mcleavey, Reichard : Principles of Operations Research, 2nd ed.,

• Richard Irwin, Illinois – All India Traveler Bookseller, New Delhi, 1995.

• Gould, F.J. etc. : Introduction to Management Science, Englewood Cliffs, New Jersey, Prentice Hall Inc., 1993.

• Mathur, K and Solow, D. : Management Science, Englewood, New Jersey, Prentice Hall Inc., 1994.

Reference Books:

• N.D. Vohra : Quantitative Techniques in Management, Tata McGraw Hill, 2101.

• Sharma, J.K.: Operations Research : Theory and Applications, New Delhi, Macmillian India Ltd., 1997.

• Narang A.S. : Linear Programming Decision-Making. New Delhi, Sultan Chand, 1995.
THANK YOU

For queries
Email: gifty.e10958@cumail.in

17