P1: FXS/ABE P2: FXS

0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

C H A P T E R

9
Inequalities and linear

E
programming

PL
What is a linear inequality?
How do we solve linear inequalities?
What is linear programming and how is it used?

In Chapter 3, ‘Linear graphs and models’, you learned how linear equations and their graphs
are used to model practical situations, such as plant growth, service charges and flow problems.
In this chapter you will learn how linear inequalities and their graphs can be used to model a
different set of practical situations, such as determining the mix of products in a supermarket
M
to maximise profit, or designing a diet to provide maximum nutrition for minimum cost.
This is known as linear programming. Linear programming requires you to solve both linear
equations and linear inequalities. You learned how to solve linear equations in Chapter 2,
‘Linear relations and equations’. You now need to learn how to solve linear inequalities.

9.1 Linear inequalities in one variable

SA

Linear inequalities in one variable and the number line

An expression such as 9 ≤ 3x ≤ 21 is called a linear inequality in one variable. It is an
inequality, not an equation, because it involves an inequality sign (≤) rather than an equals
sign ( = ). The sign ‘ ≤ ’ means ‘less than or equal to’.
The solution to the linear equation 3x = 9 is x = 3, and the solution to the linear equation
3x = 21 is 7.
We can represent these solutions on a number line by putting a closed circle (•) on the number
line at x = 3 and x = 7 as shown.
x=3 x=7
x
–3 –2 –1 0 1 2 3 4 5 6 7 8 9

When solving an inequality and graphing its solution on a number line, we need to be careful
about whether the end values of the solution are included in the range of possible values.

376
Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4
2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 377

End values included

To solve the linear inequality

9 ≤ 3x ≤ 21

we divide through by 3 and get

9 3x 21
≤ ≤
3 3 3
or 3≤x ≤7

E
There is no single solution to this inequality. Any value of x from 3 to 7 is a solution. For
example, x = 3, x = 3.5, x = 4.95 and x = 7 are all possible solutions. In fact, it is
impossible to list every possible solution, as there are an infinite number of solutions.
However, we can represent all the possible solutions on a number line.
This is done by marking the points x = 3 and x = 7 with a closed circle (•) on the number

PL
line. These points are then joined by drawing a solid line to indicate that all the values between
x = 3 and x = 7 are also solutions, as shown below.
3≤x≤7
–3 –2 –1 0 1 2 3 4 5 6 7 8 9

End values not included

To solve the linear inequality

9 < 3x < 21
x
M
we divide through by 3 to obtain the solution

3<x <7

The sign ‘ < ’ means ‘less than’. This means that x = 3 and x = 7 are not solutions, but all
values between x = 3 and x = 7 are possible solutions.
To represent this solution on a number line, mark in the points x = 3 and x = 7 with an
SA

open circle (◦). These two open circles are then joined by a solid line to indicate that all the
values between 3 and 7 are solutions, but not x = 3 and x = 7.
3<x<7
x
–3 –2 –1 0 1 2 3 4 5 6 7 8 9

Note that 7 > x > 3 represents the same values of x as 3 < x < 7.

A gallery of signs
= as in a = b reads as ‘a equals b’
> as in a > b reads as ‘a is greater than b’
≥ as in a ≥ b reads as ‘a is greater than or equal to b’
< as in a < b reads as ‘a is less than b’
≤ as in a ≤ b reads as ‘a is less than or equal to b’

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

378 Essential Standard General Mathematics

Example 1 Solving an inequality and graphing the solution

Solve the inequality

−10 < 5x ≤ 40

for x and display the solution on a number line.

Solution
−10 < 5x ≤ 40

E
1 Write the inequality.
−10 5x 40
2 Solve the inequality for x by dividing through by 5. or < ≤
5 5 5
3 Display the solution on a number line. or − 2 < x ≤ 8
r Draw a number line to include −2 and 8. x
–3 –2 –1 0 1 2 3 4 5 6 7 8 9

PL r Mark the point x = −2 with an open

circle.
r Mark the point x = 8 with a closed
circle.
r Join the two points with a solid line.

r Write in the solution inequality on

–3 –2 –1 0 1 2 3 4 5 6 7 8 9

–3 –2 –1 0 1 2 3 4 5 6 7 8 9

–3 –2 –1 0 1 2 3 4 5 6 7 8 9
–2 < x ≤ 8
–3 –2 –1 0 1 2 3 4 5 6 7 8 9
x

x
M
the graph.

Example 2 Solving an inequality and graphing the solution

Solve the inequality

10x > 20
SA

for x and display the solution on a number line.

Solution
1 Write the inequality. 10x > 20
10x 20
2 Solve the inequality for x by dividing through by 10. or >
10 10
3 Display the solution on a number line. or x > 2
r Draw a number line to include 2. x
–3 –2 –1 0 1 2 3 4 5 6 7 8 9
r Mark in the point x = 2 with an open x
–3 –2 –1 0 1 2 3 4 5 6 7 8 9
circle.
r To indicate all values of x greater than 2, x
–3 –2 –1 0 1 2 3 4 5 6 7 8 9
draw a solid line from this point to the
right that potentially goes on forever.
r Write in the solution inequality on the
x>2
x
–3 –2 –1 0 1 2 3 4 5 6 7 8 9
graph.
Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4
2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 379

Linear inequalities in one variable and the coordinate plane

We can also represent linear inequalities in one y
variable on the coordinate plane.
(3, 6)
If the equation x = 3 is plotted on a set of axes we
will have a vertical straight line, located at x = 3.

x=3
While the value of y changes along the line, for (3, 3)
every point on this line the value of x is 3.
Just as with graphing the solution of an inequality on (3, 0)
x

E
a number line, we need to be careful about whether the O
boundary lines (end values) of the solution are included (3, –1)
in the range of possible values.

Boundary line included

PL
If we tried to plot the inequality x ≥ 3, we would have
to plot all the points in the plane that have an x-value
greater than or equal to 3.
Of course we cannot show each individual point.
y

(5, 6)

x>3

x=3
What we do is shade in the region containing these
points. The shaded region starts at the vertical line
x = 3 and extends right forever. (3, 0)
Some representative points that satisfy the condition x
O
(4, –1)
x ≥ 3, and which are found in the shaded region, have
M
also been plotted.
Required region
Boundary line not included
The plot of the inequality x > 3 is similar to the plot of y
x ≥ 3, but the line x = 3 is drawn as a dashed line to
(5, 6)
indicate that it is not included in the region.
SA

Some representative points that satisfy the condition x>3

x=3

x > 3 have also been plotted.

Note: For (5, 6), 5 > 3
(4, −1), 4 > 3
Therefore both points satisfy the inequality x > 3. x
O
(4, –1)

Required region

Example 3 Plotting a linear inequality in one variable on the coordinate plane

On the coordinate plane, plot the graphs of:

a y≤4
b −1 < y < 3

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

380 Essential Standard General Mathematics

Solution
a y≤4 y
1 Draw in a solid line y = 4 to define the boundary
of the shaded region. (0, 4) y=4
2 Shade the region on and below the line y = 4 to
represent all the points defined by y ≤ 4. y<4
x
O

E
b −1 < y < 3 y
1 Draw in a dashed line y = 3 to define the upper boundary
(0, 3) y=3
of the shaded region.
2 Draw in a dashed line y = −1 to define the lower –1 < y < 3
boundary of the shaded region.

PL3 Shade the region between the lines y = 3 and y = −1 to

represent all the points defined by −1 < y < 3.

Exercise 9A
1 Which of the symbols <, = or > should be placed in the box in each of the following?
O
(0, –1) y = –1
x
M
a 7 9 b 3 2 c 7+1 9−1 d 0.5 1
e 8 4 f −3 1 g −2 −1 h 0 0.5

2 Represent each of the following inequalities on a number line.

a 1≤x ≤4 b 0<x <4 c x <4
d x ≥4 e −1 ≤ x < 4 f 3<x ≤5
SA

3 Write down an inequality represented by each of the following graphs.

a b x
x
–2 –1 0 1 2 3 4 5 6 7 8 –2 –1 0 1 2 3 4 5 6 7 8

c d x
x
–2 –1 0 1 2 3 4 5 6 7 8 –2 –1 0 1 2 3 4 5 6 7 8

e x
–2 –1 0 1 2 3 4 5 6 7 8

4 Solve each of the following inequalities and represent its solution on a number line.
a 3x ≥ 15 b 20x < 100 c 2x > −4
d 9x ≥ 36 e −12 ≤ 6x < 24 f 10 < 5x ≤ 25

5 A person becomes a teenager when they turn 13. They stop being a teenager when they turn
20. Let x be the variable age (in years).

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 381

a Write down an inequality in terms of x that defines a teenager.

b Graph this inequality on a number line.

6 Carry-on luggage in most passenger aircraft can

weigh no more than 5 kg. Let x be the variable
weight (in kg).
a Write down an inequality in terms of x that
defines the acceptable weight for carry-on
luggage.

E
b Graph this inequality on a number line.

PL
7 Graph the following inequalities on the coordinate plane.
a x ≤1
d y>1
g −1 < x < 2
b x > −2
e x <2
h 3<x ≤5
c y≤5
f −2 ≤ y ≤ 2
i −3 ≤ y < 0
M
9.2 Linear inequalities in two variablesy
The inequalities
y−x >2 y−x ≥2 10

y−x <2 y−x ≤2 8 (2, 8)

2
SA

are linear inequalities in two variables, x and y. =

6 x
To help us interpret these inequalities, we y–
have drawn the graph of y − x = 2. This line 4 (4, 4)
(2, 4)
(red) separates the coordinate plane into two 2
regions.
x
–4 –2 0 2 4
–2

The line y – x = 2
The line is defined by the equation y − x = 2 and coloured red. It includes all the points that
lie on the line.
From the graph above we can see that the point (2, 4) lies on the line. The points (2, 8) and
(4, 4) clearly do not lie on the line.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

382 Essential Standard General Mathematics

We can also show this by carrying out the following tests, using the equation of the line.
Test:
(2, 4): y − x = 4 − 2 = 2; so the point (2, 4) lies on the line y − x = 2.
(2, 8): y − x = 8 − 2 = 6; 6 is greater than 2, so (8, 9) does not lie on y − x = 2.
(4, 4): y − x = 4 − 4 = 0; 0 is less than 2, so (4, 4) does not lie on the line y − x = 2.

The regions y – x > 2 and y – x ≥ ≥2

This region is defined by the inequality y − x > 2 and coloured light blue. It includes all the
points that lie above the line; the point (2, 8) is an example.

E
By including the line in this region, we have a y
way of representing the inequality
10
y−x ≥2
8 (2, 8)
This region includes all the points on and above 2

PL
the line.
From the graph on the right we can see that
r the points (2, 4) and (2, 8) are examples of
points that lie in this region.
r the point (4, 4) clearly does not lie in the
region.
We can also show this by carrying out the
following tests, using the equation of the line.
Test:
6

–2
–4
y−
x=

(2, 4)

–2
(4, 4)

0 2 4
x
M
(2, 4): y − x = 4 − 2 = 2; so the point (2, 4) lies in the region y − x ≥ 2.
(2, 8): y − x = 8 − 2 = 6; 6 is greater than 2, so the point (2, 8) lies in the region y − x ≥ 2
(4, 4): y − x = 4 − 4 = 0; 0 is less than 2, so (4, 4) does not lie in the region y − x ≥ 2.

The regions y – x < 2 and y – x ≤ ≤2

This region is defined by the inequality y − x < 2 and coloured purple. It includes all the
SA

points that lie below the line; the point (4, 4) is an example.
By including the line in this region, we have a y
way of representing the inequality 10
y−x ≤2
8 (2, 8)
This region includes all the points on and below 2
=
the line. 6
y –x
From the graph on the right we can see that 4 (4, 4)
r the points (2, 4) and (4, 4) are examples of (2, 4)
points that lie in this region. 2
r the point (2, 8) clearly does not lie in the x
–4 –2 0 2 4
region.
–2

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 383

We can also show this by carrying out the following tests using the equation of the line.
Test:
(2, 4): y − x = 4 − 2 = 2; so the point (2, 4) lies in the region y − x ≤ 2.
(2, 8): y − x = 8 − 2 = 6; 6 is greater than 2, so (8, 9) does not lie in the region y − x ≤ 2.
(4, 4): y − x = 4 − 4 = 0; 0 is less than 2, so (4, 4) lies in the region y − x ≤ 2.
We now have a graphical way of representing inequalities.

Linear inequalities can be represented by regions in the coordinate plane

If the inequality sign is:

E
≤ or ≥, the line defining the region is included, indicated by using a solid line to
indicate the boundary
< or >, the line defining the region is not included, indicated by using a dashed line to
indicate the boundary.

PL
Graphing a linear inequality in two variables
Example 4 Graphing a linear inequality in two variables

Sketch the graph of the region 3x + 2y ≤ 18.

Solution
1 Find the intercepts for the boundary line 3x + 2y = 18
M
3x + 2y = 18. When x = 0, 2y = 18
r Find the y-intercept. Substitute y =9
x = 0 into the equation and solve ∴ y -intercept is (0, 9).
for y. When y = 0, 3x = 18
r Find the x-intercept. Substitute x =6
y = 0 into the equation and solve ∴ x -intercept is (6, 0).
SA

for x.
2 On a labelled set of axes, draw a straight line y
through the two intercepts. Use a solid line to
(0, 9)
indicate that the line is included in the region.
Label the line.
3x + 2 y = 18

(6, 0)
x
O

3 Use a test point to determine whether the Test (0, 0):

required region lies above or below the line. 3x + 2y = 3(0) + 2(0) = 0
Note: The origin (0, 0) is usually a good
0 < 18, so (0, 0) lies in the
point to test.
region 3x + 2y ≤ 18.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

384 Essential Standard General Mathematics

4 As (0, 0) is below the line, the required y

region lies on and below the line. Shade
(0, 9)
in the region on and below the line. Label
the region.
3x + 2y = 18

3x + 2y ≤ 18
(6, 0)
x
O

E
Example 5 Graphing a linear inequality in two variables

Sketch the graph of the region 4x − 5y > 20.

Solution

PL
1 Find the intercepts for the boundary
line 4x − 5y = 20.
r Find the y-intercept. Substitute x = 0
into the equation and solve for y.
r Find the x-intercept. Substitute y = 0
into the equation and solve for x.

2 On a labelled set of axes, draw a straight line

4x − 5y = 20
When x = 0, −5y = 20
y = −4
∴ y -intercept is (0, −4).
When y = 0, 4x = 20
x =5
∴ x -intercept is (5, 0).
y
M
through the two intercepts. Use a dashed line
to indicate that the boundary line is not
included in the region. Label the line. 4x – 5y = 20
(5, 0)
x
O
(0, –4)
SA

3 Use a test point to determine whether the Test (0, 0):

required region lies above or below the line. 4x − 5y = 4(0) − 5(0) = 0
0 < 20, so (0, 0) does not lie
in the region 4x − 5y > 20.
4 As (0, 0) is above the line, the required region y
lies below the line. Shade in the region
on and below the line. Label the region.
4x – 5y = 20
(5, 0)
x
O
4x – 5y > 20
(0, – 4)

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 385

Summary: Plotted linear inequalities

Graph the inequality as if it contained an equals (=) sign.
Draw a solid line if the inequality is ≤ or ≥.
Draw a dashed line if the inequality is < or >.
Pick a point not on the line to use as a test point. The origin is a good test point,
provided the boundary line does not pass through the origin.
Substitute the test point into the inequality. If the point makes the inequality true, shade
the region containing the test point. If not, shade the region not containing the test point.

E
Exercise 9B
1 Test to see whether the point (0, 0) lies in the following regions.

PL
a x+y≥0
d 3x − 2y ≥ 3

d 3x − 2y ≥ 3

3 Graph the following inequalities.

a y−x ≤5
b x+y<4
e y − 2x > 5

2 Test to see whether the point (1, 2) lies in the following regions.
a x+y≥0 b x+y<0
e 2x + 3y > 5

b 2x − y ≤ 4
c 2x + y > 2
f x − 3y < 6

c 2x + y > 2
f 5y − 2x ≥ 8

c x−y<3
M
d x + y ≥ 10 e 3x + y ≤ 9 f 5x + 3y ≥ 15
g 3y − 5x < 15 h 2y − 5x > 5 i y − x > −3

9.3 Feasible regions

In Chapter 2, ‘Linear relations and equations’, you learned how to solve pairs of simultaneous
linear equations graphically.
SA

For example, to solve the pair of linear equations y

3x + 2y = 18
(0, 9)
y=3
3x + 2y = 18
graphically, we simply plot their graphs and find the
point of intersection. (0, 3) (4, 3) y=3
The solution is the point on the coordinate plane that
(6, 0)
is common to both graphs. This is the point (4, 3), x
O
the point where the two lines intersect. From this,
we concludes that x = 4 and y = 3.
When we try to solve the pair of simultaneous linear inequalities

3x + 2y ≥ 18
y≥3

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

386 Essential Standard General Mathematics

graphically, there is not a single solution, but many solutions. The solutions are all the points
that lie in the region in the coordinate plane that is common to both inequalities.
The region common to both inequalities is called the feasible region. It is called the feasible
region because all the points in this region are possible solutions of the pair of simultaneous
linear inequalities.
The feasible region (solution region) for a set of inequalities is determined by finding the
region common to all of the inequalities involved. This process is illustrated below for the
inequalities

E
3x + 2y ≥ 18 and y ≥ 3.

y y y
3x + 2y ≥ 18 3x + 2y ≥ 18
(0, 9) y>3 (0, 9)
y≥3

PL O (6, 0)

The region shaded pink is

defined by the inequality
3x + 2y ≤ 18.
x
O
(0, 3)

The region shaded blue is

defined by the inequality
y ≥ 3.
x
(0, 3)

O
(4, 3)

(6, 0)

The region shaded purple is the

x

feasible region. It is the region

common to the inequalities
3x + 2y ≤ 18 and y ≥ 3.

The method we have used to graphically determine the feasible region is called shading in.
M
Sometimes this method of finding the region common to a set of inequalities can quickly
become messy and impractical when we have too many inequalities. Fortunately, for the sort of
applications you will meet in this chapter, the required region will lie in the first quadrant and
involve only a small number of inequalities so that the ‘shading in’ method is appropriate.

Example 6 Graphing a feasible region

SA

Graph the feasible region for the following four simultaneous inequalities:
x ≥ 0, y ≥ 0, x + y ≤ 8, 3x + 5y ≤ 30

Solution
Because x ≥ 0 and y ≥ 0, the feasible region is restricted to the first quadrant.
1 Graph the inequality x + y ≤ 8 in the first y
quadrant. (0, 8)
r Plot the boundary line x + y = 8,
marking and labelling the y-intercept
x+y=8
(0, 8) and the x-intercept (8, 0).
r Shade in the region bounded by the
x- and y-axes and the line. Here x
O (8, 0)
it has been shaded blue.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 387

2 Graph the inequality 3x + 5y ≤ 30 in the y

first quadrant.
(0, 8)
r Plot the boundary line 3x + 5y = 30,
x+y=8
marking and labelling the y-intercept (0, 6)
(0, 6) and the x-intercept (10, 0).
3x + 5y = 30
r Shade in the region bounded by the
x- and y-axes and the line. Here it x
O (8, 0) (10, 0)
has been shaded pink, but it becomes purple
where it overlaps the blue region.

E
3 The overlap region (purple) is the y
feasible region.
r Label the overlap region the (0, 8)
‘Feasible region’. x+y=8

PL
r To complete the feasible region,
find the coordinates of the point
where the two boundary
lines intersect, by solving the
simultaneous equations

x+y=8
3x + 5y = 30
(0, 6)

O
Feasible
region
(5, 3)
3x + 5y = 30

(8, 0) (10, 0)
x
M
The lines intersect at the point (5, 3).
Mark this point on the graph.

Example 7 Graphing a feasible region

Graph the feasible region for the following four simultaneous inequalities:
x ≥ 0, y ≥ 0, x + 2y ≥ 10, 6x + 4y ≥ 36
SA

Solution
Because x ≥ 0 and y ≥ 0, the feasible region is restricted to the first quadrant.
1 Graph the inequality x + 2y ≥ 10 in the y
first quadrant.
r Plot the boundary line x + 2y = 10,
marking and labelling the y-intercept
(0, 5) and the x-intercept (10, 0). (0, 5)
r Shade in the region bounded by the
x + 2y = 10
x- and y-axes and the line. Here it
has been shaded blue. x
O (10, 0)

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

388 Essential Standard General Mathematics

2 Graph the inequality 6x + 4y ≤ 36 in the y

first quadrant.
r Plot the boundary line 6x + 4y = 36, (0, 9)

marking and labelling the y-intercept (0, 5)

(0, 9) and the x-intercept (6, 0). x + 2y = 10
r Shade in the region bounded by the
x- and y-axes and the line. Here it
has been shaded pink, but it becomes purple 6x + 4y = 36
x
where it overlaps the blue region. O

E
(6, 0) (10, 0)

3 The overlap region (purple) is the y

feasible region.
(0, 9)
r Label the overlap region the Feasible
region
r ‘Feasible region’.

PL To complete the feasible region,

find the coordinates of the point
where the two boundary
lines intersect, by solving the
simultaneous equations

x + 2y = 10
6x + 4y = 36

The lines intersect at the point (4, 3).

(0, 5)
x + 2y = 10

O
(4, 3)
6x + 4y = 36
(6, 0) (10, 0)
x
M
Mark this point on the graph.

How to graph a feasible region using a TI-Nspire CAS

SA

Graph the feasible region for the following four simultaneous inequalities:
x ≥ 0, y ≥ 0, x + 2y ≥ 10, 6x + 4y ≥ 36
Because x ≥ 0 and y ≥ 0, the feasible region is restricted to the first quadrant. We take this
into account when setting the viewing window on the calculator.

Steps
1 To graph the inequalities x + 2y ≥ 10 and
6x + 4y ≥ 36 using a graphics calculator,
first we need to rearrange both inequalities
so that y is the subject. Hence,
(10 − x)
x + 2y ≥ 10 becomes y ≥
2
(36 − 6x)
6x + 4y ≥ 36 becomes y ≥
4

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 389

2 Open a new document (by pressing / + N ) and select 2: Graphs & Geometry.
a Use the backspace key ( ) to
delete the f 1(x) = and type in
y >= (10 − x) ÷ 2. Press enter . This
plots the inequality x + 2y ≥ 10.
b Repeat the above but this time type in
y >= (36 − 6x) ÷ 4. Press enter .
This plots the inequality 6x + 4y ≥ 36
c Press / + to hide the entry line.

E
d The inequalities x ≥ 0 and y ≥ 0
indicate that the feasible region is
restricted to the first quadrant. This is
best achieved by resetting the viewing

PL window.
3 To reset the viewing window, press
b /4:Window/1:Window Settings.
Using

r XMax: 12
to move between the entry
boxes, enter the following values:
r XMin: 0

r XScale: Auto
r YMin: 0
M
r YMax: 10
r YScale: Auto

4 Pressing enter confines the plot to the first

quadrant. The graphs will appear as shown.
The feasible region is the more heavily
shaded region.
SA

Note: It may be necessary to grab and move the

graph labels if they overlap with other labels.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

390 Essential Standard General Mathematics

5 To complete the feasible region, we need to

know the coordinates of the corner points.
a Press b /6:Points & Lines/3:Intersection
Point/s.
b Move the cursor to one of the graphs and
press . Now move to the other graph
and press . The point of intersection
(4, 3) will be displayed. Press to exit

E
the Intersection Point tool.
The other two points, (0, 9) and (10, 0), can
be determined from the equations of the
boundary lines.

PL How to graph a feasible region using the ClassPad

Graph the feasible region for the following four simultaneous inequalities:

x ≥ 0, y ≥ 0, x + 2y ≥ 10, 6x + 4y ≥ 36

Because x ≥ 0 and y ≥ 0, the feasible region is restricted to the first quadrant. We take
this into account when setting the viewing window on the calculator.
M
Steps
1 From the application menu, locate and open the
Graph and Table ( ) built-in application.
To graph the inequalities x + 2y ≥ 10 and
6x + 4y ≥ 36, first we need to rearrange both
inequalities so that y is the subject. Hence,
SA

(10 − x)
x + 2y ≥ 10 becomes y ≥
2
(36 − 6x)
6x + 4y ≥ 36 becomes y ≥
4

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 391

2 To set the calculator to draw

the correct inequality, tap
the down arrow ( ) adjacent
to in the toolbar and
select .
Adjacent to y1: type (10 − x)/2.
Press E.
Adjacent to y2: type (36 − 6x)/4.

E
Press E.
Adjacent to y3: type 0.
Press E.
3 To enter the x ≥ 0 inequality,

PL tap the down arrow ( )

adjacent to
and select .
in the toolbar

Adjacent to y4: type 0.

Press E.
Tap on the View Window
icon (6) in the toolbar to
set the graph viewing
M
window.
SA

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

392 Essential Standard General Mathematics

4 To complete the region,

the corner points need to
be found.
From the Analysis menu
item, select G-solve, then
Intersect.
Use the up and
directions from the blue oval

E
directional button on the
front of the calculator to
select the equations for y1
and y2.
When an equation has been

PL selected, press E to
confirm its choice.
The equation of each line is
displayed in a window at the
bottom of the graphing
screen.
5 After the second equation has
been selected and confirmed,
M
the intersection point will be
displayed on the screen,
indicated by a cursor in the
shape of a small cross. In
this case, (4, 3).
The other two boundary
SA

points are (0, 9) and (10, 0).

Exercise
********* 9C
Graph the feasible region for each of the following sets of linear inequalities.
1 x ≥ 0, y ≥ 0, x + y ≤ 10

2 x ≥ 0, y ≥ 0, 2x + 3y ≤ 12

3 x ≥ 0, y ≥ 0, 3x + 5y ≥ 15

4 x ≥ 0, y ≥ 0, x + y ≤ 6, 2x + 3y ≤ 15

5 x ≥ 0, y ≥ 0, 3x + y ≤ 6, x + 2y ≤ 7
Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4
2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 393

6 x ≥ 0, y ≥ 0, 5x + 2y ≥ 20, 5x + 6y ≥ 30

7 x ≥ 0, y ≥ 0, 4x + y ≥ 12, 3x + 6y ≥ 30

8 x ≥ 0, y ≥ 0, 2x − y ≥ 0, x + y ≤ 30

9.4 Linear programming

Objective functions and constraints
An objective function is a quantity that you are trying to make as large as possible (for

E
example, profits) or as small as possible (for example, the amount of material needed to make
a dress). Of course, there are always factors, such as the resources available or the
requirements of the dress pattern, that limit how much profit you can make or how little
material you can use to make a dress. These are called constraints.

PL
The linear programming problem
The process of maximising or minimising a linear quantity, subject to a set of constraints, is
at the heart of linear programming.

The linear programming problem

From the mathematical point of view, linear programming can be viewed as finding the
point, or points, in a feasible region that gives the maximum or minimum value of some
linear expression.
M
Finding the maximum value of an objective function
y
The aim is to find the maximum value of the
objective function P = 2x + 3y, subject (0, 8)
to the constraints:
B(0, 6) x+y=8
x ≥ 0, y ≥ 0
SA

x+y≤8 C(5, 3)
Feasible 3x + 5y = 30
3x + 5y ≤ 30
region (10, 0)
as shown by the feasible region opposite. x
A(0, 0) D(8, 0)

At first, this seems like an insurmountable problem, as there is an infinite number of points in
the region to choose from. Fortunately, we can make use of the corner point principle to help
us solve the problem.

The corner point principle

In linear programming problems, the maximum or minimum value of a linear objective
function will occur at one of the corners of the feasible region.
Note: If two corners give the same maximum or minimum value, then all points along a line joining the two
points will also give the same maximum or minimum value.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

394 Essential Standard General Mathematics

This means that we only need to evaluate

Objective function
the objective function at each of the corner
Points P = 2x + 3y
points, labelled A, B, C and D, and find
A (0, 0) P=2×0+3×0=0
which gives the maximum value. It helps to
B (0, 6) P = 2 × 0 + 3 × 6 = 18
set up a table as follows.
C (5, 3) P = 2 × 5 + 3 × 3 = 19
D (8, 0) P = 2 × 8 + 3 × 0 = 16

Thus, the maximum value of the objective function, P = 19, occurs when x = 5 and y = 3.

E
Example 8 Finding the minimum value of an objective function

Find the minimum value of the objective y

function C = 5x + 2y, subject to the
A (0, 9)
constraints: Feasible

PL
Solution
x ≥ 0, y ≥ 0
x + 2y ≥ 10
6x + 4y ≥ 36
as displayed in the feasible region opposite.

1 Set up a table for the objective

function.
(0, 5)
x + 2y = 10

6x + 4y = 36
O (0, 6)

Objective function
region

B(4, 3)

C
(10, 0)
x
M
Points C = 5x + 2y
2 Evaluate the objective function at A(0, 9) C = 5 × 0 + 2 × 9 = 18
each of the corners A, B and C. B(4, 3) C = 5 × 4 + 2 × 3 = 26
3 Identify the corner point giving the
C(10, 0) C = 5 × 10 + 2 × 0 = 50
minimum value and write your answer.
The minimum value is C = 18, which
occurs when x = 0 and y = 9.
SA

Exercise 9D
For each of the following objective functions and feasible regions, find the maximum or
minimum value (as required) and the point at which it occurs.
1 P = 4x + 2y (maximum) 2 P = 3x + 4y (maximum)
y y

C(2, 12)
B(0, 5) B(0, 10)
D(6, 8)
C(3, 3)
Feasible Feasible
region region
x x
A(0, 0) D(6, 0) A(0, 0) E(12, 0)
Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4
2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 395

3 C = 3x + 5y (minimum) 4 C = x + y (minimum)
y y

A(0, 10) Feasible

region
Feasible
A(0, 12)
region

B(3, 2.5)
B(2, 4)
C(6, 0) C(10, 0)

E
x x
O O

5 P = x + 2y (maximum) 6 C = 2x + 2y (minimum)
y y

9.5
PL A(0, 0)
B(10, 20)

Feasible
region

Linear programming applications

C(30, 0)
x
O
Feasible
region
A(0, 5)

B(5, 0)
x
M
You now have all the technical skills necessary to set up and solve a basic linear programming
problem.

Example 9 Setting up and solving a maximising problem

A manufacturer makes two sorts of orange-flavoured chocolates: House Brand and Orange
SA

Delights.
1 kg of House Brand contains 0.3 kg of chocolate and 0.7 kg of orange fill.
1 kg of Orange Delights contains 0.5 kg of chocolate and 0.5 kg of orange fill.
300 kg of chocolate and 350 kg of orange fill are available to the manufacturer each day.
The profit is $7.50 per kilogram on House Brand and $10 per kilogram on Orange
Delights.
How much of each type of
orange-flavoured chocolate should be
made each day to maximise profit?

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

396 Essential Standard General Mathematics

Solution
1 Define x and y. Let x be the amount (in kg) of House Brand
made each day.
Let y be the amount (in kg) of Orange
Delights made each day.

2 Write down the constraints. Constraints:

r x and y cannot be negative. x ≥ 0, y ≥ 0
r 300 kg of chocolate is available. 0.3x + 0.5y ≤ 300 (chocolate)

E
r 350 kg of orange fill is available. 0.7x + 0.5y ≤ 350 (orange fill)
3 Graph the feasible region defined by
the constraints. Mark in each of the
corner points and label with their

PLcoordinates. Use a calculator to

determine the point of intersection.

B(0, 600)
y

(0, 700)
C (125, 525)
0.3x + 0.5y = 300
M
Feasible
region
x
A(0, 0) D(500, 0) (1000, 0)
0.7x + 0.5y = 350

4 Write down the objective function Objective function:

(in dollars). Call it P, for profit. P = 7.5x + 10y
SA

5 Determine the maximum profit by

Objective function
evaluating the objective function at
Point P = 7.5x + 10y
each corner of the feasible region.
A(0, 0) P = 7.5 × 0 + 10 × 0 = $0
B(0, 600) P = 7.5 × 0 + 10 × 600
= $6000
C(125, 525) P = 7.5 × 125 + 10 × 525
= $6187.50
D(500, 0) P = 7.5 × 500 + 10 × 0
= $3750

6 Write your answer to the question. The maximum profit is $6187.50, which is
obtained by making 125 kg of House Brand
and 525 kg of Orange Delights.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 397

Example 10 Setting up and solving a minimising problem

SpeedGro and Powerfeed are two popular brands of home garden fertiliser. They both contain
the nutrients X, Y and Z, needed for healthy plant growth.
1 kg of SpeedGro contains 30 units of X, 50 units of Y and 10 units of Z.
1 kg of Powerfeed contains 20 units of X, 20 units of Y and 20 units of Z.
A gardener calculates that he needs a fertiliser containing at least 160 units of nutrient X,
200 units of nutrient Y and 80 units of nutrient Z.

E
Speedgro costs $8 per kg and Powerfeed costs $6 per kg.
How much of each type of fertiliser should he buy to meet his needs at the minimum cost?

Solution
1 Define x and y. Let x be the amount (in kg) of

PL
2 Write down the constraints.
r x and y cannot be negative.
r At least 160 units of X are needed.
r At least 200 units of Y are needed.
r At least 80 units of Z are needed.
SpeedGro needed.
Let y be the amount (in kg) of
Powerfeed needed.
Constraints:
x ≥ 0, y ≥ 0
30x + 20y ≥ 160 (nutrient X)
50x + 20y ≥ 200 (nutrient Y)
10x + 20y ≥ 80 (nutrient Z)
M
3 Graph the feasible region defined by the y
constraints. Mark in each of the corner A(0, 10)
points and label with their coordinates. (0, 8) Feasible
Use a calculator to determine the points region
of intersection. B(2, 5)
(0, 4)
C (4, 2)
SA

D(8, 0)
x
O (4, 0) (5.3, 0)
50x + 20y = 200
10x + 20y = 80
30x + 20y = 160
4 Write down the objective function Objective function:
(in dollars). Call it C, for cost. C = 8x + 6y
5 Determine the minimum cost by
Objective function
evaluating the objective function at
Point C = 8x + 6y
each corner of the feasible region.
A(0, 10) C = 8 × 0 + 6 × 10 = $60
B(2, 5) C = 8 × 2 + 6 × 5 = $46
C(4, 2) C = 8 × 4 + 6 × 2 = $44
D(8, 0) C = 8 × 8 + 6 × 0 = $64
6 Write your answer to the question. The minimum cost is $44, which is
achieved by buying 4 kg of
SpeedGro and 2 kg of Powerfeed.
Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4
2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

398 Essential Standard General Mathematics

Exercise 9E
1 A factory makes two products: Wigits and Gigits. Two different machines are used.
r To make a Wigit takes 1 hour on Machine 1 and 2 hours on Machine 2.
r To make a Gigit takes 1 hour on Machine 1 and 4 hours on Machine 2.
r Up to 8 hours of Machine 1 time and up to 24 hours of Machine 2 time are available each
day.
r The factory makes a profit of $200 for each Wigit and $360 for each Gigit it produces.

E
a Let x be the number of Wigits made each day.
Let y be the number of Gigits made each day.
The constraints for this problem are:

x ≥ 0, y ≥

PL x+y≤8
x + 4y ≤

Determine the missing information.

(Machine 1 time)
(Machine 2 time)

b The feasible region is shown on the right. Some

information is missing. Determine the missing
information.

B
(0, 8)
y

x+y=8
M
C
Feasible
= 24
region
x
A(0, 0) D(8, 0) ( )
c The objective function is give by P = 200x + y, where P stands for profit (in dollars).
Determine the missing information.
SA

d How many Wigits and Gigits should be made each day to maximise profit, and what is
this profit?

2 An outdoor clothing manufacturer makes two sorts of jackets: Polarbear and Polarfox.
r To make a Polarbear jacket takes 2 m of material. The time taken to make a Polarbear
jacket is 2.4 hours.
r To make a Polarfox jacket takes 2 m of material. The time taken to make a Polarfox
jacket is 3.2 hours.
r The manufacturer has 520 m of material available and 672 hours of worker time to
make the jackets.
r The manufacturer makes a profit of $36 for each Polarbear jacket and $42 for each
Polarfox jacket it produces.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 399

a Let x be the number of Polarbear jackets made.

Let y be the number of Polarfox jackets made.
The constraints for this problem are:
x≥ , y≥
x + 2y ≤ (material availability)
x+ y ≤ 672 (worker time availability)
Determine the missing information.
b The feasible region is shown on the right. Some y

E
information is missing. Determine the missing
information.

B(0, 210)
= 520
C( )
Feasible

PL A(0, 0)
region

c The objective function is given by P = x + y, where P stands for profit (in dollars)
Determine the missing information.
d What is the maximum profit that can be made, and how many Polarbear jackets and
Polarfox jackets should be made each day to achieve this profit?
D(

3 Following a natural disaster, the army plans to use helicopters to transport medical teams
)
= 672
E(
x
)
M
and their equipment into a remote area. They have two types of helicopter: Redhawks and
Blackjets.
r Redhawks carry 45 people and 3 tonnes of equipment.
r Blackjets carry 30 people and 4 tonnes of equipment.
r At least 450 people and 36 tonnes of equipment need to be transported.
r Redhawks cost $3600 per hour to run and Blackjets cost $3200 per hour to run.
SA

a Let x be the number of Redhawks.

Let y be the number of Blackjets.
The constraints for this problem are:
x ≥ 0, y ≥ 0
(people)
(equipment)
Determine the missing information.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

400 Essential Standard General Mathematics

b The feasible region is shown on the right. Some y

information is missing. Determine the missing
information.
A(0, 15)
Feasible
( )
region
B( )

C(12, 0)
x
O ( ) = 36

E
= 450
c The objective function is given by C = x+ y, where C stands for cost (in
dollars). Determine the missing information.
d How many Redhawks and Blackjets should be used to minimise the cost per hour, and

PL what is this cost?

4 A sawmill produces both construction grade and furniture grade timber.

r To produce 1 cubic metre of construction grade timber takes 2 hours of sawing and
3 hours of planing.
r To produce 1 cubic metre of furniture grade timber takes 2 hours of sawing and 6 hours of
planing.
r Up to 8 hours of sawing time and 18 hours of planing time are available each day.
r The sawmill makes a profit of $500 per cubic metre of construction grade timber and
$600 per cubic metre of furniture grade timber it produces.
M
a Write down the constraints and profit function for this problem.
b Draw a diagram.
c Find how much construction grade and furniture grade timber the sawmill should make
each day to maximise its profit. What is this profit?

5 Two breakfast cereal mixes, Healthystart and Wakeup, are available in bulk.
SA

r Each kilogram of Healthystart contains 12 mg of vitamin B1 and 40 mg of vitamin B2.

r Each kilogram of Wakeup contains 20 mg of vitamin B1 and 25 mg of vitamin B2.
r You want a mix of the two that contains at least 15 mg of vitamin B1 and 30 mg of
vitamin B2.
r Healthystart costs $5 a kilogram and Wakeup costs $4.50 per kilogram.
a Write down the constraints and cost function for this problem.
b Draw a diagram.
c Find the mixture of these two cereals that will meet your needs at minimum cost. What is
this cost?

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 401

Review
Key ideas and chapter summary

Linear inequality A linear inequality involves one or two of the signs >, ≥, < or ≤,
but not an equals sign ( = ).
Displaying linear A linear inequality in one variable can be represented on a number
inequalities in one line by a solid coloured line ending at one or two circles.
variable on a number The line represents all the possible solutions of the inequality.
line An open circle (◦) indicates that the end value is not included in the

E
inequality (for < or >).
A closed circle (•) indicates that the end value is included in the
inequality (for ≤ or ≥).
Displaying linear Linear inequalities in one variable can be represented on a

PL
inequalities in one
variable on the
coordinate plane

Displaying linear
inequalities in two
coordinate plane by a shaded region bounded by one or two lines
parallel to the x- or y-axes.
The region represents all the possible solutions of the inequality.
A dashed line indicates that the line is not included in the inequality
(for < or >).
A solid line indicates that the line is included in the inequality
(for ≤ or ≥).
A linear inequality in two variables can be represented on a
coordinate plane by a shaded region bounded by a line at an angle to
M
variables on the the x- and y-axes.
coordinate plane The region represents all the possible solutions of the inequality.
The boundary line is dashed if it is not included in the inequality
(for < or >), but solid if it is included (for ≤ or ≥).
A reference point, often the origin (0, 0), can be used to help decide
whether the required region lies above or below the line.
SA

Feasible region When solving simultaneous inequalities, the region in the coordinate
plane that is common to all the inequalities is called the feasible
region. It represents all the possible solutions to the simultaneous
inequalities.
The feasible region can be found graphically (for a small number of
inequalities) by shading in the required regions for all the
inequalities and determining where they all overlap.
A graphics calculator can be used to graph a feasible region.
Linear programming Linear programming involves maximising or minimising a linear
quantity subject to the constraints represented by a set of linear
inequalities. The constraints (e.g. requirements, resources) define the
feasible region in which the quantity is to be maximised or
minimised.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Review 402 Essential Standard General Mathematics

The constraints x ≥ 0 and y ≥ 0 together restrict the feasible region

to the positive (first) quadrant.
Objective function The objective function is a linear expression representing the
quantity to be maximised (e.g. profit) or minimised (e.g. cost) in a
linear programming problem.
Corner point principle The corner point principle states that, in linear programming
problems, the maximum or minimum value of a linear objective

E
function will occur at one of the corners of the feasible region, or on
a line on the boundary of the feasible region joining two of the
corners.

Skills check

PLHaving completed this topic you should be able to:

represent a linear inequality in one variable on a number line
represent a linear inequality in one or two variables on the coordinate plane
know the meaning of the terms feasible region, constraint and objective function as
they relate to linear programming
determine the maximum or minimum value of an objective function for a given
feasible region
M
set up and solve basic linear programming problems.

Multiple-choice questions

1 The inequality displayed on the number line on x

–1 0 1 2 3 4 5 6 7 8
the right is:
SA

A 1≤x ≤7 B 1<x <7 C 1≤x <7

D 1<x ≤7 E 1>x >7
2 The inequality displayed on the number line on x
–1 0 1 2 3 4 5 6 7 8
the right is:
A x <5 B x ≤5 C x >5
D x ≥5 E 0>x >5
3 The inequality displayed on the coordinate plane y
on the right is:
(0, 8) y=8
A x <8 B x ≤8 C y<8
D y≤8 E 0>x >8

x
O

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 403

Review
y
4 The inequality displayed on the coordinate plane
on the right is:
A 3 < x < 10 B 3 < x ≤ 10 C 3 ≤ x ≤ 10

x = 10
x=3
D 3 < y < 10 E 3 < y ≤ 10

x
O (3, 0) (10, 0)

E
y
5 The equation of the line displayed on the right is:
A 4x + 5y = 4 B 4x − 5y = 4 C 5x + 4y = 20
(0, 4)
D 4x + 5y = 20 E 4x − 5y = 20

PL 6 The equation of the line displayed on the right is:

A 4x − 5y = 0 B 4x + 5y = 0 C 5x − 4y = 20
D 5x + 4y = 20 E 5y = 20x
O

y
(5, 0)

(5, 4)
x
M
x
(0, 0)

7 The region displayed on the right (including the line) y

represents the inequality:

(0, 10)
A 5x + 2y < 20 B 5x + 2y ≤ 20 C 5x + 2y > 20 5x + 2y = 20
D 5x + 2y ≥ 20 E 2x + 5y > 20
SA

