Determine the maximum value of $Z=11 x+7 y$ subject to the constraints:
$2 x+y \leq 6, x \leq 2, x \geq 0, y \geq 0$

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(D) We have to maximize $Z=11 x+7 y$ subject to the constraints:
$2 x+y \leq 6$
$x \leq 2$
$x \geq 0, y \geq 0$
The feasible region is bounded by the lines $2x+y=6$,$x=2$,$x=0$,and $y=0$. The corner points of the shaded region are $O(0,0)$,$A(2,0)$,$B(2,2)$,and $C(0,6)$.
Corner Point Value of $Z = 11x + 7y$
$O(0,0)$ $11(0) + 7(0) = 0$
$A(2,0)$ $11(2) + 7(0) = 22$
$B(2,2)$ $11(2) + 7(2) = 22 + 14 = 36$
$C(0,6)$ $11(0) + 7(6) = 42$

Comparing the values of $Z$ at all corner points,the maximum value is $42$ at the point $(0,6)$.

Explore More

Similar Questions

The feasible region (shaded) for a $LPP$ is shown in the adjacent figure. Maximize $Z = 5x + 7y$.

The corner points of the feasible region of the objective function $Z = 3x + 9y$ are $(0, 10)$,$(5, 5)$,$(15, 15)$,and $(0, 20)$. Then,the minimum value of $Z$ is:

In a linear programming problem $(LPP)$, if the objective function $Z = ax + by$ has the same maximum value at two distinct corner points, then the number of points at which $Z_{max}$ occurs is

For a linear programming problem,the objective function is $Z = 3x + 9y$. The corner points of the feasible region are $(0, 10), (5, 5), (15, 15),$ and $(0, 20)$. The maximum value of $Z$ is . . . . . . .

The feasible solution for a $LPP$ is shown in the figure. Let $z=3x-4y$ be the objective function. The maximum value of $Z$ occurs at $......$

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo