Confirming your payment

Skip to content

Practice Questions · Question 25 of 30

The feasible region of a linear programming problem is the quadrilateral with corner points O(0, 0) , A(8, 0) , B(6…

Question 253 marksMedium

The feasible region of a linear programming problem is the quadrilateral with corner points O(0,0)O(0, 0), A(8,0)A(8, 0), B(6,3)B(6, 3) and C(0,6)C(0, 6). It is cut out by 3x+2y≤243x + 2y \le 24, x+2y≤12x + 2y \le 12, x≥0x \ge 0, y≥0y \ge 0. Let Z=kx+yZ = kx + y, where k>0k > 0.

(i) Find all values of kk for which the maximum value of ZZ occurs at BB.

(ii) For which of these values is BB the only point at which the maximum occurs? What happens at the end values of kk?