GATE 2023 ME · Question 14
Which one of the options given represents the feasible region of the linear programming model:
- A
Region P
- B
Region Q
- C
Region R
- D
Region S
GATE 2023 · Mechanical Engineering · IIT Kanpur
Answer
From the official answer key published by IIT Kanpur.
Worked solution
We plot the boundary lines of the given constraints in the first quadrant ():
1. : Region to the left of the vertical line .
2. : Region below the horizontal line .
3. : The line passes through and . Testing gives (False), so the feasible side lies above this line.
4. : The line passes through and . Testing gives (True), so the feasible side lies below/to the left of this steeper line.
At :
The intersection of and is at .
The bounded region that simultaneously satisfies , , and is the triangular area designated as Region Q.
Answer: (B)
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 2022 ME Set 1 · Q21In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is
- GATE 2022 ME Set 2 · Q42A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the table below provides…
- GATE 2020 ME Set 1 · Q57Two business owners Shveta and Ashok run their businesses in two different states. Each of them, independent…
- GATE 2018 ME Set 2 · Q45The problem of maximizing z = x1 - x2 subject to constraints x1 + x2 ≤ 10, x1 ≥ 0, x2 ≥ 0 and x2 ≤ 5 has
- GATE 2017 ME Set 1 · Q51Two models, P and Q, of a product earn profits of Rs. 100 and Rs. 80 per piece, respectively. Production…
- GATE 2017 ME Set 2 · Q51Maximize Z = 5x1 + 3x2, subject to x1 + 2x2 ≤ 10, x1 - x2 ≤ 8, x1, x2 ≥ 0. In the starting Simplex tableau,…
Question from the official GATE 2023 ME paper, IIT Kanpur. Solutions by PARIXO AI. All 65 questions of this paper.