Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
A system of linear inequalities consists of two or more linear inequalities in the same variables, such as and . The solution is the set of all ordered pairs that satisfy all inequalities in the system simultaneously. Visually, this solution is represented by the intersection of the shaded regions of each individual inequality on a Cartesian plane.
The boundary line for an inequality is the equation . If the inequality involves or , the boundary line is drawn as a solid line, indicating points on the line are included in the solution. If the inequality involves or , the boundary line is drawn as a dashed or dotted line, indicating points on the line are excluded.
Every linear inequality divides the coordinate plane into two half-planes. A non-vertical line divides the plane into an upper half-plane and a lower half-plane, while a vertical line divides it into a left half-plane and a right half-plane. The solution to a single inequality is always one of these half-planes.
To determine which side of the boundary line to shade, use the 'Test Point' method. Choose a point not lying on the boundary line (the origin is often the easiest choice). If the point satisfies the inequality, shade the region containing that point; if it does not, shade the opposite side.
The solution region (or feasible region) of a system of inequalities is the area where the shaded regions of all individual inequalities overlap. In a graph, this is often represented as the most heavily shaded or cross-hatched area. If there is no common region where all inequalities overlap, the system has no solution.
Horizontal and vertical inequalities are common components of systems. An inequality like represents the region to the right of the vertical line , while represents the region below the horizontal dashed line .
Non-negative constraints, specifically and , are frequently included in systems. Visually, these constraints restrict the entire solution set to the first quadrant of the Cartesian plane, representing real-world scenarios where quantities cannot be negative.
📐Formulae
General form of a linear inequality: or or or
Equation of the boundary line:
Slope-intercept form for boundary lines: , where and
Vertical line boundary: (where is a constant)
Horizontal line boundary: (where is a constant)
💡Examples
Problem 1:
Solve the following system of linear inequalities graphically:
Solution:
Step 1: Draw the boundary line . When ; when . Draw a solid line through and . Test point : is true, so shade the side containing (the lower-left side). \nStep 2: Draw the boundary line . When ; when . Draw a solid line through and . Since is on the line, use test point : is true, so shade the side containing (the lower-right side). \nStep 3: The solution is the overlapping region where both shaded areas meet, forming a wedge-shaped region starting from the intersection point of the lines.
Explanation:
To solve a system, we find the intersection of the solution sets of each individual inequality. The intersection point of the lines can be found by solving and simultaneously, giving .
Problem 2:
Find the region satisfying the system:
Solution:
Step 1: Graph as a solid line (intercepts at and ). Test point gives (True), so shade towards the origin. \nStep 2: Graph (the -axis). means shading the right side of the -axis (First and Fourth quadrants). \nStep 3: Graph as a solid horizontal line. means shading the region above this line. \nStep 4: The final solution is the triangular region bounded by the -axis (), the line , and the line .
Explanation:
The constraints and limit the solution to a specific part of the plane. The vertices of the resulting triangular solution region are , , and .