Pearson Algebra 2 Common Core, 2011
PA
Pearson Algebra 2 Common Core, 2011 View details
4. Linear Programming
Continue to next subchapter

Exercise 5 Page 160

We will first graph the system, then name the vertices of the overlapping region, which can be also called feasible. Note that two of the given inequalities contain only the variable and two only the variable.
We will graph both cases, for and for values, separately. Next, we will combine the graphs and identify the overlapping region. Let's start!

Inequalities I and III

First, let's graph the inequalities which contain only the variable.
Note that we can form a compound inequality from these two cases.
This compound inequality describes all values of that are greater than or equal to and less than or equal to This means that all coordinate pairs with an coordinate that is greater than or equal to and less than or equal to will be in the solution set. Note that both inequalities are non-strict, so the boundary lines will be solid.

Inequalities II and IV

For inequalities containing only the variable we will follow a similar process. Let's form the compound inequality.
This compound inequality describes all values of that are greater than or equal to and less than or equal to This means that all coordinate pairs with a coordinate that is greater than or equal to and less than or equal to will be in the solution set. Note that both inequalities are non-strict, so the boundary lines will be solid.

Combining the Inequality Graphs

Let's draw the graphs of the inequalities on the same coordinate plane.

Now that we can see the overlapping region, let's highlight the vertices.

Looking at the graph, we can see that the line intersects the lines and at the points and respectively. These are two of the vertices.
Similarly, we can see that the line intersects the lines and at the points and respectively. We have identified two remaining vertices.