Study guide

2.7 Linear Inequalities in Two Variables & Feasible Regions

SAT Math Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & Digital SAT Math Mechanics

1.1 Digital SAT Math Structure, Adaptive Routing & Scoring 1.2 Mastering the Built-In Desmos Graphing Calculator 1.3 Digital SAT Math Pacing, SPR Syntax & Test-Taking Tactics

2 Chapter 2: Algebra — Linear Equations, Functions & Inequalities

2.1 Linear Equations in One Variable 2.2 Determining the Number of Solutions 2.3 Linear Functions, Slope & Rate of Change 2.4 Forms of Linear Equations & Interpreting Intercepts 2.5 Real-World Linear Modeling & Word Problems 2.6 Linear Inequalities in One Variable 2.7 Linear Inequalities in Two Variables & Feasible Regions

3 Chapter 3: Algebra — Systems of Linear Equations & Applications

3.1 Solving Systems of Linear Equations Algebraically 3.2 Graphical Interpretation of Linear Systems 3.3 Constants & Coefficients in Systems with Special Solutions 3.4 Real-World Applications & Word Problems with Systems 3.5 Systems with Constraints & Multi-Equation Modeling

4 Chapter 4: Advanced Math — Quadratics & Nonlinear Equations

4.1 Factoring & Equivalent Algebraic Expressions 4.2 Solving Quadratic Equations by Multiple Methods 4.3 The Discriminant & Nature of Roots 4.4 Forms of Quadratic Functions & Feature Recognition 4.5 Parabolas: Vertex, Axis of Symmetry & Extrema in Context 4.6 Radical Equations & Extraneous Solutions 4.7 Systems of Linear and Nonlinear Equations

5 Chapter 5: Advanced Math — Exponentials, Polynomials & Functions

5.1 Exponent Rules & Radical Expressions 5.2 Exponential Functions: Growth & Decay Models 5.3 Compound Interest, Doubling Time & Half-Life Applications 5.4 Polynomial Operations, Division & Remainder Theorem 5.5 Graphs of Polynomials, Zeros & Multiplicity 5.6 Function Notation, Composition & Transformations

6 Chapter 6: Problem-Solving and Data Analysis

6.1 Ratios, Proportions & Dimensional Analysis 6.2 Percentages, Percent Change & Successive Percents 6.3 One-Variable Statistics: Center, Spread & Outliers 6.4 Two-Variable Data: Scatterplots & Line of Best Fit 6.5 Probability & Two-Way Frequency Tables 6.6 Statistical Study Design, Margin of Error & Generalization

7 Chapter 7: Geometry and Trigonometry

7.1 Lines, Angles & Triangle Properties 7.2 Congruent & Similar Triangles with Proportions 7.3 Right Triangles & Pythagorean Theorem 7.4 Right Triangle Trigonometry & Radian Measure 7.5 Circle Equations, Center & Radius in Coordinate Plane 7.6 Arc Length, Sector Area & 3D Geometry / Volume

2.7 Linear Inequalities in Two Variables & Feasible Regions

Key Takeaways Explain This Topic AI

A linear inequality in two variables defines a half-plane in the xy-plane bounded by a line; strict inequalities (<, >) use dashed boundary lines, while non-strict inequalities (<=, >=) use solid boundary lines.

The shaded solution half-plane can be identified using the test-point method with the origin (0, 0) or by the slope-intercept vertical rule: y >= mx + b shades above the line, while y <= mx + b shades below.

A system of linear inequalities represents the simultaneous intersection (overlap) of multiple half-planes, forming a polygonal solution set termed the feasible region.

The vertices (corner points) of a feasible region are found by solving the systems of linear equations formed by the intersecting boundary lines.

Under linear programming principles, maximum and minimum values of any linear objective function over a bounded feasible region always occur at one of its boundary vertices.

Last updated: August 2026

Linear Inequalities in Two Variables & Feasible Regions

A linear inequality in two variables (such as y ≤ 2 x + 4 y \le 2x + 4 y ≤ 2 x + 4 or 3 x + 5 y > 15 3x + 5y > 15 3 x + 5 y > 15 ) represents an entire half-plane of coordinate pairs ( x , y ) (x, y) ( x , y ) in the coordinate plane. When multiple inequalities are combined into a system, their overlapping intersection forms a feasible region that models resource limits, production constraints, and financial allocations.

1. Graphing Boundary Lines & Determining Line Styles

Every two-variable linear inequality divides the coordinate plane into two regions separated by a boundary line . +-----------------------------------------------------------------------------+

  • | BOUNDARY LINE STYLE RULES |
  • | |
  • | INEQUALITY SYMBOL BOUNDARY LINE STYLE POINTS ON LINE INCLUDED? |
  • | ----------------- ------------------- ------------------------ |
  • | < or > Dashed / Broken Line NO (Boundary not in set) |
  • | <= or >= Solid / Continuous YES (Boundary is in set) |

