Confirming your payment

Skip to content

Previous Year Questions · Question 9 of 37

The corner points of the feasible region for the Linear Programming Problem are (0,2),(3,0),(6 , 0),(6,8) and (0,5) .

Question 91 markMCQAsked 2023Easy

The corner points of the feasible region for the Linear Programming Problem are (0,2),(3,0),(6(0,2),(3,0),(6, 0),(6,8)0),(6,8) and (0,5)(0,5). Let the objective function is Z=4x+6yZ=4 x+6 y then the minimum value of the objective function occurs at

Select your answer
  • (A) (0,2)(0,2) only

  • (B) (3,0)(3,0) only

  • (C) The mid-point on the line segment joining the points (0,2)(0,2) and (3,0)(3,0)

  • (D) Any point on the line segment joining the points (0,2)(0,2) and (3,0)(3,0)

    Correct answer