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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(B) We have to maximize $Z = 11x + 7y$,subject to the constraints $x \leq 3, y \leq 2, x \geq 0, y \geq 0$.
The feasible region is a rectangle bounded by the lines $x = 0, x = 3, y = 0,$ and $y = 2$. The corner points of this region are $O(0, 0), A(3, 0), B(3, 2),$ and $C(0, 2)$.
We evaluate $Z$ at these corner points:
Corner PointValue of $Z = 11x + 7y$
$O(0, 0)$$11(0) + 7(0) = 0$
$A(3, 0)$$11(3) + 7(0) = 33$
$B(3, 2)$$11(3) + 7(2) = 33 + 14 = 47$
$C(0, 2)$$11(0) + 7(2) = 14$

The maximum value of $Z$ is $47$ at the point $(3, 2)$.

Explore More

Similar Questions

Solve the Linear Programming Problem graphically:
Maximise $Z = 5x + 3y$
subject to the constraints:
$3x + 5y \leq 15$
$5x + 2y \leq 10$
$x \geq 0, y \geq 0$

The objective function of an $LP$ problem is . . . . . . .

The corner points of the feasible region are $(0,0), (16,0), (8,12), (0,20)$. The maximum and minimum values of $Z = 22x + 18y$ are $m$ and $n$ respectively,then $m + n = \dots$

For the $LP$ problem,minimize $z = 2x + 3y$,the coordinates of the corner points of the bounded feasible region are $A(3, 3), B(20, 3), C(20, 10), D(18, 12),$ and $E(12, 12)$. The minimum value of $z$ is:

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:

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