Systems of linear equations and inequalities let you find values that satisfy multiple conditions at once. They're central to Honors Algebra II because they connect algebraic techniques to real-world modeling, and they show up constantly in later math courses.
This section covers three methods for solving systems of equations, how to classify systems by their number of solutions, graphing systems of inequalities, and applying all of it to word problems.
Solving Systems of Equations

Graphical Method
Graph both equations on the same coordinate plane. The solution is the point (or points) where the lines intersect. You read the - and -coordinates directly from the intersection point.
This method is great for visualizing what's happening, but it's not always precise. If the intersection falls between grid lines, you'll need an algebraic method to get an exact answer.
Substitution Method
Substitution works best when one equation already has a variable isolated (or can be rearranged easily).
- Solve one equation for one variable.
- Substitute that expression into the other equation.
- Solve the resulting single-variable equation.
- Plug the value back into either original equation to find the other variable.
Example:
Given:
Solve the second equation for :
Substitute into the first equation:
Distribute and combine: , so , giving
Back-substitute:
The solution is .
Elimination Method
Elimination (also called the addition method) works by adding the two equations together so that one variable cancels out.
- If the coefficients of one variable are already opposites, add the equations directly.
- If not, multiply one or both equations by constants so that one variable's coefficients become opposites.
- Add the equations to eliminate that variable.
- Solve for the remaining variable.
- Substitute back into either original equation to find the other variable.
Example:
Given:
Multiply the second equation by 2:
Add to the first equation: , so
Solve:
Substitute into the second equation: , so , giving
The solution is .
Number of Solutions for Systems
Every system of two linear equations falls into one of three categories. Recognizing which category you're in saves time and prevents confusion when you get an unexpected result during solving.

One Solution (Consistent and Independent)
The lines have different slopes, so they cross at exactly one point. This is the most common case. You'll get a unique pair.
No Solution (Inconsistent)
The lines are parallel: same slope, different -intercepts. They never intersect. When you solve algebraically, the variables cancel and you're left with a false statement like . That false statement is your signal that no solution exists.
Infinitely Many Solutions (Consistent and Dependent)
The lines are coincident, meaning they're the same line. Same slope, same -intercept. Algebraically, the variables cancel and you get a true statement like .
Example: Consider:
The second equation is just the first multiplied by 2. Every point on satisfies both equations, so there are infinitely many solutions.
Quick check: Before solving, compare the equations in slope-intercept form. If the slopes differ, expect one solution. If slopes match but intercepts differ, no solution. If both match, infinitely many.
Graphing Systems of Inequalities

Graphing a Linear Inequality
-
Rewrite the inequality in slope-intercept form if needed.
-
Graph the boundary line:
- Dashed line for strict inequalities ( or ) because points on the line are not included.
- Solid line for non-strict inequalities ( or ) because points on the line are included.
-
Shade the correct side:
- Shade above the line for or .
- Shade below the line for or .
- If you're unsure, test a point (the origin is convenient when it's not on the line). If the point satisfies the inequality, shade that side.
Identifying the Solution Set
Graph each inequality on the same coordinate plane. The solution set is the region where all shaded areas overlap.
- Bounded solution set: the overlapping region is enclosed (forms a polygon).
- Unbounded solution set: the overlapping region extends infinitely in some direction.
- Empty solution set: no overlap exists, meaning no point satisfies all inequalities simultaneously.
To find the vertices of the solution region, solve the systems of equations formed by pairs of boundary lines. These vertices matter because, in optimization problems, the best answer always occurs at a vertex.
Example:
Given:
Graph as a solid line and shade below. Graph as a dashed line and shade above. The solution set is the unbounded region where the shading overlaps.
Real-World Applications of Systems
Modeling with Systems of Linear Equations
The setup process for word problems follows a consistent pattern:
- Define your variables clearly (what does represent? what does represent?).
- Translate each condition in the problem into an equation.
- Solve using substitution or elimination.
- Check that your answer makes sense in context.
Common scenarios include:
- Break-even analysis: finding where revenue equals cost
- Mixture problems: combining solutions of different concentrations
- Rate problems: two objects moving at different speeds
Modeling with Systems of Linear Inequalities
The setup is similar, but constraints become inequalities instead of equations. These problems often ask you to find a feasible region rather than a single answer.
- Linear programming problems ask you to maximize or minimize an objective function (like profit or cost) subject to inequality constraints.
- The optimal solution always occurs at a vertex of the feasible region, so you only need to evaluate the objective function at each vertex.
Interpreting Solutions
Always check that your mathematical answer makes sense in context. Negative quantities of a product, fractional numbers of people, or values that violate a constraint all signal that you need to re-examine your work.
Example:
A bakery sells cupcakes and cookies. Each cupcake uses 2 units of flour and 1 unit of sugar. Each cookie uses 1 unit of flour and 2 units of sugar. The bakery has 50 units of flour and 60 units of sugar. Profit is per cupcake and per cookie.
Let = number of cupcakes, = number of cookies.
Constraints:
- (flour)
- (sugar)
- (can't produce negative quantities)
Objective function: Maximize
Find the vertices of the feasible region by solving pairs of boundary equations:
- :
- :
- :
- Intersection of and : solving gives , so
Evaluating at each vertex, the maximum profit of occurs at : produce 25 cupcakes and 0 cookies.
Note: If the problem requires whole-number answers (which is realistic for baked goods), you'd check integer points near any non-integer vertex to confirm the optimum.