If $z = 3x + 4y$ be the objective function of a of a linear programming problem (LPP) and (3, 1), (2, 4), (0, 4), (5, 0) be corner points of the bounded feasible region. Then the maximum value of objective function is

22

The correct answer is Option (3) → 22

$z = 3x + 4y$

At $(3,1)$ → $z = 3(3) + 4(1) = 13$

At $(2,4)$ → $z = 3(2) + 4(4) = 6 + 16 = 22$

At $(0,4)$ → $z = 3(0) + 4(4) = 16$

At $(5,0)$ → $z = 3(5) + 4(0) = 15$

Maximum value = 22 at (2, 4)