Question:medium

The LPP maximize \(z = 2x+5y\) subject to \(x+3y\leq 6\), \(2x+6y\leq 18\), \(x\geq 0\), \(y\geq 0\) has

Show Hint

Draw the feasible region, find its corners and compare z at each corner.
Updated On: Oct 1, 2026
  • Unique solution
  • Infinite solutions
  • No solution
  • Unbounded feasible region
Show Solution

The Correct Option is A

Solution and Explanation

Step 1: Approach
Check for ties between corners and for unboundedness.

Step 2: Region
Bounded triangle with vertices $(0,0),(6,0),(0,2)$ after removing the redundant constraint $x+3y\le9$.

Step 3: Parallel check
The objective line $2x+5y=$ const has slope $-\dfrac25$, and the edge $x+3y=6$ has slope $-\dfrac13$. They are not parallel, so two corners cannot tie.

Step 4: Values
$z$ is 12 at $(6,0)$, larger than 10 at $(0,2)$. The maximum is unique, option (A).

Final Answer:
The maximum value 12 occurs at only one corner, (6, 0), so the solution is unique, option (A). \[ \boxed{\text{Unique solution}} \]
Was this answer helpful?
0