GATE 2015 ME Set 3 · Question 61
For the linear programming problem:
The above problem has
- A
unbounded solution
- B
infeasible solution
- C
alternative optimum solution
- D
degenerate solution
GATE 2015 · Mechanical Engineering · Set 3 · IIT Kanpur
Answer
From the official answer key published by IIT Kanpur.
Worked solution
To solve the linear programming problem graphically, consider the constraints in the first quadrant ():
1. :
The boundary line passes through and . Testing gives (true), so the region lies below this line. As , can also increase up to .
2. , which is equivalent to :
The boundary line passes through and . Testing gives (true), so the region lies below this line.
In the first quadrant, both lines have positive slopes:
As , both constraints allow to grow indefinitely without an upper bound on (e.g., along the -axis where , both constraints and are satisfied for all ).
Since the objective is to maximize , we can choose and let , causing .
Thus, the problem has an unbounded solution.
Answer: (A) unbounded solution
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 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…
- GATE 2024 ME · Q39At the current basic feasible solution (bfs) v0 ( v0 R5), the simplex method yields the following form of a…
- GATE 2023 ME · Q14Which one of the options given represents the feasible region of the linear programming model: Maximize 45X1…
- GATE 2022 ME Set 1 · Q21In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is
Question from the official GATE 2015 ME paper (Set 3), IIT Kanpur. Solutions by PARIXO AI. All 65 questions of this paper.