LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

LESSON NOTE
General Mathematics — SS2 Third Term
Week 2: Linear Inequalities in Two Variables & Optimization

Subject General Mathematics

Class Senior Secondary School 2 (SS2)
Term Third Term
Week Week 2
Duration 2 Periods (80 minutes)
Topic Linear Inequalities in Two Variables
Sub-Topics i. Graph of linear inequality in two variables ii. Illustrating the feasible
region iii. Maximum and minimum values of simultaneous linear
inequalities iv. Optimization function f(x, y) = ax + by under a set of
inequalities
Previous Knowledge Linear inequalities in one variable, coordinate geometry, straight-line
graphs
Importance/Use Used in business, economics, computer programming, and operations
research to maximise profit or minimise cost
Curriculum Lagos State Unified Scheme of Work — Senior Secondary Schools

LEARNING OBJECTIVES

By the end of this lesson, students should be able to:

1. Draw the graph of a linear inequality in two variables accurately.
2. Identify and shade the correct feasible region satisfying a set of inequalities.
3. Determine the vertices (corner points) of the feasible region.
4. Find the maximum and minimum values of a linear objective function f(x, y) = ax + by subject to
given constraints.
5. Interpret solutions in the context of real-life problems (e.g. maximising profit, minimising cost).

EMBEDDED CORE SKILLS

• Critical Thinking and Problem Solving

• Collaboration and Communication
• Digital Literacy
• Leadership and Personal Development

LEARNING RESOURCES

Page 1 of 8
 LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

• Graph board and graph paper

• Ruler, pencil, coloured pens
• Model Mathematical set
• Concrete objects of different sizes or heights
• Khan Academy — [Link], [Link]

PREREQUISITE KNOWLEDGE

Students must already be confident with:

• Drawing straight-line graphs using the equation y = mx + c or ax + by = c.
• Finding x-intercepts (set y = 0) and y-intercepts (set x = 0).
• Solving simultaneous linear equations by substitution or elimination.
• Understanding inequality symbols: <, >, ≤, ≥ and their graphs (solid vs dashed lines).

PERIOD 1 — GRAPHING LINEAR INEQUALITIES IN TWO VARIABLES

1.1 From Equation to Inequality — Key Concepts

A linear inequality in two variables takes the form:
ax + by < c or ax + by > c or ax + by ≤ c or ax + by ≥ c

SYMBOL MEANING BOUNDARY LINE

< or > Strictly less than / greater than Dashed line (boundary NOT included)

Less than or equal / greater than or

≤ or ≥ Solid line (boundary IS included)
equal

1.2 Procedure for Graphing a Linear Inequality

1 Replace the inequality sign with = and draw the boundary line. Use a SOLID line for ≤ or ≥; use
a DASHED line for < or >.
2 Choose a TEST POINT not on the line — the origin (0, 0) is the simplest choice (unless the line
passes through the origin).
3 Substitute the test point into the original inequality. If the inequality is TRUE, shade the region
containing the test point. If FALSE, shade the OPPOSITE region.
4 Label the shaded region as the solution set (feasible region).

WORKED EXAMPLE 1 — Graph of a Single Linear Inequality

Question: Draw the graph of 2x + 3y ≤ 12 and shade the feasible region.

Page 2 of 8
 LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

Step 1: Draw the boundary line 2x + 3y = 12

Set y = 0 Set x = 0 Boundary line

Join (6, 0) and (0, 4) with a SOLID

2x = 12 → x = 6 Point: (6, 0) 3y = 12 → y = 4 Point: (0, 4)
line (because of ≤)

Step 2: Test point (0, 0)

Substitute into 2x + 3y ≤ 12: 2(0) + 3(0) = 0 ≤ 12 ✓ TRUE
Since TRUE → shade the region containing (0, 0), i.e. the region BELOW and to the LEFT of the line.

Step 3: Label
The shaded region (including the solid boundary line) is the solution set of 2x + 3y ≤ 12.

WORKED EXAMPLE 2 — Two Simultaneous Inequalities

Question: Show on a graph the region satisfying both: x + y ≤ 6 and x ≥ 1.

Inequality 1: x + y ≤ 6
Boundary: x + y = 6. Intercepts: (6, 0) and (0, 6). Solid line. Test (0,0): 0 ≤ 6 ✓ → shade below the line.

Inequality 2: x ≥ 1
Boundary: x = 1. Vertical solid line through x = 1. Test (0,0): 0 ≥ 1 ✗ FALSE → shade the region to the
RIGHT of x = 1.

⚠ The FEASIBLE REGION is the area where BOTH shaded regions overlap simultaneously. Always
clearly label this region on your graph. In WAEC/NECO, marks are awarded for: correct intercepts,
correct line type (solid/dashed), correct shading, and correct labelling.

1.3 System of Three or More Inequalities — Identifying the Feasible Region

