Class 12 Business Maths - Operations Research MCQ Questions
Class 12 Business Mathematics and Statistics Unit 10, Operations Research, covers transportation problems and initial basic feasible solutions by the North-West Corner rule, least cost method and Vogel's approximation method, assignment problems solved by the Hungarian method, and decision theory with the maximin and minimax criteria for choosing the best action.
Study this chapter
Asked in previous board exams
20 questions from this chapter came in 12 past public exams. Open any of them to see the answer and explanation.
-
March 2026
North-West corner refers to ______.See answer in the solved paper →
-
March 2026
In a non-degenerate solution number of allocations is :See answer in the solved paper →
-
March 2025
Solution for transportation problem using ________ method is nearer to an optimal solution.See answer in the solved paper →
-
Supplementary June 2025
Number of basic allocation in any row or column in an assignment problem can be :See answer in the solved paper →
-
March 2025
The transportation problem is said to be unbalanced if ________.See answer in the solved paper →
-
Supplementary June 2025
A type of decision-making environment is :See answer in the solved paper →
-
March 2024
In an assignment problem the value of decision variable \(x_{ij}\) is :See answer in the solved paper →
-
March 2024
In a non-degenerate solution number of allocations is :See answer in the solved paper →
-
Supplementary June 2024
Number of basic allocation in any row or column in an assignment problem can be :See answer in the solved paper →
-
Supplementary June 2024
A type of decision-making environment is :See answer in the solved paper →
-
March 2023
The transportation problem is said to be unbalanced if ________.See answer in the solved paper →
-
Supplementary June 2023
The transportation problem is said to be unbalanced if :See answer in the solved paper →
About Operations Research
Medium ~150 min study
Operations Research is an analytical method of problem solving and decision making that is useful in management. Unit 10 of the Tamil Nadu State Board Class 12 Business Mathematics and Statistics book studies three such tools: the transportation problem, the assignment problem and decision theory.
The transportation problem, formulated by Frank Lauren Hitchcock in 1941, asks how much to send from each origin to each destination so that the total transportation cost is the least. The assignment problem gives one job to one machine at the least total cost. Decision theory helps a manager choose the best act when the state of nature is not under his control.
This page collects the book-back one-mark questions and additional practice questions with full working, so that students can revise the methods step by step before the board examination.
What you'll learn
- Formulate transportation and assignment problems as linear programming models.
- Distinguish between transportation and assignment problems.
- Find an initial basic feasible solution by the NWC rule, least cost method and VAM.
- Identify degenerate and non-degenerate basic feasible solutions.
- Solve assignment problems, including unbalanced ones, by the Hungarian method.
- Choose the best alternative using the maximin and minimax criteria.
Before you start
- Reading rows and columns of a table or matrix.
- Basic ideas of linear programming: objective function and constraints.
- Comfort with addition, subtraction and finding minimum and maximum values.
Topics covered in this chapter
Operations Research explained
What the unit covers
Transportation problem
There are m origins with supplies and n destinations with demands. The aim is to minimise the total cost subject to supply and demand constraints. The problem is balanced when total supply equals total demand.
Basic feasible solutions
A basic feasible solution has not more than m + n - 1 allocations. It is non-degenerate with exactly m + n - 1 allocations in independent positions and degenerate with fewer.
Initial solution methods
- North-West Corner rule: start at the top left cell and allocate the minimum of supply and demand.
- Least cost method: allocate as much as possible to the cheapest cell first.
- Vogel's approximation method: use penalties, the difference of the two smallest costs, to pick a row or column; it gives a solution close to the optimum.
Assignment problem
A special case of the transportation problem where every supply and demand is 1 and each decision variable is 1 or 0. The Hungarian method reduces rows and columns and assigns zeros until each row and column has exactly one assignment.
Decision theory
Acts, states of nature and pay-offs form a pay-off matrix. Under uncertainty, the maximin criterion picks the best of the worst pay-offs and the minimax criterion picks the least of the highest pay-offs.
Common mistakes to avoid
- Taking the VAM penalty as largest minus smallest cost. The penalty is the difference between the two smallest costs of the row or column.
- Starting the least cost or VAM process without checking balance. First confirm that total supply equals total demand.
- Adding a dummy row with non-zero costs. A dummy row or column in an assignment problem has all entries zero.
- Counting allocations against m + n instead of m + n - 1 when testing degeneracy.
- Mixing up maximin and minimax. Maximin takes row minima and picks the largest; minimax takes row maxima and picks the smallest.
Test yourself on these with the practice test, then check the worked reasoning in the solved MCQs.
Frequently asked questions
When is a transportation problem balanced?
It is balanced when total supply equals total demand. Only then can an initial basic feasible solution be found directly; otherwise the problem is unbalanced.
How many allocations does a non-degenerate solution have?
Exactly m + n - 1 allocations in independent positions, where m is the number of rows and n the number of columns. Fewer allocations make the solution degenerate.
Which initial method is closest to the optimum?
Vogel's approximation method usually gives an initial basic feasible solution very close to the optimum, better than the North-West Corner rule and the least cost method.
What is the penalty in Vogel's approximation method?
For each row and column it is the difference between the least cost and the next higher cost. The row or column with the largest penalty is chosen for allocation.
How is an assignment problem a special case of the transportation problem?
The numbers of sources and destinations are equal, and the supply at each source and the demand at each destination are 1, so each row and column has exactly one assignment.
What is the difference between maximin and minimax?
Maximin chooses the act with the largest of the minimum pay-offs and is called pessimistic. Minimax chooses the act with the least of the maximum pay-offs.
Last updated 22 October 2026