Solution of assignment problem using vogel’s method

Abstract : Assignment problem is a special case of Transportation problem. It is a minimizing model that assigns numbers of people with equal number of jobs, henceforth minimizing the corresponding costs. In this paper Assignment problem is solved using Vogel's method of transportation problem. The optimality of the solution is checked by diagonal method,with the help of illustrating numerical examples. The results obtained in the examples are compared with the results yielded with Hungarian method. This method is one of the efficient, simple, and accurate method for obtaining an optimal solution of assignment problem. Keywords: Assignment Problem, Linear Integer Programming,Cost Minimization; Diagonal sum; Vogel's method