21 extra multiple-choice questions for Operations Research (12th Standard Business Mathematics and Statistics, Samacheer Kalvi), beyond the ones printed in the textbook — each with the correct option highlighted and a clear, worked explanation. Free to read in English and Tamil.
Q1
Who formulated the transportation problem in 1941?
- A. Frank Lauren HitchcockCorrect
- B. Kuhn
- C. Flood
- D. Egervary
Explanation. The American mathematician and physicist Frank Lauren Hitchcock (1875-1957) is known for formulating the transportation problem in 1941. Kuhn and Flood devised the assignment method, and Egervary's theorems justify it.
Q2
A feasible solution of an \(m \times n\) transportation problem is called a basic feasible solution if it contains
- A. exactly \(mn\) allocations
- B. not more than \(m + n - 1\) allocationsCorrect
- C. at least \(m + n\) allocations
- D. exactly \(m + n + 1\) allocations
Explanation. By definition, a feasible solution is a basic feasible solution if it contains not more than \(m + n - 1\) allocations, where \(m\) is the number of rows and \(n\) the number of columns.
Q3
Three origins have supplies 25, 35 and 40 units, and three destinations need 30, 25 and 40 units. The transportation problem is
- A. balanced, with a total of 100 units
- B. unbalanced, with supply exceeding demand by 5 unitsCorrect
- C. unbalanced, with demand exceeding supply by 5 units
- D. balanced, with a total of 95 units
Explanation. Total supply \(= 25 + 35 + 40 = 100\). Total demand \(= 30 + 25 + 40 = 95\). Since \(100 \neq 95\), the problem is unbalanced, and supply exceeds demand by 5 units.
Q4
A transportation problem has 3 origins and 4 destinations. How many allocations does a non-degenerate basic feasible solution have?
- A. 6Correct
- B. 7
- C. 12
- D. 8
Explanation. A non-degenerate basic feasible solution has exactly \(m + n - 1\) allocations. Here \(m = 3\), \(n = 4\), so \(3 + 4 - 1 = 6\). The value 12 is \(mn\), and 8 is \(m + n + 1\).
Q5
A basic feasible solution of a transportation problem with 4 origins and 3 destinations has only 5 allocations. The solution is
- A. non-degenerate, as \(m + n - 1 = 5\)
- B. degenerate, as \(m + n - 1 = 6\) and \(5 < 6\)Correct
- C. non-degenerate, as 5 is less than \(mn = 12\)
- D. not basic, as it exceeds \(m + n - 1 = 4\)
Explanation. Here \(m + n - 1 = 4 + 3 - 1 = 6\). A basic feasible solution with fewer than \(m + n - 1\) allocations is degenerate. Since \(5 < 6\), the solution is degenerate.
Q6
Using the North-West Corner rule, the total transportation cost (in ₹) of the initial basic feasible solution for the following problem is
\( \begin{array}{c|ccc|c} & D_1 & D_2 & D_3 & \text{Supply} \\ \hline O_1 & 6 & 3 & 7 & 20 \\ O_2 & 2 & 5 & 4 & 30 \\ \hline \text{Demand} & 10 & 25 & 15 & 50 \end{array} \)
- A. 225Correct
- B. 165
- C. 210
- D. 195
Explanation. \(x_{11} = \min(20, 10) = 10\), \(x_{12} = \min(10, 25) = 10\), \(x_{22} = \min(30, 15) = 15\), \(x_{23} = 15\). Cost \(= 10(6) + 10(3) + 15(5) + 15(4) = 60 + 30 + 75 + 60 = 225\).
Q7
In the least cost method, the first allocation for the following transportation problem is
\( \begin{array}{c|ccc|c} & D_1 & D_2 & D_3 & \text{Supply} \\ \hline O_1 & 6 & 3 & 7 & 20 \\ O_2 & 2 & 5 & 4 & 30 \\ \hline \text{Demand} & 10 & 25 & 15 & 50 \end{array} \)
- A. 30 units in cell \((O_2, D_1)\)
- B. 20 units in cell \((O_1, D_2)\)
- C. 10 units in cell \((O_2, D_1)\)Correct
- D. 10 units in cell \((O_1, D_1)\)
Explanation. The least cost in the table is 2, in cell \((O_2, D_1)\). The maximum feasible quantity there is \(\min(30, 10) = 10\) units, which exhausts the demand of \(D_1\).
Q8
Using the least cost method, the total transportation cost (in ₹) of the initial basic feasible solution for the following problem is
\( \begin{array}{c|ccc|c} & D_1 & D_2 & D_3 & \text{Supply} \\ \hline O_1 & 6 & 3 & 7 & 20 \\ O_2 & 2 & 5 & 4 & 30 \\ \hline \text{Demand} & 10 & 25 & 15 & 50 \end{array} \)
- A. 225
- B. 165Correct
- C. 175
- D. 155
Explanation. \((O_2, D_1) = 10\) at cost 2; then least cost 3: \((O_1, D_2) = \min(20, 25) = 20\); \(O_2\) takes the rest: \((O_2, D_2) = 5\), \((O_2, D_3) = 15\). Cost \(= 20 + 60 + 25 + 60 = 165\).
Q9
In Vogel's approximation method, the penalty for a row with unit costs 16, 18, 14 and 10 is
- A. 8
- B. 2
- C. 4Correct
- D. 6
Explanation. The penalty is the difference between the least cost and the next higher cost in the row. The two smallest costs are 10 and 14, so the penalty is \(14 - 10 = 4\). Largest minus smallest (8) is a common mistake.
Q10
For the following problem, Vogel's approximation method makes its first allocation in
\( \begin{array}{c|ccc|c} & D_1 & D_2 & D_3 & \text{Supply} \\ \hline O_1 & 6 & 3 & 7 & 20 \\ O_2 & 2 & 5 & 4 & 30 \\ \hline \text{Demand} & 10 & 25 & 15 & 50 \end{array} \)
- A. row \(O_1\) (penalty 3): 20 units in cell \((O_1, D_2)\)
- B. column \(D_3\) (penalty 3): 15 units in cell \((O_2, D_3)\)
- C. column \(D_1\) (penalty 4): 10 units in cell \((O_1, D_1)\)
- D. column \(D_1\) (penalty 4): 10 units in cell \((O_2, D_1)\)Correct
Explanation. Row penalties: \(O_1\): \(6 - 3 = 3\), \(O_2\): \(4 - 2 = 2\). Column penalties: \(D_1\): 4, \(D_2\): 2, \(D_3\): 3. Largest is 4 (column \(D_1\)); its least cost cell \((O_2, D_1)\) gets \(\min(30, 10) = 10\).
Q11
In the linear programming model of a transportation problem with 3 origins and 4 destinations, the numbers of decision variables \(x_{ij}\) and of supply and demand constraints are
- A. 12 variables and 7 constraintsCorrect
- B. 7 variables and 12 constraints
- C. 12 variables and 6 constraints
- D. 6 variables and 7 constraints
Explanation. There is one variable \(x_{ij}\) for each route, so \(mn = 3 \times 4 = 12\). There are \(m = 3\) supply constraints and \(n = 4\) demand constraints, \(3 + 4 = 7\) in all, besides \(x_{ij} \geq 0\).
Q12
The Hungarian method for assignment problems was devised by Kuhn and Flood (1956). It is called the Hungarian method because its steps are justified by theorems of the Hungarian mathematicians
- A. Hitchcock and Vogel
- B. Koneig and EgervaryCorrect
- C. Kuhn and Flood
- D. Hitchcock and Kuhn
Explanation. The justification of the steps rests on theorems proved by the Hungarian mathematicians Koneig (1950) and Egervary (1953); hence the name Hungarian method.
Q13
In Step 1 of the Hungarian method, the row of costs \((14, 9, 12, 17)\) becomes
- A. \((0, -5, -2, 3)\)
- B. \((5, 0, 3, 8)\)Correct
- C. \((3, 8, 5, 0)\)
- D. \((6, 1, 4, 9)\)
Explanation. Step 1 subtracts the least element of the row from every element of that row. The least element is 9, so the row becomes \((14 - 9, 9 - 9, 12 - 9, 17 - 9) = (5, 0, 3, 8)\).
Q14
The cost matrix (in ₹) for assigning jobs A, B, C to machines I, II, III is as follows. The minimum total cost is
\( \begin{array}{c|ccc} & \text{I} & \text{II} & \text{III} \\ \hline A & 9 & 2 & 7 \\ B & 6 & 4 & 3 \\ C & 5 & 8 & 1 \end{array} \)
- A. ₹9Correct
- B. ₹10
- C. ₹6
- D. ₹14
Explanation. Subtract row minima 2, 3, 1: rows \((7, 0, 5)\), \((3, 1, 0)\), \((4, 7, 0)\). Subtract column minima 3, 0, 0: \((4, 0, 5)\), \((0, 1, 0)\), \((1, 7, 0)\). Assign A to II, C to III, B to I. Cost \(= 2 + 6 + 1 = 9\).
Q15
In the cost matrix below, the optimal assignment is A to II, B to I and C to III, with minimum cost ₹9. If 5 is added to every element of row A, then
\( \begin{array}{c|ccc} & \text{I} & \text{II} & \text{III} \\ \hline A & 9 & 2 & 7 \\ B & 6 & 4 & 3 \\ C & 5 & 8 & 1 \end{array} \)
- A. the schedule changes and the minimum cost stays ₹9
- B. the schedule is unaltered and the minimum cost stays ₹9
- C. the schedule is unaltered and the minimum cost becomes ₹24
- D. the schedule is unaltered and the minimum cost becomes ₹14Correct
Explanation. The optimum assignment schedule remains unaltered if a constant is added to all elements of a row. Row A still contributes exactly one assignment, so the cost rises by 5 only once: \(9 + 5 = 14\).
Q16
An assignment problem has 4 tasks (rows) and 3 men (columns). To solve it by the Hungarian method, we
- A. introduce a dummy column with all entries zeroCorrect
- B. introduce a dummy row with all entries zero
- C. introduce a dummy column with every entry equal to the largest cost
- D. delete the task with the highest costs
Explanation. Since the number of columns is less than the number of rows, the problem is unbalanced. It is balanced by adding a dummy column with all entries zero; the task matched with the dummy column is left unassigned.
Q17
The maximin criterion, which locates the alternative strategy with the least possible loss, is also known as
- A. an optimistic decision criterion
- B. a pessimistic decision criterionCorrect
- C. decision making under certainty
- D. the least cost criterion
Explanation. The maximin criterion chooses the act that maximises the minimum possible pay-off. Since it locates the alternative with the least possible loss, the book calls it a pessimistic decision criterion.
Q18
Using the maximin principle, the best alternative for the following pay-off (profit) matrix is
\( \begin{array}{c|ccc} & E_1 & E_2 & E_3 \\ \hline P & 12 & -6 & 4 \\ Q & -2 & 5 & 9 \\ R & 15 & 3 & -8 \end{array} \)
- A. R, with value 15
- B. P, with value \(-6\)
- C. Q, with value \(-2\)Correct
- D. Q, with value 9
Explanation. Lowest pay-off of each alternative: P: \(-6\), Q: \(-2\), R: \(-8\). The maximum of these is \(\max(-6, -2, -8) = -2\), so alternative Q is chosen.
Q19
Using the minimax principle (choose the alternative whose highest pay-off is the least), the best alternative for the following cost pay-off matrix is
\( \begin{array}{c|ccc} & S_1 & S_2 & S_3 \\ \hline A_1 & 12 & 18 & 9 \\ A_2 & 15 & 14 & 16 \\ A_3 & 20 & 8 & 11 \end{array} \)
- A. \(A_3\), with value 8
- B. \(A_2\), with value 16Correct
- C. \(A_1\), with value 18
- D. \(A_3\), with value 20
Explanation. Highest outcome of each alternative: \(A_1\): 18, \(A_2\): 16, \(A_3\): 20. The minimum of these is \(\min(18, 16, 20) = 16\), so \(A_2\) is chosen.
Q20
A farmer has 3 alternative crops and the rainfall can be in any of 4 states of nature. How many pay-offs does the pay-off table contain?
- A. 7
- B. 12Correct
- C. 81
- D. 64
Explanation. If there are \(k\) alternatives and \(n\) states of nature, there are \(k \times n\) pay-offs. Here \(3 \times 4 = 12\). The value 7 wrongly adds them.
Q21
Consider the statements:
1. Under certainty, only one possible state of nature exists.
2. Under uncertainty, the probability of each state of nature is known.
3. States of nature are outside the decision maker's control.
Which are correct?
- A. 1 and 3 onlyCorrect
- B. 1 and 2 only
- C. 2 and 3 only
- D. 1, 2 and 3
Explanation. Under certainty only one state of nature exists, and states of nature are outside the decision maker's control. Under uncertainty only the pay-offs are known; nothing is known about the likelihood of each state, so statement 2 is false.