Practice 3

ATL 1 Graph these systems of inequalities. Shade the region of the solution set.

a y < 4 ; y ≤ 2x 6 b x ≥ 3 ; y > x

c y ≤ −x 2 ; y ≥ 2 5x d 2y x < 4 ; y + 2x < 3

e x ≥ −3 ; 3y > 5x + 6 f 3x + 2y > −2 ; x + 2y < 2

g 4x + 2y ≤ 2 ; y > −2 h y > 23x + 3 ; y ≥ −43x 3

Problem solving

2 Write the system of inequalities satised by the region shaded in the graph.

4 2 2 8

3 Graph these systems of inequalities. Shade the region of the solution set.

a y < 5 ; x ≥ −3 ; y < x b y > x 2 ; y > 0 ; x < 0

4 Graph these systems of inequalities.

a x ≥ 0 ; x + y < 7, y < 6 b 2 ≤ x < 7 ; y > 3x + 2

c x ≥ −1 ; 2x y < 12; x > y d y ≤ 2x ; 3x + y > 2; x ≤ 8

When a real-life problem is modelled by a system of linear inequalities, you

can solve the system graphically. This process is called linear programming

Linear programming was developed during World War II to help optimize

the allocation of labor and materials for the war eor t. It is sometimes

called linear optimization. Nowadays it is used as a tool in the decision-

making process by a wide range of groups. For example, industries use it to

allocate labor, transpor t, materials and other resources to maximize prot

and minimize cost.

ATL

Exploration 6

1 Graph the inequalities y ≤ − x + 7, y ≤ 3x and y ≥ x 2.

2 Shade the region which contains the solution set.

3 The region is a triangle. Write down the coordinates of the vertices of

this triangle.

4 If the vertices give the maximum and minimum values of z, explain why

you think this happens.

5 6 4 14 Models
 A LG E B R A

In Exploration 6, you optimized (found the maximum/minimum) of a

function z in x and y, where x and y satisfy a system of inequalities.

The region of the graph that contains the solution set is called the feasible Explaining why

region. This region might be a polygon. the system of

linear inequalities

A system of linear equalities is optimized on one of the vertices of the

is optimized on

feasible region polygon.

one of the vertices

of the feasibility

You can use this method to solve real-world problems, such as this one:
region polygon

uses mathematics
A furniture manufacturing company makes desks and chairs.

beyond the level of

It takes 8 hours to make a desk, and 2 hours to varnish it.

this course.

It take 2 hours to make a chair, and 1 hour to varnish it.

One week there are 400 hours of worker time available for making desks and

chairs, and 120 hours of worker time for varnishing them.

The company sells each desk for $50 and each chair for $20. Determine

the number of desks and chairs the company should produce that week to

Revenue is the

maximize their revenue.

amount of money

1 Identify the variables. they will be paid

for the desks and

Let x be the number of desks made and y be the number of chairs.

chairs.

It takes 8x hours to make x desks, and 2y hours to make y chairs.

It takes 2x hours to varnish x desks, and y hours to varnish y chairs.

2 Identify the constraints.

There are 400 hours available for making, so one constraint is ‘the total time

for making desks and chairs is less than or equal to 400’.

This is expressed mathematically as 8x + 2y ≤ 400.

There are 120 hours available for varnishing, so another constraint can be

expressed as 2x + y ≤ 120.

Also, both x and y are greater than or equal to 0, so x ≥ 0 and y ≥ 0.

This is a system of

3 Graph the system of inequalities four inequalities.

250

225

200

175

y ≤ −4x + 200
150

(0, 120)
125

y > 0

100

x > 0

75
(50, 0)

50 (40, 40)
y ≤ −2x + 120

25 feasible region

(0, 0)

x
0
10 20

14.3 Decisions, decisions 5 6 5

4 Shade the feasible region.

The numbers of desks and chairs that can be manufactured given

the company’s constraints all fall within this region. Write down the

