Operation Research (2171901) MCQs

MCQs of Linear Programming Problem

Showing 41 to 50 out of 64 Questions
2 3 4 5 6 7
41.

The penalty for not taking correct decision is known as

(a)

Fine,
(b)

Loss
(c)

Cost
(d)

Opportunity Cost
Answer:

Option (c)

42.

To transfer the key row in simplex table we have to

(a)

Add the elements of the key row to the key number
(b)

Subtract the elements of a key row from topmost no key row
(c)

Divide the elements of the key row by the key number
(d)

None of these
Answer:

Option (a)

43.

The solution of the Linear programming problem in graphical solution lies in

(a)

First quadrant
(b)

Second quadrant
(c)

Third quadrant
(d)

Fourth quadrant
Answer:

Option (b)

44.

When we solve the maximization problem by the simplex method the elements of the net evaluation row of the optimal solution must be (when we use the opportunity cost concept)

 

(a)

Either zeros or positive numbers
(b)

Either zeros or negative numbers
(c)

All are negative numbers
(d)

All are zeros
Answer:

Option (b)

45.

When all the elements of replacement ratio column are equal, the situation is known as

(a)

Tie,
(b)

Degeneracy
(c)

Break
(d)

None of these
Answer:

Option (a)

46.

When the elements of net evaluation row of simplex table are equal, the situation is known as

(a)

Tie,
(b)

Degeneracy
(c)

Break
(d)

Shadow price.
Answer:

Option (c)

47.

The number at the intersection of key row and key column is known as

(a)

Column number
(b)

Row number
(c)

Key number
(d)

Cross number
Answer:

Option (a)

48.

Dual of a Duel is

(a)

Primal
(b)

Dual
(c)

Primal-Dual
(d)

None of these
Answer:

Option (a)

49.

Primal of a Primal is

(a)

Primal,
(b)

Dual
(c)

Primal-Dual
(d)

Duo primal
Answer:

Option (b)

50.

Dual of a Dual of Dual is

(a)

Dual,
(b)

Primal,
(c)

Double dual,
(d)

Single dual.
Answer:

Option (a)

Showing 41 to 50 out of 64 Questions
2 3 4 5 6 7