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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) The shaded region is bounded by the corner points $O(0,0)$,$A(7,0)$,$B(3,4)$,and $C(0,2)$.
We evaluate the objective function $Z = 5x + 7y$ at each corner point:
Corner Point Value of $Z = 5x + 7y$
$O(0,0)$ $5(0) + 7(0) = 0$
$A(7,0)$ $5(7) + 7(0) = 35$
$B(3,4)$ $5(3) + 7(4) = 15 + 28 = 43$
$C(0,2)$ $5(0) + 7(2) = 14$

Comparing the values of $Z$,the maximum value is $43$,which occurs at the point $B(3,4)$.

Explore More

Similar Questions

Corner points of the feasible region for an $\operatorname{LPP}$ are $(0,2), (3,0), (6,0), (6,8)$ and $(0,5)$. Let $F = 4x + 6y$ be the objective function. Find the value of $\text{Maximum of } F - \text{Minimum of } F$.

The corner points of the feasible region are $A(0,0)$,$B(16,0)$,$C(8,16)$,and $D(0,24)$. The minimum value of the objective function $z = 300x + 190y$ is . . . . . . .

The corner points of the feasible region determined by the system of linear constraints are $(2, 72)$,$(15, 20)$,and $(40, 15)$. Let $Z = 6x + 3y$ be the objective function. The minimum value of $Z$ occurs at:

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 . . . . . . .

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