The feasible region for a $LPP$ is shown in the figure. Find the maximum value of $Z=11x+7y$.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(47) The feasible region is bounded by the corner points $C(0,3)$,$A(3,2)$,and $B(0,5)$.
We evaluate the objective function $Z=11x+7y$ at each corner point:
Corner Point $(x, y)$Value of $Z = 11x + 7y$
$C(0, 3)$$11(0) + 7(3) = 21$
$A(3, 2)$$11(3) + 7(2) = 33 + 14 = 47$
$B(0, 5)$$11(0) + 7(5) = 35$

Comparing the values of $Z$ at these points,the maximum value is $47$,which occurs at the point $A(3, 2)$.

Explore More

Similar Questions

Solve the Linear Programming Problem graphically:
Maximise $Z = 3x + 4y$
subject to the constraints: $x + y \leq 4, x \geq 0, y \geq 0.$

Show that the minimum of $Z$ occurs at more than two points.
Minimise and Maximise $Z = 5x + 10y$
subject to $x + 2y \leq 120, x + y \geq 60, x - 2y \geq 0, x, y \geq 0$.

Corner points of the feasible region determined by the system of linear constraints are $(0,3)$,$(1,1)$ and $(3,0)$. Let $Z = px + qy$,where $p, q > 0$. The condition on $p$ and $q$ so that the minimum value of $Z$ occurs at $(3,0)$ and $(1,1)$ is . . . . . . .

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$

For a linear programming problem,the objective function is $Z = 3x + 2y$. If the corner points of the bounded feasible region are $(12, 0)$,$(4, 2)$,$(1, 5)$,and $(1, 10)$,then the maximum 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