LAISHA
Open Laisha

ASRB NET and ARS / SMS / STO recruitment Operations Research / Quantitative Techniques: practice questions

ASRB NET and ARS / SMS / STO recruitment · India · Agricultural Scientists Recruitment Board (ICAR)

Original practice questions written to the published syllabus · not past papers
10worked here, free
34written to this exam in this subject
15syllabus units

About ASRB NET and ARS / SMS / STO recruitment

ASRB NET and ARS / SMS / STO recruitment is a professional certification run by Agricultural Scientists Recruitment Board (ICAR), for candidates in India. NET: one paper of 150 objective questions at 1 mark each, 2 hours, -1/3 negative, online, English or Hindi, Master's level. ARS: qualifying prelims, then mains 240 and interview 60.

Official site: pw.live.

We have not been able to confirm these details against the exam body's own specification, so fees, dates and pass marks are left out on purpose. Check the current format, eligibility, fees and dates on the official site.

Operations Research / Quantitative Techniques in ASRB NET and ARS / SMS / STO recruitment

Mathematical models for decisions: linear programming, transport and assignment, inventory, queues, decision theory, games, simulation and networks.

Our 34 ASRB NET and ARS / SMS / STO recruitment questions in this subject: 2 easy, 24 medium, 8 hard, across 15 units.

10 practice questions, worked

Choose an answer, then open the working. Each explanation says why the right answer is right and why the others are not.

These 10 were written to ASRB NET and ARS / SMS / STO recruitment and are not shown on any other exam's page.

Question 1 · medium

Three FPOs use staff (single input) to generate turnover (single output). FPO A: 4 staff, turnover 20; FPO B: 6 staff, turnover 36; FPO C: 8 staff, turnover 32 (turnover in the same money units). Under constant returns to scale, the technical efficiency of FPO C is

  1. 1.5
  2. 0.889
  3. 0.667
  4. 0.8
Answer and working

C. 0.667

Output per staff: A 20/4 = 5, B 36/6 = 6, C 32/8 = 4. Under CRS with one input and one output, efficiency = own ratio / best ratio = 4/6 = 0.667. Comparing with A (4/5 = 0.8) uses the wrong benchmark; 32/36 = 0.889 compares outputs while ignoring inputs; 1.5 inverts the ratio and exceeds the upper bound of 1.

Question 2 · medium

A farmer has 3 units of irrigation water for two crops. Returns (thousands) from 0, 1, 2 and 3 units are: crop A 0, 6, 10, 12; crop B 0, 5, 8, 11. What is the maximum total return?

  1. 14 thousand
  2. 12 thousand
  3. 23 thousand
  4. 15 thousand
Answer and working

D. 15 thousand

Enumerate the stage decisions: 0 to A and 3 to B gives 0 + 11 = 11; 1 and 2 gives 6 + 8 = 14; 2 and 1 gives 10 + 5 = 15; 3 and 0 gives 12 + 0 = 12. The best is 2 units to A and 1 to B, return 15. 12 puts all water on A; 14 is the (1, 2) split; 23 adds the two 3-unit returns, which would need 6 units of water.

Question 3 · medium

A dairy farm uses dynamic programming to decide each year whether to keep or replace each cow. In this model the state variable is best described as

  1. the decision to keep or replace
  2. the price of milk, fixed for all years
  3. the total profit of the herd over its lifetime
  4. the cow's current age or lactation number and productivity
Answer and working

D. the cow's current age or lactation number and productivity

In a replacement DP the stage is the period (year or lactation), the state is the condition of the asset (age, lactation, yield level), and the decision is keep or replace. The keep/replace choice is the decision, not the state; lifetime profit is the value function being maximised; a fixed price is a parameter.

Question 4 · medium

Three chilling centres supply 50, 60 and 40 thousand litres of milk; three plants need 40, 70 and 40 thousand litres. Unit costs (per thousand litres) from centre 1 to plants 1, 2, 3 are 2, 7, 4; from centre 2: 3, 3, 1; from centre 3: 5, 4, 7. What is the total cost of the initial solution by the north-west corner rule?

  1. 360
  2. 610
  3. 410
  4. 400
Answer and working

B. 610

North-west corner: x11 = 40 fills plant 1; x12 = 10 empties centre 1; x22 = 60 empties centre 2 and fills plant 2; x33 = 40 finishes. Cost = 40(2) + 10(7) + 60(3) + 40(7) = 80 + 70 + 180 + 280 = 610. 410 is the least-cost method's starting cost and 400 is the true optimum, both of which use the cost matrix; the north-west corner rule ignores costs, so it is usually the most expensive start. 360 is not the cost of any feasible allocation.

Question 5 · hard

A retailer orders fresh coriander daily. Each bunch sold earns a margin of 8; each unsold bunch is a loss of 2. Daily demand is normal with mean 500 and standard deviation 50 bunches. The optimal order quantity is about

  1. 458 bunches
  2. 466 bunches
  3. 500 bunches
  4. 542 bunches
Answer and working

D. 542 bunches

Newsvendor critical ratio = Cu/(Cu + Co) = 8/(8 + 2) = 0.8, and z(0.8) = 0.842. Q = 500 + 0.842 x 50 = 542. 458 uses the ratio Co/(Cu + Co) = 0.2 (orders below the mean when shortage is the costlier error); 500 ignores the cost asymmetry; 466 uses Co/Cu = 0.25 as the service level.

Question 6 · medium

