Q.In an assignment problem the value of decision variable $x_{ij}$ is :

An assignment problem matches $n$ workers to $n$ jobs one-to-one at minimum total cost, and is a special case of the transportation problem where every supply and demand equals 1 on a square matrix. The Hungarian Method solves it by row-reducing and column-reducing the cost matrix, covering all zeros with the minimum number of lines, adjusting the matrix if fewer than $n$ lines are needed, and repeating until exactly $n$ …