TN Online TestSamacheer Kalvi practice

Operations Research One Mark Online Test (12th Standard Business Mathematics and Statistics)

Share this chapter: Telegram

Pick how many questions you want and set a time limit, then start. You'll get your score at the end with the correct answer and an explanation for every question. Free, in Tamil and English — 34 questions available.

Set up your test

Time remaining00:00
Q1
The transportation problem is said to be unbalanced if _________.
Q2
In a non-degenerate solution, the number of allocations is
Q3
In a degenerate solution, the number of allocations is
Q4
The penalty in VAM represents the difference between the first ________
Q5
The number of basic allocations in any row or column in an assignment problem can be
Q6
North-West Corner refers to ________
Q7
The solution of a transportation problem using the __________ method is nearer to an optimal solution.
Q8
In an assignment problem, the value of the decision variable \(x_{ij}\) is _________.
Q9
If the number of sources is not equal to the number of destinations, the assignment problem is called _______________
Q10
The purpose of a dummy row or column in an assignment problem is to
Q11
The solution for an assignment problem is optimal if
Q12
Decision theory is concerned with
Q13
A type of decision-making environment is
Q14
Who formulated the transportation problem in 1941?
Q15
A feasible solution of an \(m \times n\) transportation problem is called a basic feasible solution if it contains
Q16
Three origins have supplies 25, 35 and 40 units, and three destinations need 30, 25 and 40 units. The transportation problem is
Q17
A transportation problem has 3 origins and 4 destinations. How many allocations does a non-degenerate basic feasible solution have?
Q18
A basic feasible solution of a transportation problem with 4 origins and 3 destinations has only 5 allocations. The solution is
Q19
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} \)
Q20
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} \)
Q21
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} \)
Q22
In Vogel's approximation method, the penalty for a row with unit costs 16, 18, 14 and 10 is
Q23
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} \)
Q24
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
Q25
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
Q26
In Step 1 of the Hungarian method, the row of costs \((14, 9, 12, 17)\) becomes
Q27
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} \)
Q28
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} \)
Q29
An assignment problem has 4 tasks (rows) and 3 men (columns). To solve it by the Hungarian method, we
Q30
The maximin criterion, which locates the alternative strategy with the least possible loss, is also known as
Q31
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} \)
Q32
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} \)
Q33
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?
Q34
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?

More for this chapter

Book Back Questions13 textbook MCQs · solved Additional MCQs21 extra MCQs · solved Book Back TestTest yourself on the textbook set Additional MCQ TestTest yourself on the extra set Study NotesConcepts & methods Formula SheetAll key formulas

About this Operations Research test

This free online practice test covers Operations Research from the 12th Standard Business Mathematics and Statistics (Samacheer Kalvi) syllabus. Choose the number of questions and an optional time limit, then answer and submit; everything is checked in your browser, with the correct answers and a worked explanation shown at the end. For the full solutions to every question in this set, see the solved MCQs page.

More chapters in Business Mathematics and Statistics

View all
1 Applications of Matrices and Determinants 2 Integral Calculus - I 3 Integral Calculus - II 4 Differential Equations 5 Numerical Methods 6 Random Variable and Mathematical Expectation 7 Probability Distributions 8 Sampling Techniques and Statistical Inference 9 Applied Statistics