4-5 Additional Practice Systems Of Linear Inequalities

Mastering Linear Inequalities: 5 Advanced Practice Systems to Elevate Your Skills

Moving beyond the basics of solving single linear inequalities, mastering systems of linear inequalities is a critical step in algebra and pre-calculus. These systems model real-world constraints where multiple conditions must be satisfied simultaneously, defining a feasible region on the coordinate plane. While introductory problems often feature simple, positive coefficients, true proficiency comes from tackling diverse and challenging configurations. This article provides five additional, carefully crafted practice systems designed to solidify your understanding, expose common pitfalls, and build the analytical stamina needed for more complex mathematical modeling.

System 1: The Graphing Focus with Fractional Boundaries

This system tests precision in graphing lines with fractional slopes and intercepts, a frequent source of errors.

System:

1. ( y \geq \frac{2}{3}x - 1 )
2. ( y < -\frac{1}{2}x + 4 )
3. ( x \geq 0 )
4. ( y \geq 0 )

Step-by-Step Solution & Analysis:

1. Graph Boundary Lines: Convert each inequality to an equation to find the boundary.

   • Line 1: ( y = \frac{2}{3}x - 1 ). Slope is ( \frac{2}{3} ), y-intercept is -1. Since the inequality is ( \geq ), use a solid line.
   • Line 2: ( y = -\frac{1}{2}x + 4 ). Slope is ( -\frac{1}{2} ), y-intercept is 4. Since the inequality is ( < ), use a dashed line.
   • Lines 3 & 4 are the x-axis (( y=0 ), solid) and y-axis (( x=0 ), solid), forming the first quadrant.

2. Test Points for Shading: Choose a test point not on any line, typically (0,0) if it's not on a boundary.

   • For ( y \geq \frac{2}{3}x - 1 ): Test (0,0). ( 0 \geq \frac{2}{3}(0) - 1 \rightarrow 0 \geq -1 ). True. Shade the side containing (0,0).
   • For ( y < -\frac{1}{2}x + 4 ): Test (0,0). ( 0 < -\frac{1}{2}(0) + 4 \rightarrow 0 < 4 ). True. Shade the side containing (0,0).
   • ( x \geq 0 ) shades the right side of the y-axis.
   • ( y \geq 0 ) shades above the x-axis.

3. Identify the Feasible Region: The solution is the overlapping shaded area in the first quadrant bounded by the two slanted lines. It is a polygonal region (likely a quadrilateral or pentagon). The vertices are found by solving the systems of equations formed by the intersecting boundary lines:

   • Intersection of ( y = \frac{2}{3}x - 1 ) and ( y = -\frac{1}{2}x + 4 ).
   • Intersection of ( y = \frac{2}{3}x - 1 ) and ( x=0 ) (or ( y=0 )).
   • Intersection of ( y = -\frac{1}{2}x + 4 ) and ( y=0 ) (or ( x=0 )).

Key Takeaway: Practice plotting points accurately when dealing with fractions. The feasible region's shape is entirely dictated by the intersection points of the boundary lines.

System 2: Maximization Context with Unbounded Region

This system introduces a linear objective function and a feasible region that is unbounded, teaching that maximum or minimum values may not exist.

System & Objective:

• Constraints:
  1. ( 2x + y \leq 10 )
  2. ( x + 3y \leq 12 )
  3. ( x \geq 0 )
  4. ( y \geq 0 )
• Objective Function to Maximize: ( P = 3x + 2y )

Solution Process:

1. Graph Constraints: As before, graph the solid boundary lines for ( \leq ) and ( \geq ). The feasible region is in the first quadrant, bounded by the two slanted lines and the axes. It is a triangle with vertices at (0,0), (5,0) [from ( 2x=10 )], and (0,4) [from ( 3y=12 )]. Wait, is that all? Check intersection of ( 2x+y=10 ) and ( x+3y=12 ). Solving: Multiply first by 3: ( 6x+3y=30 ). Subtract second: ( (6x+3y) - (x+3y) = 30-12 \rightarrow 5x=18 \rightarrow x=3.6 ). Then ( y=10-2(3.6)=2.8 ). So the third vertex is (3.6, 2.8). The region is a quadrilateral? Let's list vertices properly:

   • (0,0) - intersection of x=0 and y=0.
   • (5,0) - intersection of ( 2x+y=10 ) and y=0.
   • (3.6, 2.8) - intersection of ( 2x+y=10 ) and ( x+3y=12 ).
   • (0,4) - intersection of ( x+3y=12 ) and x=0. The feasible region is this quadrilateral.

