ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2023

Corner points of the feasible region for a linear programming problem are \((0,2),(3,0),(6,0),(6,8)\) and \((0,5)\). Let \(F=4 x+6 y\) be the objective function. Then the minimum value of \(F\) occurs at :

  1. A \((0,2)\) only
  2. B \((3,0)\) only
  3. C The mid point of the line segment joining the points \((0,2)\) and \((3,0)\) only
  4. D Every point on the line segment joining the points \((0,2)\) and \((3,0)\)
Verified Solution

Answer & Solution

Correct Answer

(D) Every point on the line segment joining the points \((0,2)\) and \((3,0)\)

Step-by-step Solution

Detailed explanation

\( F(0,2) = 4(0) + 6(2) = 12 \) \( F(3,0) = 4(3) + 6(0) = 12 \) \( F(6,0) = 4(6) + 6(0) = 24 \) \( F(6,8) = 4(6) + 6(8) = 72 \) \( F(0,5) = 4(0) + 6(5) = 30 \) Minimum value \( = 12 \). Minimum occurs at \( (0,2) \) and \( (3,0) \). The minimum value of \(F\) occurs at every…
From CUET
Explore more questions on app