Graphing Solution Regions

Master graphing solution regions: understanding feasible areas, boundary lines, shading techniques, and system solutions through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Single Inequality Solution Region
Exercise 1
Graph the solution region for the inequality 2x + 3y ≤ 12. Show the boundary line, determine if it's included in the solution, and shade the correct region.
Definition:

Solution Region: The area on the coordinate plane that contains all points satisfying the inequality. The boundary line separates the solution region from the non-solution region.

Solution Region Graphing Method:
  1. Graph the boundary line (solid for ≤ or ≥, dashed for < or >)
  2. Choose a test point not on the boundary line
  3. Substitute the test point into the original inequality
  4. If true, shade the region containing the test point
  5. If false, shade the opposite region
Boundary
2x + 3y = 12
Line Type
Solid (≤)
Shading
Below line
Step 1: Find intercepts for the boundary line

For 2x + 3y = 12: x-intercept (y=0): 2x = 12 → x = 6, so (6, 0)

y-intercept (x=0): 3y = 12 → y = 4, so (0, 4)

Step 2: Draw the boundary line

Since the inequality is ≤, draw a solid line through (6, 0) and (0, 4).

Step 3: Choose a test point

Use (0, 0) since it's not on the boundary line.

Step 4: Test the point in the original inequality

Substitute (0, 0) into 2x + 3y ≤ 12: 2(0) + 3(0) ≤ 12 → 0 ≤ 12 ✓

Step 5: Shade the correct region

Since the test point satisfies the inequality, shade the region containing (0, 0), which is below the line.

Step 6: Verify with additional points

Test (1, 1): 2(1) + 3(1) = 5 ≤ 12 ✓ (in shaded region)

Test (5, 3): 2(5) + 3(3) = 19 ≤ 12 ✗ (not in shaded region)

Solid line through (6,0) and (0,4), shaded below
Final answer:

The solution region is the area below and including the line 2x + 3y = 12. The boundary line is solid because the inequality includes equality (≤). All points in the shaded region satisfy 2x + 3y ≤ 12.

Applied rules:

• Line Type: Solid for ≤ or ≥, dashed for < or >

• Test Point Method: Determines which side of boundary to shade

• Verification: Check that points in shaded region satisfy original inequality

2 System of Two Inequalities
Exercise 2
Graph the system: x + y ≤ 6 and 2x - y ≥ 2. Identify the feasible region and find its corner points.
Definition:

Feasible Region: The intersection of all individual solution regions in a system of inequalities. It represents all points that satisfy all constraints simultaneously.

Ineq 1
x + y ≤ 6 (solid, below)
Ineq 2
2x - y ≥ 2 (solid, above)
Intersection
Feasible region
Step 1: Graph first inequality x + y ≤ 6

Boundary line: x + y = 6. Intercepts: (6, 0) and (0, 6). Solid line. Test (0, 0): 0 + 0 ≤ 6 ✓. Shade below.

Step 2: Graph second inequality 2x - y ≥ 2

Boundary line: 2x - y = 2. Rewrite as y = 2x - 2. Intercepts: (1, 0) and (0, -2). Solid line. Test (0, 0): 2(0) - 0 ≥ 2 → 0 ≥ 2 ✗. Shade above the line.

Step 3: Find intersection point

Solve system: x + y = 6 and 2x - y = 2. Adding equations: 3x = 8 → x = 8/3. Then y = 6 - 8/3 = 10/3. Intersection: (8/3, 10/3).

Step 4: Identify feasible region

The feasible region is where both conditions are satisfied: below x + y = 6 AND above 2x - y = 2.

Step 5: Find corner points

Corner points occur where boundary lines intersect each other and axes. For this system: (8/3, 10/3) is one corner point.

Step 6: Describe the region

The feasible region is unbounded above and to the right, but bounded by the two constraint lines and the axes if considering non-negative constraints.

Feasible region: Between lines, corner at (8/3, 10/3)
Final answer:

The feasible region is the area that satisfies both inequalities simultaneously. It's bounded by the lines x + y = 6 and 2x - y = 2. One corner point is at (8/3, 10/3), where the two lines intersect.

Applied rules:

• System Solution: Intersection of individual solution regions

• Corner Points: Intersections of boundary lines

• Verification: Points in feasible region satisfy all constraints

3 Unbounded Solution Region
Exercise 3
Graph the system: y ≥ x - 2, y ≥ -x + 2, and x ≥ 0. Is the feasible region bounded or unbounded? Identify any corner points.
Definition:

Bounded Region: A feasible region that is enclosed and finite in area. Unbounded Region: A feasible region that extends infinitely in at least one direction.

