LAISHA
Open Laisha

ICAR AICE-JRF/SRF Operations Research / Quantitative Techniques: practice questions

ICAR AICE-JRF/SRF (PhD admission and fellowship) · India · National Testing Agency for ICAR

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

About ICAR AICE-JRF/SRF

ICAR AICE-JRF/SRF (PhD admission and fellowship) is a PhD, fellowship and lectureship exam run by National Testing Agency for ICAR, for candidates in India. LAN-based CBT, 2 hours, 120 MCQs, 480 marks, +4 / -1. 2026 exam on 4 July 2026. 72 subjects at 122 cities.

Source: cdnbbsr.s3waas.gov.in.

Checked against the exam body's published information. Formats and fees change; confirm the current edition there before you book.

Operations Research / Quantitative Techniques in ICAR AICE-JRF/SRF

Heavy unit. LP assumptions, formulation, graphical corner points and special cases (unbounded, infeasible, alternative optima, degeneracy); simplex entering and leaving rules, slack/surplus/artificial variables, Big-M; primal-dual construction, duality theorems, complementary slackness and shadow prices; transportation starting methods (NWC, least cost, VAM), m+n-1 and MODI; Hungarian method; EOQ, reorder point, Q versus P systems; M/M/1 measures and Little's law; maximax, maximin, minimax regret, Laplace, Hurwicz, EMV, EVPI; saddle points and 2x2 mixed games; PERT expected time, variance and completion probability, floats and crashing; Monte Carlo steps; Markov steady state; DEA CCR/BCC and scale efficiency; Bellman's principle.

LP as a farm-planning and least-cost ration tool, shadow prices as marginal value products of farm resources, parametric programming for normative supply response, risk programming (MOTAD), DEA for farm efficiency, and decision analysis under risk.

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

Our 98 ICAR AICE-JRF/SRF questions in this subject: 29 easy, 45 medium, 24 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 ICAR AICE-JRF/SRF and are not shown on any other exam's page.

Question 1 · easy

When a >= constraint is converted to standard form for the simplex method (Big-M or two-phase), what is done?

  1. An artificial variable is subtracted and a slack variable is added
  2. A slack variable is added
  3. A surplus variable is added and nothing else
  4. A surplus variable is subtracted and an artificial added
Answer and working

D. A surplus variable is subtracted and an artificial added

For a >= constraint the surplus variable (amount by which the requirement is exceeded) is subtracted. Because the surplus enters with -1 it cannot serve as a starting basic variable, so an artificial variable is added. A slack is added only to <= constraints.

Question 2 · easy

The 'curse of dimensionality' in dynamic programming refers to

  1. the need for all returns to be linear
  2. the explosive growth in the number of states when there are multiple state variables
  3. the requirement that the problem be split into exactly two stages with linear returns
  4. the impossibility of backward recursion
Answer and working

B. the explosive growth in the number of states when there are multiple state variables

DP evaluates every state at every stage; with several state variables each taking many values, the number of states multiplies and computation becomes infeasible. DP does not require linear returns (its strength is that it handles non-linear ones), backward recursion is its standard method, and it allows any number of stages.

Question 3 · 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 least-cost (matrix minimum) method?

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

A. 410

Cheapest cell first: x23 = 40 at cost 1 (plant 3 filled, centre 2 has 20 left); next cheapest 2: x11 = 40 (plant 1 filled, centre 1 has 10 left); next 3: x22 = 20 (centre 2 empty); next 4: x32 = 40 (centre 3 empty, plant 2 needs 10 more); last x12 = 10 at 7. Cost = 40(1) + 40(2) + 20(3) + 40(4) + 10(7) = 40 + 80 + 60 + 160 + 70 = 410. 610 is the north-west corner cost; 400 is the optimum after MODI improvement. 550 comes from working column by column, taking each plant's cheapest remaining centre.

Question 4 · easy

In the Hungarian method for an n x n assignment problem, an optimal assignment can be made when

  1. the sum of the reduced matrix is zero
  2. the number of zeros equals n squared
  3. every row and every column of the reduced matrix contains at least one zero
  4. the minimum number of lines needed to cover all zeros equals n
Answer and working

D. the minimum number of lines needed to cover all zeros equals n

After row and column reduction, every row and column has a zero, but that alone does not guarantee a one-to-one assignment. Only when the minimum covering lines equal n do n independent zeros exist. The other conditions have no such meaning.

Question 5 · hard

In the Hungarian method, after row and column reduction, the zeros of a 5 x 5 matrix can be covered by only 4 lines. The smallest uncovered element is 3. The next step is to

  1. subtract 3 from every uncovered element and add 3 to every element at the intersection of two lines
  2. subtract 3 from every covered element
  3. subtract 3 from every element of the matrix
  4. add 3 to every uncovered element and subtract 3 from every element at the intersection of two covering lines
Answer and working

A. subtract 3 from every uncovered element and add 3 to every element at the intersection of two lines

Subtracting the smallest uncovered value from uncovered cells creates at least one new zero; adding it at intersections keeps all entries non-negative and is equivalent to subtracting from uncovered rows and adding to covered columns. Other covered cells stay unchanged. The reversed version or subtracting from covered cells can create negative entries or lose zeros.

Question 6 · hard

A village input shop reviews stock every 14 days (P system). Lead time is 2 days, average daily demand is 50 units with a daily standard deviation of 8, and z = 1.28 for the target service level. At a review, the inventory position is 300 units. How much should be ordered?

  1. 500 units
  2. 664 units
  3. 541 units
  4. 438 units
Answer and working

C. 541 units

The P system must protect over P + L = 16 days. Target T = 50 x 16 + 1.28 x 8 x sqrt(16) = 800 + 40.96 = 840.96; order = T - position = 840.96 - 300 = 541 units. 438 protects only the review period and forgets the lead time; 500 omits safety stock; 664 multiplies the standard deviation by 16 instead of sqrt(16).

Question 7 · easy

A farmer chooses among tomato, chilli and okra. Net returns (thousands) under good, average and poor rainfall are: tomato 90, 50, -20; chilli 70, 55, 10; okra 40, 35, 30. Which crop does the maximax criterion choose?

  1. Chilli
  2. Tomato
  3. Okra
  4. Chilli and okra equally
Answer and working

B. Tomato

Row maxima: tomato 90, chilli 70, okra 40; maximax (optimist) picks the largest, tomato. Okra is the maximin choice and chilli is the minimax regret and Laplace choice.

Question 8 · medium

A farmer chooses among tomato, chilli and okra. Net returns (thousands) under good, average and poor rainfall are: tomato 90, 50, -20; chilli 70, 55, 10; okra 40, 35, 30. Probabilities are 0.3, 0.5 and 0.2. What is the expected value of perfect information?

  1. 10 thousand
  2. 25 thousand
  3. 124.5 thousand
  4. 60.5 thousand
Answer and working

A. 10 thousand

With perfect information the farmer picks the best crop in each state: 90 (good), 55 (average), 30 (poor). EPPI = 0.3(90) + 0.5(55) + 0.2(30) = 60.5. Max EMV = 50.5 (chilli). EVPI = 60.5 - 50.5 = 10. 60.5 is EPPI itself; 25 subtracts the lowest EMV; 124.5 adds best payoffs without probabilities.

Question 9 · medium

In PERT, the critical activities of a project have variances of 1, 4, 2.25 and 1.44 weeks squared. The standard deviation of project completion time is

  1. 8.69 weeks
  2. 5.7 weeks
  3. 0.74 weeks
  4. 2.95 weeks
Answer and working

D. 2.95 weeks

Variances of independent activities on the critical path add: 1 + 4 + 2.25 + 1.44 = 8.69; sigma = sqrt(8.69) = 2.95 weeks. 8.69 is the variance; 5.7 adds standard deviations (1 + 2 + 1.5 + 1.2), which is wrong; 0.74 divides the standard deviation by the number of activities.

Question 10 · medium

A pack-house project has activities (weeks): A 3 (start); B 5 (after A); C 4 (after A); D 6 (after B); E 3 (after C); F 2 (after D and E). What is the project duration?

  1. 23 weeks
  2. 12 weeks
  3. 16 weeks
  4. 14 weeks
Answer and working

C. 16 weeks

Forward pass: A 0-3; B 3-8; C 3-7; D 8-14; E 7-10; F starts at max(14, 10) = 14, ends 16. Duration = 16 weeks along the critical path A-B-D-F (3 + 5 + 6 + 2). 12 is path A-C-E-F; 23 adds all activities as if done in series; 14 is the finish of D, forgetting F.

A study plan for Operations Research / Quantitative Techniques in ICAR AICE-JRF/SRF

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 (38% of the 98 questions): Graphical and simplex methods (8, 8%); Transportation problems (8, 8%); Assignment problems (7, 7%); Duality (7, 7%); Inventory models: EOQ, Q and P systems (7, 7%).

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

  2. Then the middle band: Linear programming formulation (7, 7%); Markov chains (7, 7%); Network analysis (7, 7%); Two-person zero-sum games (7, 7%); Data envelopment analysis (6, 6%).

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

  3. Then the lighter units: Decision criteria: maximax, maximin, regret and Laplace (6, 6%); Decision trees and expected value of perfect information (6, 6%); Introduction to dynamic programming (5, 5%); Queuing models (5, 5%); Simulation (5, 5%).

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

  4. Leave time for the hard ones: Data envelopment analysis (2 hard of 6), Assignment problems (2 hard of 7), Duality (2 hard of 7).

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

  5. Bank the easy marks: Introduction to dynamic programming (2 easy of 5); Queuing models (2 easy of 5).

    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 — ICAR AICE-JRF/SRF 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.