ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2023

Let R be the feasible region for a Linear Programming Problem and let \(z=a x+b y\) be the objective function. If R is bounded, then the objective function z has :

  1. A Only maximum value on \(R\)
  2. B Only minimum value on \(R\)
  3. C Both maximum and minimum values on \(R\)
  4. D Neither maximum nor minimum value on \(R\)
Verified Solution

Answer & Solution

Correct Answer

(C) Both maximum and minimum values on \(R\)

Step-by-step Solution

Detailed explanation

Based on the Fundamental Theorem of Linear Programming, if the feasible region R is bounded, the objective function z = ax + by is guaranteed to attain both a maximum and a minimum value on R. These optimal values always occur at the corner points (vertices) of the feasible…
From CUET
Explore more questions on app