Q.
The feasible region for $LPP$ is shown shaded in the figure. Let $f =3 x -4 y$ be the objective function, then maximum value of $f$ is
Linear Programming
Solution:
Construct the following table of values of objective function f.
Corner Point
(0, 0)
(6,12)
(6,16)
(0,4)
Value of $f = 3 x - 4 y$
0
-30
-46
-16
maximum
minimum
| Corner Point | (0, 0) | (6,12) | (6,16) | (0,4) |
| Value of $f = 3 x - 4 y$ | 0 | -30 | -46 | -16 |
| maximum | minimum |