Scribd
Upload
2 views

Assignment Method

The document outlines the Assignment Method of Linear Programming, specifically the Hungarian method for optimizing resource allocation to minimize costs. It details the step-by-step procedure including row and column reductions, testing for optimal assignments, and making final assignments based on the modified cost table. The document also provides examples of the method applied to specific data sets, demonstrating the calculations and resulting minimum costs.

Uploaded by

Jenalyn Guzman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Assignment Method

The document outlines the Assignment Method of Linear Programming, specifically the Hungarian method for optimizing resource allocation to minimize costs. It details the step-by-step procedure including row and column reductions, testing for optimal assignments, and making final assignments based on the modified cost table. The document also provides examples of the method applied to specific data sets, demonstrating the calculations and resulting minimum costs.

Uploaded by

Jenalyn Guzman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 20

ASSIGNMENT METHOD

Assignment Method of LP
A special type of transportation model where the
resources are allocated to destinations on a one-to-one
basis to minimize the total cost.
A simple assignment method of one-to-one matching is
called Hungarian method to identify the lowest-cost
solution. The method assumes that every machine is
capable of handling every job, and that the cost or values
associated with each assignment combination are known
and fixed.
Basic Procedure for Hungarian method:
1. Row reduction: Subtract the smallest number in each row
from every number in the row.
2. Column reduction: Subtract the smallest number in each
column of the new table from every number in the column.
3. Test whether an optimum assignment can be made by
determining the minimum number of lines(horizontal or vertical)
needed to cross out all zeroes. If the number of lines equals to
the number of rows, an optimum assignment is possible. In that
case, go to step 6. Otherwise, go on to step 4.
4. If the number of lines is less than the number of rows, modify
the table in this way:
a. Subtract the smallest uncovered number from every
uncovered number in the table.
b. Add the smallest uncovered number to the numbers at
intersections of cross-out lines.
c. Numbers crossed out but not an intersections of cross-
out lines carry over unchanged to the next table.
5. Repeat steps 3 and 4 until an optimal table is
obtained.
6. Make the assignments. Begin with rows and columns
with only one zero. Match items that have zeros, using
only one match for each row and each column. Eliminate
both the row and the column after the match.
1 2 3 4
A 10 12 19 11
B 5 10 7 8
C 12 14 13 11
D 8 12 9 11
*CHECK IF IT IS A BALANCED ASSIGNEMENT
PROBLEM
1 2 3 4
A 10 12 19 11
B 5 10 7 8 1 2 3 4
C 12 14 13 11 A
D 8 12 9 11 B
C
D
ROW REDUCTION

Row reduction: Subtract the smallest number in each row from every number in the
row
SOLUTION

1 2 3 4

A 0 2 9 1

B 1 5 2 3

C 0 3 2 0

D 0 4 3 1
1 2 3 4
A 0 2 9 1
B 1 5 2 3
C 0 3 2 0 1 2 3 4
D 0 4 3 1 A
B
C
D

Column reduction: Subtract the smallest number in each column of the new table
from every number in the column.
1 2 3 4 5
A 13 8 16 18 19
B 9 15 24 9 12
C 12 9 4 4 4
D 6 12 10 8 13
E 15 17 18 12 20
*CHECK IF IT IS A BALANCED ASSIGNEMENT
PROBLEM
1 2 3 4 5
A 13 8 16 18 19
B 9 15 24 9 12
C 12 9 4 4 4 1 2 3 4 5
D 6 12 10 8 13
E 15 17 18 12 20 A
B
C
ROW REDUCTION D
E
SOLUTION:

1 2 3 4 5
A 5 0 8 10 11
B 0 6 15 0 3
C 8 5 0 0 0
D 0 6 4 2 7
E 3 5 6 0 8
1 2 3 4 5
A 13 8 16 18 19
B 9 15 24 9 12
C 12 9 4 4 4 1 2 3 4 5
D 6 12 10 8 13
E 15 17 18 12 20 A
B
C
D
COLUMN REDUCTION E
SOLUTION:

1 2 3 4 5
A 5 0 8 10 11
B 0 6 15 0 3
C 8 5 0 0 0
D 0 6 4 2 7
E 3 5 6 0 8
1 2 3 4 5
A
B
C
*Find the lowest value outside
or the uncovered elements
D
*Subtract the lowest value to
the uncovered elements E
*Add the lowest value to the
point of intersection
*Values which are covered
remains the same
1 2 3 4 5
A 8 0 8 13 11
B 0 3 12 0 0
C 11 5 0 3 0
*DO not make any selection first to the D 0 3 1 2 4
rows with 2 or more zeros.
*Choose first the row with the least E 3 2 3 0 5
zero or only one zero available. Box it
out to identify its assignment.
*Once you chose the available zero in
the row, strike out the available zero in
the column section.
1 2 3 4 5
A 13 8 16 18 19
B 9 15 24 9 12 1 2 3 4 5
C 12 9 4 4 4 A 8 0 8 13 11
D 6 12 10 8 13 B 0 3 12 0 0
E 15 17 18 12 20
C 11 5 0 3 0
OPTIMAL ASSIGNMENT D 0 3 1 2 4
PERSON JOB COST
A 2 8 E 3 2 3 0 5
B 5 12
C 3` 4
D 1 6
E 4 2

TOTAL MINIMUM COST= 42

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy