Abdel Moneim Kazem Hammadi

Abstract

The second special purpose linear programming (L. P ) algorithm discussed in the research is assignment model . Each assignment problem has associated with a matrix Generally, the rows contain the objects or problem we wish to assign, and the columns comprise the takes we want them assigned to The numbers in the matrix 0r the costs associated with each particular assignment . An assignment problem can be viewed as a transportation problem in which capacity from each source ( m ) or person to be assigned is ( 1 ) and the demand at each destination ( n ) or job to be done is ( 1 ) also to get of the objective function ( max or min ) if assigned a sources ( i = 1 , 2 , ………, m ) to done a jobs ( j = 1 , 2 , ………, n ) to reach for objective function ( maximization or minimization ) . The assignment problem must be square matrix ( n n ) . Hanes assignment one source to one job and this means number of (m) equal (n) , if ( m > n ) or ( m < n ) here in this case must addition dummy source or dummy destination depend of which more or leas between ( m and n ) . The mathematical assignment model by using a linear programming as following : 1 – Suppose if assigned a sources ( i ) to job ( j) . 2 – Suppose if don’t assigned a source ( i ) to job ( j ) .From above we reach to the following model :

DOI:10.52113/6/2012-2-3/1-36