1/22

ADMATHS
SECTION: LINEAR PROGRAMMING

LESSON 9LP1: LINEAR INEQUALITIES AND LINEAR

PROGRAMMING
______________________________________________________________

Linear Programming is a mathematical modelling technique used in

Operational Research. Operational Research is the field of knowledge that
has to do with the planning of operations in the most economical way.

Linear Programming was first developed during the Second World War
(1 939 – 1 945) when allied forces had to do operations thousands of
kilometres away from their base camps. The logistics of variables such as
huge quantities of soldiers, food, ammunition, vehicles and weapons etc.
that had to be moved over long distances had to be studied.

Although most practical problems usually have many variables, we are going
to restrict ourselves in these lessons to situations with only TWO variables.
George Danzig developed the Simplex Method in 1 946 by which problems
with any amount of variables could be handled. With this method the use of
computers became very important.

Problems with TWO variables can be represented on the Cartesian plane

(𝑥, 𝑦-system of axes). Constraints in situations lead to algebraic inequalities
which can be represented graphically.

It is thus necessary to revise graphical representations of inequalities before

we can continue with linear programming.

©2022 AdMaths 9LP1

 2/22

Example 1

Represent the following inequalities graphically on separate systems of axes.

1.1 𝑦≤3

1.2 𝑥>4

1.3 2≤𝑥<5

1.4 𝑦 ≤ 2𝑥

1.5 𝑥+𝑦 ≤7

Solution

1.1
𝑦=3
𝑦≤3

Note that 𝑦 = 3
is a solid line.

©2022 AdMaths 9LP1

 3/22

1.2
𝑥>4

Note that 𝑥 = 4
is a dotted line.

𝑥=4

1.3
2≤𝑥<5

Note that 𝑥 = 2 is a
solid line while 𝑥 = 5
is a dotted line.

𝑥=2
𝑥=5

1.4
𝑦 ≤ 2𝑥

How to draw 𝑦 = 2𝑥:

• Choose any two 𝑥-values and determine

(1; 2) the corresponding y-values.
eg. 𝑥 = 0 and 𝑥 = 1
(0; 0)
𝑥 0 1

𝑦 = 2𝑥 0 2

• Coordinates are (0; 0) and (1 ; 2)

𝑦 = 2𝑥 OR
Use the gradient intercept method.

©2022 AdMaths 9LP1

 4/22

1.5 𝑥+𝑦 ≤7

• Write 𝑥 + 𝑦 ≤ 7 in the form 𝑦 ≤ 𝑚𝑥 + 𝑐. This is advisable so that

one can see where to shade – above or below the line.
∴ 𝑦 ≤ −𝑥 + 7
Shading will be done below the line.

• Draw the line 𝑦 = −𝑥 + 7 using the double-intercept method.

The line can also be drawn using the form 𝑥 + 𝑦 = 7. It is often
easier to keep it in the original form when drawing the line.

𝑦-intercept (Let 𝑥 = 0)
𝑦 = −𝑥 + 7 or 𝑥+𝑦 =7
= −0 + 7 0+𝑦 = 7
=7 𝑦=7

𝑥-intercept (Let 𝑦 = 0)
𝑦 = −𝑥 + 7 or 𝑥+𝑦 =7
0 = −𝑥 + 7 𝑥+0=7
𝑥=7 𝑥=7

• Shade below the solid line.

𝑦 = −𝑥 + 7
𝑦𝑦≤≤ −𝑥
−𝑥 ++
7 7

©2022 AdMaths 9LP1

 5/22

THE SOLUTION OF A SYSTEM OF LINEAR INEQUALITIES

Example 2

Make a graphical representation of the SOLUTION of the following system of

inequalities.
(All inequalities are drawn on ONE system of axes.)

𝑥≥0

𝑦≥0

𝑥+𝑦 ≤5

Solution
The SOLUTION of a system of inequalities is the region where all the
shaded areas OVERLAP.

• 𝑥≥0

©2022 AdMaths 9LP1

 6/22

• 𝑦≥0

• 𝑥+𝑦 ≤5

∴ 𝑦 ≤ −𝑥 + 5

Draw the line 𝑦 = −𝑥 + 5 and shade below the line.

(Use the double intercept method: 𝑥 = 5 ; 𝑦 = 5)

𝑦 = −𝑥 + 5

©2022 AdMaths 9LP1

 7/22

SOLUTION: This is the region where the shaded areas overlap.

𝑦 = −𝑥 + 5

Solution

The SOLUTION of a number of inequalities is called the FEASIBLE REGION

in Linear Programming.

Example 3a

Represent the system of inequalities graphically and shade the solution of

all the inequalities. (Feasible region)

𝑥 ≥ 0; 𝑦 ≥ 0 (1)

𝑥+𝑦 ≥2 (2)

𝑥+𝑦 ≤6 (3)

©2022 AdMaths 9LP1

 8/22

Solution

(1) 𝑥 ≥ 0; 𝑦 ≥ 0 This indicates that only the first quadrant of the

Cartesian plane is used, because 𝑥 ≥ 0 and 𝑦 ≥ 0.

(2) 𝑥+𝑦 ≥2

𝑦 ≥ −𝑥 + 2

∴ Draw the line 𝑦 = −𝑥 + 2 and shade above (≥) the line.

(3) 𝑥+𝑦 ≤6

∴ 𝑦 ≤ −𝑥 + 6

Draw the line 𝑦 = −𝑥 + 6 and shade below (≤) the line.

SOLUTION

𝑦 = −𝑥 + 6

𝑦 = −𝑥 + 2

1 2 3 4 5 6

The shaded region represents the SOLUTION of the system of inequalities.

©2022 AdMaths 9LP1

 9/22

Example 3b

Represent the system of inequalities graphically and shade the solution of

all the inequalities. (Feasible region)

𝑥 ≥ 0 ; 𝑦 ≥ 0 (1)

𝑥+𝑦 ≥2 (2)

𝑥+𝑦 ≤6 (3)

𝑦≥1 (4)

𝑥≤3 (5)

(The only difference from example 3𝑎 is that the constraints 4 and 5 are
included here.)
Solution

(1) 𝑥 ≥ 0; 𝑦 ≥ 0 This indicates that only the first quadrant of the

Cartesian plane is used, because 𝑥 ≥ 0 and 𝑦 ≥ 0.

(2) 𝑥+𝑦 ≥2

𝑦 ≥ −𝑥 + 2

∴ Draw the line 𝑦 = −𝑥 + 2 and shade above (≥) the line.

(3) 𝑥+𝑦 ≤6

∴ 𝑦 ≤ −𝑥 + 6

Draw the line 𝑦 = −𝑥 + 6 and shade below (≤) the line.

(4) 𝑦 ≥ 1 shade above (≥) the line 𝑦 = 1

(5) 𝑥 ≤ 3 shade to the left (≤) of the line 𝑥 = 3

©2022 AdMaths 9LP1

 10/22

SOLUTION

𝑦 = −𝑥 + 6 (3)

𝑥=3 (5)

𝑦 = 1 (4)

(2) 𝑦 = −𝑥 + 2

The shaded region represents the SOLUTION of the system of inequalities.

Example 4

Represent the SOLUTION of the following system of inequalities graphically.

𝑥 ≥ 0; 𝑦 ≥ 0

𝑥+𝑦 ≥3 (1)

𝑥 + 𝑦 ≤ 12 (2)

2𝑥 + 𝑦 ≥ 12 (3)

𝑥≤5 (4)

𝑦≥5 (5)

©2022 AdMaths 9LP1

 11/22

Solution
Draw:

(1) 𝑦 = −𝑥 + 3 ; shade above the line (𝑦 ≥ −𝑥 + 3)

(2) 𝑦 = −𝑥 + 12 ; shade below the line (𝑦 ≤ −𝑥 + 12)

(3) 𝑦 = −2𝑥 + 12 ; shade above the line (𝑦 ≥ −2𝑥 + 12)

(4) 𝑥=5; shade to the left of the line (𝑥 ≤ 5)

(5) 𝑦=5; shade above 𝑦 = 5 (𝑦 ≥ 5)

(4)

𝑥=5

(3)
𝑦 = −2𝑥 + 12 𝑦=5

(5)

(1) (2) 𝑦 = −𝑥 + 12

𝑦 = −𝑥 + 3

NOTE: 𝒙 ≥ 𝟎 ; 𝒚 ≥ 𝟎 means that only the first quadrant is used.

Take note that the inequality 𝑥 + 𝑦 ≥ 3 has no effect on the
outcome of the solution in this example.

©2022 AdMaths 9LP1

 12/22

EXERCISE 1
1. Make graphical representations of the systems of inequalities and shade
the REGION of the SOLUTION.

1.1 𝑥 ≥ 0; 𝑦 ≥ 0 1.2 𝑥 ≥ 0; 𝑦 ≥ 0

𝑥≤6 𝑦≤3

𝑦≥1 1≤𝑥≤4

𝑥+𝑦 ≤ 7 2𝑥 + 𝑦 ≤ 10

1
𝑦 ≥ 2𝑥 𝑦≥ 𝑥
2

2. Write down the system of inequalities leading to the following shaded

area.

14

13
12

11

10

9
8
7

5
4

3
2

1 2 3 4 5 6 7 8 9 10 11 12 13 14

©2022 AdMaths 9LP1

 13/22

THE PROCESS OF LINEAR PROGRAMMING

The first part of this process will be illustrated using an example.
The second part will be explained in the next lesson.

Example 5

Two ordinary dice are used in a gambling game. One die is red and the other
one is blue. Both dice are cast and the outcomes are used as results.

When both dice are cast simultaneously the result will be acceptable only
when it satisfies the following conditions:

 The sum of the outcomes on the two dice may not exceed 10.

 The outcome on the blue die must be less than 5.

 The outcome on the red die is greater or equal to 2.

 The outcome on the red die must be less than or equal to

double the outcome on the blue die.

The rules of this game lead to a number of constraints. The outcomes have
to comply with these constraints. These constraints are written as
inequalities, represented graphically and then solved.

CONSTRAINTS

Let 𝑥 represent the outcome on the blue die and 𝑦 the outcome on the red
die.

• The constraints can be written as:

 𝑥 + 𝑦 ≤ 10 (The sum of the outcomes must be less or equal to 10.)

©2022 AdMaths 9LP1

 14/22

𝑥≤4 (The outcome on the blue die must be less than 5

therefore smaller or equal to 4.)

𝑦 ≥2 (The outcome on the red die must be bigger or equal to 2.)

 𝑦 ≤ 2𝑥 (The outcome on the red die has to be less than or equal

to double the outcome on the blue die.)

• Inherent constraints:

These are constraints that will be applicable because of the situation itself.

We know that the numbers on an ordinary dice can only be the values
1 ; 2 ; 3 ; 4 ; 5 and 6. Therefore:

1 ≤ 𝑥 ≤ 6 and
1≤𝑦≤6
where 𝑥; 𝑦 ∈ 𝑁 (Natural numbers)

GRAPHICAL REPRESENTATION OF THE FEASIBLE REGION

A graphical representation of the solution of all the restrictions leads to the

FEASIBLE REGION. This is the area where all solutions are found that
comply with ALL the rules, i.e. the constraints, of the situation. Many
solutions are possible. There is never only one possible answer.

Below is the graphical representation of all the constraints in the game of

the red and blue dice:

𝑥 + 𝑦 ≤ 10
𝑥≤4
𝑦≥2
𝑦 ≤ 2𝑥
1≤𝑥≤6
1≤𝑦≤6

©2022 AdMaths 9LP1

 15/22

𝑦 = −𝑥 + 10

𝑥=4
𝑥=1

𝑦=6
𝐴 𝐵
𝑅𝑒𝑑
𝑥=6

𝑦=2

𝐷 𝐶
𝑦 = 2𝑥

𝑦=1

𝐵𝑙𝑢𝑒

The shaded area (𝐴𝐵𝐶𝐷) is the solution of all the inequalities.

That is the area where all the shaded areas overlap.
The dots shown in the sketch are all the possible combinations of throws that
will be acceptable according to the rules of the game. The dots represent the
feasible region.
For example: Look at the dot that is marked with a circle. This dot represents
an outcome of 3 on the blue die and 5 on the red die. This outcome is in
compliance with all the rules of the game.

©2022 AdMaths 9LP1

 16/22

Example 6

Joani is an entrepreneur who sells her products at a flea market. She

manufactures baby bags and duvet covers.

She realises that with the time and equipment at her disposal she can
manufacture up to a maximum of 50 baby bags and 80 duvet covers per
month. She cannot manufacture more than 100 items per month. A small
business owner has placed a fixed order each month of 8 baby bags and
10 duvet covers for his shop.

Let 𝑥 be the number of baby bags and 𝑦 the number of duvet covers.

(a) Write down all the constraints in terms of 𝑥 and 𝑦 that are applicable
to this situation.

(b) Make a graphical representation of the constraints and shade the

feasible region.

Solution
A Identify the VARIABLES – in this example it is indicated that 𝑥
represents the baby bags and 𝑦 the duvet covers.

B Write down the CONSTRAINTS that apply in the situation. This will
lead to inequalities in terms of 𝑥 and 𝑦

• Equipment and time: 𝑥 ≤ 50 (1) – maximum of 50 baby bags

𝑦 ≤ 80 (2) – maximum of 80 duvet covers

• Maximum amount
of items: 𝑥 + 𝑦 ≤ 100 (3) – maximum of 100 items
are possible

• Fixed order: 𝑥 ≥ 8 (4) At least 8 baby bags and 10

𝑦 ≥ 10 (5) duvet covers have to be
manufactured

©2022 AdMaths 9LP1

 17/22

C Implicit constraints – the constraints that are obvious because of the

situation.

In this case 𝑥 ≥ 0 and 𝑦 ≥ 0, because Joani cannot manufacture a

negative number of baby bags or duvet covers.

Furthermore, the values of 𝑥 and 𝑦 can only be Natural numbers.

It is useless to think in terms of a half or quarter baby bag/duvet cover.
Thus: 𝑥; 𝑦 ∈ 𝑁

D Represent the system of inequalities graphically and shade the feasible

region:

Graphical representation of the feasible region:

𝑥=8 𝑥 = 50

𝐴 𝐵 𝑦 = 80

Duvet
covers

Feasible region 𝑥 + 𝑦 = 100

𝐸 𝐷 𝑦 = 10

Baby bags

©2022 AdMaths 9LP1

 18/22

Although the entire feasible region is shaded, it is clear that the solutions can
only be part of the Natural numbers and should, therefore, be indicated by
dots. As it would be very time consuming to draw all possible answers as
dots, we simply keep in mind that our answers will have to be Natural
numbers.

EXERCISE 2
A factory that manufactures sports clothes makes golf shirts and tracksuit
pants that are exported to Mexico. To stay competitive the factory has certain
requirements to meet, but there are also constraints regarding production:

• A minimum of 150 golf shirts have to be manufactured daily.

• It is not possible to manufacture more than 500 pieces of clothing
daily.
• It takes 40 machine-minutes to manufacture one golf shirt and
70 machine-minutes for each pair of tracksuit pants.
• There is a maximum of 28 000 machine-minutes available each
day.

Let 𝑥 be the number of golf shirts that are manufactured each day.

Let 𝑦 be the number of tracksuit pants manufactured daily.

(a) Write down all the constraints (inequalities) in terms of 𝑥 and 𝑦 that
are applicable in this situation.

Assume that 𝑥 ≥ 0 and 𝑦 ≥ 0.

(b) Use the graph paper given below to represent all the constraints
graphically.

(c) Shade the feasible region.

©2022 AdMaths 9LP1

 19/22

©2022 AdMaths 9LP1

 20/22

HOMEWORK

Question 1
1.1 Make graphical representations of the solutions of the following sets of
inequalities.

1.1.1 𝑥≥0

𝑦≥0

𝑦≤3

𝑥+𝑦 ≤4

1.1.2 𝑥≥0

𝑦≥0

𝑥≤6

3𝑦 + 𝑥 ≤ 12

1.1.3 𝑥≥0

𝑦≥0

𝑥+𝑦 ≥3

𝑥+𝑦 ≤8

𝑦≥2

©2022 AdMaths 9LP1

 21/22

1.2 Given the following constraints.

𝑦≥0
𝑥+5≥𝑦
𝑥 + 3𝑦 < 0

Shade the feasible region.

(6; −2)

©2022 AdMaths 9LP1

 22/22

Question 2
John does woodwork and sells handmade jewellery boxes and small coffee
tables at a market. He works over weekends and sometimes during the
night. He approximately has 63 hours per month available to pursue his
hobby.

It takes around 3 hours to manufacture a coffee table and 7 hours for a

jewellery box. John sells more jewellery boxes than coffee tables and plans
to produce at least 5 jewellery boxes per month. He knows that he should not
produce more than 8 coffee tables per month. It will not sell for lack of
interest.

To cover his expenses, he must manufacture at least 10 articles per month.

Let 𝑥 be the number of jewellery boxes and 𝑦 be the number of coffee tables
he manufactures (sells).

2.1 Write down all the mathematical constraints that are applicable to this
situation.

2.2 Make a graphical representation of the constraints and shade the

feasible region.

©2022 AdMaths 9LP1