+-----------------------------------------------------------------------------+ DASHED LINE (< or >) SOLID LINE (<= or >=)

  • y y
  • | - - / | /
  • | - / | /
  • | - / | /
  • -------+----/--- x --------+--/----- x
  • | - / | /
  • Boundary points EXCLUDED Boundary points INCLUDED
  • 2. Determining Shading Direction: Two Reliable Methods

Once the boundary line is graphed, you must shade the correct half-plane representing the inequality's solution set.

Method 1: The Test Point Method (The Universal Approach)

Choose any test point ( x 0 , y 0 ) (x_0, y_0) ( x 0 ​ , y 0 ​ ) that does not lie directly on the boundary line . The origin ( 0 , 0 ) (0, 0) ( 0 , 0 ) is the fastest and easiest test point unless the boundary line passes through ( 0 , 0 ) (0, 0) ( 0 , 0 ) .

Substitute ( x 0 , y 0 ) (x_0, y_0) ( x 0 ​ , y 0 ​ ) into the original inequality.

If the statement is TRUE: Shade the entire half-plane containing ( x 0 , y 0 ) (x_0, y_0) ( x 0 ​ , y 0 ​ ) .

If the statement is FALSE: Shade the opposite half-plane away from ( x 0 , y 0 ) (x_0, y_0) ( x 0 ​ , y 0 ​ ) .

Method 2: The Slope-Intercept Vertical Position Rule

When the inequality is solved explicitly for y y y in slope-intercept form:

y > m x + b y > mx + b y > m x + b or y ≥ m x + b y \ge mx + b y ≥ m x + b : Shade ABOVE the boundary line (greater y y y -values).

y < m x + b y < mx + b y < m x + b or y ≤ m x + b y \le mx + b y ≤ m x + b : Shade BELOW the boundary line (lesser y y y -values).

Caution

Standard Form Negative Coefficient Trap: In the inequality 3 x − 2 y ≤ 6 3x - 2y \le 6 3 x − 2 y ≤ 6 , do not assume " ≤ \le ≤ " means shade below. When converting to slope-intercept form, dividing by − 2 -2 − 2 reverses the inequality: − 2 y ≤ − 3 x + 6 ⟹ y ≥ 3 2 x − 3 -2y \le -3x + 6 \implies y \ge \frac{3}{2}x - 3 − 2 y ≤ − 3 x + 6 ⟹ y ≥ 2 3 ​ x − 3 . The " ≥ \ge ≥ " indicates that the solution set is actually ABOVE the boundary line!

3. Systems of Linear Inequalities & Feasible Regions

A system of linear inequalities consists of two or more inequalities in the same variables. The solution set of the system is the overlapping intersection of the shaded regions of all individual inequalities. +-----------------------------------------------------------------------------+

  • | SYSTEM OF INEQUALITIES FEASIBLE REGION |
  • | |
  • | Inequality 1: y >= -x + 4 |
  • | Inequality 2: y <= 2x + 1 |
  • | |
  • | y |
  • | | Feasible Region |
  • | | (Overlap) |
  • | | / / |
  • | | / / |
  • | | (1, 3) * / y = 2x + 1 |
  • | | / \/ |
  • | | / /\ |
  • | | / / \ |
  • | | / / \ y = -x + 4 |
  • | ---------------------+------+---------+----- x |
  • | | |
  • +-----------------------------------------------------------------------------+
  • Calculating Feasible Region Vertices

The vertices (corner points) of a feasible region are the points where the boundary lines intersect. To find a vertex, solve the system of linear equations formed by the intersecting boundary lines using substitution or elimination.

Worked Example: Multi-Constraint Feasible Region

Problem: Find all four vertices of the feasible region defined by the following system of linear constraints: x ≥ 0 x \ge 0 x ≥ 0 y ≥ 0 y \ge 0 y ≥ 0 x + y ≤ 8 x + y \le 8 x + y ≤ 8 2 x + y ≤ 12 2x + y \le 12 2 x + y ≤ 12

Step 1: Identify the non-negativity axes boundaries The constraints x ≥ 0 x \ge 0 x ≥ 0 and y ≥ 0 y \ge 0 y ≥ 0 restrict the feasible region strictly to the First Quadrant .

Vertex 1: Intersection of x = 0 x = 0 x = 0 and y = 0 ⟹ ( 0 , 0 ) y = 0 \implies (0, 0) y = 0 ⟹ ( 0 , 0 ) .

Step 2: Find the x x x -axis intercept of 2 x + y = 12 2x + y = 12 2 x + y = 12 Set y = 0 y = 0 y = 0 : 2 x + 0 = 12 ⟹ x = 6 2x + 0 = 12 \implies x = 6 2 x + 0 = 12 ⟹ x = 6 .