A payoff table for a cold-store owner shows that storing onions is never better and sometimes worse than storing potatoes in every state of the market. Before applying any decision criterion, the onion option should be

  1. given the highest weight under Laplace
  2. kept, because maximax might still choose it
  3. used as the reference for regret
  4. removed as a dominated act
Answer and working

D. removed as a dominated act

An act that is never better and sometimes worse than another in every state is dominated; no criterion that respects dominance (maximax, maximin, regret, Laplace, Hurwicz, EMV) will choose it, so it can be deleted first. Maximax cannot select it because the dominating act has at least as high a maximum.

Question 7 · medium

Two rival dairies compete on promotion. The payoff matrix (market share gain of Dairy A, rows are A's strategies) is: row 1: 5, 3, 4; row 2: 6, 4, 7; row 3: 2, 1, 8. What is the value of the game?

  1. 5
  2. 6
  3. 4
  4. 3
Answer and working

C. 4

Row minima: 3, 4, 1; maximin = 4 (row 2). Column maxima: 6, 4, 8; minimax = 4 (column 2). Maximin = minimax = 4, so there is a saddle point at row 2, column 2, and the value is 4 with pure strategies. 3 is row 1's minimum; 6 is column 1's maximum; 5 is not a saddle element.

Question 8 · easy

A sugar mill's cane yard has several stages (weighbridge, unloading, empty-truck weighing) with non-exponential service times and shift-dependent arrivals. The most suitable tool to evaluate alternative yard layouts is

  1. the Hungarian method
  2. the graphical LP method
  3. discrete-event simulation
  4. the M/M/1 formulas
Answer and working

C. discrete-event simulation

Analytical queuing formulas need specific assumptions (Poisson arrivals, exponential service, a single stage) that this system violates. Simulation can represent several stages, any distributions and changing arrival patterns. The Hungarian method and graphical LP address different problems altogether.

Question 9 · medium

Farmers buy seed from company X or company Y. Each season 85 percent of X's buyers stay with X and 15 percent switch to Y; 75 percent of Y's buyers stay and 25 percent switch to X. Current shares are X 40 percent and Y 60 percent. Next season, X's share will be

  1. 21 percent
  2. 34 percent
  3. 49 percent
  4. 79 percent
Answer and working

C. 49 percent

X's next share = (X keeps 85 percent of 40) + (Y loses 25 percent of 60 to X) = 0.34 + 0.15 = 0.49, that is 49 percent. 79 adds both retention rates, mixing X and Y; 34 counts only retained X buyers; 21 adds only the switchers.

Question 10 · hard

A cow's health state each month is Healthy (H) or Sick (S). P(H to H) = 0.6, P(H to S) = 0.4, P(S to H) = 0.3, P(S to S) = 0.7. A cow is healthy now. What is the probability that she is sick two months from now?

  1. 0.52
  2. 0.16
  3. 0.28
  4. 0.4
Answer and working

A. 0.52

Two-step probability = P(H to H) P(H to S) + P(H to S) P(S to S) = 0.6(0.4) + 0.4(0.7) = 0.24 + 0.28 = 0.52, the (H, S) element of P squared. 0.4 is the one-step probability; 0.16 is 0.4 squared (sick, then 'sick to sick' taken as 0.4); 0.28 counts only the path through S and misses the path that stays healthy for one month.

A study plan for Operations Research / Quantitative Techniques in ASRB NET and ARS / SMS / STO recruitment

This plan follows where our questions actually fall, so the time goes where the marks are likely to be. It is our reading of the syllabus, not the exam body's weighting.

  1. First, the heavy units (44% of the 34 questions): Inventory models: EOQ, Q and P systems (4, 12%); Transportation problems (4, 12%); Queuing models (3, 9%); Assignment problems (2, 6%); Data envelopment analysis (2, 6%).

    Read the manual chapters for these first and do every worked question you can find on them.

  2. Then the middle band: Decision criteria: maximax, maximin, regret and Laplace (2, 6%); Decision trees and expected value of perfect information (2, 6%); Duality (2, 6%); Graphical and simplex methods (2, 6%); Introduction to dynamic programming (2, 6%).

    Aim for one sitting per unit, then mixed questions across them.

  3. Then the lighter units: Linear programming formulation (2, 6%); Markov chains (2, 6%); Network analysis (2, 6%); Simulation (2, 6%); Two-person zero-sum games (1, 3%).

    Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.

  4. Leave time for the hard ones: Decision trees and expected value of perfect information (1 hard of 2), Duality (1 hard of 2), Graphical and simplex methods (1 hard of 2).

    Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.

  5. Bank the easy marks: Simulation (1 easy of 2); Inventory models: EOQ, Q and P systems (1 easy of 4).

    Do these early in revision so they are fast on the day.

  6. Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.

Last updated · How Laisha writes and checks its pages · Report a mistake

Ask Laisha about this

Opens Laisha's chat with your question ready to send. Sign in or start free.

Unlock every question — ASRB NET and ARS / SMS / STO recruitment Operations Research / Quantitative Techniques

US$10 a month · one price worldwide · cancel any time

  • Every practice question in this subject, with full working
  • Timed exam papers and progress by unit
  • Ask Laisha to explain any answer — up to 1,000 questions a month
Free or Smarter
FreeSmarter
Grow guides, pest pages, articlesRead allRead all
Ask Laisha5 a dayUp to 1,000 a month
Exam practiceThe sample on each pageEvery question, timed papers
Crop calendar and pest alerts—For your own fields
Calculators and tools—All
Uploads and reports—100 a month, real files
10 days free for every new account, no card.