Scribd
Upload
85 views

LP Assignment Method

1. The document describes solving an assignment problem using the linear programming assignment method to minimize the total time for a team competing in an event with running, swimming, bicycling and canoeing. 2. It provides the steps to solve the problem, which involves subtracting row and

Uploaded by

Meg shark
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
85 views

LP Assignment Method

1. The document describes solving an assignment problem using the linear programming assignment method to minimize the total time for a team competing in an event with running, swimming, bicycling and canoeing. 2. It provides the steps to solve the problem, which involves subtracting row and

Uploaded by

Meg shark
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

MODULE

12 ◦ Management Science
MODULE G ALS FLEX Course Material

Linear Programming
Assignment Method

College of Businesncvs and


Accountancy
LESSON
#12
LEARNING
OUTC MES
Linear Programming
Learn the concept of LP Assignment Method
Assignment Model.
Solve LP problems in
Assignment Model using a
special method.
What is an assignment model?
Assignment model is a special type of transportation model where the “resources”
are allocated to the “destination” on a one to one basis so as to minimize the total
cost.
◦ What are the steps in solving Linear Programming
Assignment Method?
◦ Steps in solving assignment problems
1. Subtract the smallest cost in each row from all the costs appearing in that row. This
will ensure a zero entry in each row of the table.
2. Subtract the smallest cost in each column. If the zero entries can now be distributed
on a one to one correspondence with the workers, an optimal solution is reached. If it
can not go on 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 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 at the intersection of the lines. If an assignment is already possible
an optimal solution is reached if not repeat step 3.
◦ When do we say that an assignment problem is optimum?
Note :
Assignment is optimum if the number of lines used to cover rows or columns is
equal to the number of rows or columns
Application

CORA DEBBIE
ALICE

BETTY
Illustrative example:
Alice, Betty, Cora, and Debbie plan to enter as a team in a competition. Each of the four will
participate in
a one of the legs of competition which includes running, swimming, bicycling, and canoeing. Based
upon
past performances, their expected times to complete any of the four events (in minutes) are as follows;
Running Swimming Bicycling Canoeing
Alice 44 32 40 28
Betty 24 20 12 32
Cora 16 32 40 36
Debbie 44 40 20 28

1. Determine which woman is to participate in each event so that the total time required for the team
is minimized.
2. What total time will the team expect to take for the contest?
Given:
Running Swimming Bicycling Canoeing
Alice 44 32 40 28
Betty 24 20 12 32
Cora 16 32 40 36
Step 1: (Rows) Debbie 44 40 20 28

Since each woman is to participate in only one event, we use the Hungarian method or the
Assignment method to find the shortest time that they can finish the 4 events. We begin by
reducing the row by subtracting the smallest number in each row from all numbers in the
row;
Alice: 44 – 28 = 16; 32 – 28 = 4; 40 – 28 = 12; 28 – 28 = 0
Betty: 24 – 12 = 12; 20 – 12 = 8; 12 – 2 = 0; 32 – 12 = 20
Cora: 16 – 16 = 0; 32 – 16 = 16; 40 – 16 = 24; 36 – 16 = 20
Debbie: 44 – 20 = 24; 40 – 20 = 20; 20 – 20 = 0; 28 – 20 = 8
Initial Table: Runnin Swimmin Bicyclin Canoeing Alice Canoeing
g g g
Alice 16 4 12 0
Betty Bicycling ?
Betty 12 8 0 20
Cora 0 16 24 20
Debbie 24 20 0 8 Cora Running
Debbie Bicycling
Not one to one ?
correspondence

Step 2 (Columns)
Now we reduce each column by subtracting the smallest number in each column from
all numbers in the column.
Running Swimming Bicycling Canoeing
Alice: 16 – 0 = 16 4–4=0 12 – 0 = 12 0–0=0
Betty 12 – 0 = 12 8–4=4 0–0=0 20 – 0 = 20
Cora 0–0=0 16 – 4 = 12 24 – 0 = 24 20 – 0 = 20
Debbie 24 – 0 = 24 20 – 4 = 16 0–0=0 8–0=8
Table II
Running Swimmin Bicycling Canoeing
g Alice Swimming, Canoeing
Alice 16 0 12 0
Betty Bicycling ?
Betty 12 4 0 20
Cora 0 12 24 20 Cora Running
Debbie 24 16 0 8 Debbie Bicycling ?
Step 2 (Columns) Not one to one correspondence

