LAISHA
Open Laisha

Indian Statistical Service Examination Optimization Techniques for Statisticians: practice questions

Indian Statistical Service Examination (with Indian Economic Service) · India · Union Public Service Commission

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

About Indian Statistical Service Examination

Indian Statistical Service Examination (with Indian Economic Service) is a government recruitment exam run by Union Public Service Commission, for candidates in India. Written examination of six papers and a viva voce. Reported scheme: General English 100, General Studies 100, Statistics I and II (objective, 200 each), Statistics III and IV (descriptive, 200 each); viva 200.

Official site: upsc.gov.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 Indian Statistical Service Examination

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 57 Indian Statistical Service Examination questions in this subject: 13 easy, 36 medium, 8 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 Indian Statistical Service Examination and are not shown on any other exam's page.

Question 1 · easy

In a maximisation simplex tableau, which variable usually enters the basis?

  1. The one with the most negative zⱼ − cⱼ
  2. Any artificial variable
  3. The basic variable with the smallest value
  4. The one with the largest positive zⱼ − cⱼ
Answer and working

A. The one with the most negative zⱼ − cⱼ

The most negative coefficient in the objective row promises the fastest improvement per unit.

Question 2 · medium

When are artificial variables needed?

  1. For ≥ and = constraints
  2. Only when the problem is unbounded
  3. For every ≤ constraint
  4. Only in transportation problems
Answer and working

A. For ≥ and = constraints

Slacks give a starting basis for ≤ constraints; ≥ and = constraints need artificials, removed by Big-M or Phase I.

Question 3 · medium

In the farm LP's final tableau the objective row has coefficients 20 for the land slack and 10 for the labour slack. What are they?

  1. The shadow prices of land and labour
  2. The ranges of the right-hand sides
  3. The reduced costs of wheat and mustard
  4. The optimal hectares of wheat and mustard
Answer and working

A. The shadow prices of land and labour

Final objective-row coefficients of slack variables equal the optimal dual values.

Question 4 · easy

What is the dual of: maximise c′x subject to Ax ≤ b, x ≥ 0?

  1. Maximise b′y subject to A′y ≤ c, y ≥ 0
  2. Minimise b′y subject to Ay = c
  3. Minimise c′y subject to Ay ≥ b, y ≥ 0
  4. Minimise b′y subject to A′y ≥ c, y ≥ 0
Answer and working

D. Minimise b′y subject to A′y ≥ c, y ≥ 0

Each primal constraint gives a dual variable; objective and right-hand sides swap, and inequalities reverse.

Question 5 · hard

What does complementary slackness require at an optimal primal-dual pair?

  1. Every primal constraint is slack
  2. Every dual variable is positive
  3. Positive dual variable ⇒ binding constraint
  4. Primal and dual variables are equal
Answer and working

C. Positive dual variable ⇒ binding constraint

yᵢ(bᵢ − aᵢ′x) = 0 and xⱼ(aⱼ′y − cⱼ) = 0.

Question 6 · hard

Which method re-optimises efficiently after a resource level changes and makes the current basis infeasible?

  1. The Big-M method
  2. Branch and bound
  3. The dual simplex method
  4. The Hungarian method
Answer and working

C. The dual simplex method

The basis stays dual feasible (optimal) but primal infeasible; the dual simplex restores feasibility.

Question 7 · medium

For supplies 30, 40, 30, demands 20, 40, 40 and costs [[4, 6, 8], [5, 3, 7], [6, 4, 2]], what is the minimum transport cost?

  1. 360
  2. 380
  3. 340
  4. 320
Answer and working

C. 340

Ship 20 and 10 from centre 1 to warehouses 1 and 3, 40 from centre 2 to warehouse 2, 30 from centre 3 to warehouse 3: 80 + 80 + 120 + 60 = 340, confirmed optimal by MODI.

Question 8 · easy

Total supply exceeds total demand in a transportation problem. What is done?

  1. Delete the cheapest source
  2. Scale all supplies down
  3. Add a dummy source
  4. Add a dummy destination
Answer and working

D. Add a dummy destination

The dummy absorbs the excess supply; a dummy source handles excess demand.

Question 9 · easy

For a maximisation integer programme, what does the LP relaxation's optimum provide?

  1. The integer optimum itself
  2. A feasible integer solution
  3. A lower bound on the integer optimum
  4. An upper bound
Answer and working

D. An upper bound

Dropping integrality enlarges the feasible set, so the LP value cannot be worse.

Question 10 · medium

A DP finds several allocations with the same maximum return. What does this show?

  1. The returns are linear
  2. The recursion has an error
  3. The problem is infeasible
  4. Alternative optima exist
Answer and working

D. Alternative optima exist

Ties in the recursion reveal equally good policies, information a single reported answer would hide.

A study plan for Optimization Techniques for Statisticians in Indian Statistical Service Examination

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 (47% of the 57 questions): Simplex method, Big-M and two-phase methods (10, 18%); Transportation and assignment problems (9, 16%); Duality and sensitivity analysis (8, 14%).

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

  2. Then the middle band: Integer programming: branch and bound (8, 14%); Linear programming: formulation and graphical solution (7, 12%); Dynamic programming (6, 11%).

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

  3. Then the lighter units: Non-linear programming: Lagrange multipliers and Kuhn-Tucker conditions (4, 7%); Goal programming for multi-objective farm planning (3, 5%); Quadratic programming and risk programming (MOTAD) (2, 4%).

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

  4. Leave time for the hard ones: Goal programming for multi-objective farm planning (1 hard of 3), Duality and sensitivity analysis (2 hard of 8), Integer programming: branch and bound (2 hard of 8).

    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 (3 easy of 7); Transportation and assignment problems (3 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 — Indian Statistical Service Examination 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.