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

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(A) The lines $x+y=5$ and $x+3y=9$ intersect at $(3,2)$. From the figure,the feasible region is bounded with 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 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$,the minimum value is $21$ at the point $(0,3)$.

Explore More

Similar Questions

Corner points of the bounded feasible region for an $LP$ problem are $(0,4), (6,0), (12,0), (12,16)$ and $(0,10)$. Let $z = 8x + 12y$ be the objective function. Match the following:
$(i)$ Minimum value of $z$ occurs at $\ldots$
$(ii)$ Maximum value of $z$ occurs at $\ldots$
$(iii)$ Maximum of $z$ is $\ldots$
$(iv)$ Minimum of $z$ is $\ldots$

Difficult
View Solution

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

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)$

In the following figure,the feasible region (shaded) for a $LPP$ is shown. Determine the maximum and minimum value of $Z=x+2y$.

Let $x$ and $y$ be optimal solutions of a Linear Programming $(LP)$ problem. Then,which of the following is true?

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