Now we reduce each column by subtracting the smallest number in each column from
all numbers in the column.
Running Swimming Bicycling Canoeing
Alice: 16 – 0 = 16 4–4=0 12 – 0 = 12 0–0=0
Betty 12 – 0 = 12 8–4=4 0–0=0 20 – 0 = 20
Cora 0–0=0 16 – 4 = 12 24 – 0 = 24 20 – 0 = 20
Debbie 24 – 0 = 24 20 – 4 = 16 0–0=0 8–0=8
Runnin Swimming Bicycling Canoeing
g
Alice 16 0 12 0
Betty 12 4 0 20
Cora 0 12 24 20
Debbie 24 16 0 8

Step 3
Cover the zero entries by vertical or horizontal lines using the least number of
lines possible (This can be done by covering first 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 at the intersection of the lines. If an assignment is already
possible an optimal solution is reached if not repeat step 3.
Since we only have three lines to cover all the zeros in our problem, we cannot get the
optimum solution. Taking the smallest number not covered by the line which is 4. Then
subtract 4 from all the uncovered numbers and add 4 to each element at the
intersection of two lines, just copy the number which were covered by the lines.

Alice: just copy 16; just copy 0; 12 + 4 = 16 just copy 0


Betty: 12 – 4 = 8; 4 – 4 = 0; just copy 0; 20 – 4 = 16
Cora: just copy 0; just copy 12; 24 + 4 = 28 just copy 20
Debbie: 24 – 4 = 20; 16 – 4 = 12; just copy 0; 8–4=4

Enter the new entries in the third tableau:


Third Tableau: Cover the zeros with straight line to find out if the optimal solution is
possible. Running Swimming Bicycling Canoeing
Alice 16 0 16 0 Alice Swimming , Canoeing
Betty 8 0 0 16 Betty Swimming , Bicycling
Cora 0 12 28 20 Cora Running
Debbie 20 12 0 4
Debbie Bicycling
Now we can do the assignment; Number of lines = number of rows or columns 4 = 4
Start with the row or column where in there is only one zero. Let us examine the
rows;
a. Cora’s row: There is only one zero in this row, then Running can be assigned to Cora.
b. Debbie’s row: There is only one zero in this row, then Bicycling can be assigned to her.
Let us examine the column
c. There is only one zero in the column of Canoeing, then assign Canoeing to Alice.
d. Lastly Betty can be assigned to to swimming.
Third Tableau decision: Answer: 1: Determine which woman is to participate in each event
so Running Swimming Bicycling Canoeing so that the total time required for the team is
Alice 16 0 16 0 minimized. Alice Canoeing
Betty 8 0 0 16 Betty Swimming
Cora 0 12 28 20
Cora Running
Debbie 20 12 0 4
Debbie Bicycling
First Tableau Optimal Assignment will be
Alice to Canoeing = 28 minutes
Running Swimming Bicycling Canoeing
Alice 44 32 40 28 Betty to Swimming = 20 minutes
Betty 24 20 12 32 Cora to Running = 16 minutes
Cora 16 32 40 36 Debbie to Bicycling = 20 minutes
Debbie 44 40 20 28
Answer 2: What total time will the team expect to take for the contest? 84 minutes
There fore ; the shortest time that the team can finish the four events is 84 minutes
◦ Homework:
Homework: ( 10 marks )
Four engineers are to work on 4 government projects of the DPWH. The problem is 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 work. The costs (in Million) of assigning a particular
engineer to particular projects are as follows ;
Project A Project B Project C Project D
Engineer 1 11 Million 8M 10 M 7M
Engineer 2 6M 5M 3M 8M
Engineer 3 4M 8M 5M 7M
Engineer 4 11 M 10 M 5M 7M

1. Determine which engineer is to be assigned in each project so that the total cost of constructing the
project is minimized.
2. What is total cost of the entire project?
KEEP SAFE EVERYONE
END

You might also like