Ineq 1
y ≥ x - 2
Ineq 2
y ≥ -x + 2
Ineq 3
x ≥ 0
Step 1: Graph y ≥ x - 2

Boundary line: y = x - 2. Solid line. Test (0, 0): 0 ≥ -2 ✓. Shade above the line.

Step 2: Graph y ≥ -x + 2

Boundary line: y = -x + 2. Solid line. Test (0, 0): 0 ≥ 2 ✗. Shade above the line.

Step 3: Graph x ≥ 0

Boundary line: x = 0 (y-axis). Solid line. Shade to the right of the y-axis.

Step 4: Find intersection points

Lines y = x - 2 and y = -x + 2 intersect when: x - 2 = -x + 2 → 2x = 4 → x = 2, y = 0. Point: (2, 0)

Line y = -x + 2 intersects y-axis (x = 0) at: y = -0 + 2 = 2. Point: (0, 2)

Step 5: Identify the feasible region

The region is above both slanted lines and to the right of the y-axis. It forms a triangular region with vertices at (0, 2) and (2, 0).

Step 6: Determine boundedness

The region extends infinitely upward (as x increases, y can increase without bound), making it unbounded. The corner points are (0, 2) and (2, 0).

Unbounded region with vertices (0,2) and (2,0)
Final answer:

The feasible region is unbounded. It has corner points at (0, 2) and (2, 0). The region extends infinitely upward and to the right, satisfying all three constraints but having infinite area.

Applied rules:

• Unbounded Detection: Region extends infinitely in any direction

• Vertex Calculation: Intersections of active constraints

• Feasibility: Region still valid even if unbounded

Key Concepts and Methods
ax + by \lt c
Linear Inequality
Boundary Line
ax + by = c
Separates solution from non-solution
Line Type
Solid vs Dashed
Solid for ≤ or ≥, dashed for < or >
Shading Direction
Test point method
Which side satisfies the inequality
System Solution
Intersection of regions
Simultaneous satisfaction
Key Definitions:

Solution Region: The set of all points (x, y) that satisfy a given inequality or system of inequalities.

Boundary Line: The line that separates the solution region from the non-solution region. It's formed by replacing the inequality symbol with an equals sign.

Feasible Region: The area defined by all constraints in a system of inequalities. It represents all possible solutions that satisfy all conditions.

Corner Point (Vertex): A point where two or more boundary lines intersect in a feasible region.

Bounded Region: A region that is enclosed and has finite area.

Unbounded Region: A region that extends infinitely in at least one direction.

Test Point Method: A technique for determining which side of a boundary line to shade by substituting coordinates of a point not on the line into the original inequality.

System of Inequalities: A set of two or more inequalities that must all be satisfied simultaneously.

Complete Graphing Process:
  1. Identify the Inequality: Determine the form and variables
  2. Graph Boundary Line: Convert to equation and graph using intercepts or slope-intercept form
  3. Determine Line Type: Solid for ≤ or ≥, dashed for < or >
  4. Choose Test Point: Select a point not on the boundary line
  5. Test Point Substitution: Substitute coordinates into original inequality
  6. Shade Solution Region: Shade the side containing points that satisfy the inequality
  7. For Systems: Find intersection of all individual solution regions
Tip 1: Always use the test point method to determine shading direction.
Tip 2: Remember: solid line for ≤ or ≥, dashed line for < or >.
Tip 3: For systems, the solution is the intersection of all individual regions.
Common Applications: Optimization problems, constraint modeling, resource allocation, production planning.
Geometric Properties: Convex regions, linear boundaries, corner point solutions.
Essential Rules:

• Line Type Rule: Solid for inclusive inequalities (≤, ≥), dashed for strict inequalities (<, >)

• Shading Rule: If test point satisfies inequality, shade that side; otherwise, shade opposite side

• System Rule: Solution is intersection of all individual solution regions

• Verification: Always check that points in shaded region satisfy original inequality

Solution: Exercises 4 to 5
4 Real-World Constraint System
Exercise 4
A company produces two products. Product A requires 2 hours of labor and 1 hour of machine time. Product B requires 1 hour of labor and 3 hours of machine time. The company has 100 hours of labor and 150 hours of machine time available. Graph the feasible region for this system.
Definition:

Constraint Modeling: Translating real-world limitations into mathematical inequalities to define a feasible region for optimization problems.

Variables
x = A units, y = B units
Constraints
2x + y ≤ 100, x + 3y ≤ 150
Non-negativity
x ≥ 0, y ≥ 0
Step 1: Define variables and constraints

Let x = units of Product A, y = units of Product B

Labor constraint: 2x + y ≤ 100

Machine constraint: x + 3y ≤ 150

Non-negativity: x ≥ 0, y ≥ 0

Step 2: Graph each constraint

For 2x + y ≤ 100: Boundary line through (0, 100) and (50, 0), shade below

For x + 3y ≤ 150: Boundary line through (0, 50) and (150, 0), shade below

For x ≥ 0: Shade right of y-axis

For y ≥ 0: Shade above x-axis

Step 3: Find intersection points

Intersection of 2x + y = 100 and x + 3y = 150:

From first equation: y = 100 - 2x

Substitute: x + 3(100 - 2x) = 150 → x + 300 - 6x = 150 → -5x = -150 → x = 30

Then y = 100 - 2(30) = 40. Point: (30, 40)

Step 4: Identify corner points

The feasible region is a quadrilateral with vertices at: (0, 0), (0, 50), (30, 40), and (50, 0).

Step 5: Describe the region

The feasible region is bounded and represents all possible production combinations that satisfy all resource constraints.

Bounded quadrilateral with vertices (0,0), (0,50), (30,40), (50,0)
Final answer:

The feasible region is a bounded quadrilateral with corner points at (0, 0), (0, 50), (30, 40), and (50, 0). These represent the possible production combinations that satisfy all resource constraints: 100 labor hours and 150 machine hours.

Applied rules:

• Constraint Translation: Convert word constraints to mathematical inequalities

• Non-negativity: Include x ≥ 0 and y ≥ 0 for real-world problems

• Vertex Calculation: Solve systems of boundary equations

5 Inconsistent System
Exercise 5
Graph the system: y > x + 3 and y < x - 1. Does a solution exist? Explain why or why not.
Definition:

Inconsistent System: A system of inequalities with no solution. This occurs when the solution regions do not overlap.

Ineq 1
y > x + 3
Ineq 2
y < x - 1
Result
No intersection
Step 1: Graph y > x + 3

Boundary line: y = x + 3 (dashed). Test (0, 0): 0 > 3 ✗. Shade above the line.

Step 2: Graph y < x - 1

Boundary line: y = x - 1 (dashed). Test (0, 0): 0 < -1 ✗. Shade below the line.

Step 3: Analyze the relationship

Both lines have the same slope (1) but different y-intercepts. They are parallel lines: y = x + 3 and y = x - 1.

Step 4: Identify the contradiction

For a point to satisfy both inequalities: y > x + 3 AND y < x - 1. This would require y > x + 3 > x - 1 + 4 = x + 3, which is impossible.

Step 5: Conclusion

Since the solution regions do not overlap (the "above" region is completely separated from the "below" region), there is no solution to the system. This is an inconsistent system.

No solution exists | Parallel lines with no overlap
Final answer:

There is no solution to this system. The inequalities represent regions on opposite sides of parallel lines, so there is no overlap between the solution regions. This is an inconsistent system.

Applied rules:

• Parallel Lines: Same slope, different intercepts → no intersection

• Impossible Combination: y > a and y < b when a ≥ b

• Consistency Check: Verify if solution regions have any overlap

Comprehensive Summary: Graphing Solution Regions
\text{Solution Region} = \{ (x,y) \mid ax + by \lt c \}
Definition
Key Definitions:

Solution Region: The set of all points (x, y) that satisfy a given inequality or system of inequalities. It represents the area on the coordinate plane where the inequality holds true.

Boundary Line: The line formed by replacing the inequality symbol with an equals sign. It separates the solution region from the non-solution region.

Feasible Region: The area defined by all constraints in a system of inequalities. It represents all possible solutions that satisfy all conditions simultaneously.

Corner Point (Vertex): A point where two or more boundary lines intersect in a feasible region. These are critical in optimization problems.

Bounded Region: A feasible region that is enclosed and finite in area. All variables are constrained within finite bounds.

Unbounded Region: A feasible region that extends infinitely in at least one direction.

Consistent System: A system that has at least one solution (feasible region is not empty).

Inconsistent System: A system that has no solution (feasible region is empty).

Complete Graphing Process:
  1. Identify the Inequality: Determine the form and variables involved
  2. Graph the Boundary Line: Convert inequality to equation and graph using intercepts or slope-intercept form
  3. Determine Line Type: Solid line for ≤ or ≥, dashed line for < or >
  4. Choose a Test Point: Select a point not on the boundary line (often origin if available)
  5. Test the Point: Substitute coordinates into original inequality
  6. Shade the Solution Region: Shade the side containing points that satisfy the inequality
  7. For Systems: Find intersection of all individual solution regions
  8. Identify Corner Points: Find intersections of boundary lines
