The total number of decision variables in the objective function of an assignment problem of size n $\times$n (n jobs and n machines) is
(a) n2 (b) 2n (c) 2n–1 (d) n
10.4k questions
274 answers
26 comments
15.3k users