GATE 2013 ME · Question 36
A linear programming problem is shown below.
It has
- A
an unbounded objective function.
- B
exactly one optimal solution.
- C
exactly two optimal solutions.
- D
infinitely many optimal solutions.
GATE 2013 · Mechanical Engineering · IIT Bombay
Answer
From the official answer key published by IIT Bombay.
Worked solution
Consider the constraints and find the intercepts with the coordinate axes in the first quadrant ():
1. : intercepts are and .
2. : intercepts are and .
Since both intercepts of lie strictly inside those of ( and ), the first constraint is redundant and does not bind the feasible region.
The feasible region is bounded by the vertices:
Evaluating the objective function at these corner points:
- At :
- At :
- At :
Even though the objective function is parallel to the redundant constraint , that constraint is inactive. The unique maximum occurs at . Hence, the problem has exactly one optimal solution.
Answer: (B) exactly one optimal 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 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
- 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…
Question from the official GATE 2013 ME paper, IIT Bombay. Solutions by PARIXO AI. All 65 questions of this paper.