Confirming your payment

Skip to content

Practice Questions · Question 14 of 30

The shaded region OABCD in the figure is the feasible region of a linear programming problem.

Question 141 markMCQMedium

The shaded region OABCDOABCD in the figure is the feasible region of a linear programming problem. It is bounded by the coordinate axes and the lines x+3y=15x + 3y = 15, x+y=7x + y = 7 and 2x+y=122x + y = 12.

Shaded pentagon OABCD bounded by the axes and the lines x + 3y = 15, x + y = 7 and 2x + y = 12, each line draw

At which point does Z=2x+3yZ = 2x + 3y attain its maximum value on this region?

Select your answer
  • (A) (5,2)(5, 2)

  • (B) (215,185)\left(\dfrac{21}{5}, \dfrac{18}{5}\right)

  • (C) (0,5)(0, 5)

  • (D) (3,4)(3, 4)

    Correct answer