Introduction to Systems of Inequalities
A system of linear inequalities in two variables consists of two or more linear inequalities that must be satisfied simultaneously. The solution to the system is the set of all ordered pairs (x, y) that satisfy every inequality in the system.
The Solution Region (Feasible Region)
Graphically, the solution to a system of inequalities is the intersection of the solution regions of each individual inequality. This common, overlapping area is known as the solution region or feasible region.
Method for Solving a System Graphically
Graph Each Inequality: For every inequality in the system, follow the procedure from the previous section:
- Draw the boundary line (solid for ; dashed for ).
- Choose a test point (like (0,0)).
- Shade the appropriate half-plane.
Identify the Common Region: The solution to the system is the region on the graph where all the shaded half-planes overlap. If there is no region where all shadings overlap, the system has no solution.
Find Corner Points: The vertices or corner points of the feasible region are particularly important in optimization problems (Linear Programming). A corner point is found at the intersection of two boundary lines.
Example 1: A Simple System
Question: Solve the following system of inequalities graphically: and .
Solution:
- Graph : Draw the solid line . Test (0,0): is false. Shade the half-plane that does not contain the origin.
- Graph : Draw the solid line . Test (0,0): is true. Shade the half-plane that contains the origin.
- Find the Solution Region: The solution is the region where the two shaded areas overlap.
Example 2: Bounded Feasible Region
Question: Find the solution region for the system: , , , .
Solution:
- Graph all four inequalities:
- : Solid line through (0,4) and (8,0). Shaded towards the origin.
- : Solid line through (0,8) and (4,0). Shaded towards the origin.
- : The y-axis and the region to its right.
- : The x-axis and the region above it.
- Find the Solution Region: The intersection of all four regions is a bounded quadrilateral (the feasible region) in the first quadrant.
- Find Corner Points: The vertices of this region are:
- (0,0): Intersection of and .
- (4,0): Intersection of and .
- (0,4): Intersection of and .
- To find the fourth point, solve and simultaneously. This gives the point .
Example 3: Unbounded Feasible Region
Question: Solve the system: , .
Solution:
- Graph : Draw a dashed line through (0,4) and (4,0). Shade the side that does not contain the origin.
- Graph (or ): Draw a dashed line through (0,0) and (1,2). Test a point not on the line, e.g., (1,0). is true. Shade the side containing (1,0).
- Find the Solution Region: The overlapping shaded area is an unbounded region extending infinitely in one direction.