5.6: Solving System of Inequalities on the Cartesian Plane
Solving a System of Linear Inequalities
Introduction
In a previous lesson you learned how to solve a system of linear equations graphically. The solution was determined by identifying the intersection point of the two linear equations. When the system of equations was solved by graphing, the system could have one point of intersection, no point of intersection (the lines were parallel), or an infinite number of intersection points (the equations were multiples of each other).
In this lesson you will learn to solve a system of linear inequalities by identifying the regions of intersection. The region of intersection or the common solution of a system of linear equation is where the shading of the inequalities overlaps. This area of overlapping is known as the feasible region and this region contains the common solution of the system of inequalities.
Objectives
The lesson objectives for Solving Systems Inequalities on the Cartesian Plane are:
- Plotting two or more inequalities on the same Cartesian grid.
- Showing the overlap of the shading of the inequalities.
- Identifying the feasible region on the graph.
Introduction
When a linear inequality is graphed on a Cartesian plane, the region that contains the points that will satisfy the inequality is identified by shading. If two inequalities are graphed on the same grid and if they share common points that will satisfy both linear equations, an area will be created that contains shading from both inequalities. The area that contains this shading is the region that contains the common solution for the system of inequalities.
Watch This
Khan Academy Systems of Linear Inequalities
Guidance
Graph the following system of linear inequalities on the same Cartesian grid.
Both inequalities are in slope-intercept form. Begin by graphing .
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
No, one is not greater than one and one-half. Therefore, the point (1, 1) does not satisfy the inequality and will not lie in the shaded area. The shaded area is above the dashed line.
Now, the inequality will be graphed on the same Cartesian grid.
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
No, one is not less than or equal to negative one. Therefore, the point (1, 1) does not satisfy the inequality and will not lie in the shaded area. The shaded area is below the solid line.
The region that is indicated as the feasible region is the area on the graph where the shading from each line overlaps. This region contains all the points that will satisfy both inequalities. Another way to indicate the feasible region is to shade the entire region a different color. If you were to do this exercise in your notebook using colored pencils, the feasible region would be very obvious.
The feasible region is the area shaded in yellow.
Example A
Solve the following system of linear inequalities by graphing:
Write each inequality in slope-intercept form.
Graph: .
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
Yes, negative eight is less than or equal to twelve. The point (1, 1) satisfies the inequality and will lie within the shaded region.
Now graph on the same Cartesian grid.
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
Yes, one is greater than negative four. The point (1, 1) satisfies the inequality and will lie within the shaded region.
The region that is indicated as the feasible region is the area on the graph where the shading from each line overlaps. This region contains all the points that will satisfy both inequalities.
The feasible region is the area shaded in blue.
Example B
Solve the following system of linear inequalities by graphing:
These are the special lines that need to be graphed. The first line is a line that has an undefined slope. The graph is a vertical line parallel to the axis. The second line is a line that has a slope of zero. The graph is a line parallel to the axis.
Graph: .
On the graph, every point to the right of the vertical line has an value that is greater than one. Therefore, the graph must be shaded to the right of the vertical line.
Now graph on the same Cartesian grid.
On the graph, every point above the horizontal line has a value that is greater than two. Therefore, the graph must be shaded above the horizontal line.
The region that is indicated as the feasible region is the area on the graph where the shading from each line overlaps. This region contains all the points that will satisfy both inequalities.
The feasible region is the area shaded in purple.
Example C
More than two inequalities can be shaded on the same Cartesian plane. The solution set is all of the coordinates that lie within the shaded regions that overlap. When more than two inequalities are being shaded on the same grid, the shading must be done accurately and neatly.
Solve the following system of linear inequalities by graphing:
Graph: :
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
Yes, one is less than two. The point (1, 1) satisfies the inequality and will lie within the shaded region.
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
No, one is not greater than or equal to two. The point (1, 1) does not satisfy the inequality and will not lie within the shaded region.
The graph of is a horizontal line along the axis. Every point above the horizontal line has a value greater than zero. Therefore, the shaded area will be above the graphed line.
The region that is indicated as the feasible region is the area on the graph where the shading from each line overlaps. This region contains all the points that will satisfy both inequalities.
The feasible region is the area shaded in pink.
Vocabulary
- Feasible region
- The feasible region is the part on the graph where the shaded areas of the inequalities overlap. This area contains the all the solution sets for the inequalities.
Guided Practice
1. Solve the following system of linear inequalities by graphing:
2. Solve the system of linear inequalities by graphing:
3. Determine and prove three points that satisfy the following system of linear inequalities:
Answers
1.
Write each inequality in slope-intercept form.
Graph:
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
Yes, nine is less than or equal to twenty. The point (1, 1) satisfies the inequality and will lie within the shaded region.
Graph
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
Yes, four is less than or equal to six. The point (1, 1) satisfies the inequality and will lie within the shaded region.
The feasible region is the area shaded in pink.
2.
Write the first two inequalities in slope-intercept form.
Graph:
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
Yes, five is less than twelve. The point (1, 1) satisfies the inequality and will lie within the shaded region.
Graph:
The point (1, 1) is not on the graphed line. Test the point (1, 1) to determine the location of the shading.
Yes, three is less than or equal to eight. The point (1, 1) satisfies the inequality and will lie within the shaded region.
Graph:
The graph will be a vertical line that will coincide with the axis. All values to the right of the line are greater than or equal to zero. The shaded area will be to the right of the vertical line.
Graph:
The graph will be a horizontal line that will coincide with the axis. All values above the line are greater than or equal to zero. The shaded area will be above the horizontal line.
The feasible region is the area shaded in green.
3.
Graph the system of inequalities to determine the feasible region.
Three points in the feasible region are (-1, 3); (4, -2); and (6, 5). These points will be tested in each of the linear inequalities. All of these points should satisfy both inequalities.
Test (-1, 3)
The point (-1, 3) satisfies both inequalities. In the first inequality, three is less than five. In the second inequality three is greater than or equal to negative one. Therefore, the point lies within the feasible region and is a solution for the system of linear inequalities.
Test (4, -2)
The point (4, -2) satisfies both inequalities. In the first inequality, negative two is less than fifteen. In the second inequality negative two is greater than or equal to negative sixteen. Therefore, the point lies within the feasible region and is a solution for the system of linear inequalities.
Test (6, 5)
The point (6, 5) satisfies both inequalities. In the first inequality, five is less than nineteen. In the second inequality five is greater than or equal to negative twenty-two. Therefore, the point lies within the feasible region and is a solution for the system of linear inequalities.
Summary
In this lesson you have learned to solve a system of linear inequalities on a Cartesian plane. The solution set was all points in the area that was in the overlapping, shaded region of the graphs. To determine where the shaded area should be with respect to each line, a point, which was not on the line, was tested in the original inequality. If the point made the inequality true, then the area containing the point was shaded. If the point did not make the inequality true, then the tested point did not lie within the shaded region.
Problem Set
Solve the following systems of linear inequalities by graphing.
Solve the following systems of linear inequalities by graphing.
Answers
Solve the following systems...
Test (1, 1)
It is not true. The point (1, 1) will not lie within the shaded region.
Test (1, 1)
It is true. The point (1, 1) will lie within the shaded region.
The feasible region is the area shaded in purple.
Test (1, 1)
It is not true. The point (1, 1) will not lie within the shaded region.
Test (1, 1)
It is not true. The point (1, 1) will not lie within the shaded region.
The feasible region is the area shaded in gold.
Test (1, 1)
It is true. The point (1, 1) will lie within the shaded region.
Test (1, 1)
It is true. The point (1, 1) will lie within the shaded region.
The feasible region is the area shaded in blue.
Solve the following systems...
The feasible region is the area shaded in red.
The feasible region is the area shaded in yellow.
The feasible region is the area shaded in gold.
Notes/Highlights Having trouble? Report an issue.
Color | Highlighted Text | Notes | |
---|---|---|---|
Show More |