Starter

Plot the following inequalities on a graph and shade the region that
satisfies all 3…

y x=4
𝑥>4 𝑦≤8 2𝑥 + 𝑦 ≤ 18 18

16

14
Plot the equation of each one (ignoring the
inequality) 12

 A quick way to plot the 3rd one is to work out x 10

when y = 0, and to work out y when x is 0, and
plot from these! 8 y=8
2𝑥 + 𝑦 = 18 6

4
If x = 0, y = 18 If y = 0, x = 9
2
 We need to be right of the red line, below the
blue line, and below/left of the green line! 0 x
0 2 4 6 8 10 12 14 16 18
2x + y = 18
 Learning Objectives
• To find a number of possible solutions to a
problem given a number of constraints.
 Linear Programming
• Linear programming is a mathematical method
of optimisation

• For example a business might want to make the

most profits, or the lowest costs

• Businesses have restrictions on them though

(employees/space/money etc), so they seek to
get the best they can using what they have

• Linear programming helps with this!

 Linear Programming
A company makes two different types of chair. Chair A Chair B
The machine time and craftsman’s time needed to Machine time
2 3
make each chair is shown in the table to the right. needed (hours)
Craftsman’s
time needed 4 2
In a week, the company has 30 hours of machine (hours)
time and 32 hours of craftsman’s time available.

They want to make at least 2 of chair A and at

least 6 of chair B.

What combinations of chair A and B can be made

under the restrictions above?

 To answer this type of question, you need to

write several inequalities using the
information given…
 Linear Programming
A company makes two different types of chair. Chair A Chair B
The machine time and craftsman’s time needed to Machine time
2 3
make each chair is shown in the table to the right. needed (hours)
Craftsman’s
time needed 4 2
In a week, the company has 30 hours of machine (hours)
time and 32 hours of craftsman’s time available.

They want to make at least 2 of chair A and at 𝑥≥2

least 6 of chair B. The number of chair A
has to be greater than 2
What combinations of chair A and B can be made
under the restrictions above?

 Let ‘x’ be the number of chair A and ‘y’ be the

𝑦≥6
number of chair B to be made… The number of chair B
has to be greater than 6
𝑥≥2

𝑦≥6
 Linear Programming
A company makes two different types of chair. Chair A Chair B
The machine time and craftsman’s time needed to Machine time
2 3
make each chair is shown in the table to the right. needed (hours)
Craftsman’s
time needed 4 2
In a week, the company has 30 hours of machine (hours)
time and 32 hours of craftsman’s time available.

The total machine time taken will be:

They want to make at least 2 of chair A and at
least 6 of chair B. 2 × 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐ℎ𝑎𝑖𝑟 𝐴
+
What combinations of chair A and B can be made
under the restrictions above? 3 × 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐ℎ𝑎𝑖𝑟 𝐵

 Let ‘x’ be the number of chair A and ‘y’ be the = 2𝑥 + 3𝑦

number of chair B to be made…

𝑥≥2 2𝑥 + 3𝑦 ≤ 30 The total machine time available is 30 hours

though. Therefore:

𝑦≥6 2𝑥 + 3𝑦 ≤ 30
 Linear Programming
A company makes two different types of chair. Chair A Chair B
The machine time and craftsman’s time needed to Machine time
2 3
make each chair is shown in the table to the right. needed (hours)
Craftsman’s
time needed 4 2
In a week, the company has 30 hours of machine (hours)
time and 32 hours of craftsman’s time available.

The total craftsman’s time taken will be:

They want to make at least 2 of chair A and at
least 6 of chair B. 4 × 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐ℎ𝑎𝑖𝑟 𝐴
+
What combinations of chair A and B can be made
under the restrictions above? 2 × 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐ℎ𝑎𝑖𝑟 𝐵

 Let ‘x’ be the number of chair A and ‘y’ be the = 4𝑥 + 2𝑦

number of chair B to be made…
The total craftsman’s time available is 32
𝑥≥2 2𝑥 + 3𝑦 ≤ 30 hours though. Therefore:

4𝑥 + 2𝑦 ≤ 32
𝑦≥6 2𝑥 + 𝑦 ≤ 16 Simplify
2𝑥 + 𝑦 ≤ 16
 Linear Programming
x=2
y
 Using these inequalities, we can draw graphs 18
to represent the situation…
16
𝑥≥2 2𝑥 + 3𝑦 ≤ 30 14

𝑦≥6 2𝑥 + 𝑦 ≤ 16 12

10
 Ignore the inequality signs, and work out
8
coordinates where needed…
6 y=6
2𝑥 + 3𝑦 = 30
4

𝐼𝑓 𝑥 = 0, 𝑦 = 10 𝐼𝑓 𝑦 = 0, 𝑥 = 15 2

0 x
0 2 4 6 8 10 12 14 16 18
2𝑥 + 𝑦 = 16 2x + y = 16 2x + 3y = 30

𝐼𝑓 𝑥 = 0, 𝑦 = 16 𝐼𝑓 𝑦 = 0, 𝑥 = 8
 Linear Programming
x=2
y
 Using these inequalities, we can draw graphs 18
to represent the situation…
16
𝑥≥2 2𝑥 + 3𝑦 ≤ 30 14

𝑦≥6 2𝑥 + 𝑦 ≤ 16 12

10
 Now consider the region on the graph which
8
satisfies all the inequalities. You are usually
asked on these questions to shade the 6 y=6
unwanted region… (for some reason…)
4
 To the right of the red line
2
 Above the blue line
 Below/left of the green line 0 x
0 2 4 6 8 10 12 14 16 18
 Below/left of the purple line
2x + y = 16 2x + 3y = 30

 The unshaded region represents all

combinations of chairs that can be made!
 Linear Programming
x=2
y
 Using these inequalities, we can draw graphs 18
to represent the situation…
16
𝑥≥2 2𝑥 + 3𝑦 ≤ 30 14

𝑦≥6 2𝑥 + 𝑦 ≤ 16 12

10
 Remember that in this region we can have any
8
combination of chair A and B as long as they
are integer values… 6 y=6
𝐶ℎ𝑎𝑖𝑟 𝐴 (𝑥) 𝐶ℎ𝑎𝑖𝑟 𝐵 (𝑦)
4
2 6
2 7 2
2 8
0 x
3 6 0 2 4 6 8 10 12 14 16 18
3 7 2x + y = 16 2x + 3y = 30
3 8
4 6
The optimal value will always occur at
4 7
a corner of the wanted region!
5 6
 Plenary
A company has a vehicle parking area of
1200m2 with space for x cars and y trucks.
Each car requires 20m2 of space, and a
truck requires 100m2 of space.

a) Show that: 𝑥 + 5𝑦 ≤ 60

b) There must also be space for at least 40

vehicles and at least 2 trucks

Write down 2 more inequalities to

represent this information:

________

________
 Work to be completed
• Page 151 , Exercise 14.4