GATE ST Optimization Techniques for Statisticians: practice questions
GATE - Statistics (ST) · India · IITs and IISc on rotation (2027: IIT Madras)
Original practice questions written to the published syllabus · not past papers
10worked here, free
40written to this exam in this subject
10syllabus units
About GATE ST
GATE - Statistics (ST) is a postgraduate admission exam run by IITs and IISc on rotation (2027: IIT Madras), for candidates in India. Computer-based, 3 hours, 100 marks (15 General Aptitude + 85 subject). MCQ, MSQ and NAT; negative marking on MCQ only; on-screen virtual calculator.
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 GATE ST
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 40 GATE ST questions in this subject: 4 easy, 29 medium, 7 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.
Question 1 · medium
What shape is the feasible region of a linear programme?
A non-convex polygon
Any closed curve
A convex polyhedron
A circle or ellipse
Answer and working
C. A convex polyhedron
Intersections of half-spaces are convex polyhedra.
Question 2 · hard
Mustard's return stays at 30. Over what range of wheat return does the plan (4, 8) remain optimal?
30 to 60
20 to 40
0 to 40
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 3 · easy
Maximise xy subject to x + y = 10. What are x, y and the Lagrange multiplier?
x = y = 5, λ = 5
x = 10, y = 0, λ = 0
x = y = 10, λ = 5
x = y = 5, λ = 25
Answer and working
A. x = y = 5, λ = 5
∂L/∂x = y − λ = 0 and ∂L/∂y = x − λ = 0 with x + y = 10 give x = y = λ = 5; the optimum is 25.
Question 4 · medium
In maximising xy subject to x + y = 10, λ = 5. By about how much does the optimum rise if the constraint becomes x + y = 10.1?
0.05
5
0.1
0.5
Answer and working
D. 0.5
λ is the marginal value of the constraint: Δ ≈ λ × 0.1 = 0.5 (exactly 5.05² − 25 = 0.5025).
Question 5 · medium
Which is NOT one of the KKT conditions for a maximum with constraints gᵢ(x) ≤ bᵢ?
∇f = Σμᵢ∇gᵢ
μᵢ ≥ 0
μᵢ[gᵢ(x) − bᵢ] = 0
μᵢ < 0 for binding constraints
Answer and working
D. μᵢ < 0 for binding constraints
Dual feasibility requires μᵢ ≥ 0; the others are stationarity and complementary slackness (plus primal feasibility).
Question 6 · medium
What does the Lagrange multiplier of a constraint measure?
The number of binding constraints
The constraint's marginal value
The value of the objective
The step size of the algorithm
Answer and working
B. The constraint's marginal value
λ = ∂f*/∂b, the shadow price of the constraint.
Question 7 · medium
What does Target MOTAD penalise?
Shortfalls below a target
The number of crops
Variance above a threshold
All deviations from the mean
Answer and working
A. Shortfalls below a target
It focuses on downside risk relative to a target, closer to farmers' concern with meeting obligations.
Question 8 · easy
What does Bellman's principle of optimality state?
The first decision determines all others
Optimal sub-policies from each state
Optimal policies are unique
Every greedy choice is optimal
Answer and working
B. Optimal sub-policies from each state
This allows backward recursion over stages.
Question 9 · medium
What is the 'curse of dimensionality' in dynamic programming?
Exponential growth of states
Stages grow with time
Returns become non-linear
Recursions diverge
Answer and working
A. Exponential growth of states
Several continuous states make the state space enormous, requiring approximation.
Question 10 · easy
How fast does Newton's method converge near an optimum?
Linearly
Not at all
Sub-linearly
Quadratically
Answer and working
D. Quadratically
The number of correct digits roughly doubles per iteration once close; gradient methods are linear.
A study plan for Optimization Techniques for Statisticians in GATE ST
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.
First, the heavy units (70% of the 40 questions): Numerical optimisation: gradient, Newton and quasi-Newton methods (10, 25%); Non-linear programming: Lagrange multipliers and Kuhn-Tucker conditions (8, 20%); Dynamic programming (5, 13%); Integer programming: branch and bound (5, 13%).
Read the manual chapters for these first and do every worked question you can find on them.
Then the middle band: Goal programming for multi-objective farm planning (3, 8%); Duality and sensitivity analysis (2, 5%); Linear programming: formulation and graphical solution (2, 5%); Quadratic programming and risk programming (MOTAD) (2, 5%).
Aim for one sitting per unit, then mixed questions across them.
Then the lighter units: Simplex method, Big-M and two-phase methods (2, 5%); Transportation and assignment problems (1, 3%).
Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.
Leave time for the hard ones: Duality and sensitivity analysis (1 hard of 2), Numerical optimisation: gradient, Newton and quasi-Newton methods (3 hard of 10), Dynamic programming (1 hard of 5).
Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.
Bank the easy marks: Numerical optimisation: gradient, Newton and quasi-Newton methods (2 easy of 10); Dynamic programming (1 easy of 5).
Do these early in revision so they are fast on the day.
Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.