Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
54 views

Assignment Problem: NOTE: The Pay Off Matrix of Assignment Problem Is A Square Matrix. It

The document discusses assignment problems in operations research and linear programming, which deal with allocating resources or tasks to activities while minimizing time or cost. It describes the Hungarian method for solving assignment problems and notes that assignment problems can also involve maximizing profit or have additional constraints like the traveling salesman problem.

Uploaded by

Prajjwal Pal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
54 views

Assignment Problem: NOTE: The Pay Off Matrix of Assignment Problem Is A Square Matrix. It

The document discusses assignment problems in operations research and linear programming, which deal with allocating resources or tasks to activities while minimizing time or cost. It describes the Hungarian method for solving assignment problems and notes that assignment problems can also involve maximizing profit or have additional constraints like the traveling salesman problem.

Uploaded by

Prajjwal Pal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

ASSIGNMENT PROBLEM

It is a special type of linear programming problem which deals with


allocation of various resources or items to various activities on one to
one basis in such a way that the time or cost involved is minimized and
sale or profit is maximized.

For e.g : A departmental head may have six people available for
assignment and six jobs to assign. He may like to know which job should
be assigned to which person so that all these jobs can be completed in
the shortest possible time.

NOTE : The pay off matrix of assignment problem is a square matrix. It


means

number of jobs should be equal to number of persons.

HUNGARIAN METHOD ( HAM)

 Starting with first row , locate the smallest cost element in each
row of the cost table. Subtract this smallest element from each
element in that row.
 In reduced table, starting with first row , locate the smallest cost
element in each column of the cost table. Subtract this smallest
element from each element in that column.
 Examine the rows successively, until a row with exactly one zero is
found . Put a square around it and cross out all zeros appearing in
the corresponding column.
 Examine the columns successively, until a column with exactly one
zero is found . Put a square around it and cross out all zeros
appearing in the corresponding row.
 Repeat the procedure until all
 zeros in rows and columns are either in square box or crossed out.
 If there is exactly one square box ( one assignment) in each row
and each column, number of assignments made equal to number
of rows / columns, then we get an optimal solution of the
problem.
 In for any row or column without assignment, we proceed to
following steps.
 Draw the minimum numbers of horizontal and vertical lines
necessary to cover all the zeros in the reduced matrix.

Elements in reduced matrix are divided as :

Covered , Uncovered and Intersection elements

 Select the smallest element among all the uncovered elements.


Subtract this element from all uncovered elements and add it to
element which lies at the intersection of two lines ( intersection
element) . Keeps the covered elements are as it is.
 Make the assignment for the reduced matrix again and repeat the
procedure until number of assignments became equal to number
of rows / columns. Every row and column has an assignment.

MAXIMIZATION CASE

In some cases, the pay off elements of the assignment problem may
represent profits instead of cost so that the objective will be to
maximize total profit.
The problem of maximization can be converted into minimization case
by selecting the largest element among all elements of the profit
matrix and then subtracting it from all other elements. Now Hungarian
method can be used to obtain optimal solution by adding the original
values of these cells to which the assignments have been made.

TRAVELLING SALESMAN PROBLEM

It is a special type of assignment problem having one additional


restriction that a salesman who start from his home city, visit each city
once and returns to his home city with time or cost involved is
minimized and sale or profit is maximized.

UNBALANCED ASSIGNMENT PROBLEM

If numbers of rows are not equal to number of columns in pay off


matrix, the problem is called unbalanced assignment problem. In such
cases a dummy row / column is added in the matrix to make it a square
matrix. The cost or time associated with this dummy row or column is
assigned zero element in the matrix. Then we can apply HAM to this
resultant matrix ( square ) to get optimal solution.

You might also like