GATE 2017 ME Set 2 · Question 51
Maximize ,
subject to
,
,
.
In the starting Simplex tableau, and are non-basic variables and the value of is zero. The value of in the next Simplex tableau is ________
GATE 2017 · Mechanical Engineering · Set 2 · IIT Roorkee
Answer
From the official answer key published by IIT Roorkee.
Worked solution
In the standard form with slack variables and :
At the initial basic feasible solution, non-basic variables are , giving basic variables , and .
1. Entering variable: The most negative coefficient in the objective row is (for ), so enters the basis.
2. Leaving variable (Minimum ratio test):
The minimum ratio is 8, so leaves the basis.
3. New solution: In the next tableau, takes the value of 8, while remains non-basic ().
Answer: 40
Practise Linear Programming and Simplex Method
14 GATE questions from this chapter, in short untimed sets, with the formula sheet beside them. Free.
More from Linear Programming and Simplex Method
- GATE 2016 ME Set 1 · Q65Maximize Z = 15X1 + 20X2 subject to 12X1 + 4X2 ≥ 36 12X1 - 6X2 ≤ 24 X1, X2 ≥ 0 The above linear programming…
- GATE 2016 ME Set 3 · Q65A firm uses a turning center, a milling center and a grinding machine to produce two parts. The table below…
- GATE 2015 ME Set 3 · Q61For the linear programming problem: arrayll Maximize Z = 3X1 + 2X2 Subject to -2X1 + 3X2 ≤ 9 X1 - 5X2 ≥ -20…
- GATE 2014 ME Set 3 · Q49Consider an objective function Z(x1, x2) = 3x1 + 9x2 and the constraints x1 + x2 ≤ 8, x1 + 2x2 ≤ 4, x1 ≥ 0,…
- GATE 2013 ME · Q36A linear programming problem is shown below. aligned Maximize 3x + 7y Subject to 3x + 7y ≤ 10 4x + 6y ≤ 8 x,…
- GATE 2026 ME · Q46An objective function Z of primal variables (x1 and x2) is described below: Minimize Z = 0.07 x1 + 0.05 x2…
Question from the official GATE 2017 ME paper (Set 2), IIT Roorkee. Solutions by PARIXO AI. All 65 questions of this paper.