Linear Programming Using Assignment Method
At the end of the lesson you should be able to:
• explain the different steps of solving LP
problems using Assignment Method;
• solve LP problems using assignment method;
• assign workers to a certain project at a
minimum cost.
Linear Programming Using Assignment Method
The problem is concerned with allocating the jobs
to each of the workers for minimum cost.
Steps of Solving an Assignment Method
1. Subtract the smallest cost from each entry in each
row. If each zero can now be assigned one-to-one
correspondence with the “workers”, an optimal
solution is reached. If it cannot, go on to step 2.
2. Subtract the smallest cost in each column. If the zero
entries can now be distributed on one-to-one
correspondence with the “workers”’ an optimal
solution is reach. If it is not go on step 3.
Steps of Solving an Assignment Method
3. Cover the zero entries by vertical or horizontal lines,
using the least number of lines possible. This can be
done by covering first the row or column having the
most number of zeros. Subtract the smallest uncovered
cost from each uncovered cost but add it to the entry
found in the intersection of the lines. If an assignment is
already possible, an optimal solution is reached. If not,
repeat step 3.
An assignment is optimum if the number of
lines used is equal to the number of rows or
columns.
Example:
Four engineers are to work on 4 projects of XYZ
Construction Company. Each engineer charges
different fees on each project, due to distances
of the projects and the complexity of the work.
The cost of assigning particular engineers to
particular projects are as follows:
Project A Project B Project C Project D
Engineer 1 P11,000 P8,000 P10,000 P7,000
Engineer 2 6,000 5,000 3,000 8,000
Engineer 3 4,000 8,000 10,000 9,000
Engineer 4 11,000 10,000 5,000 7,000
For easy computation, since all entries have 3
zero-endings, we may temporarily eliminate
the three zeros first.
11 8 10 7
6 5 3 8
4 8 10 9
11 10 5 7
Result after subtracting the smallest entry in
each row. Since zeros cannot yet be assigned
to each engineer, proceed to the next step.
4 1 3 0
3 2 0 5
0 4 6 5
6 5 0 2
Result after subtracting the smallest entry in
each column. Zeros cannot yet be assigned
one-to-one to each engineer, proceed to the
next step.
4 0 3 0
3 1 0 5
0 3 6 5
6 4 0 2
Covering zero entries with the least number of
vertical and horizontal lines
4 0 3 0
3 1 0 5
0 3 6 5
6 4 0 2
Result after subtracting 1, the smallest uncovered, from each
uncovered entry and add it to the intersection of the lines. This is the
optimum table since the least number of vertical line or horizontal
lines that can be drawn is equal to the number of columns, and each
zero can now be assigned to each engineer.
5 0 4 0
3 0 0 4
0 2 6 4
6 3 0 1
Assigning the project to each engineer: (giving each zero to each
engineer)
Initial Assignment
Engineer 1 can go to project B or D
Engineer 2 can go to project B or C
Engineer 3 can go to project A
Engineer 4 can go to project C
Final Decision
Engineer 1 can go to project D with cost P7,000
Engineer 2 can go to project B with cost P5,000
Engineer 3 can go to project A with cost P4,000
Engineer 4 can go to project C with cost P5,000
P21,000 minimum cost
Assignment
1. What is forecasting?
2. What are the importance of forecasting in an
organization?
3. What are the quantitative methods of
forecasting?
4. What is regression analysis?
5. What is trend projection?
