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

Determine graphically the minimum value of the objective function
$Z = -50x + 20y$ .....$(1)$
subject to the constraints:
${2x - y \geqslant -5}$ .....$(2)$
${3x + y \geqslant 3}$ .....$(3)$
${2x - 3y \leqslant 12}$ .....$(4)$
${x \geqslant 0, y \geqslant 0}$ .....$(5)$

Maximize the function $Z = 11x + 7y$,subject to the constraints:
$x \leq 3, y \leq 2, x \geq 0, y \geq 0$

The constraints $-x_{1} + x_{2} \leq 1$,$-x_{1} + 3x_{2} \leq 9$,and $x_{1}, x_{2} \geq 0$ define:

The corner points of the feasible region determined by the system of linear inequalities are $(0,3), (1,1)$ and $(3,0)$. Let $Z = px + qy$ where $p, q > 0$. Find the condition on $p$ and $q$ such that the minimum of $Z$ occurs at both $(3,0)$ and $(1,1)$.

The optimal value of the objective function is attained at the points

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