Most SS2 and WAEC questions involve three or more simultaneous inequalities. The feasible region is the
polygon formed by the intersection of all shaded half-planes.

• Plot ALL boundary lines on the same axes.

• Shade each half-plane correctly using the test-point method.
• The feasible region is where ALL shadings overlap.
• Identify the VERTICES (corner points) of the feasible region — these are where the boundary lines
intersect.
• The maximum or minimum value of any objective function ALWAYS occurs at one of the vertices.

PERIOD 2 — MAXIMUM & MINIMUM VALUES (OPTIMIZATION)

Page 3 of 8
 LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

2.1 The Objective Function f(x, y) = ax + by

An objective function is a linear expression in x and y that we want to MAXIMISE or MINIMISE, subject to a
set of linear inequality constraints.

The Vertex (Corner Point) Theorem states:

If an objective function f(x, y) = ax + by has a maximum or minimum value over a feasible region,
that value is attained at one (or more) of the VERTICES of the feasible region. We therefore evaluate
f at every vertex and compare the values.

2.2 Procedure for Finding Maximum/Minimum Values

1 Write down all the constraints (inequalities) and the objective function f(x, y) = ax + by.
2 Draw the graph of each constraint and shade the feasible region where ALL constraints are
satisfied simultaneously.
3 Identify the vertices (corner points) of the feasible region by solving pairs of boundary
equations simultaneously.
4 Substitute each vertex into the objective function f(x, y) and calculate the value.
5 The LARGEST value is the maximum; the SMALLEST value is the minimum.
6 State the coordinates of x and y that give the optimal value, and interpret in context if
required.

WORKED EXAMPLE 3 — Finding Maximum Value (WAEC-Style)

Question: A feasible region is defined by the following constraints:

x + y ≤ 8, x ≥ 0, y ≥ 0, 2x + y ≤ 12
Find the maximum value of f(x, y) = 3x + 2y.

Step 1: Draw all boundary lines

LINE x-INTERCEPT y-INTERCEPT LINE TYPE

x+y=8 (8, 0) (0, 8) Solid (≤)

2x + y = 12 (6, 0) (0, 12) Solid (≤)

x=0 y-axis — Solid (≥)

y=0 x-axis — Solid (≥)

Step 2: Identify vertices of the feasible region

Shade each region using test point (0, 0). The feasible region is the quadrilateral with vertices at:

VERTEX HOW FOUND f = 3x + 2y VALUE

Page 4 of 8
 LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

O = (0, 0) Origin (x=0, y=0) 3(0)+2(0) 0

A = (6, 0) 2x+y=12 meets y=0 3(6)+2(0) 18

B = (4, 4) x+y=8 meets 2x+y=12 3(4)+2(4) 20 ← MAX

C = (0, 8) x+y=8 meets x=0 3(0)+2(8) 16

Step 3: Finding vertex B = (4, 4)

Solve simultaneously: x + y = 8 and 2x + y = 12
Subtract: (2x + y) − (x + y) = 12 − 8 → x = 4
Substitute: 4 + y = 8 → y = 4. So vertex B = (4, 4) ✓

Conclusion:
The maximum value of f(x, y) = 3x + 2y is 20, occurring at the point (4, 4).

WORKED EXAMPLE 4 — Real-Life Optimization (Business Context)

Question: A trader sells pens (x) and pencils (y). He must have at least 2 pens and 5 pencils. He cannot carry
more than 12 items in total. Pens cost ₦120 each and pencils cost ₦50 each. He has at most ₦1,000 to
spend. Find the maximum number of items he can carry.

Setting up the constraints:

• x ≥ 2 (at least 2 pens)
• y ≥ 5 (at least 5 pencils)
• x + y ≤ 12 (cannot carry more than 12 items)
• 120x + 50y ≤ 1,000 → 12x + 5y ≤ 100 (budget constraint, simplified by dividing by 10)
• Objective: Maximise f(x, y) = x + y (total items)

Finding vertices of feasible region:

VERTEX HOW FOUND f=x+y

(2, 5) Minimum corner: x=2, y=5 7

x=2, from 12x+5y=100: 24+5y=100 → y=15.2
(check x+y≤12): use x+y=12, x=2 → y=10. Check
(2, 9) 12
budget: 24+50=74≤100 ✓. Corner: x+y=12 and
x=2 → y=10

(5, 7) x+y=12 and 12x+5y=100: Solve → x=5⅓ ≈ 5, y=7 12 ← MAX

Maximum number of items = 12 (subject to all constraints being satisfied).

WORKED EXAMPLE 5 — Finding Minimum Value

Question: The constraints of a feasible region are: x + 2y ≥ 6, x ≥ 0, y ≥ 0. Minimize f(x, y) = 2x + y.

Page 5 of 8
 LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

