GATE 2016 ME Set 1 · Question 65
Maximize
subject to
The above linear programming problem has
- A
infeasible solution
- B
unbounded solution
- C
alternative optimum solutions
- D
degenerate solution
GATE 2016 · Mechanical Engineering · Set 1 · IISc Bangalore · printed as Q.55 in the ME section
Answer
From the official answer key published by IISc Bangalore.
Worked solution
To determine the nature of the solution, we analyze the constraints in the first quadrant ():
1. First constraint:
- The boundary line passes through and , and the feasible region lies above this line.
2. Second constraint:
- The boundary line passes through and , and the feasible region lies above this line.
Both constraints require to be greater than or equal to a linear function of . Thus, for any value of , can be chosen arbitrarily large such that:
Since the objective is to maximize and both coefficients are positive, taking yields within the feasible region. Therefore, the problem has an unbounded solution.
Answer: (B) 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 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…
- GATE 2024 ME · Q39At the current basic feasible solution (bfs) v0 ( v0 R5), the simplex method yields the following form of a…
Question from the official GATE 2016 ME paper (Set 1), IISc Bangalore. Solutions by PARIXO AI. All 65 questions of this paper.