Study guide
4.3 Single & Systems of Linear Inequalities on the Coordinate Plane
FTCE Mathematics 6-12 026
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview & Rational Number Systems
1.1 FTCE Mathematics 6-12 Overview, Interface & Test-Taking Strategies 1.2 Rational Numbers, Representations & Multi-Step Operations
2 Chapter 2: Real Number Approximations & Proportional Reasoning
2.1 Irrational Numbers, Radical Estimation & Scientific Notation 2.2 Ratios, Rates, Proportions & Dimensional Analysis 2.3 Percent Applications, Financial Models & Depreciation
3 Chapter 3: Algebraic Expressions & Polynomial Operations
3.1 Polynomial Arithmetic, Factoring Strategies & Special Products 3.2 Radical Operations, Rational Expressions & Equations 3.3 Field Properties, Exponent Laws & Literal Equations
4 Chapter 4: Linear Relationships, Systems & Inequalities
4.1 Linear Equations, Slope Concepts & Line Forms 4.2 Systems of Linear Equations & Real-World Applications 4.3 Single & Systems of Linear Inequalities on the Coordinate Plane 4.4 Absolute Value Equations & Inequalities in One and Two Variables
5 Chapter 5: Quadratic Equations, Functions & Complex Numbers
5.1 Quadratic Equations, Discriminant & Complex Number Arithmetic 5.2 Quadratic Functions: Vertex, Axis, Intercepts & Concavity 5.3 Quadratic Inequalities in One/Two Variables & Optimization
6 Chapter 6: Function Foundations, Transformations & Inverses
6.1 Function Definitions, Relations, Domain, Range & Notation 6.2 Function Families, Key Graphical Behaviors & Even/Odd Symmetry 6.3 Shifting, Scaling & Reflecting Functions Across Representations 6.4 Function Composition, Invertibility & Inverse Functions
7 Chapter 7: Geometric Foundations, Angles & Deductive Proofs
7.1 Angle Relationships, Parallel Lines & Transversals 7.2 Triangle Sum, Exterior Angles & Polygon Angle Formulas 7.3 Formal Proof Methods, CPCTC & Quadrilateral Properties
8 Chapter 8: Congruence, Similarity & Geometric Transformations
8.1 Triangle Congruence (SSS, SAS, ASA, AAS, HL) & Similarity (AA, SAS, SSS) 8.2 Rigid Motions: Translations, Reflections, Rotations & Symmetry 8.3 Dilations, Scale Factors & Proportional Reasoning in Geometry
9 Chapter 9: Coordinate Geometry & 3D Spatial Measurement
9.1 Distance, Midpoint, Slope Criteria & Coordinate Proofs 9.2 Perimeter, Area, Surface Area & Volume of 2D and 3D Figures 9.3 Cross Sections of 3D Figures & Solids of Revolution
10 Chapter 10: Circle Theorems & Geometric Constructions
10.1 Central, Inscribed, Tangent & Chord Angles and Arcs 10.2 Intersecting Chords, Secant/Tangent Lengths, Arc Length & Sector Area 10.3 Euclidean Constructions with Compass and Straightedge
11 Chapter 11: Conic Sections & Coordinate Modeling
11.1 Circles and Parabolas: Geometric Definitions, Equations & Modeling 11.2 Ellipses and Hyperbolas: Foci, Axes, Asymptotes & Real-World Applications
12 Chapter 12: Trigonometric Foundations & Oblique Triangles
12.1 Right-Triangle Trigonometry, Pythagorean Theorem & Special Triangles 12.2 The Unit Circle, Radian Measure & Exact Trigonometric Values 12.3 Law of Sines (Ambiguous Case), Law of Cosines & Oblique Triangle Area
13 Chapter 13: Trigonometric Functions, Polar & Parametric Systems
13.1 Graphs of the Six Trigonometric Functions & Periodic Modeling 13.2 Polar Coordinates, Polar-Rectangular Conversion & Polar Graphs 13.3 Parametric Equations, Elimination of Parameters & Projectile Motion
14 Chapter 14: Descriptive Statistics & Data Distributions
14.1 Measures of Central Tendency, Dispersion & Resistant Statistics 14.2 Univariate Displays (Histograms, Boxplots, Stemplots) & Distribution Shapes 14.3 Normal Distribution Properties, Empirical Rule & Standard Normal Z-Scores
15 Chapter 15: Statistical Studies, Bivariate Data & Linear Regression
15.1 Statistical Study Design, Random Sampling Techniques & Sources of Bias 15.2 Survey Sampling, Margin of Error & Population Estimation 15.3 Scatterplots, Correlation Coefficient r, Linear Regression & Residuals
16 Chapter 16: Probability Theory, Two-Way Tables & Expected Value
16.1 Fundamental Counting Principle, Permutations & Combinations 16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability 16.3 Two-Way Frequency Tables, Law of Large Numbers & Expected Value of Random Variables
17 Chapter 17: Precalculus: Polynomial, Rational & Transcendental Functions
17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots 17.2 Rational Functions, Domain Restrictions, Holes & Asymptotes 17.3 Exponential & Logarithmic Functions, Base e & Logarithmic Properties
18 Chapter 18: Sequences, Series, Binomial Theorem & Vectors
18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence 18.2 Binomial Theorem, Pascal's Triangle & General Term Determination 18.3 Vector Representations, Operations, Magnitude, Direction & Dot Product
19 Chapter 19: Differential Calculus Foundations
19.1 Limits, One-Sided Limits, Indeterminate Forms & Continuity 19.2 Derivative Definition, Power, Product, Quotient & Transcendental Rules 19.3 Chain Rule, Tangent Line Equations & Rates of Change
20 Chapter 20: Applications of Derivatives & Integral Calculus
20.1 First & Second Derivative Tests, Extrema, Concavity & Optimization 20.2 Antiderivatives, Indefinite Integrals & Integration by U-Substitution 20.3 Fundamental Theorem of Calculus, Net Signed Area & Geometric Applications
21 Chapter 21: Mathematical Representations, Progressions & Tools
21.1 Concrete-Representational-Abstract (CPA) Progressions & Concept Continuity 21.2 The Rule of Four: Translating Among Representations to Support Fluency 21.3 Manipulatives, Dynamic Software & Technology in Secondary Mathematics
22 Chapter 22: Assessment, Error Analysis & Misconception Remediation
22.1 Student Misconceptions & Error Analysis Across Core Secondary Domains 22.2 Evaluating Validity of Student Mathematical Arguments & Reasonableness Checks 22.3 Formative Assessment Formats, Data-Driven Differentiation & Tiered Tasks
4.3 Single & Systems of Linear Inequalities on the Coordinate Plane
Key Takeaways Explain This Topic AI
Multiplying or dividing an inequality by a negative number reverses the inequality symbol, derived from the ordered field axiom that the product of positive elements is positive.
A linear inequality in two variables partitions the plane via a boundary line (solid for <= and >=; dashed for < and >), with the solution half-plane verified using a test point such as (0, 0).
The solution set of a system of linear inequalities is the intersection of half-planes, forming a convex polygonal feasible region that may be bounded or unbounded.
Vertices (corner points) of feasible regions are computed by solving pairwise linear systems of intersecting active boundary lines.
The Fundamental Theorem of Linear Programming guarantees that the optimal value of a linear objective function z = ax + by over a compact convex feasible region occurs at one or more vertices.
Last updated: September 2026
4.3 Single & Systems of Linear Inequalities on the Coordinate Plane
Linear inequalities extend linear equation concepts into regions of numerical order and multi-dimensional coordinate spaces. On the FTCE Mathematics 6–12 examination, educators must demonstrate conceptual and algebraic mastery of order axioms, boundary line conventions, half-plane test point methods, convex polygonal feasible regions, and linear programming optimization protocols.
1. Single Linear Inequalities & Order Inversion Axioms
A linear inequality in one variable over the real numbers R \mathbb{R} R involves expressions of degree one separated by inequality symbols ( < , ≤ , > , ≥ <, \le, >, \ge < , ≤ , > , ≥ ). The algebraic properties governing inequalities mirror those of equations, with one crucial, foundational distinction: multiplying or dividing by a negative real number reverses the direction of the inequality.
The algebraic justification stems directly from the axioms of an ordered field. By definition, a < b a < b a < b means that the difference b − a b - a b − a is strictly positive ( b − a > 0 b - a > 0 b − a > 0 ). If c c c is a negative real number ( c < 0 c < 0 c < 0 ), then by definition − c -c − c is strictly positive ( − c > 0 -c > 0 − c > 0 ). Multiplying the positive quantity ( b − a ) (b - a) ( b − a ) by the positive quantity ( − c ) (-c) ( − c ) must yield a positive product by field closure under multiplication: ( − c ) ( b − a ) > 0 ⟹ − b c + a c > 0 ⟹ a c − b c > 0 ⟹ a c > b c (-c)(b - a) > 0 \implies -bc + ac > 0 \implies ac - bc > 0 \implies ac > bc ( − c ) ( b − a ) > 0 ⟹ − b c + a c > 0 ⟹ a c − b c > 0 ⟹ a c > b c
Hence, a < b a < b a < b and c < 0 c < 0 c < 0 rigorously imply a c > b c ac > bc a c > b c . Failing to reverse the inequality symbol when dividing or multiplying by a negative scalar is one of the most widespread student errors diagnosed on the FTCE Mathematics 6–12 examination.
Compound inequalities combine two conditions:
Conjunction ("And"): a ≤ x ≤ b a \le x \le b a ≤ x ≤ b denotes the intersection of two conditions: x ≥ a x \ge a x ≥ a and x ≤ b x \le b x ≤ b . The solution set is a bounded interval [ a , b ] [a, b] [ a , b ] .
Disjunction ("Or"): x ≤ a or x ≥ b x \le a \text{ or } x \ge b x ≤ a or x ≥ b (with a < b a < b a < b ) denotes the union of two disjoint unbounded intervals: ( − ∞ , a ] ∪ [ b , ∞ ) (-\infty, a] \cup [b, \infty) ( − ∞ , a ] ∪ [ b , ∞ ) .
2. Two-Variable Linear Inequalities & Half-Plane Geometry
A linear inequality in two variables can be written in standard form as A x + B y ≤ C Ax + By \le C A x + B y ≤ C (or with < , > , ≥ <, >, \ge < , > , ≥ ). In the Cartesian plane R 2 \mathbb{R}^2 R 2 , the corresponding linear equation A x + B y = C Ax + By = C A x + B y = C defines the boundary line .
By the Jordan Curve Theorem for lines, any straight line partitions the Euclidean plane into three mutually disjoint subsets: the boundary line itself, and two open half-planes lying on opposite sides of the line.
Boundary Line Style:
Solid Line ( ≤ , ≥ \le, \ge ≤ , ≥ ): Indicates an inclusive inequality where the boundary points satisfy the relation.
Dashed Line ( < , > <, > < , > ): Indicates a strict inequality where points on the boundary line are excluded from the solution set.
The Test-Point Protocol: To identify which half-plane contains the solution set:
Graph the boundary line A x + B y = C Ax + By = C A x + B y = C .
Select a test point ( x 0 , y 0 ) (x_0, y_0) ( x 0 , y 0 ) that does not lie on the boundary line. The origin ( 0 , 0 ) (0, 0) ( 0 , 0 ) is the standard algebraic choice whenever C ≠ 0 C \neq 0 C = 0 .
Substitute ( x 0 , y 0 ) (x_0, y_0) ( x 0 , y 0 ) into the inequality. If the resulting numerical statement is true, shade the entire half-plane containing ( x 0 , y 0 ) (x_0, y_0) ( x 0 , y 0 ) . If false, shade the opposite half-plane.
Solving for y y y Warning: When converting A x + B y > C Ax + By > C A x + B y > C to slope-intercept form y > m x + b y > mx + b y > m x + b , if B < 0 B < 0 B < 0 , dividing by B B B reverses the inequality to y < m x + b y < mx + b y < m x + b . Thus, "greater than" in standard form with B < 0 B < 0 B < 0 corresponds to shading below the boundary line.
3. Systems of Linear Inequalities & Convex Feasible Regions
A system of linear inequalities consists of two or more simultaneous inequalities: { A 1 x + B 1 y ≤ C 1 A 2 x + B 2 y ≤ C 2 ⋮ A m x + B m y ≤ C m \begin{cases} A_1 x + B_1 y \le C_1 \\ A_2 x + B_2 y \le C_2 \\ \quad \vdots \\ A_m x + B_m y \le C_m \end{cases} ⎩ ⎨ ⎧ A 1 x + B 1 y ≤ C 1 A 2 x + B 2 y ≤ C 2 ⋮ A m x + B m y ≤ C m
The overall solution set F \mathcal{F} F is the simultaneous intersection of all individual closed (or open) half-planes: F = ⋂ i = 1 m H i \mathcal{F} = \bigcap_{i=1}^m H_i F = i = 1 ⋂ m H i
A fundamental geometric property of the feasible region F \mathcal{F} F is convexity . A set S ⊆ R 2 \mathcal{S} \subseteq \mathbb{R}^2 S ⊆ R 2 is convex if for every pair of points P , Q ∈ S P, Q \in \mathcal{S} P , Q ∈ S , the line segment P Q ‾ \overline{PQ} PQ is entirely contained within S \mathcal{S} S . Because every half-plane is convex and the intersection of any collection of convex sets is itself convex, every linear inequality feasible region is a convex polygonal set .
Feasible regions are classified into two categories:
Bounded (Compact): The region can be enclosed entirely within a circle of finite radius. It forms a closed convex polygon with finite area and a finite number of vertices (corner points).
Unbounded: The region extends infinitely in one or more directions.
4. Linear Programming & The Fundamental Extreme Value Theorem
Linear Programming is a mathematical optimization technique used to maximize or minimize a linear objective function: z = f ( x , y ) = a x + b y z = f(x, y) = ax + by z = f ( x , y ) = a x + b y
subject to a set of linear inequality constraints defining a feasible region F \mathcal{F} F .
Fundamental Theorem of Linear Programming: If an optimal value (maximum or minimum) of the objective function z = a x + b y z = ax + by z = a x + b y exists over a non-empty closed and bounded convex feasible region F \mathcal{F} F , it must occur at one or more vertices (corner points) of F \mathcal{F} F .
Geometric Rationale: Level sets of the objective function a x + b y = k ax + by = k a x + b y = k represent a family of parallel lines with constant slope m = − a b m = -\frac{a}{b} m = − b a . Increasing (or decreasing) k k k translates this line across the coordinate plane. The extreme values of k k k where the line still makes contact with the closed convex polygon F \mathcal{F} F occur at the boundary extremes—which are inevitably corner vertices (or an entire boundary edge connecting two vertices if the level line is parallel to an edge).
5. Worked Exemplar: Linear Programming Optimization
Problem: A small craft furniture shop manufactures custom desks ( x x x ) and bookcases ( y y y ). The shop seeks to maximize weekly profit P ( x , y ) = 40 x + 30 y P(x, y) = 40x + 30y P ( x , y ) = 40 x + 30 y subject to the constraints: { x + 2 y ≤ 16 (Carpentry hours) x + y ≤ 9 (Finishing hours) x ≥ 0 , y ≥ 0 (Non-negativity constraints) \begin{cases} x + 2y \le 16 & \text{(Carpentry hours)} \\ x + y \le 9 & \text{(Finishing hours)} \\ x \ge 0, \; y \ge 0 & \text{(Non-negativity constraints)} \end{cases} ⎩ ⎨ ⎧ x + 2 y ≤ 16 x + y ≤ 9 x ≥ 0 , y ≥ 0 (Carpentry hours) (Finishing hours) (Non-negativity constraints)
Step 1: Determine boundary lines and intercepts
x + 2 y = 16 x + 2y = 16 x + 2 y = 16 : Intercepts are ( 16 , 0 ) (16, 0) ( 16 , 0 ) and ( 0 , 8 ) (0, 8) ( 0 , 8 ) .
x + y = 9 x + y = 9 x + y = 9 : Intercepts are ( 9 , 0 ) (9, 0) ( 9 , 0 ) and ( 0 , 9 ) (0, 9) ( 0 , 9 ) .
Non-negativity x ≥ 0 , y ≥ 0 x \ge 0, y \ge 0 x ≥ 0 , y ≥ 0 restricts the region to Quadrant I.
Step 2: Identify the vertices of the feasible region The feasible region is a convex polygon bounded by the coordinate axes and constraint lines:
Vertex 1: The origin ( 0 , 0 ) (0, 0) ( 0 , 0 ) .
Vertex 2: The y y y -intercept bounded by carpentry: ( 0 , 8 ) (0, 8) ( 0 , 8 ) (since ( 0 , 9 ) (0, 9) ( 0 , 9 ) violates x + 2 y ≤ 16 x + 2y \le 16 x + 2 y ≤ 16 , as 0 + 2 ( 9 ) = 18 > 16 0 + 2(9) = 18 > 16 0 + 2 ( 9 ) = 18 > 16 ).
Vertex 3: The x x x -intercept bounded by finishing: ( 9 , 0 ) (9, 0) ( 9 , 0 ) (since ( 16 , 0 ) (16, 0) ( 16 , 0 ) violates x + y ≤ 9 x + y \le 9 x + y ≤ 9 ).
Vertex 4: The intersection of x + 2 y = 16 x + 2y = 16 x + 2 y = 16 and x + y = 9 x + y = 9 x + y = 9 :
Subtract the second equation from the first: ( x + 2 y ) − ( x + y ) = 16 − 9 ⟹ y = 7 (x + 2y) - (x + y) = 16 - 9 \implies y = 7 ( x + 2 y ) − ( x + y ) = 16 − 9 ⟹ y = 7 Substitute y = 7 y = 7 y = 7 into x + y = 9 ⟹ x = 2 x + y = 9 \implies x = 2 x + y = 9 ⟹ x = 2 .
Intersection vertex: ( 2 , 7 ) (2, 7) ( 2 , 7 ) .
Step 3: Evaluate the objective function P ( x , y ) = 40 x + 30 y P(x, y) = 40x + 30y P ( x , y ) = 40 x + 30 y at each vertex
Vertex ( x , y ) (x, y) ( x , y ) Algebraic Evaluation of P ( x , y ) = 40 x + 30 y P(x, y) = 40x + 30y P ( x , y ) = 40 x + 30 y Profit Value ( P P P ) Feasibility Status
( 0 , 0 ) (0, 0) ( 0 , 0 ) 40 ( 0 ) + 30 ( 0 ) = 0 40(0) + 30(0) = 0 40 ( 0 ) + 30 ( 0 ) = 0 $ 0 \text{\textdollar}0 $ 0 Minimum profit
( 0 , 8 ) (0, 8) ( 0 , 8 ) 40 ( 0 ) + 30 ( 8 ) = 240 40(0) + 30(8) = 240 40 ( 0 ) + 30 ( 8 ) = 240 $ 240 \text{\textdollar}240 $ 240 Boundary vertex candidate
( 9 , 0 ) (9, 0) ( 9 , 0 ) 40 ( 9 ) + 30 ( 0 ) = 360 40(9) + 30(0) = 360 40 ( 9 ) + 30 ( 0 ) = 360 $ 360 \text{\textdollar}360 $ 360 Optimal maximum vertex
( 2 , 7 ) (2, 7) ( 2 , 7 ) 40 ( 2 ) + 30 ( 7 ) = 80 + 210 = 290 40(2) + 30(7) = 80 + 210 = 290 40 ( 2 ) + 30 ( 7 ) = 80 + 210 = 290 $ 290 \text{\textdollar}290 $ 290 Intersection vertex candidate
Conclusion: The maximum weekly profit is $ 360 \text{\textdollar}360 $ 360 , achieved by manufacturing 9 9 9 desks and 0 0 0 bookcases.
Important
A common student error is assuming the maximum must always occur at the interior intersection vertex ( 2 , 7 ) (2, 7) ( 2 , 7 ) . As demonstrated above, the slope of the objective function ( m = − 40 30 = − 4 3 m = -\frac{40}{30} = -\frac{4}{3} m = − 30 40 = − 3 4 ) relative to the constraint boundaries ( m 1 = − 1 2 , m 2 = − 1 m_1 = -\frac{1}{2}, m_2 = -1 m 1 = − 2 1 , m 2 = − 1 ) dictates which vertex is struck last by the expanding level line. Rigorous corner-point evaluation is mandatory.