This particular class of transportation problems is called the assignment problems. These problems can, of course, be solved by the streamlined Simplex algorithm.

In this unit we extend the theory of linear programming to two special linear programming problems, the Transportation and Assignment Problems. Both of these problems can be …

The assignment model can be solved directly as a regular transportation model. The fact that all the supply and demand amounts equal 1 has led to the development of a simple solution …

In this section, we consider some special cases of the assignment problem such as the maximisation problem, unbalanced assignment problem, alternative optimal solutions and …

In a typical assignment problem, four different machines are to be assigned to three different jobs with the restriction that exactly one machine is allowed for each job.

Assignment Problem: Successive Shortest Path Algorithm f an alternating path. Pay c(x, y) to match x-y; receive 1 10 6

The objective of this assignment problem is to assign n persons to n jobs, so as to minimize the total assignment cost. The cost matrix for this problem is given below: