21. |
If a two-person zero-sum game is converted to a Linear Programming Problem,
|
||||||||
Answer:
Option (c) |
22. |
In case, there is no saddle point in a game then the game is
|
||||||||
Answer:
Option (c) |
23. |
When Minimax and Maximin criteria matches, then
|
||||||||
Answer:
Option (d) |
24. |
When there is dominance in a game then
|
||||||||
Answer:
Option (d) |
25. |
When the game is not having a saddle point, then the following method is used to solve the game:
|
||||||||
Answer:
Option (b) |
26. |
If there are more than two persons in a game then the game is known as:
|
||||||||
Answer:
Option (c) |
27. |
Consider the matrix given, which is a pay off matrix of a game. Identify the dominance in it
|
|||||||||||||||||||||||||||||||
Answer:
Option (d) |
28. |
For the given pay of matrix,
Player A always uses
|
|||||||||||||||||||||||
Answer:
Option (d) |
29. |
For the given pay of matrix,
Player A always uses
|
|||||||||||||||||||||||
Answer:
Option (b) |
30. |
For the given pay off matrix the game value is
|
|||||||||||||||||||||||
Answer:
Option (d) |