Special Purpose Algorithm of Linear Programming:

THE ASSIGNMENT METHOD

Another special-purpose algorithm used in linear programming is the Assignment Method. The
technique is concerned with allocating the jobs to each of the worker/machine for the least cost.

There are three main steps to follow in solving an assignment problem:

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 costs in each column. If the zero entries can now be distributed one-to-
one correspondence with the “workers”, an optimal solution is reached. If it cannot, go on to
step 3.
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 zeroes.)
Subtract the smallest uncovered cost from each uncovered cost but add it to the entry found at
the intersection of the lines. If an assignment is already possible, an optimal solution is
reached. If not, repeat step 3.
.
EXAMPLE 1:
Four engineers are to work on 4 projects of PSV Construction Company. The problem is to
decide which engineer should be assigned to which project. Each engineer charges different fees on
each project, due to distances of the projects and the complexity of the work. The costs of
assigning particular engineers to particular projects are as follows:

PROJECTS
ENGINEERS A B C D
1 P11,000 P8,000 P10,000 P7,000
2 6,000 5,000 3,000 8,000
3 4,000 8,000 10,000 9,000
4 11,000 10,000 5,000 7,000

SOLUTION:
A B C D
1 11 8 10 7 Convert the numbers to lower term by dropping off
1,000.
2 6 5 3 8
3 4 8 10 9
4 11 10 5 7

A B C D
1 4 1 3 0 Step 1.
Deduct the lowest number in each row from the
2 3 2 0 5 numbers in the same row. Check if a one on one
3 0 4 6 5 correspondence on the assignment is met. If not yet,
go to step 2
4 6 5 0 2
This study source was downloaded by 100000861998815 from CourseHero.com on 02-26-2023 22:44:36 GMT -06:00

https://www.coursehero.com/file/65440174/LESSON-4-Assignment-Methoddoc/
 A B C D
1 4 0 3 0 Step 2.
2 3 1 0 5 Deduct the smallest number in each column from every
number on the same column. If a one to one
3 0 3 6 5 correspondence is met on the assignment, then stop. If
4 6 4 0 2 not, then go to step 3.

A B C D
Step 3
1 4 0 3 0 Cover the zero entries by vertical or horizontal lines,
2 3 1 0 5 using the least number of lines possible. (This can be
done by covering first the row or column having the most
3 0 3 6 5 number of zeroes.) Subtract the smallest uncovered cost
from each uncovered cost but add it to the entry found at
4 6 4 0 2 the intersection of the lines. If an assignment is already
possible, an optimal solution is reached. If not, repeat
step 3.

A B C D
1 5 0 4 0 An assignment is optimum if the number of lines used
is equal to the number of rows or the number of
2 3 0 0 4 columns
3 0 2 6 4
4 6 3 0 1

Decision:
To minimize cost, the following assignments must be followed:

ENGINEER PROJECT COST

1 D 7,000

2 B 5,000

3 A 4,000

4 C 5,000

TOTAL COST PhP 21,000

This study source was downloaded by 100000861998815 from CourseHero.com on 02-26-2023 22:44:36 GMT -06:00

https://www.coursehero.com/file/65440174/LESSON-4-Assignment-Methoddoc/
 Assignment:
1)The Standard Engineering Service has three jobs to be done by three machines. Determine the
least cost of assignment if the cost are shown below:

MACHNES
JOBS X Y Z
A P37 P43 P45
B 27 32 36
C 34 31 29

2) Given the following data, determine the least cost of allocation of the variable machines to the
five jobs.
JOBS
MACHINES A B C D E
1 P37 P26 P33 P32 P45
2 25 22 39 34 24
3 31 35 26 28 36
4 42 18 28 40 23
5 29 19 38 27 42

3) The purchasing agent for RSV company wishes to purchase replacement tires for the company’s
service vehicles. He needs 400 unit s of type A, 400 units of type B and 400 units of type C.
Three tire suppliers have bid a the prices given below: Each of them says it will supply all or part
of the order.

MACHINES
Type A Type B Type C
Southern Tire Co. P850 P1000 P880
Firestone Tire Co. 860 880 890
Goodyear Tire Co. 800 890 890
The purchasing agent would like to buy the tires in such a way that the entire requirement of
each type is purchased from a single dealer. Use assignment method to determine the least cost of
purchasing plan.

4) Systems Development Corporation has to assign 4 teams to work on 4 projects . The costs
charged by each team are as follows. Costs are in thousands of pesos. Determine the least cost
of assignment.

PROJECTS
TEAMS 1 2 3 4
A P15 P18 P20 P16
B 18 17 14 20
This study source was downloaded by 100000861998815 from CourseHero.com on 02-26-2023 22:44:36 GMT -06:00

https://www.coursehero.com/file/65440174/LESSON-4-Assignment-Methoddoc/
 C 21 20 13 15
D 17 15 18 19

This study source was downloaded by 100000861998815 from CourseHero.com on 02-26-2023 22:44:36 GMT -06:00

https://www.coursehero.com/file/65440174/LESSON-4-Assignment-Methoddoc/
Powered by TCPDF (www.tcpdf.org)