The feasible region for a $LPP$ is shown in the following figure. Evaluate $Z = 4x + y$ at each of the corner points of this region. Find the minimum value of $Z$,if it exists.
(N/A) The lines $x + 2y = 4$ and $x + y = 3$ intersect at $(2, 1)$. From the figure,it is an unbounded shaded region with the corner points $A(4, 0)$,$B(2, 1)$,and $C(0, 3)$.
We evaluate $Z = 4x + y$ at these corner points:
The smallest value obtained is $3$ at $(0, 3)$. Since the region is unbounded,we must check if $Z < 3$ has any common points with the feasible region.
Graphing the inequality $4x + y < 3$,we observe that the open half-plane $4x + y < 3$ has no common point with the feasible region. Therefore,the minimum value of $Z$ is $3$ at the point $(0, 3)$.
We evaluate $Z = 4x + y$ at these corner points:
| Corner points | Corresponding value of $Z$ |
| $(4, 0)$ | $Z = 4(4) + 0 = 16$ |
| $(2, 1)$ | $Z = 4(2) + 1 = 9$ |
| $(0, 3)$ | $Z = 4(0) + 3 = 3$ |
The smallest value obtained is $3$ at $(0, 3)$. Since the region is unbounded,we must check if $Z < 3$ has any common points with the feasible region.
Graphing the inequality $4x + y < 3$,we observe that the open half-plane $4x + y < 3$ has no common point with the feasible region. Therefore,the minimum value of $Z$ is $3$ at the point $(0, 3)$.
Explore More
Similar Questions
Show that the minimum of $Z$ occurs at more than two points.
Maximize $Z = -x + 2y$,subject to the constraints:
$x \geq 3, x + y \geq 5, x + 2y \geq 6, y \geq 0$
Maximize $Z = -x + 2y$,subject to the constraints:
$x \geq 3, x + y \geq 5, x + 2y \geq 6, y \geq 0$
Medium
View SolutionThe 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 + 9y$. The corner points of the feasible region are $(0, 10), (5, 5), (15, 15),$ and $(0, 20)$. The maximum value of $Z$ is . . . . . . .
Easy
View SolutionIf an $LPP$ admits an optimal solution at two consecutive vertices of a feasible region,then:
MediumKCET 2017
View Solution$A$ fruit grower can use two types of fertilizer in his garden,brand $P$ and brand $Q$. The amounts (in $kg$) of nitrogen,phosphoric acid,potash,and chlorine in a bag of each brand are given in the table. Tests indicate that the garden needs at least $240\,kg$ of phosphoric acid,at least $270\,kg$ of potash and at most $310\,kg$ of chlorine. If the grower wants to minimize the amount of nitrogen added to the garden,how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden (in $,kg$)?
Brand $P$ ($kg$ per bag) Brand $Q$ ($kg$ per bag) Nitrogen $3$ $3.5$ Phosphoric acid $1$ $2$ Potash $3$ $1.5$ Chlorine $1.5$ $2$
| Brand $P$ ($kg$ per bag) | Brand $Q$ ($kg$ per bag) | |
| Nitrogen | $3$ | $3.5$ |
| Phosphoric acid | $1$ | $2$ |
| Potash | $3$ | $1.5$ |
| Chlorine | $1.5$ | $2$ |
Difficult
View SolutionVedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo