ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2025

Consider the Linear Programming Problem
Maximize \(z=x+y\)
Subject to the constraints \(x-y \leq-1, x \geq y, x \geq 0, y \geq 0\)
Then which one of the following is TRUE?

  1. A Maximum \(z=3\) at \((1,2)\)
  2. B There is no solution
  3. C Maximum \(z=15\) at \((7,8)\)
  4. D Maximum \(z=10\) at all points on the line \(x-y=-1\)
Verified Solution

Answer & Solution

Correct Answer

(B) There is no solution

Step-by-step Solution

Detailed explanation

\(x-y \leq -1 \implies y \geq x+1\) \(x \geq y\) \(y \geq x+1\) and \(y \leq x \implies x+1 \leq x \implies 1 \leq 0\) No feasible region. There is no solution.
From CUET
Explore more questions on app