System of Linear Inequalities: A set of two or more linear inequalities in the same variables. The solution is the intersection of all individual solution regions.
- Graph each inequality separately
- Identify the solution region for each
- Find the intersection of all solution regions
- Identify corner points where boundary lines intersect
- Verify solution by testing points
Draw solid line y = x + 1 (slope = 1, y-intercept = 1). Test (0,0): 0 ≥ 0 + 1 → 0 ≥ 1 (false). Shade above the line.
Draw solid line y = -x + 5 (slope = -1, y-intercept = 5). Test (0,0): 0 ≤ 0 + 5 → 0 ≤ 5 (true). Shade below the line.
The solution is the area that satisfies both conditions: above y = x + 1 AND below y = -x + 5.
Intersection point: x + 1 = -x + 5 → 2x = 4 → x = 2. Then y = 2 + 1 = 3. Point: (2, 3)
With non-negativity constraints (if assumed), the region is bounded by the intersection point and intercepts with axes.
The solution region is the area above the line y = x + 1 and below the line y = -x + 5. The corner point is (2, 3), where the two lines intersect. This represents all ordered pairs (x, y) that satisfy both inequalities simultaneously.
• Intersection Rule: System solution is intersection of individual solution sets
• Corner Points: Occur at intersections of boundary lines
• Verification: Test points in original inequalities to confirm solution
Feasible Region: The area defined by all constraints in a system of inequalities. Vertices: Corner points where boundary lines intersect.
Draw solid vertical line x = 0 and shade to the right.
Draw solid horizontal line y = 0 and shade above.
Draw solid line 2x + 3y = 12. Find intercepts: x=0→y=4, y=0→x=6. Test (0,0): 0≤12 ✓. Shade below the line.
Vertices occur where boundary lines intersect: (0,0), (0,4), (6,0). The line 2x + 3y = 12 intersects both axes at the intercepts.
The feasible region is a triangle with vertices at (0,0), (0,4), and (6,0). It represents all points in the first quadrant that also satisfy 2x + 3y ≤ 12.
The feasible region is a triangle in the first quadrant with vertices at (0, 0), (0, 4), and (6, 0). The shape is bounded by the x-axis, y-axis, and the line 2x + 3y = 12.
• Non-negativity: x ≥ 0 and y ≥ 0 constrain to first quadrant
• Vertex Calculation: Intersection points of boundary lines
• Region Shape: Number of constraints determines number of sides
Inconsistent System: A system of inequalities with no solution. This occurs when the solution regions do not overlap.
Draw dashed line y = x + 3 (slope = 1, y-intercept = 3). Test (0,0): 0 > 3 (false). Shade above the line.
Draw dashed line y = x - 1 (slope = 1, y-intercept = -1). Test (0,0): 0 < -1 (false). Shade below the line.
Both lines have slope 1 but different y-intercepts. The first line (y = x + 3) is parallel to the second (y = x - 1) but 4 units higher.
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.
Since the solution regions do not overlap (the "above" region is completely separated from the "below" region), there is no solution to the system.
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.
• 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
System of Linear Inequalities: A collection of linear inequalities in the same variables. The solution is the set of all ordered pairs that satisfy all inequalities simultaneously.
Feasible Region: The region of the coordinate plane that satisfies all constraints in the system. It represents all possible solutions.
Corner Point (Vertex): A point where boundary lines of the feasible region intersect. These are critical in optimization problems.
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.
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).
- Graph Each Inequality: Draw boundary line and shade appropriate region
- Identify Overlap: Find intersection of all shaded regions
- Mark Corner Points: Find intersections of boundary lines
- Verify Solution: Test points in the region against all original inequalities
- Describe Region: Note if it's bounded/unbounded and identify vertices
• Intersection Principle: Solution is intersection of all individual solution sets
• Line Type: Solid for ≤ or ≥, dashed for < or >
• Shading Direction: Test points determine which side to shade
• Vertex Importance: Optimal solutions occur at corner points
• Consistency Check: Verify that feasible region is non-empty
Constraint Modeling: Translating real-world limitations into mathematical inequalities to define a feasible region for optimization problems.
Let x = number of units of Product A, y = number of units of Product B
Product A uses 2 hours, Product B uses 1 hour. Total available: 100 hours. Inequality: 2x + y ≤ 100
Product A uses 1 hour, Product B uses 3 hours. Total available: 150 hours. Inequality: x + 3y ≤ 150
Cannot produce negative quantities: x ≥ 0 and y ≥ 0
Graph all four inequalities: 2x + y ≤ 100, x + 3y ≤ 150, x ≥ 0, y ≥ 0. The feasible region is in the first quadrant bounded by all constraints.
Vertices: (0,0), (0,50), (30,40), (50,0). These are intersections of boundary lines.
The system of constraints is: x ≥ 0, y ≥ 0, 2x + y ≤ 100, x + 3y ≤ 150. The feasible region is a quadrilateral with vertices at (0, 0), (0, 50), (30, 40), and (50, 0). These represent the possible production combinations that satisfy all resource limitations.
• Resource Constraints: Total usage ≤ Total availability
• Non-negativity: Physical quantities must be non-negative
• Linear Programming: Constraints form convex feasible region
Unbounded Region: A feasible region that extends infinitely in at least one direction. The solution set has infinite area.
Draw solid line y = x - 2. Test (0,0): 0 ≥ -2 ✓. Shade above the line.
Draw solid line y = -x + 2. Test (0,0): 0 ≥ 2 (false). Shade above the line.
Draw solid line x = 0 (y-axis). Shade to the right.
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 (0, 2). This is another vertex.
The region extends infinitely upward (as x increases, y can increase without bound), so it's unbounded.
The feasible region is unbounded. It has vertices at (0, 2) and (2, 0). The region extends infinitely upward and to the right, satisfying all three constraints but having infinite area.
• Unbounded Detection: Region extends infinitely in any direction
• Vertex Calculation: Intersections of active constraints
• Feasibility: Region still valid even if unbounded
System of Linear Inequalities: A set of two or more linear inequalities in the same variables. The solution is the intersection of all individual solution sets.
Feasible Region: The area defined by all constraints in the system. It represents all possible solutions that satisfy all constraints simultaneously.
Corner Point (Vertex): A point where two or more boundary lines intersect. 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. At least one variable can grow without bound.
Consistent System: A system that has at least one solution (the feasible region is not empty).
Inconsistent System: A system that has no solution (the feasible region is empty).
Active Constraint: A constraint that is satisfied as an equality at a particular point in the feasible region.
Redundant Constraint: A constraint that doesn't affect the feasible region because it's already implied by other constraints.
- Identify Variables: Define what x and y represent in the context
- Formulate Constraints: Translate each limitation into an inequality
- Graph Each Inequality: Draw boundary lines and shade appropriate regions
- Find Intersection: Identify the area where all shadings overlap
- Locate Vertices: Find all corner points where boundary lines intersect
- Classify Region: Determine if feasible region is bounded or unbounded
- Verify Solution: Test points in the region against all original inequalities
System Properties:
• Intersection Rule: The solution to a system is the intersection of all individual solution sets
• Convexity: The feasible region of a system of linear inequalities is always a convex set
• Vertex Theorem: If an optimal solution exists, it occurs at a vertex of the feasible region
• Consistency: A system is consistent if the feasible region is non-empty
Graphical Properties:
• Line Type: Solid for ≤ or ≥, dashed for < or >
• Shading Direction: Determined by test point method
• Boundedness: Finite area (bounded) vs infinite extension (unbounded)
• Parallel Constraints: May lead to no solution or redundant constraints
Simple Case: Two inequalities forming a triangular region
Quadrilateral: Four inequalities creating a rectangular or trapezoidal region
Unbounded: Region extending infinitely in one direction
Empty Set: Contradictory constraints with no solution
Single Point: Constraints that uniquely determine the solution
Half-Plane: Single inequality with one constraint
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.
Slack Variables: Variables added to convert inequality constraints into equality constraints.
Basic Feasible Solution: A solution that corresponds to a corner point of the feasible region.
- Model Formulation: Translate real-world problem into mathematical constraints
- Feasible Region Analysis: Identify vertices and boundedness
- Objective Function: Define what needs to be maximized or minimized
- Corner Point Evaluation: Calculate objective function at each vertex
- Optimal Solution: Select vertex that gives best value of objective function
- Sensitivity Analysis: Examine how changes in constraints affect the solution
• 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 system of inequalities has a solution without graphing?
Answer: While graphing is the most reliable method, you can analyze consistency by:
- Checking for contradictory constraints: Look for inequalities like x > 5 AND x < 3
- Examining parallel constraints: If two constraints are parallel and point in opposite directions, there may be no solution
- Testing feasibility: Try to find a point that satisfies all constraints
For example, the system x > 5 and x < 3 has no solution because no number can be both greater than 5 and less than 3 simultaneously.
However, graphing remains the most reliable way to visualize and confirm the solution set.
Question: What's the difference between a bounded and unbounded feasible region, and why does it matter?
Answer: The key differences are:
- Bounded Region: Finite area enclosed by constraints; variables have both minimum and maximum possible values
- Unbounded Region: Infinite area; at least one variable can increase or decrease without bound
This matters for optimization because:
- In a bounded region, an optimal solution (if it exists) is guaranteed at a corner point
- In an unbounded region, a maximum may not exist (objective function can increase indefinitely), though a minimum might still exist
For example, if maximizing profit in an unbounded region, you might find that profit can theoretically increase forever, which indicates a problem with the model.
Question: How do I find the corner points of a feasible region algebraically?
Answer: Corner points occur where boundary lines intersect. To find them:
- Take each pair of boundary equations from the constraints
- Solve the system of equations formed by that pair
- Verify that the solution satisfies all other constraints
- Repeat for all pairs of boundary lines
For example, if you have constraints y ≥ x + 1 and y ≤ -x + 5, the corner point is where y = x + 1 and y = -x + 5 intersect. Setting x + 1 = -x + 5, we get 2x = 4, so x = 2 and y = 3. The corner point is (2, 3).
Remember to check that the intersection point satisfies all constraints in the system.