Boundary: x + 2y = 6. Intercepts: (6, 0) and (0, 3). Solid line. Test (0,0): 0 ≥ 6 ✗ → shade ABOVE/RIGHT of
the line.

VERTEX HOW FOUND f = 2x + y

(6, 0) x + 2y = 6 meets y = 0 2(6)+0 = 12

(0, 3) x + 2y = 6 meets x = 0 2(0)+3 = 3 ← MIN

The minimum value of f(x, y) = 2x + y is 3, occurring at (0, 3).

CLASS ACTIVITY / STUDENTS' EXERCISE

Answer all questions. Show full working including graphs where required.

6. Draw the graph of 3x + 2y ≤ 18, x ≥ 0, y ≥ 0. Shade the feasible region and identify its vertices.
7. A feasible region is bounded by: x + y ≤ 10, x ≥ 2, y ≥ 1. Find the maximum and minimum values of
f(x, y) = 5x + 3y.
8. Solve graphically and find the maximum value of P = 4x + 3y subject to: x + y ≤ 6, x ≤ 4, y ≤ 4, x ≥ 0, y ≥
0.
9. A manufacturer makes two products X and Y. Each unit of X requires 2 hours and each unit of Y
requires 3 hours. Total hours available = 18. X costs ₦500 and Y costs ₦700 per unit. He must
produce at least 2 units of each. Set up the constraints and find the maximum revenue.
10. (WAEC-style) The constraints of a feasible region are: 2x + y ≤ 14, x + 2y ≤ 14, x ≥ 0, y ≥ 0. Find the
maximum value of f = 3x + 4y and state the coordinates at which it occurs.

LESSON EVALUATION / ASSESSMENT

11. Explain the difference between a solid boundary line and a dashed boundary line when graphing
linear inequalities.
12. What is the Vertex Theorem? Why is it important in optimization problems?
13. A feasible region has vertices at (0,0), (4,0), (3,2) and (0,3). Find the maximum value of f(x,y) = 6x +
5y.
14. State two real-life situations where linear programming is applied. For each, identify what is being
maximised or minimised.
15. (Challenge) Two factories produce product A and B. Factory 1 can produce at most 30 units of A and
20 units of B per day. Factory 2 can produce at most 20 units of A and 30 units of B. Each unit of A
sells for ₦200 and each unit of B for ₦150. Formulate the constraints and write the objective
function.

LESSON SUMMARY

Key takeaways from this lesson:

• A linear inequality in two variables defines a HALF-PLANE on the coordinate axes.

Page 6 of 8
 LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

• Use a SOLID line for ≤ or ≥ (boundary included). Use a DASHED line for < or > (boundary excluded).
• Always use a test point (preferably the origin) to determine which side to shade.
• The FEASIBLE REGION is the intersection of all shaded half-planes satisfying the constraints
simultaneously.
• The maximum or minimum value of an objective function f(x, y) = ax + by occurs at a VERTEX of the
feasible region (Vertex Theorem).
• Always find vertices by solving pairs of boundary lines simultaneously.
• Evaluate the objective function at EVERY vertex — do not guess which one gives the optimal value.

ASSIGNMENT

16. (WAEC 2019) A feasible region is defined by: x + y ≤ 8, 3x + y ≤ 18, x ≥ 0, y ≥ 0. Find the maximum
value of P = 5x + 2y.
17. A company produces two types of goods, X and Y. Each unit of X requires 1 hour of labour and each
unit of Y requires 2 hours. A total of 8 hours of labour is available. The profit per unit of X is ₦300
and per unit of Y is ₦500. At least 1 unit of each must be produced. Formulate and solve graphically
to maximise profit.
18. Draw the region satisfying: 2x − y ≤ 4, x + y ≥ 2, x ≥ 0. Shade the region and state whether (1, 1) lies
within the feasible region. Justify your answer.
19. The minimum value of f(x, y) = 3x + 5y subject to x + y ≥ 4, x ≥ 1, y ≥ 0 occurs at a vertex. Find this
vertex and the minimum value.

TEACHER'S REMARK / SELF-EVALUATION

Were students able to shade the correct feasible region independently? ___________________

Which worked example required the most re-teaching? ____________________________________

Did students correctly identify all vertices by solving simultaneous equations? ______________

WAEC/NECO alignment check — were exam-style questions attempted? ______________________

Teacher's Signature: ________________________ Date: ___________________________

NEXT LESSON PREVIEW — WEEK 3

• Application of linear inequalities in real-life situations

• Introduction to linear programming — formulating constraints from word problems
• Solving linear programming problems graphically

Page 7 of 8
 LAGOS STATE GOVERNMENT — UNIFIED SCHEME OF WORK | GENERAL MATHEMATICS | SS2 THIRD TERM

• Interpreting solutions in context (profit maximisation, cost minimisation)

Prepared in accordance with Lagos State Unified Scheme of Work for Senior Secondary Schools | SS2 Third Term

Page 8 of 8