Question
Solve the Linear Programming Problem graphically:
Minimize $Z = 30x + 20y$ Subject to
$x+y \leq 8$
$x+4 y \geq 12$
$5 x+8 y=20$
$x, y \geq 0$
Minimize $Z = 30x + 20y$ Subject to
$x+y \leq 8$
$x+4 y \geq 12$
$5 x+8 y=20$
$x, y \geq 0$
✓
Answer
First, we will convert the given inequations into equations, we obtain the following equations:
$x + y = 8 x + 4 y = 12 x = 0$ and $y = 0$
$5x + 8 y = 20$ is already an equation.
Region represented by $x+y \leq 8$ The line $x+y=8$ meets the coordinate axes at $A(8,0)$ and $B(0,8)$ respectively.
By joining these points we obtain the line $x+y=8$.
Clearly $(0,0)$ satisfies the inequation $x+y \leq 8.50$, the region in $x y$ plane which contain the origin represents the solution set of the inequation $x+y \leq 8$.
Region represented by $x+4 y \geq 12$ :
The line $x+4 y=12$ meets the coordinate axes at $C(12,0)$ and $D(0,3)$ respectively.
By joining these points we obtain the line $x+$
$4 y=12$. Clearly $(0,0)$ satisfies the inequation $x+4 y \geq 12$.
So, the region in $x y$ plane which does not contain the origin represents the solution set of the inequation $x+4 y \geq 12$.
The line $5 x +8 y =20$ is the line that passes through $E (4,0)$ and $F\left(0, \frac{5}{2}\right)$ Region represented by $x \geq 0$ and $y \geq 0$ :
since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations $x \geq 0$ and $y \geq 0$.
The feasible region determined by subject to the constraints arex $+y \leq 8, x+4 y \geq 12,5 x+8 y=20$ and the non $-$ negative restrictions, $x \geq 0$ and $y \geq 0$ are as follows.
The corner points of the feasible region are $ B(0, 8) D(0, 3) \ G\left(\frac{20}{3}, \frac{4}{3}\right)$
The values of objective function at corner points are as follows:
Corner point: $Z = 30x + 20y$
$B(0, 8) 160$
$D(0, 3) : 60$
$G\left(\frac{20}{3}, \frac{4}{3}\right): 266.66$
Therefore, the minimum value of objective function $Z$ is $60$ at the point $D(0, 3)$
Hence $, x = 0$ and $y = 3$ is the optimal solution of
the given $\text{LPP}$.
Thus, the optimal value of objective function $Z$ is $60.$
$x + y = 8 x + 4 y = 12 x = 0$ and $y = 0$
$5x + 8 y = 20$ is already an equation.
Region represented by $x+y \leq 8$ The line $x+y=8$ meets the coordinate axes at $A(8,0)$ and $B(0,8)$ respectively.
By joining these points we obtain the line $x+y=8$.
Clearly $(0,0)$ satisfies the inequation $x+y \leq 8.50$, the region in $x y$ plane which contain the origin represents the solution set of the inequation $x+y \leq 8$.
Region represented by $x+4 y \geq 12$ :
The line $x+4 y=12$ meets the coordinate axes at $C(12,0)$ and $D(0,3)$ respectively.
By joining these points we obtain the line $x+$
$4 y=12$. Clearly $(0,0)$ satisfies the inequation $x+4 y \geq 12$.
So, the region in $x y$ plane which does not contain the origin represents the solution set of the inequation $x+4 y \geq 12$.
The line $5 x +8 y =20$ is the line that passes through $E (4,0)$ and $F\left(0, \frac{5}{2}\right)$ Region represented by $x \geq 0$ and $y \geq 0$ :
since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations $x \geq 0$ and $y \geq 0$.
The feasible region determined by subject to the constraints arex $+y \leq 8, x+4 y \geq 12,5 x+8 y=20$ and the non $-$ negative restrictions, $x \geq 0$ and $y \geq 0$ are as follows.
The corner points of the feasible region are $ B(0, 8) D(0, 3) \ G\left(\frac{20}{3}, \frac{4}{3}\right)$
The values of objective function at corner points are as follows:
Corner point: $Z = 30x + 20y$
$B(0, 8) 160$
$D(0, 3) : 60$
$G\left(\frac{20}{3}, \frac{4}{3}\right): 266.66$
Therefore, the minimum value of objective function $Z$ is $60$ at the point $D(0, 3)$
Hence $, x = 0$ and $y = 3$ is the optimal solution of
the given $\text{LPP}$.
Thus, the optimal value of objective function $Z$ is $60.$
Need a full question paper?
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
Explore more
Similar questions
Solve the following equation for x:
$\tan^{-1}(2+\text{x})+\tan^{-1}(2-\text{x})=\tan^{-1}\frac{2}{3},$ where $\text{x}<-\sqrt3$ or, $\text{x}>\sqrt3$
→$\tan^{-1}(2+\text{x})+\tan^{-1}(2-\text{x})=\tan^{-1}\frac{2}{3},$ where $\text{x}<-\sqrt3$ or, $\text{x}>\sqrt3$
A factory has two machines A and B. Past records show that the machine A produced 60% of the items of output and machine B produced 40% of the items. Further 2% of the items produced by machine A were defective and 1% produced by machine B were defective. If an item is drawn at random, what is the probability that it is defective?
Integrate the function $\sqrt{x^{2}+3 x}$
→Evaluate the following:
$\int\frac{\sin\text{x}+\cos\text{x}}{\sqrt{1+\sin2\text{x}}}\text{dx}$
→$\int\frac{\sin\text{x}+\cos\text{x}}{\sqrt{1+\sin2\text{x}}}\text{dx}$
Find which of the binary operations are commutative and which are associative.
Let A = N × N and * be the binary operation on A defined by:
(a, b) * (c, d) = (a + c, b + d)
Let A = N × N and * be the binary operation on A defined by:
(a, b) * (c, d) = (a + c, b + d)
Find a vactor of magnitude $\sqrt{171}$ which is perpendicular to both of the vectors $\vec{\text{a}}=\hat{\text{i}}+2\hat{\text{j}}-3\hat{\text{k}}$ and $\vec{\text{b}}=3\hat{\text{i}}-\hat{\text{j}}+2\hat{\text{k}}.$
→Find the image of the point (1, 2, 3) in the plane x + 2y + 4z = 38.
Evaluate the following integrals:
$\int\limits^{{\pi}}_{-\frac{\pi}{2}}\sin^{-1}(\sin\text{x})\text{dx}$
→$\int\limits^{{\pi}}_{-\frac{\pi}{2}}\sin^{-1}(\sin\text{x})\text{dx}$
Show that the line through the points (4, 7, 8) and (2, 3, 4) is parallel to the line through the points (-1, -2, 1) and, (1, 2, 5).
Find the points at which the function f given by $\text{f}\text{(x)}=\text{(x}-2)^4(\text{x}+1)^3$ has:
→- local maxima.
- local minima.
- point of inflexion.