LAISHA
Open Laisha

State statistical services Optimization Techniques for Statisticians: practice questions

State statistical services: Statistical Officer / Assistant Statistical Officer (State PSCs and selection boards) · India · State Public Service Commissions and Subordinate Service Selection Boards

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

About State statistical services

State statistical services: Statistical Officer / Assistant Statistical Officer (State PSCs and selection boards) is a government recruitment exam run by State Public Service Commissions and Subordinate Service Selection Boards, for candidates in India. Varies by state: usually an objective screening test in statistics and general studies, some with a descriptive paper and interview.

Official site: mospi.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 State statistical services

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 61 State statistical services questions in this subject: 17 easy, 36 medium, 8 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 State statistical services and are not shown on any other exam's page.

Question 1 · easy

Which assumption of LP is violated when fractional animals cannot be kept?

  1. Proportionality
  2. Additivity
  3. Certainty
  4. Divisibility
Answer and working

D. Divisibility

Divisibility allows fractional activity levels; integer requirements need integer programming.

Question 2 · easy

Which variable converts a ≤ constraint into an equation in the simplex method?

  1. A dual variable
  2. A surplus variable
  3. A slack variable
  4. An artificial variable
Answer and working

C. A slack variable

Slack = unused resource, added to ≤ constraints; surplus is subtracted from ≥ constraints.

Question 3 · hard

Why do modern solvers also use interior-point methods for very large LPs?

  1. They always give integer solutions
  2. They avoid the need for constraints
  3. They give exact shadow prices without duality
  4. Polynomial worst-case complexity
Answer and working

D. Polynomial worst-case complexity

Simplex is fast in practice but has exponential worst cases; interior-point methods have polynomial complexity and suit very large sparse problems.

Question 4 · easy

Which algorithm solves the assignment problem efficiently?

  1. Vogel's approximation
  2. The two-phase method
  3. The Hungarian method
  4. The north-west corner rule
Answer and working

C. The Hungarian method

The Hungarian method exploits the assignment structure; NW corner and Vogel give initial transportation solutions.

Question 5 · hard

What does a Gomory cut do?

  1. Removes integer points to speed the search
  2. Converts the IP into a transportation problem
  3. Fixes all variables at zero
  4. Cuts off the fractional optimum only
Answer and working

D. Cuts off the fractional optimum only

A valid inequality derived from the tableau cuts off the current fractional vertex while keeping every integer solution.

Question 6 · medium

A binary-variable model requires that at most 2 of 5 irrigation projects be chosen. How is this written?

  1. Σδⱼ = 2.5
  2. δ₁ + δ₂ ≤ 5
  3. δ₁δ₂ ≤ 2
  4. δ₁ + δ₂ + δ₃ + δ₄ + δ₅ ≤ 2
Answer and working

D. δ₁ + δ₂ + δ₃ + δ₄ + δ₅ ≤ 2

With δⱼ ∈ {0, 1}, the sum counts chosen projects.

Question 7 · medium

What does the Lagrange multiplier of a constraint measure?

  1. The number of binding constraints
  2. The constraint's marginal value
  3. The value of the objective
  4. The step size of the algorithm
Answer and working

B. The constraint's marginal value

λ = ∂f*/∂b, the shadow price of the constraint.

Question 8 · medium

What type of problem is E-V (mean-variance) farm planning?

  1. An assignment problem
  2. A quadratic programme
  3. A linear programme
  4. A dynamic programme
Answer and working

B. A quadratic programme

The objective x′Σx is quadratic with linear constraints.

Question 9 · medium

Four units of water go to crops A, B, C with returns A: 0, 5, 9, 12, 14; B: 0, 4, 8, 11, 13; C: 0, 6, 10, 12, 13 (for 0-4 units). What is the maximum total return?

  1. 20
  2. 18
  3. 19
  4. 14
Answer and working

C. 19

The DP recursion gives 19, reached by several allocations such as (1, 1, 2) and (2, 1, 1). 14 gives all water to A.

Question 10 · easy

How many possible one-to-one assignments exist for 4 tractors and 4 fields?

  1. 4
  2. 256
  3. 16
  4. 24
Answer and working

D. 24

n! = 4! = 24; 16 = 4² counts cells, not assignments.

A study plan for Optimization Techniques for Statisticians in State statistical services

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 (61% of the 61 questions): Simplex method, Big-M and two-phase methods (10, 16%); Transportation and assignment problems (10, 16%); Duality and sensitivity analysis (9, 15%); Integer programming: branch and bound (8, 13%).

    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 and graphical solution (8, 13%); Dynamic programming (6, 10%); Non-linear programming: Lagrange multipliers and Kuhn-Tucker conditions (4, 7%); Goal programming for multi-objective farm planning (3, 5%).

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

  3. Then the lighter units: Quadratic programming and risk programming (MOTAD) (2, 3%); Numerical optimisation: gradient, Newton and quasi-Newton methods (1, 2%).

    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), Integer programming: branch and bound (2 hard of 8), Duality and sensitivity analysis (2 hard of 9).

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

  5. Bank the easy marks: Numerical optimisation: gradient, Newton and quasi-Newton methods (1 easy of 1); Linear programming: formulation and graphical solution (4 easy of 8).

    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 — State statistical services 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.