The GATE Grind

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

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

  1. 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
  2. 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…
  3. 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…
  4. 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…