2. Apply the Corner Point Theorem: For a linear objective function over a polygonal feasible region, the maximum and minimum values occur at corner points (vertices).

   • Calculate ( P = 3x + 2y ) at each vertex:
     • (0,0): ( P = 0 )
     • (5,0): ( P = 3(5) + 2(0) = 15 )

(3.6, 2.8): ( P = 3(3.6) + 2(2.8) = 10.8 + 5.6 = 16.4 ) * (0,4): ( P = 3(0) + 2(4) = 8 )

The maximum value of \( P \) is **16.4** at the point **(3.6, 2.8)**. The feasible region is a bounded quadrilateral, so a maximum exists and is attained at a vertex.

System 3: Unbounded Region and the Absence of a Maximum

This final system demonstrates a critical nuance: an unbounded feasible region can prevent a linear objective function from having a finite maximum (or minimum).

System & Objective:

• Constraints:
  1. ( x - y \geq -1 ) (or ( y \leq x + 1 ))
  2. ( x + y \leq 5 )
  3. ( x \geq 0 )
  4. ( y \geq 0 )
• Objective Function to Maximize: ( Z = 2x + y )

Solution Process:

1. Graph Constraints & Identify Region: The constraints define a feasible region in the first quadrant bounded by the lines ( y = x + 1 ) (shaded below), ( y = -x + 5 ) (shaded below), and the axes. The intersection of ( y = x + 1 ) and ( y = -x + 5 ) is found by solving ( x + 1 = -x + 5 \rightarrow 2x = 4 \rightarrow x = 2, y = 3 ). The other vertices are where these lines meet the axes: (0,1) from ( y = x+1 ) at x=0, and (5,0) from ( y = -x+5 ) at y=0. The point (0,0) is not in the region because it violates ( x - y \geq -1 ) (0-0=0 ≥ -1 is true, but it also must satisfy ( x+y \leq 5 ), which it does. Let's check all constraints at (0,0): 0≥-1 (true), 0≤5 (true), x≥0, y≥0. So (0,0) is a vertex. The vertices are: (0,0), (0,1), (2,3), and (5,0). The region is a quadrilateral. However, is it bounded? Look at the constraint ( y \leq x + 1 ). As ( x ) increases indefinitely, ( y ) can also increase indefinitely, as long as ( y \leq x+1 ) and ( y \leq -x+5 ). The line ( y = -x+5 ) slopes downward, so for very large ( x ), ( -x+5 ) becomes very negative, but ( y \geq 0 ) prevents ( y ) from being negative. The binding constraint for large ( x ) is actually ( y \geq 0 ). For any large ( x ), we can choose ( y = 0 ) (which satisfies ( 0 \leq x+1 ) and ( 0 \leq -x+5 ) only if ( x \leq 5 )). For ( x > 5 ), ( y = 0 ) violates ( x+y \leq 5 ). So the region is actually bounded by x=5 on the right? Let's re-evaluate: The constraint ( x+y \leq 5 ) with ( x \geq 0, y \geq 0 ) creates a triangle with vertices (0,0), (5,0), (0,5). But we also have ( y \leq x+1 ). The line ( y=x+1 ) passes through (0,1) and (2,3). For points in the first quadrant with ( x+y \leq 5 ), the maximum x is 5 (at y=0). At x=5, y must be ≤0 from ( x+y \leq 5 ), so y=0. Check ( y \leq x+1 ): 0 ≤ 6, true. So (5,0) is a vertex. The feasible region is the polygon with vertices (0,0), (0,1), (2,3), (5,0). This is a bounded