coordinates of its vertices: (0, 0), (0, 120), (50, 0) and (40, 40).

5 Determine the function to be maximized.

Desks sell for $50 and chairs for $20, so for selling x desks and y chairs gives

total revenue R = 50x + 20y.

R = 50x + 20y is the objective function the one to be optimized using

values that satisfy the constraints.

6 Test the coordinates of the vertices with the constraints and

objective function:

x y 8x + 2y 2x + y 50x + 20y

(0, 0) 0 0 0 0 $0

(50, 0) 50 0 400 100 $100

(0, 120) 0 120 240 120 $2400

(40, 40) 40 40 400 120 $2800

You can see from the table that the maximum revenue is $2800 from

making and selling 40 desks and 40 chairs.

Linear programming

Linear programming is a method of maximizing or minimizing a linear

function subject to linear constraints within the problem.

The objective function is the linear function representing cost, prot, or

some other quantity to be optimized (maximized or minimized) subject to

the constraints.

The constraints form a system of linear inequalities which model the real-

life problem.

The feasible region is the area of the graph that contains the solutions to

the system of linear inequalities.

If there is an optimal solution to a linear programming problem, it will

occur at one or more vertices of the feasibility region polygon.

Example 3 is a simplied version of a real-life problem at the end of World

War II, where British and US planes were ying supplies into the Berlin airport.

Example 3

Up to 10 planes can y into a particular airport each day. Each US plane

can carry 30 tons of supplies and requires two crew members. Each British

plane can carry 20 tons and requires one crew member. There are 14 crew

members in total (they can y on either US or British planes). Find the

maximum weight of supplies that can be transported each day.

x = number of US planes

Identify the variables.

y = number of British planes

Continued on next page

5 6 6 14 Models
 A LG E B R A

0 ≤ x ≤ 10; 0 ≤ y ≤ 10

x + y ≤ 10 The maximum number of planes that can y in is 10.

x US planes need 2x crew members,

y British planes need y crew members.

2x + y ≤ 14 The total number of crew members is 14.

16
y = 14 2x

Another way of showing

12

y = 10
(0, 10)
the solution is to shade

the regions that do not

8
y = 10 x

satisfy the inequalities.

x = 10

(4, 6)

4 feasible region The feasible region is left

unshaded.
(7, 0)
(0, 0)

x
0
2 4 6 8 10

Identify the vertices of the unshaded

Vertices: (0, 0), (0, 10), (7, 0), (4, 6)

polygon which is the feasible region.

Objective Function:

Total weight of supplies in x US planes and

Determine the objective function.

y British planes is W = 30x + 20y.

x y x + y 2x + y 30x + 20y

Test the coordinates of the

(0, 0) 0 0 0 0 0 vertices with the constraints and

objective function.

(0, 10) 0 10 10 10 200

(7, 0) 7 0 7 14 210

Find the one that optimizes the

(4, 6) 4 6 10 14 240

objective function.

The maximum weight of supplies that could be transported

each day is 240 tons.

16
y = 14 2x

As a check, you can graph

12
the objective function
y = 10

30x + 20y = 240 (here in black)

8 (0, 10)
y = 10 x

to check that it intersects the

x = 10
other lines at (4, 6).
(4, 6)

4 feasible region

(0, 0)
(7, 0)

x
0
2 4 6 8 10

14.3 Decisions, decisions 5 67

 Practice 4

ATL 1 Optimize the objective function P = 50x + 20y, given the four constraints:

Tip
x + 4y ≤ 21 4x + 6y ≤ 0

Graph the system

0 ≤ x ≤ 15 y ≥ 0

of inequalities, and

2 Optimize the objective function z = 0.4x + 3.2y given the four constraints:
test the vertices of

the feasible region

x ≥ 0, y ≥ 0 x + y ≤ 7

polygon in the

x + 2y ≥ 4 y ≤ x + 5
objective function.

3 Optimize the objective function R = 5y 2x, given the three constraints:

99 ≤ x < 201 79 < y ≤ 181 y + x ≤ 300

4 A shoe manufacturer produces mid-top and high-top athletics shoes. Cutting

machines cut the fabric for the shoes. Stitching machines stitch the fabric.

The cutting machines run 4 hours per day, and the stitching machines run

5 hours per day.

A mid-top shoe takes 1 minute to cut, and 2 minutes to stitch.

A high-top shoe takes 3 minutes to cut, and 2 minutes to stitch.

The prot is $13 on a mid-top shoe and $16 on a high-top shoe.

Determine how many shoes of each kind should be made in order to

maximize prots, and what the maximum possible prot is.

Problem solving

5 A school wants to buy small and large minibuses to transport students to sports

activities. It has $220 000 to buy the minibuses, and $1200 to insure them.

The table gives some information about dierent sizes of minibuses.

Size Maximum number of people Cost Insurance

Small 8 $11 000 $120

Large 16 $24 000 $80

Determine how many of each size minibus the school should buy to

maximize the number of students they can transport.

6 An educational software company produces two software packages: an

algebraic solver and a graphing program. They project a demand for at least

100 algebraic solvers and 80 graphing programs each day. They can produce

up to 200 algebraic solvers and 170 graphing programs per day. They need

to produce at least 200 software packages each day to satisfy existing orders.

Each algebraic solver makes a loss of $1.50. Each graphing program makes

a prot of $4.50.

Determine how many of each software package the company should

produce each day to maximize its prots.

5 6 8 14 Models
 A LG E B R A

7 World Polar Products makes skis for the Alpine Skiing World

Championship competitions.

To make one downhill ski takes an average of 2 hours to cut the material

needed, 1 hour to shape the ski, and 3 hours for the nishing. To make one

cross-country ski takes 2 hours to cut the material, 2 hours for shaping, and

1 hour for nishing. Each week the company has 140 sta and machine

hours for cutting, 120 hours for shaping and 150 hours for nishing. They

make a prot of $10 for each downhill ski and $8 for each cross-country ski.

Find the maximum prot they can make in one week.

8 Amelie received $120 000 from a trust fund on her 25th birthday. She wants

to invest it in dierent funds to maximize the interest she receives.

She can invest in three types of investment:

Type of investment Interest per annum

Municipal bond 2%

Bank Mutual fund 3.2%

Speculative money market fund 5%

To minimize her risk, she decides to invest only $20 000 in the speculative

money market fund. Her tax adviser says she has to invest at least three

times as much in the municipal bond as in the bank’s mutual fund.

Determine the optimum investment amounts for each type of investment.

Linear programming
D

●
What are the advantages and limitations of linear programming?

●
Can good decisions be calculated?

In Practice 4 you used linear programming to solve problems in dierent real-

life situations.

Activity

Research the use of linear programming in industry. Which types of

industry use it, and for what applications?

Reect and discuss 3

●
What type of problems can you solve using linear programming?

What kinds of functions are used?

●
All the examples and problems you have seen deal with only positive

numbers. Why do you think this is?

●
What kinds of real-world problems would not be suitable for linear

programming?

●
What are the advantages of using linear programming?

●
What are the limitations of mathematical modelling using linear

programming?

14.3 Decisions, decisions 5 6 9

 Summary

Denitions of inequality Linear programming

a > b if and only if a b > 0 Linear programming is a method of maximizing

or minimizing a linear function subject to linear

and

constraints within the problem.

a < b if and only if a b < 0

The objective function is the linear function

Theorem 1: Adding the same number to both representing cost, prot, or some other quantity to

sides of an inequality gives another valid be optimized (maximized or minimized) subject

inequality. to the constraints.

Using algebra: The constraints form a system of linear

inequalities which model a real-life problem.

i if a > b then a + c > b + c

The feasible region is the area of the graph that

ii if a < b then a + c < b + c

contains the solutions to the system of linear

Theorem 2: Multiplying both sides of an

inequalities.

inequality by the same positive real number

If there is an optimal solution to a linear

gives another valid inequality.

programming problem, it will occur at one or

Using algebra:
more vertices of the feasibility region polygon.

i if a > b then ac > bc

Using linear programming to solve real-life

problems:

ii if a < b then ac < bc

●
Identify all variables and parameters.

Theorem 3: If both sides of an inequality are

●
Identity all constraints. This is your system of
multiplied by a negative real number, the

inequalities.
direction of the inequality changes. This means

that if a, b ∈ , and c ∈ then: ●

Graph your system of inequalities, and

identify the polygon that makes up the

i if a > b then ac < bc and

feasibility region.

ii if a < b then ac > bc

●
Substitute the values of the vertices of the

polygon into the system of inequalities and the

objective function. Identify the ordered pair

that optimizes the function.

Mixed practice

1 Solve these inequalities algebraically: c 2y > x ; y < 2x ; x + y < 8

a 4 2x ≤ 2 b + 5 < 11 d y ≥ 2x 3 ; y ≥ −3 ; y ≤ −0.8x + 2.5

c 2(x + 1) > x 7 d 3(x + 1) < 2(1 x)

Problem solving

e 3x + 1 ≥ 2x + 5 f 10 ≤ 2x ≤ x + 9

4 A company hires out buses:

g x < 3x 1 < 2x + 7

Bus Hire cost

2 Solve the inequalities in 1a–d graphically.

40-seater £80

3 Graph these inequalities. Show clearly the

24-seater £50

region that satises the system of inequalities.

A school can spend up to £400 to hire buses to

a 0 < x < 4 ; y < 2

take 120 students on an outing.

b x > 0 ; x + y < 10 ; y > x

Determine how many of each bus the school

should hire.

57 0 14 Models
 A LG E B R A

5 A factory manager has to decide which per week. Determine if the factory can meet

machines to install to manufacture a product. its production target. If it can, determine how

many of each type of machine it should buy.

Machine A

6 Your company has a maximum of $2200 to

2

Output is 300 units per week. Needs 500 m of

spend on advertising. You plan to run at most

space, and 10 operators.

20 advertisements because each one needs to be

Machine B dierent and creative. An advertisement in the

daily newspaper costs $50, and in the weekend

2

Output is 200 units per week. Needs 600 m of

newspaper costs $200. Find the maximum

space, and 6 operators.

number of weekday and weekend newspaper

The factory has 5050 m of space available and

advertisements you can buy.

80 operators. Its production target is 2400 units

Objective: D. Applying mathematics in real-life contexts

ii. select appropriate mathematical strategies when solving authentic real-life

situations

Make sure you identify variables and constraints in each problem in order to solve the

real-world problems.

Review in context

Identities and relationships

1 Trees are planted in urban areas for beauty but 2 A nutritionist prescribes this diet to a patient:

also to remove air pollution. Trees with a large

●
400 units of carbohydrates
2

diameter, which cost £100 to plant, need 80 m

●
500 units of fat
of space to grow and remove 1.5 kg/year of

2
●
pollutants. Smaller trees, costing £30, need50 m 300 units of protein

of space to grow but remove only 0.02 kg/year

The nutritionist has combined these into

of air pollutants. If your school has a budget of

two types of protein shake. Type A costs $3

£1200 and 1500 m of space, determine how

per pack and type B costs $2.50 per pack.

many of each type of tree should be planted in

One pack oftype A contains 10 units of

order to maximize the amount of air pollutants

carbohydrates, 20 units of fat and 15 units of

removed.
protein. One pack of type B contains 25 units

of carbohydrates, 10 units of fat and 20 units of

protein. Find the minimum cost for a diet that

consists of a mixture of these two shakes and

meets the minimum requirements.

Reect and discuss

How have you explored the statement of inquiry? Give specic examples.

Statement of Inquiry:

Modelling with equivalent forms of representation can improve decisionmaking.

14.3 Decisions, decisions 5 71