3.2: Linear Inequalities
- Page ID
- 67112
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)In the systems of equations chapter, we looked at a company that produces a basic and premium version of its product, and we determined how many of each item they should produce to fully utilize all staffed hours. In some cases, though, it might not make the most sense for the company to utilize all the staffed hours; if the premium product has high demand and a high price, it might make more sense for the company to make as many of those, even if some staff hours go unused. In this case, the company might be most interested in what combinations of basic and premium product production are possible. For that, we need linear inequalities
A linear equation in two variables is an equation like \(f(x)=2 x+1\), which is sometimes written without function notation as \(y=2 x+1 .\) Recall that the graph of this equation is a line, formed by all the points \((x, y)\) that satisfy the equation. A linear inequality in two variables is similar, but involves an inequality. Some examples:
\[y<2 x+1 \quad y>4 x-1 \quad y \leq \frac{2}{3} x+4 \quad y \geq 5-2 x\nonumber\]
Linear inequalities can also be written with both variables on the same side of the equation, like \(2 x-3 y<4\)
The solution set to a linear inequality will be all the points \((x, y)\) that satisfy the inequality. Notice that the line \(y=2 x+1\) divides the coordinate plane into two halves:
on one half \(y<2 x+1\), and on the other \(y>2 x+1 .\) The solution set to a linear inequality will be a half plane, and to show the solution set we shade the part of the coordinate plane where the points lie in the solution set.
To graph the solution to a linear inequality
1. If necessary, rewrite the linear inequality into a form convenient for graphing, like slope-intercept form
2. Graph the corresponding linear equation.
a. For a strict inequality (< or \(>\) ), draw a dashed line to show that the points on the line are not part of the solution
b. For an inequality that includes the equal sign \((\leq\) or \(\geq)\), draw a solid line to show that the points on the line are part of the solution.
3. Choose a test point, not on the line.
a. Substitute the test point into the inequality
b. If the inequality is true at the test point, shade the half plane on the side including the test point
c. If the inequality is not true at the test point, shade the half plane on the side that doesn't include the test point
Example \(\PageIndex{1}\)
Graph the solution to \(y<2 x+1\)
Solution
Since this is a strict inequality, we will graph \(y = 2x + 1\nonumber \) as a dashed line.
Now we choose a test point not on the line. Usually picking a point where one coordinate is zero will make things easier. Let's use \((3,0)\).
Substituting (3,0) into the inequality, we get
\[\begin{align*} 0 &< 2(3) + 1 \\ 0 &< 7 \end{align*} \nonumber \]
This is a true statement, so we will shade the side of plane that includes \((3,0)\).
Example \(\PageIndex{2}\)
Graph the solution to \(x \geq 2 y+4\)
Solution
This is not written in a form we are used to use for graphing, so we might solve it for \(y\) first.
\(x \geq 2 y+4 \quad \)
Subtract \(2 v\) from both sides
\(x-2 y \geq 4 \quad \)
Subtract \(x\) from both sides
\(-2 y \geq 4-x\)
Divide by \(-2\), reversing the order of the inequality
\(y \leq-2+\frac{1}{2} x\)
Since this inequality includes the equals sign, we will graph \(y=-2+\frac{1}{2} x\) as a solid line
Now we choose a test point not on the line. (0,0) is a convenient choice. Substituting (0,0) into the inequality, we get
\[\begin{align*} 0 &\leq - 2 + \frac{1}{2}(0) \\ 0 &\leq - 2 \end{align*} \nonumber \]
This is a false statement, so we shade the half of the plane that does not include \((0,0)\).
Exercise \(\PageIndex{1}\)
Graph the solution to \[y \geq - \frac{1}{2}x + 1\nonumber \]
- Answer
-
Maximize \(P = 14x + 9y \) subject to the constraints:
\[\begin{align*} x + y &\leq 9 \\ 3x + y &\leq 15 \\ x \geq 0, &\; y \geq 0 \\ \end{align*} \nonumber \]
Example \(\PageIndex{3}\)
A store sells peanuts for \(\$ 4 /\) pound and cashews for \(\$ 8 /\) pound, and plans to sell a ney mixed-nut blend in a jar. What combinations of peanuts and cashews are possible, if they want the mix to cost \(\$ 6\) or less?
Solution
We start by defining our variables:
\(p\): The number of pounds of peanuts in 1 pound of mix
\(c\): The number of pounds of cashews in 1 pound of mix
The cost of one pound of mix will be \(4 p+8 c\), so all the mixes costing \(\$ 6\) or less will satisfy the inequality \(4 p+8 c \leq 6\)
We can graph the equation \(4 p+8 c=6\) fairly easily by finding the intercepts:
When \(p=0\)
\[\begin{align*} 4(0)+8 c &= 6 \\ 8 c &= 6 \\ c &= \frac{6}{8}=\frac{3}{4}. \end{align*}\]
So the point \(\left(0, \frac{3}{4}\right)\) on the line.
When \(c=0,4 p=6\), so \(p=\frac{6}{4}=\frac{3}{2}\), giving the point \(\left(\frac{3}{2}, 0\right)\).
Notice the test point \((0,0)\) will satisfy the inequality, so we will shade the side of the line including the origin. Because of the context, only values in the first quadrant are reasonable. The graph shows all the possible combinations the store could use, including 1 pound of peanuts with \(1 / 4\) pound of cashews, or \(1 / 2\) a pound of each.
Systems of Linear Inequalities
In the systems of equations chapter, we looked for solutions to a system of linear equations - a point that would satisfy all the equations in the system. Likewise, we can consider a system of linear inequalities. The solution to a system of linear inequalities is
the set of points that satisfy all the inequalities in the system.
With a single linear inequality, we can show the solution set graphically. Likewise, with a system of linear inequalities we show the solution set graphically. We find it by looking for where the regions indicated by the individual linear inequalities overlap.
Example \(\PageIndex{4}\)
Graph the solution to the system of linear inequalities
\[\begin{align*} y &\leq x + 2 \\ y &\geq 1 - x \end{align*} \nonumber \]
Solution
If we graph the solution set to each inequality individually, we get the two solutions sets shown here.
Graphing these solution sets on the same axes reveals the solution to the system of inequalities as the region where the two overlap.
The solution set, where the regions overlap.
The solution set, drawn alone.
Exercise \(\PageIndex{2}\)
Graph the solution to the system of linear inequalities
\[\begin{align*} y &\leq 3 - 2x \\ y &\geq \frac{1}{2}x + 1 \end{align*} \nonumber \]
- Answer
The following question is similar to a problem we solved using systems in the systems chapter.
Example \(\PageIndex{5}\)
A company produces a basic and premium version of its product. The basic version requires 20 minutes of assembly and 15 minutes of painting. The premium version requires 30 minutes of assembly and 30 minutes of painting. If the company has staffing for 3,900 minutes of assembly and 3,300 minutes of painting each week. How many items can then produce within the limits of their staffing?
Solution
Notice this problem is different than the question we asked in the first section, since we are no longer concerned about fully utilizing staffing, we are only interested in what is possible. As before, we'll define
\(b\): The number of basic products made, \(p\): The number of premium products made.
Just as we created equations in the first section, we can now create inequalities, since we know the hours used in production needs to be less than or equal to the hours available. This leads to two inequalities:
\[\begin{array}{*{20}{c}} 20b + 30p \leq 3900 \\ 15b + 30p \leq 3300 \end{array}\nonumber \]
Graphing these inequalities gives us the solution set.
Since it isn't reasonable to consider negative numbers of items, we can further restrict the solutions to the first quadrant. This could also be represented by adding the inequalities
\[b \geq 0,\quad p \geq 0. \nonumber \]
In the solution set we can see the solution to the system of equations we solved in the previous section: 120 basic products and 50 premium products. The solution set shows that if the company is willing to not fully utilize the staffing, there are many other possible combinations of products they could produce.
The techniques we used above are key to a branch of mathematics called linear programming, which is used extensively in business. We will explore linear programming further in the next section.
Important Topics of this Section
Graphing linear inequalities
Dashed line for strict inequalities, solid for ≤ or ≥
Graphing systems of linear inequalities