LAISHA
Open Laisha

ICAR AICE-JRF/SRF Optimization Techniques for Statisticians: practice questions

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) · India · National Testing Agency for ICAR

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

About ICAR AICE-JRF/SRF

ICAR AICE-JRF/SRF - Agricultural Statistics, Computer Application, Bioinformatics (PhD admission and fellowship) is a PhD, fellowship and lectureship exam run by National Testing Agency for ICAR, for candidates in India. Computer-based test, 2 hours, 120 MCQs, +4 / -1 (Part A general, Part B core group, Part C subject). 2026 exam held with AIEEA-PG in July 2026.

Source: icar.org.in.

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

Optimization Techniques for Statisticians in ICAR AICE-JRF/SRF

LP formulation, graphical solution, simplex (including Big-M and two-phase), duality and shadow prices, transportation (initial solutions, MODI) and assignment (Hungarian method).

The optimisation theory statisticians use: linear programming with simplex and duality, transportation and assignment, integer and goal programming for farm and crop planning, non-linear optimisation with Kuhn-Tucker conditions, and the numerical optimisers inside likelihood estimation. The Agribusiness track teaches operations research for managers; this goes to the theory.

Our 64 ICAR AICE-JRF/SRF questions in this subject: 14 easy, 32 medium, 18 hard, across 10 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 · medium

An LP's objective line is parallel to a binding constraint edge at the optimum. What does this mean?

  1. Alternative optima exist
  2. The solution is degenerate
  3. The problem is unbounded
  4. The problem is infeasible
Answer and working

A. Alternative optima exist

Every point on the edge gives the same optimal value.

Question 2 · medium

Phase I of the two-phase method ends with a positive minimum sum of artificial variables. What does this mean?

  1. The optimum is degenerate
  2. The problem is infeasible
  3. Phase II can start
  4. The problem is unbounded
Answer and working

B. The problem is infeasible

A positive minimum means no feasible solution makes all artificials zero.

Question 3 · medium

Land has a shadow price of 20 thousand currency units per hectare. Renting more land costs 15 per hectare. What should the farmer do?

  1. Sell land at 15
  2. Rent none, since the price is positive
  3. Rent more, within the RHS range
  4. Rent unlimited land
Answer and working

C. Rent more, within the RHS range

Each extra hectare adds 20 at a cost of 15, but only within the range over which the shadow price stays valid.

Question 4 · medium

Tractor-field costs are [[9, 2, 7], [6, 4, 3], [5, 8, 1]]. What is the minimum total assignment cost?

  1. 6
  2. 13
  3. 9
  4. 12
Answer and working

C. 9

Tractor 1 → field 2 (2), tractor 2 → field 1 (6), tractor 3 → field 3 (1): total 9, as the Hungarian method finds. 6 takes each tractor's cheapest field, which puts two tractors on field 3.

Question 5 · medium

An assignment problem maximises yields of varieties at sites. How is it converted for the Hungarian method?

  1. Sort each row in descending order
  2. Subtract entries from the maximum
  3. Take reciprocals of all entries
  4. Multiply all entries by −1 and add n
Answer and working

B. Subtract entries from the maximum

Regret = maximum − entry turns maximisation into minimisation; negating also works but the standard device is subtraction from the maximum.

Question 6 · medium

For a peak-labour goal of at most 20 days, which deviation is minimised?

  1. d⁻, the shortfall
  2. Neither deviation
  3. d⁺, the excess
  4. Both deviations equally
Answer and working

C. d⁺, the excess

Using fewer than 20 days is acceptable; exceeding it is the unwanted deviation.

Question 7 · medium

Why does mixing crops with imperfectly correlated returns reduce farm income risk?

  1. It makes returns normally distributed
  2. Imperfect correlation lowers total variance
  3. It removes all variance
  4. It raises expected income
Answer and working

B. Imperfect correlation lowers total variance

Var(Σxⱼcⱼ) includes covariances; correlations below 1 make the total variance smaller than the sum of individual contributions.

Question 8 · hard

Which methods solve a Markov decision process?

  1. Branch and bound only
  2. The simplex and MODI methods
  3. Value and policy iteration
  4. Newton-Raphson only
Answer and working

C. Value and policy iteration

Both iterate the Bellman equation for expected values.

Question 9 · hard

After an MLE optimiser converges, why check that the Hessian is negative definite?

  1. To make the gradient zero
  2. To speed up the next run
  3. To confirm a true maximum
  4. To transform the parameters
Answer and working

C. To confirm a true maximum

A stationary point may be a saddle or minimum; the inverse of −H gives the standard errors only at a proper maximum.

Question 10 · easy

What is the dual of the dual of an LP?

  1. A transportation problem
  2. An integer programme
  3. The original primal
  4. The dual itself
Answer and working

C. The original primal

Duality is symmetric: dualising twice returns the primal.

A study plan for Optimization Techniques for Statisticians 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 (55% of the 64 questions): Transportation and assignment problems (10, 16%); Linear programming: formulation and graphical solution (9, 14%); Duality and sensitivity analysis (8, 13%); Simplex method, Big-M and two-phase methods (8, 13%).

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

  2. Then the middle band: Numerical optimisation: gradient, Newton and quasi-Newton methods (6, 9%); Integer programming: branch and bound (5, 8%); Non-linear programming: Lagrange multipliers and Kuhn-Tucker conditions (5, 8%); Quadratic programming and risk programming (MOTAD) (5, 8%).

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

  3. Then the lighter units: Dynamic programming (4, 6%); Goal programming for multi-objective farm planning (4, 6%).

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

  4. Leave time for the hard ones: Dynamic programming (3 hard of 4), Quadratic programming and risk programming (MOTAD) (3 hard of 5), Numerical optimisation: gradient, Newton and quasi-Newton methods (3 hard of 6).

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

  5. Bank the easy marks: Linear programming: formulation and graphical solution (4 easy of 9); Transportation and assignment problems (4 easy of 10).

    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 Optimization Techniques for Statisticians

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.