x
O (4, 0)

8 The region displayed on the right (not including the line) y

represents the inequality:

y – 3x = 6
A y − 3x ≤ 6 B y − 3x < 6 C y − 3x ≥ 6
(0, 6)
D y − 3x > 6 E 3x − y > 6

(–2, 0)
x
O

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Review 404 Essential Standard General Mathematics

9 The two lines shown on the right intersect at the point: y

A (1, 1.3) B (2, 1.5) C (1.2, 1.2)

D (2.4, 1.2) E (3, 2.4) (0, 3)
3x + 4y = 12
(0, 2)
x + 3y = 6
x
O (4, 0) (6, 0)

10 The feasible region displayed on the right y

E
(including the line) is defined by the inequalities: (0, 5)
A x ≥ 0, y ≥ 0, x − y < 5
B x ≥ 0, y ≥ 0, x − y ≥ 5
Feasible
C x ≥ 0, y ≥ 0, x + y < 5 region
D x ≥ 0, y ≥ 0, x + y ≤ 5 x

PL E x ≥ 0, y ≥ 0, x + y ≥ 5

11 The feasible region displayed on the right

(including the lines) is defined by the inequalities:
A x ≥ 0, y ≥ 0, x + 2y ≥ 10, 4x + y ≥ 12
B x ≥ 0, y ≥ 0, x + 2y ≤ 10, 4x + y ≤ 12
C x ≥ 0, y ≥ 0, x + 2y > 10, 4x + y > 12
D x ≥ 0, y ≥ 0, x + 2y < 10, 4x + y < 12
E x ≥ 0, y ≥ 0, x + 2y ≥ 10, 4x + y ≤ 12
(0, 12)

(0, 5)

O
O

4x + y = 12
y

(3, 0)
(2, 4)
(5, 0)

Feasible
region

(10, 0)
x
x + 2y = 10
M
12 For the feasible region displayed in Question 11, the minimum value of the
objective function, C = 2x + y, is:
A 5 B 6 C 8 D 12 E 20

13 For the feasible region displayed on the right, the maximum y

value of the objective function, P = 4x + 3y, is:
SA

(0, 12)
A 0 B 40 C 42 (0, 10)
D 48 E 60 (6, 6)
Feasible
region (15, 0)
x
(0, 0) (12, 0)

The following information relates to Questions 14 to 16

An outdoor clothing manufacturer makes two styles of all-weather coats: long and short.
r To make a short coat, 2 m of material are required. The time taken to make a short
coat is 2.5 hours.
r To make a long coat, 3 m of material are required. The time taken to make a long
coat is 3.5 hours.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Chapter 9 — Inequalities and linear programming 405

Review
r The manufacturer has 450 m of material available and 700 hours of worker time to
make the coats.
r The manufacturer makes a profit of $40 for each short coat and $48 for each long
coat.
Let x be the number of short coats made.
Let y be the number of long coats made.
14 The constraints that relate to the amount of material available are:
A x ≥ 0, y ≥ 0, 2x + 3y ≤ 450 B x ≥ 0, y ≥ 0, 2x + 3y ≥ 450

E
C x ≥ 0, y ≥ 0, 2.5x + 3.5y ≤ 700 D x ≥ 0, y ≥ 0, 2.5x + 3.5y ≥ 700
E x ≥ 0, y ≥ 0, 40x + 48y ≥ 700
15 The constraints that relate to the amount of time available are:
A x ≥ 0, y ≥ 0, 2x + 3y ≤ 450 B x ≥ 0, y ≥ 0, 2x + 3y ≥ 450

PL C x ≥ 0, y ≥ 0, 2.5x + 3.5y ≤ 700 D x ≥ 0, y ≥ 0, 2.5x + 3.5y ≥ 700

E x ≥ 0, y ≥ 0, 40x + 48y ≥ 700
16 The objective function P is:
A P = 2.5x + 3.5y
D P = 40x + 48y

Short-answer questions
B P = 2x + 3y
E P = 450x + 700y

1 Plot the inequality −2 ≤ x < 4 on a number line.

C P = 3x + 3.5y
M
2 Plot the inequality 1 ≤ y < 5 on the coordinate plane.
3 Plot the inequality 5x + 4y < 40 on the coordinate plane.
4 Plot the region defined by the inequalities:
x ≥ 0, y ≥ 0, 3x + 5y ≤ 60
5 Plot the region defined by the inequalities:
SA

x ≥ 0, y ≥ 0, 2x + 3y ≥ 30, x + 4y ≥ 20

Extended-response questions

1 A garden products company makes two sorts of fertiliser: Standard Grade and
Premium Grade. There are two main ingredients: nitrate and phosphate.
r To make a tonne of Standard Grade fertiliser takes 0.8 tonnes of nitrate and 0.2
tonnes of phosphate.
r To make a tonne of Premium Grade fertiliser takes 0.7 tonnes of nitrate and 0.3
tonnes of phosphate.
r The company has 56 tonnes of nitrate and 21 tonnes of phosphate.
r The company makes a profit of $600 per tonne on Standard Grade fertiliser and
$750 per tonne on Premium Grade fertiliser.

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard
P1: FXS/ABE P2: FXS
0521672600Xc09.xml CUAU034-EVANS March 11, 1904 1:36

Back to Menu >>>

Review 406 Essential Standard General Mathematics

a Write the constraints and profit function for this problem.

b Draw a diagram.
c Find how much of each type of fertiliser the company should make to maximise
its profit. What will this profit be?
2 Two foods fed to animals contain both vitamin A and vitamin B.
r 1 kg of Food A contains 3 units of vitamin A and 4 units of vitamin B.
r 1 kg of Food B contains 5 units of vitamin A and 3 units of vitamin B.
r The daily vitamin requirement of each animal is at least 15 units of vitamin A

E
and at least 12 units of vitamin B.
r Food A costs $0.30 per kg and Food B costs $0.24 per kg.

a Write the constraints and cost function for this problem.

b Draw a diagram.

PL c Find how much of each type of food should be fed to the animals each day to
minimise cost. What is this cost?
M
SA

Cambridge University Press • Uncorrected Sample Pages • 978-0-521-74049-4

2008 © Evans, Lipson, Jones, Avery, TI-Nspire & Casio ClassPad material prepared in collaboration with Jan Honnens & David Hibbard