Tip 1: Always use the test point method to determine which side of the boundary line to shade.
Tip 2: Remember: solid line for ≤ or ≥, dashed line for < or >.
Tip 3: For systems, the solution is the intersection of all individual solution regions.
Tip 4: Corner points occur where boundary lines intersect.
Common Applications: Linear programming, resource allocation, budget constraints, production planning, scheduling.
Geometric Properties: Convex polygons, linear boundaries, vertex solutions, parallel constraints.
Essential Rules:

Line Type Rules:

• Solid Line: For inequalities with ≤ or ≥ (boundary included in solution)

• Dashed Line: For inequalities with < or > (boundary not included in solution)

Shading Rules:

• Test Point Method: If test point satisfies inequality, shade that side

• Direction: Positive slope patterns, negative slope patterns

System Rules:

• Intersection: Solution is intersection of all individual solution regions

• Consistency: Check if intersection is non-empty

• Corner Points: Occur at intersections of boundary lines

Example Progression

Simple Case: Single inequality y > x (half-plane)

System: Two inequalities forming a wedge

Bounded: Three or more inequalities creating a polygon

Unbounded: Region extending infinitely in one direction

Inconsistent: Parallel constraints with no overlap

Identity: Constraint that doesn't limit the region

Advanced Applications and Problem-Solving Strategies
\text{Maximize } z = ax + by \text{ subject to: } \text{system of inequalities}
Linear Programming
Advanced Concepts:

Linear Programming: Optimization of a linear objective function subject to linear inequality constraints. The optimal solution occurs at a corner point of the feasible region.

Corner Point Theorem: If a linear programming problem has an optimal solution, it occurs at one or more corner points of the feasible region.

Redundant Constraints: Constraints that don't affect the feasible region because they're already implied by other constraints.

Advanced Problem-Solving Steps:
  1. Model Formulation: Translate real-world problem into mathematical constraints
  2. Feasible Region Analysis: Identify vertices and determine boundedness
  3. Objective Function: Define what needs to be maximized or minimized
  4. Corner Point Evaluation: Calculate objective function at each vertex
  5. Optimal Solution: Select vertex that gives best value of objective function
  6. Sensitivity Analysis: Examine how changes in constraints affect the solution
Tip 1: In real-world problems, always consider implicit constraints like non-negativity.
Tip 2: The feasible region is the intersection of all constraint regions.
Tip 3: If the feasible region is unbounded, check if the objective function has a maximum or minimum.
Tip 4: Always verify that your solution makes sense in the context of the problem.
Common Pitfalls: Forgetting constraints, incorrect shading, misinterpreting inequalities, overlooking non-negativity.
Best Practices: Graph carefully, check all constraints, verify corner points, interpret results in context.
Critical Success Factors:

• Accurate Graphing: Precisely draw boundary lines with correct slope and intercepts

• Correct Line Type: Dashed for strict inequalities, solid for inclusive inequalities

• Proper Shading: Use test points to ensure correct shading direction

• System Integration: For systems, identify intersection of all solution regions

• Context Awareness: Consider real-world constraints and implications

• Verification: Check that solution points satisfy all original constraints

Questions & Answers

Question: How do I determine if a solution region is bounded or unbounded?

Answer: A solution region is:

  • Bounded: If it can be enclosed within a circle of finite radius. All variables have both minimum and maximum possible values.
  • Unbounded: If it extends infinitely in at least one direction. At least one variable can increase or decrease without bound.

To check:

  1. Look for constraints in all directions (left, right, up, down)
  2. If there's no constraint in some direction, the region extends infinitely in that direction
  3. Count the number of corner points - bounded regions have a finite number of vertices

For example, if you have constraints x ≥ 0, y ≥ 0, and x + y ≤ 10, the region is bounded because it's confined to the first quadrant and limited by the line x + y = 10.

Question: What's the difference between a solid line and a dashed line in solution regions?

Answer: The line type indicates whether the boundary is included in the solution:

  • Solid Line: Used for ≤ or ≥ inequalities. Points on the line are included in the solution region.
  • Dashed Line: Used for < or > inequalities. Points on the line are NOT included in the solution region.

For example:

  • y ≥ 2x + 1: Solid line, shade above (including the line)
  • y > 2x + 1: Dashed line, shade above (excluding the line)

This distinction is crucial because it affects which points satisfy the inequality.

Question: How do I know which side to shade when graphing an inequality?

Answer: Use the test point method:

  1. Choose a point that is NOT on the boundary line (the origin (0,0) is often convenient)
  2. Substitute the coordinates of the test point into the original inequality
  3. If the inequality is true, shade the side containing the test point
  4. If the inequality is false, shade the opposite side

For example, for y > 2x - 3:

  • Test point (0,0): Is 0 > 2(0) - 3? → Is 0 > -3? ✓
  • Since true, shade the side containing (0,0)

This method always works regardless of the inequality form.