LAISHA
Open Laisha

ASRB Agricultural Research Service Optimization Techniques for Statisticians: practice questions

ASRB Agricultural Research Service (ARS) - Agricultural Statistics scientist · India · Agricultural Scientists Recruitment Board (ICAR)

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

About ASRB Agricultural Research Service

ASRB Agricultural Research Service (ARS) - Agricultural Statistics scientist is a government recruitment exam run by Agricultural Scientists Recruitment Board (ICAR), for candidates in India. Combined NET/ARS/SMS/STO recruitment: preliminary (objective), mains (descriptive, discipline paper) and interview for ARS.

Official site: asrb.org.in.

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.

Optimization Techniques for Statisticians in ASRB Agricultural Research Service

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 32 ASRB Agricultural Research Service questions in this subject: 0 easy, 23 medium, 9 hard, across 9 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 Agricultural Research Service and are not shown on any other exam's page.

Question 1 · medium

In a least-cost feed formulation, what are the decision variables?

  1. Number of animals fed
  2. Feed quantities
  3. Prices of the feeds
  4. Nutrient requirements of the animal
Answer and working

B. Feed quantities

The model chooses feed amounts to minimise cost subject to nutrient requirements, which are constraints, with prices as objective coefficients.

Question 2 · medium

A resource constraint is slack at the optimum. What is its shadow price?

  1. The objective value
  2. Undefined
  3. 0
  4. Its unit cost
Answer and working

C. 0

Complementary slackness: a non-binding constraint has a zero dual value; more of the resource adds nothing.

Question 3 · hard

Mustard's return stays at 30. Over what range of wheat return does the plan (4, 8) remain optimal?

  1. 30 to 60
  2. 20 to 40
  3. 0 to 40
  4. 40 to 80
Answer and working

A. 30 to 60

The plan stays optimal while c_wheat/c_mustard lies between the slopes 1 (land) and 2 (labour), i.e. 30 to 60.

Question 4 · hard

In a goal constraint f(x) + d⁻ − d⁺ = g, what does d⁻ measure?

  1. The slack in a resource
  2. Shortfall below target
  3. The goal's weight
  4. Over-achievement of the goal
Answer and working

B. Shortfall below target

d⁻ ≥ 0 is the shortfall below the target; d⁺ the excess above it.

Question 5 · medium

For an income goal of at least 300, which deviation is minimised?

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

C. d⁻, the shortfall

Exceeding a minimum income goal is not penalised.

Question 6 · medium

Why are deviations normalised before weighting in weighted goal programming?

  1. Goals are in different units
  2. To make the problem integer
  3. To remove the constraints
  4. To make all goals equal
Answer and working

A. Goals are in different units

Adding rupees of income shortfall to days of labour excess is meaningless without scaling, for example dividing by targets.

Question 7 · hard

In E-V farm planning, what is minimised?

  1. The mean absolute deviation by LP
  2. Variance for given expected income
  3. The number of activities
  4. Expected income for a given variance
Answer and working

B. Variance for given expected income

Markowitz E-V minimises variance subject to c′x ≥ E and resources; repeating over E traces the frontier.

Question 8 · medium

What is the main caution when estimating risk-programming inputs from past gross margins?

  1. The past need not predict risk
  2. Covariances are always zero
  3. Gross margins have no variance
  4. MOTAD needs no past data
Answer and working

A. The past need not predict risk

Short series, trends and structural change (climate, markets) make historical risk estimates unreliable.

Question 9 · medium

A variance component must stay positive during optimisation. What is a standard device?

  1. Set it to 1
  2. Square it after each step
  3. Optimise over its logarithm
  4. Use the simplex method
Answer and working

C. Optimise over its logarithm

Transforming constrained parameters (log σ², logit p) lets unconstrained optimisers work.

Question 10 · medium

A mixed model reports non-convergence. Which cause is most common?

  1. A bug in every optimiser
  2. Over-parameterisation
  3. Too many observations
  4. Normal residuals
Answer and working

B. Over-parameterisation

Unidentifiable or boundary parameters make the objective flat or constrained; simplifying or reparameterising usually helps.

A study plan for Optimization Techniques for Statisticians in ASRB Agricultural Research Service

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 (63% of the 32 questions): Quadratic programming and risk programming (MOTAD) (9, 28%); Goal programming for multi-objective farm planning (8, 25%); Duality and sensitivity analysis (3, 9%).

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

  2. Then the middle band: Dynamic programming (3, 9%); Linear programming: formulation and graphical solution (3, 9%); Integer programming: branch and bound (2, 6%).

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

  3. Then the lighter units: Numerical optimisation: gradient, Newton and quasi-Newton methods (2, 6%); Non-linear programming: Lagrange multipliers and Kuhn-Tucker conditions (1, 3%); Transportation and assignment problems (1, 3%).

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

  4. Leave time for the hard ones: Integer programming: branch and bound (1 hard of 2), Quadratic programming and risk programming (MOTAD) (3 hard of 9), Duality and sensitivity analysis (1 hard of 3).

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

  5. 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 Agricultural Research Service 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.