ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2023

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

  1. A \((0,2)\) only
  2. B \((3,0)\) only
  3. C 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(4,1) = 4(4) + 6(1) = 22\) \(F(2,3) = 4(2) + 6(3) = 26\) \(F(0,3) = 4(0) + 6(3) = 18\) Minimum value is \(12\). The minimum value occurs at every point on the line segment joining the points \((0,2)\) and \((3,0)\).
From CUET
Explore more questions on app