The total number of decision variables in the objective function of an – McqOptions

MCQOPTIONS

1.	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.	2n
C.	2n 1
D.	n
Answer» B. 2n

Discussion

No Comment Found

Related MCQs

Maximize z = 15x1 + 20x2 Subject to 12x1 + 4x1 36 12x1 + 6x1 24 x1, x1 0 The above linear programming problem has
A linear programming problem is shown below: Maximise 3x + 7y Subjeot to 3x + 7y 10 4x + 6y 8 x, y 0
Consider an objective function Z(x1, x2) = 3x1 + 9x2 and the constraints x1 + x2 8 x1 + 2x2 4 x1 0, x2 0 The maximum value of the objective function is __________.
For the linear programming problem: Maximize z = 3x1 + 2x2 Subject to 2x1 + 3x2 9 x1 5x2 20 x1, x2 0 The above problem has
For the standard transportation linear program with m sources and n destinations and total supply equaling total demand, an optimal solution (lowest cost) with the smallest number of non-zero xij values (amounts from source i to destination j) is desired. The best upper bound for this number is
The problem of maximizing Z = x1 x2 subject to constrains x1 + x2 10, x1 0, x2 0 and x2 5 has
The minimum value of 3x + 5y such that: 3x + 5y 15 4x + 9y 8 13x + 2y 2 x 0, y 0 is ___________ .
Following data refers to the jobs (P, Q, R, S) which have arrived at a machine for scheduling. The shortest possible average flow time is ____ days.JobProcessing Time (days)P15Q9R 22S12
The unit worth of resource R2, i.e. dual price of resource R2 in Rs per kg is
Consider the following Linear Programming Problem (LPP): Maximize z = 3x1 + 2x2, Subject to x1 4 x2 = 6 3x1 + 2x2 < 18 x1 0, x2 0