Question

The total number of decision variables in the objective function of an assignment problem of size n × n (n jobs and n machines) is

• A. n
• B. $n^2$
• C. 2n
• D. 2n - 1

Answer 1

The correct option is B $n^2$

• $\text{Number of decision variables}=n\times n=n^2$
• $\text{Number of constraint = n + n = 2n}$
• $\text{Number of assignment = n}$
• $\text{Possible ways to make assignment = n!}$