The GATE Grind

GATE Operations Research: Linear programming and the simplex method – Previous Year Questions

12 GATE previous year questions on Linear programming and the simplex method (Operations Research, Mechanical Engineering) with answers and explanations, from every paper.

12 questions worth 22 marks in all (2 1-mark, 10 2-mark). Asked between 2016 and 2026, so you can see how the topic has been tested over time.

  1. GATE 2017 ME (ME1) Q61 (2 marks, Numerical answer) – Models P and Q earn profits of Rs. 100 and Rs. 80 per piece and take 5 and 3 hours to produce. Available time is 150 hours and total batch size is 40.…
  2. GATE 2016 ME (ME3) Q65 (2 marks, Numerical answer) – A firm produces parts I and II using turning, milling and grinding. Required times (minutes per unit of I, II) and weekly capacity are: turning (12,…
  3. GATE 2016 ME (ME1) Q65 (2 marks, Multiple choice) – Maximize Z=15X1 + 20X2 subject to 12X1 + 4X2 ≥ 36 12X1 − 6X2 ≤ 24 X1, X2 ≥ 0 The above linear programming problem has
  4. GATE 2017 ME (ME2) Q61 (2 marks, Numerical answer) – Maximize Z=5x 1+3x 2 subject to x 1+2x 210, x 1-x 28, x 1,x 20. Initially both variables are nonbasic and Z = 0. The Z value in the next simplex…
  5. GATE 2018 ME (ME2) Q45 (2 marks, Multiple choice) – Maximize z=x 1-x 2 subject to x 1+x 210, x 10, x 20, x 25. The problem has .
  6. GATE 2018 ME (ME1) Q61 (2 marks, Numerical answer) – Minimize 3x+5y subject to 3x+5y15, 4x+9y8, 13x+2y2 and x,y0. The minimum is .
  7. GATE 2020 ME (ME1) Q57 (2 marks, Numerical answer) – Shveta and Ashok independently produce A and B in two states, selling at ₹2000/kg and ₹3000/kg respectively. Each maximizes daily revenue by linear…
  8. GATE 2022 ME (ME2) Q42 (2 marks, Multiple choice) – A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the table below provides quantities of materials M1, M2, and M3…
  9. GATE 2022 ME (ME1) Q21 (1 mark, Multiple choice) – In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is
  10. GATE 2023 ME Q14 (1 mark, Multiple choice) – Which one of the options given represents the feasible region of the linear programming model: Maximize 45X 1 + 60X 2 X 1 45 X 2 50 10X 1 + 10X 2 600…
  11. GATE 2024 ME Q39 (2 marks, Multiple choice) – At the current basic feasible solution (bfs) v 0 (v 0 R5), the simplex method yields the following form of a linear programming problem in standard…
  12. GATE 2026 ME Q46 (2 marks, Multiple choice) – An objective function Z of primal variables (x 1 and x 2) is described below: Minimize Z = 0.07\,x 1 + 0.05\,x 2 subject to 0.1\,x 1 0.4, 0.1\,x 2…