Chapter 10: Operations Research — Online MCQ Test
BUSINESS MATHS AND STATISTICS · CLASS 12th · Tamil Nadu State Board
Practice Chapter 10: Operations Research with a free chapter-wise online MCQ test.
This chapter covers: The final chapter introduces quantitative decision techniques including transportation and assignment problems. Students apply North-West Corner method Vogel approximation Hungaria....
AI-generated questions from basic to board-exam level, with instant results and explanations.
Chapter 10: Operations Research — Important Questions & Answers
What is the key condition for a Transportation Problem to be classified as balanced?
- A. Total Supply is greater than Total Demand
- B. Total Supply is less than Total Demand
- C. Total Supply is equal to Total Demand
- D. The number of rows equals the number of columns
Answer: C. Total Supply is equal to Total Demand
A transportation problem is said to be balanced if the sum of total supply from all origins equals the sum of total demand at all destinations.
A transportation problem is said to be balanced if the sum of total supply from all origins equals the sum of total demand at all destinations.
Which of the following mathematical methods is specifically used to obtain the optimal solution for an Assignment Problem?
- A. North-West Corner Rule
- B. Vogel's Approximation Method
- C. Hungarian Method
- D. Least Cost Method
Answer: C. Hungarian Method
The Hungarian Method is an iterative algorithm used to find the optimal assignment of jobs to machines at minimal cost.
The Hungarian Method is an iterative algorithm used to find the optimal assignment of jobs to machines at minimal cost.
For a balanced transportation problem with 'm' origins and 'n' destinations, what is the number of basic variables in a non-degenerate basic feasible solution?
- A. m * n
- B. m + n
- C. m + n - 1
- D. m + n + 1
Answer: C. m + n - 1
A basic feasible solution to a transportation problem is non-degenerate if the number of occupied cells (basic variables) is exactly equal to m + n - 1.
A basic feasible solution to a transportation problem is non-degenerate if the number of occupied cells (basic variables) is exactly equal to m + n - 1.
Under the Hurwicz criterion of decision-making under uncertainty, if the coefficient of optimism (α) is set to 0.7, what is the weight assigned to the worst (minimum) payoff for a maximization scenario?
- A. 0.7
- B. 0.3
- C. 1.0
- D. 0.0
Answer: B. 0.3
The Hurwicz criterion balances optimism and pessimism by weighting the best payoff by α and the worst payoff by (1 - α). Thus, the pessimistic weight is 1 - 0.7 = 0.3.
The Hurwicz criterion balances optimism and pessimism by weighting the best payoff by α and the worst payoff by (1 - α). Thus, the pessimistic weight is 1 - 0.7 = 0.3.
Consider a payoff matrix with acts (A1, A2) and states of nature (S1, S2). The payoffs of A1 are S1 = 50, S2 = 10. The payoffs of A2 are S1 = 30, S2 = 30. Using the Laplace criterion of equal probability, which act is preferred and what is its expected value?
- A. A1 with expected value 30
- B. A2 with expected value 30
- C. Both A1 and A2 are equally preferable with expected value 30
- D. A1 with expected value 50
Answer: C. Both A1 and A2 are equally preferable with expected value 30
Laplace criterion assumes equal probabilities (0.5 each). Expected value for A1 = (50*0.5) + (10*0.5) = 30. Expected value for A2 = (30*0.5) + (30*0.5) = 30. Both yield 30, making them equally preferable.
Laplace criterion assumes equal probabilities (0.5 each). Expected value for A1 = (50*0.5) + (10*0.5) = 30. Expected value for A2 = (30*0.5) + (30*0.5) = 30. Both yield 30, making them equally preferable.