Vertex 2: ( 6 , 0 ) (6, 0) ( 6 , 0 ) .

Step 3: Find the intersection of the two constraint lines Solve the system:

  • x + y = 8 ⟹ y = 8 − x x + y = 8 \implies y = 8 - x x + y = 8 ⟹ y = 8 − x
  • 2 x + y = 12 2x + y = 12 2 x + y = 12

Substitute y = 8 − x y = 8 - x y = 8 − x into equation 2: 2 x + ( 8 − x ) = 12 ⟹ x + 8 = 12 ⟹ x = 4 2x + (8 - x) = 12 \implies x + 8 = 12 \implies x = 4 2 x + ( 8 − x ) = 12 ⟹ x + 8 = 12 ⟹ x = 4 y = 8 − 4 = 4 y = 8 - 4 = 4 y = 8 − 4 = 4

Vertex 3: ( 4 , 4 ) (4, 4) ( 4 , 4 ) .

Step 4: Find the y y y -axis intercept of x + y = 8 x + y = 8 x + y = 8 Set x = 0 x = 0 x = 0 : 0 + y = 8 ⟹ y = 8 0 + y = 8 \implies y = 8 0 + y = 8 ⟹ y = 8 .

Vertex 4: ( 0 , 8 ) (0, 8) ( 0 , 8 ) .

Feasible Region Summary: The bounded feasible region is a convex polygon with four vertices: ( 0 , 0 ) , ( 6 , 0 ) , ( 4 , 4 ) , (0, 0), (6, 0), (4, 4), ( 0 , 0 ) , ( 6 , 0 ) , ( 4 , 4 ) , and ( 0 , 8 ) (0, 8) ( 0 , 8 ) .

4. Real-World Constraint Optimization (The Vertex Theorem)

In real-world business and manufacturing problems (linear programming), an objective function (such as profit P ( x , y ) = a x + b y P(x, y) = ax + by P ( x , y ) = a x + b y or cost C ( x , y ) = c x + d y C(x, y) = cx + dy C ( x , y ) = c x + d y ) is optimized subject to a set of linear inequality constraints.

Important

The Vertex Principle of Linear Programming: The maximum or minimum value of any linear objective function f ( x , y ) = a x + b y f(x, y) = ax + by f ( x , y ) = a x + b y over a bounded polygonal feasible region always occurs at one of the vertices (corner points) of the region.

Testing Vertices for Maximum Profit

Using the vertices found in the previous example: ( 0 , 0 ) , ( 6 , 0 ) , ( 4 , 4 ) , ( 0 , 8 ) (0, 0), (6, 0), (4, 4), (0, 8) ( 0 , 0 ) , ( 6 , 0 ) , ( 4 , 4 ) , ( 0 , 8 ) with profit function P ( x , y ) = 50 x + 40 y P(x, y) = 50x + 40y P ( x , y ) = 50 x + 40 y :

Candidate Vertex ( x , y ) (x, y) ( x , y ) Profit Calculation P ( x , y ) = 50 x + 40 y P(x, y) = 50x + 40y P ( x , y ) = 50 x + 40 y Evaluated Profit

( 0 , 0 ) (0, 0) ( 0 , 0 ) 50 ( 0 ) + 40 ( 0 ) 50(0) + 40(0) 50 ( 0 ) + 40 ( 0 ) $0

( 6 , 0 ) (6, 0) ( 6 , 0 ) 50 ( 6 ) + 40 ( 0 ) = 300 + 0 50(6) + 40(0) = 300 + 0 50 ( 6 ) + 40 ( 0 ) = 300 + 0 $300

( 4 , 4 ) (4, 4) ( 4 , 4 ) 50 ( 4 ) + 40 ( 4 ) = 200 + 160 50(4) + 40(4) = 200 + 160 50 ( 4 ) + 40 ( 4 ) = 200 + 160 $360 (MAXIMUM)

( 0 , 8 ) (0, 8) ( 0 , 8 ) 50 ( 0 ) + 40 ( 8 ) = 0 + 320 50(0) + 40(8) = 0 + 320 50 ( 0 ) + 40 ( 8 ) = 0 + 320 $320

The maximum possible profit is $360 , achieved by producing 4 units of x x x and 4 units of y y y .

5. Digital SAT Desmos Workflows for Inequalities

The built-in Desmos calculator makes solving systems of inequalities fast and visual:

Type each inequality on a separate line (e.g., y >= -x + 4 and y <= 2x + 1 ).

Desmos automatically renders solid or dashed boundary lines and shades each region.

The feasible region appears as the darkest overlapping shaded area .

Click directly on the intersection of boundary lines to view the exact coordinate values of vertices.