Chapter 08

Distribution
Model
- Part 2 - Members:
Kiseo, Christine Mae
Matedios, Wendylyn
Rosas, Marco
 • Describe the assignment problem

Learnin and list the assumptions.

• Explain the different methods for

g solving the assignment problem.

Outcom
• Apply the Hungarian method.

es
Introduct The assignment model was developed and

ion
published in 1955 by Harold Kuhn, an
American mathematician. This model is
another type of transportation problem,
and its objective is to assign a number of
origins to the equal number of
destinations at either minimum cost or
maximum profit.
Business situations that can utilize the assignment
model are the following:

(a) assigning machines to produce the purchase orders;

(b) assigning manpower to sales territories;
(c) assigning contracts to bidders through a methodical
bid selection process;
(d) assigning teaching loads to teachers;
(e) assigning account executives to different clientele;
and so on.
 The management of Metro Utilities wants to assign three service teams to Luzon, Visayas and Mindanao
areas. Each team has a certain degree of familiarity with the three geographical areas that affect the team's
level of efficiency as reflected in the service cost. The management of Metro Utilities wants to with an
efficient assignment schedule that will minimize the total cost.

Service Teams Luzon Visayas Mindanao

Service Team 1 20 15 30

Service Team 2 16 13 33

Service Team 3 18 19 27
 Lesson 8.1
Characteristics of the Assignment Problem
1. The entities under consideration, such as service teams, jobs, employees account personnel, contracts, and
projects, are finite in number.
2. The entities are assigned on a one-to-one basis to other objects.
3. The results of each assignment can be expressed as profits, payoffs, or costs.
4. The ultimate goal is to assign all entities in such a way that the total benefit is maximized or minimized for cases
involving total cost.

Lesson 8.2
Presentation of the Assignment Problem
The assignment table is quite similar to the transportation table. This is because the assignment problem is considered a
special transportation problem that indicates supply at each source and demand at each destination to be equal to one
unit
 Lessom 8.3
Methods for Solving the Assignment Problem

Complete Enumeration
The assignment problem is basically presented as a balance problem with the number n of items equal to the
number n of entities. Thus, there are n! (n factorial) different solutions to a given assignment problem.

Simplex Transportation Hungarian

Method Method Method
The simplex method can be used Assignment problems can also be The Hungarian method is the
but not very efficient for solving solved using the transportation most efficient way of solving
assignment problem. method. However, there are more large or more complex
efficient methods. assignment problems
 Lesson 8.4

The Hungarian
Method
The Hungarian Method or
Flood's Technique
—is an algorithm that provides an efficient solution procedure
for solving large, balanced assignment problems.
 Dénes Kőnig
a Hungarian mathematician and is based
on the concept of opportunity loss.
 The procedure was based on the following theorem:

If one substract (or adds) a constant number from all entries in any row or column of
the assignment matrix, then the total cost of each of the n! possible assignments is
reduced (or increased) by the constant number substracted (or added).
Steps in Solving the Assignment Problem

Step 1: Construct Step 2: Evaluate if optimal

"Total Opportunity assignment can
Cost" Matrix be achieved.
Steps in Solving the Assignment Problem

Step 3: Improve the Step 4: Establish the final

matrix (optimal) assignment.
 Step 1: Construct the "total opportunity cost" matrix

-the first step concerns the transformation of the most matrix to a "total opportunity
cost" matrix.

First, the entry with the smallest value in each row is substracted from all the other
elements in the same row. This step will eliminate the negative numbers.

20-15 = 5 15-15 = 0 30-15 = 15 5 0 15

16-13 = 3 13-13 = 0 33-13 = 20 3 0 20

18-18 = 0 19-18 = 1 27-18 = 9 0 1 9

New Matrix
 Second, the lowest entry in each column of the new matrix is substracted from
all elements in the same column. The result is the "total opportunity cost".

5-0 = 5 0-0 = 0 15-9 = 6 5 0 6

3-0 = 3 0-0 = 0 20-9 = 11 3 0 11

0-0 = 0 1-0 = 1 9-9 = 0 0 1 0

Total Opportunity Cost Matrix

 Step 2: Evaluate optimality

—All values in the total opportunity cost" matrix is non-negative, and the minimum
possible cost will be at zero. Therefore, a feasible assignment with total opportunity
cost value of zero is already considered optimal.

Z1 Z2 Z3

S1 5 0 6

S2 3 0 11

S3 0 1 0
 Step 3: Improve the total “opportunity cost” that requires three operations:

—First, find the smallest entry with the smallest value in the uncovered cells or cells
without a line.

Second, add the lowest entry to cells in which lines intersect.

Third, cells that are with the single line are to be transmitted with no change in the
improved matrix code.
 z1 z2 z3

z1 z2 z3

s1 5-3=2 0 6-3=3

s1 2 0 3

s2 3-3=0 0 11-3=8

s2 0 0 8

s3 0 1+3=4 0

s3 0 4 0
 z1 z2 z3

z1 z2 z3

s1 5-3=2 0 6-3=3

s1 2 0 3

s2 3-3=0 0 11-3=8

s2 0 0 8

s3 0 1+3=4 0

s3 0 4 0
 Step 4: Establish an optimal assignment.The optimal
assignment is made using the values to the cell with a zero
entry. The one-to-one entry requirement must be
maintained. . If there’s a solution found, drop the row or
column of the matrix and repeat the procedure. If there will
be two or more zeros in the row or column , then choose
arbitrarily.
Conclusi
The assignment model isa a special case of LP.

on
However the format of LP will not be the most
efficient way of solving such problem.The special
algorithm used on the structure of the assignment
table is highly efficient compared to using LP.