LAISHA
Open Laisha

ASRB NET Optimization Techniques for Statisticians: practice questions

ASRB NET - Agricultural Statistics (and Computer Application / Bioinformatics) · India · Agricultural Scientists Recruitment Board (ICAR)

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

About ASRB NET

ASRB NET - Agricultural Statistics (and Computer Application / Bioinformatics) is a professional certification run by Agricultural Scientists Recruitment Board (ICAR), for candidates in India. NET: one objective paper of about 150 questions, 2 hours, negative marking, online, Master's level (pattern as reported for other disciplines).

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 NET

Formulating farm-planning and ration problems, interpreting shadow prices and sensitivity, goal and risk programming in farm planning.

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 59 ASRB NET questions in this subject: 14 easy, 36 medium, 9 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 ASRB NET and are not shown on any other exam's page.

Question 1 · easy

Where does the optimum of a linear programme occur, if it exists?

  1. At the centre of the feasible region
  2. At a vertex of the feasible region
  3. On the boundary only by chance
  4. Where the gradient is zero
Answer and working

B. At a vertex of the feasible region

The fundamental theorem of LP: a linear objective over a convex polyhedron attains its optimum at an extreme point (possibly along a whole edge if there are ties).

Question 2 · medium

A least-cost ration requires more protein than any feed combination within the weight limit can supply. What is the LP?

  1. Unbounded
  2. Degenerate
  3. Infeasible
  4. Optimal at the origin
Answer and working

C. Infeasible

Conflicting constraints leave an empty feasible region.

Question 3 · medium

A maximisation LP's objective can increase without limit. What is the usual cause?

  1. A redundant constraint
  2. A missing constraint
  3. Too many constraints
  4. Degeneracy
Answer and working

B. A missing constraint

Unboundedness in practical models almost always means a resource limit was left out.

Question 4 · medium

Wheat enters the basis; the ratios of right-hand sides to its column entries are 12 (land) and 8 (labour). Which variable leaves?

  1. Wheat itself
  2. Labour's slack
  3. Neither, the problem is unbounded
  4. Land's slack
Answer and working

B. Labour's slack

The minimum-ratio test picks 8, so the labour constraint binds first and its slack leaves.

Question 5 · medium

For the farm LP, the dual is: minimise 12u + 16v subject to u + 2v ≥ 40, u + v ≥ 30. What are u and v at the optimum?

  1. u = 40, v = 0
  2. u = 0, v = 30
  3. u = 20, v = 10
  4. u = 10, v = 20
Answer and working

C. u = 20, v = 10

Both primal variables are positive, so both dual constraints bind: v = 10 and u = 20, giving 12 × 20 + 16 × 10 = 400.

Question 6 · easy

What does strong duality state?

  1. The dual is always infeasible
  2. Only the primal has an optimum
  3. The dual value always exceeds the primal value
  4. Optimal primal and dual values are equal
Answer and working

D. Optimal primal and dual values are equal

Weak duality gives c′x ≤ b′y; strong duality gives equality at the optimum.

Question 7 · medium

What does the reduced cost of a non-basic activity tell a planner?

  1. The return gain needed to enter
  2. The shadow price of land
  3. The dual objective value
  4. Its optimal level
Answer and working

A. The return gain needed to enter

A positive reduced cost (max problem) is the shortfall per unit that keeps the activity out.

Question 8 · easy

A balanced transportation problem has 3 sources and 4 destinations. How many basic (allocated) cells does a non-degenerate basic solution have?

  1. 7
  2. 6
  3. 12
  4. 4
Answer and working

B. 6

m + n − 1 = 3 + 4 − 1 = 6.

Question 9 · medium

What does compromise programming minimise?

  1. The maximum profit
  2. The sum of all deviations
  3. The number of goals
  4. Distance to the ideal point
Answer and working

D. Distance to the ideal point

The ideal point has every objective at its own optimum; compromise solutions minimise a weighted distance to it.

Question 10 · easy

In the farm LP with 12 ha land and 16 labour-days, which constraints bind at the optimum (4, 8)?

  1. Land only
  2. Labour only
  3. Neither
  4. Both land and labour
Answer and working

D. Both land and labour

4 + 8 = 12 ha and 2 × 4 + 8 = 16 days: both resources are fully used, so both have positive shadow prices.

A study plan for Optimization Techniques for Statisticians in ASRB NET

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 (58% of the 59 questions): Linear programming: formulation and graphical solution (9, 15%); Quadratic programming and risk programming (MOTAD) (9, 15%); Duality and sensitivity analysis (8, 14%); Goal programming for multi-objective farm planning (8, 14%).

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

  2. Then the middle band: Transportation and assignment problems (8, 14%); Simplex method, Big-M and two-phase methods (6, 10%); Dynamic programming (4, 7%); Integer programming: branch and bound (4, 7%).

    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, 3%); Non-linear programming: Lagrange multipliers and Kuhn-Tucker conditions (1, 2%).

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

  4. Leave time for the hard ones: Quadratic programming and risk programming (MOTAD) (3 hard of 9), Goal programming for multi-objective farm planning (2 hard of 8), Dynamic programming (1 hard of 4).

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

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

    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 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.