FURMATHS: GRAPHS AND RELATIONS

Linear Programming
Teacher: Dora Verrocchi
Exam Equivalent Time: 92.25 minutes (based on VCE allocation of 2.25
min/mark for FUR1, and 1.5 min/mark for FUR2)

Questions
1. GRAPHS, FUR1 2009 VCAA 5-6 MC
Kathy is a tutor who offers tutorial sessions for English and History students.
Part 1
An English tutorial session takes 1.5 hours.
A History tutorial session take 30 minutes.
Kathy has no more than 15 hours available in a week for tutorial sessions.
Let represent the number of English tutorial sessions Kathy has each week.
Let represent the number of History tutorial sessions Kathy has each week.
An inequality representing the constraint on Kathy’s tutorial time each week (in hours) is
A.
B.
C.
D.
E.

Part 2
Kathy prefers to have no more than 18 tutorial sessions in total each week.
She prefers to have at least 4 English tutorial sessions.
She also prefers to have at least as many History tutorial sessions as English tutorial
sessions.
Let represent the number of English tutorial sessions Kathy has each week.
Let represent the number of History tutorial sessions Kathy has each week.
The shaded region that satisfies all of these constraints is
2. GRAPHS, FUR1 2006 VCAA 7 MC 3. GRAPHS, FUR1 2007 VCAA 9 MC
In a linear programming problem involving animal management on a farm The following five constraints apply to a linear programming problem.
• represents the number of cows on the farm
• represents the number of sheep on the farm.
In the diagram below, the shaded region (with boundaries included) represents the feasible
The feasible region (with boundaries included) for the problem is indicated by the shaded region for this linear programming problem.
region on the diagram below.

The aim is to maximise the objective function .

One of the constraints defining the feasible region indicates that
If the maximum value of occurs only at the point , then a possible value for is
A. there must be 20 cows and 60 sheep.
B. there must be 40 cows and 40 sheep. A.

C. the number of sheep cannot exceed 40. B.

D. the number of cows must be at least 60. C.

E. the total number of cows and sheep cannot exceed 80. D.

E.
4. GRAPHS, FUR1 2009 VCAA 7 MC 5. GRAPHS, FUR1 2014 VCAA 8 MC
A school’s squash and volleyball teams plan to enter a sports competition. The constraints of a linear programming problem are given by the following set of
inequalities.
A squash team requires at least 4 players.
A volleyball team requires at least 6 players.
No more than 25 students from any one school can enter the competition.
Let be the number of squash players sent by the school to the competition.
Let be the number of volleyball players sent by the school to the competition.
The constraints above define the feasible region shaded in the graph below.
The coordinates of the points that define the boundaries of the feasible region for this linear
programming problem are
A.
B.

C.
D.

E.

A fee is charged for all players entering the competition. Squash players are charged $5 and
volleyball players are charged $4.
Given the above constraints, the maximum cost for the school’s squash and volleyball teams
to enter the competition is
A.
B.
C.
D.
E.
6. GRAPHS, FUR1 2015 VCAA 9 MC
The shaded area in the graph below shows the feasible region for a linear programming
problem.

Part 1
One of the constraints that defines the feasible region is
A.
B.
The maximum value of the objective function for this problem occurs at point C.
A. D.
B. E.
C.
D. Part 2
E. By spending Saturday playing sport and computer games, Craig believes he can improve
his health.

7. GRAPHS, FUR1 2011 VCAA 7-9 MC Let be the health rating Craig achieves by spending a day playing sport and computer
games.
Craig plays sport and computer games every Saturday.
The value of is determined by using the rule .
Let be the number of hours that he spends playing sport.
For the feasible region shown in the graph above, the maximum value of occurs at
Let be the number of hours that he spends playing computer games.
A. point
Craig has placed some constraints on the amount of time that he spends playing sport and
computer games. B. point
These constraints define the feasible region shown shaded in the graph below. The C. point
equations of the lines that define the boundaries of the feasible regions are also shown.
D. point
E. point
 Part 3 In which one of the following graphs does the shaded area show the feasible region defined
by these conditions?
By spending Saturday playing sport and computer games, Craig believes he can improve
his mental alertness.
Let be the mental alertness rating Craig achieves by spending a day playing sport and
computer games.
For the feasible region shown in the graph above, the maximum value of occurs at any
point that lies on the line that joins points and is the feasible region.
The rule for could be
A.
B.
C.
D.
E.

8. GRAPHS, FUR1 2006 VCAA 9 MC

The four inequalities below were used to construct the feasible region for a linear
programming problem.

A point that lies within this feasible region is

A.

B.
C.
D.
E.

9. GRAPHS, FUR1 2014 VCAA 9 MC

Xavier and Yvette share a job.
Yvette must work at least twice as many hours as Xavier.
They must work at least 40 hours each week, in total.
Xavier must work at least 10 hours each week.
Yvette can only work for a maximum of 30 hours each week.
Let represent the number of hours that Xavier works each week.
Let represent the number of hours that Yvette works each week.
10. GRAPHS, FUR1 2018 VCAA 07 MC 11. GRAPHS, FUR1 2008 VCAA 9 MC
In the diagram below, the shaded region (with boundaries included) represents the feasible The shaded region in the graph below represents the feasible region for a linear
region for a linear programming problem. programming problem.

Which objective function, , has its maximum value at the point ?

A.
B.
C.
The objective function, , has minimum values at both point and point .
D.
Which one of the following could be the objective function?
E.
A.
B.
C.
D.
E.
12. GRAPHS, FUR1 2013 VCAA 8 MC 13. GRAPHS, FUR1 2016 VCAA 5 MC
The shaded region in the graph below represents the feasible region for a linear The feasible region for a linear programming problem is shaded in the diagram below.
programming problem.

The equation of the objective function for this problem is of the form
, where and
The dotted line in the diagram has the same slope as the objective function for this problem.
The maximum value of the objective function can be determined by calculating its value at
A. point A.
An objective function has its value maximised at both vertex and vertex
B. point B.
.
C. point C.
The values of and could be
D. point D.
A.
E. any point along line segment BC.
B.
C.
D.
E.
14. GRAPHS, FUR1 2017 VCAA 8 MC 15. GRAPHS, FUR2 2015 VCAA 5
The shaded area in the graph below shows the feasible region for a linear programming When Ben is in Japan, he will study at a Japanese school.
problem.
Some of his lessons will be in English and some of his lessons will be in Japanese.
y
Let be the number of lessons in English that he will attend each week.
20
19 Let be the number of lessons in Japanese that he will attend each week.
18 There are 35 lessons each week.
17
16 It is a condition of his exchange that Ben attends at least 24 lessons each week.
B
15 It is also a condition that Ben attends no more than two lessons in English for every lesson
14 in Japanese.
13 D
12 This information can be represented by Inequalities 1, 2 and 3.
11 Inequality 1
10
9 E Inequality 2
A
8
7 Inequality 3
6
5 There is another constraint given by
4 Inequality 4
3 C
2 a. Describe Inequality 4 in terms of the lessons that Ben must attend. (1 mark)

1 b. The graph below shows the lines that represent the boundaries of Inequalities 1 to 4.
x
O 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 On the graph below, shade the region that contains the points that satisfy these
inequalities. (1 mark)
The objective function is given by

Which one of the following statements is not true?

A. When and , the minimum value of is at point .
B. When and , the maximum value of is at point .
C. When and , the minimum value of is at point .
D. When and , the maximum value of is at point .
E. When and , the maximum value of is at point .

c. Determine the maximum number of lessons in English that Ben can attend. (1 mark)

16. GRAPHS, FUR2 2011 VCAA 1

 Michael is preparing to hike through a national park.
He decides to make some trail mix to eat on the hike.
The trail mix consists of almonds and raisins.
The table below shows some information about the amout of carbohydrate and protein
contained in each gram of almonds and raisins.

a. If Michael mixed 180 g of almonds and 250 g of raisins to make some trail mix, calculate
the weight, in grams, of carbohydrate in the trail mix. (1 mark)
Michael wants to make some trail mix that contains 72 g of protein. He already has 320 g of
almonds.
b. How many grams of raisins does he need to add? (2 marks)

The trail mix Michael takes on his hike must satisfy his dietary requirements. d. On the graph above
i. draw the straight line that relates to Inequality 5 (1 mark)
Let be the weight, in grams, of almonds Michael puts into the trail mix.
ii. shade the region that satisfies Inequalities 1 to 5. (1 mark)
Let be the weight, in grams, of raisins Michael puts into the trail mix.
e. What is the maximum weight, in grams, of trail mix that satisfies Michael's dietary
Inequalities 1 to 4 represents Michael's dietary requirements for the weight of carbohydrate requirements? (1 mark)
and protein in the trail mix.
Michael plans to carry at least 500 g of trail mix on his hike.
Inequality 1
He would also like this trail mix to cantain the greatest possible weight of almonds.
Inequality 2
The trail mix must satisfy all of Michael's dietary requirements.
Inequality 3 (carbohydrate) f. What is the weight of the almonds, in grams, in this trail mix? (2 marks)

Inequality 4 (protein)
17. GRAPHS, FUR2 2014 VCAA 1
Michael also requires a minimum of 16 g of fibre in the trail mix.
Fastgrow and Booster are two tomato fertilisers that contain the nutrients nitrogen and
Each gram of almonds contains 0.1 g of fibre. phosphorus.
Each gram of raisins contains 0.04 g of fibre. The amount of nitrogen and phosphorus in each kilogram of Fastgrow and Booster is shown
in the table below.
c. Write down an inequality, in terms of and , that represents this dietary requirement.
Inequality 5 (fibre) _________________________ (1 mark)

The graphs of and are shown below.

a. How many kilograms of phosphorus are in 2 kg of Booster? (1 mark)

b. If 100 kg of Booster and 400 kg of Fastgrow are mixed, how many kilograms of
nitrogen would be in the mixture? (1 mark)
Arthur is a farmer who grows tomatoes.
He mixes quantities of Booster and Fastgrow to make his own fertiliser.
Let be the number of kilograms of Booster in Arthur’s fertiliser.
Let be the number of kilograms of Fastgrow in Arthur’s fertiliser.
Inequalities 1 to 4 represent the nitrogen and phosphorus requirements of Arthur’s tomato
field.
Inequality 1
Inequality 2
Inequality 3 (nitrogen)
Inequality 4 (phosphorus)
Arthur’s tomato field also requires at least 180 kg of the nutrient potassium.
Each kilogram of Booster contains 0.06 kg of potassium.
Each kilogram of Fastgrow contains 0.04 kg of potassium.
c. Inequality 5 represents the potassium requirements of Arthur’s tomato field.
Write down Inequality 5 in terms of and . (1 mark)
The lines that represent the boundaries of Inequalities 3, 4 and 5 are shown in the
graph below.
d.
i. Using the graph above, write down the equation of line . (1 mark)
ii. On the graph above, shade the region that satisfies Inequalities 1 to 5. (1 mark)
(Answer on the graph above.)
Arthur would like to use the least amount of his own fertiliser to meet the nutrient
requirements of his tomato field and still satisfy Inequalities 1 to 5.
e.
i. What weight of his own fertiliser will Arthur need to make? (1 mark)
ii. On the graph above, show the point(s) where this solution occurs. (2 marks)
(Answer on the graph above.)
18. GRAPHS, FUR2 2018 VCAA 4
This year Robert is planning a camping trip for the members of his gold prospecting club.
The club has chosen two camp sites, Bushman’s Track and Lower Creek.
Let be the number of members staying at Bushman’s Track.
Let be the number of members staying at Lower Creek.
A maximum of 10 members can stay at Bushman’s Track.
A maximum of 15 members can stay at Lower Creek.
At least 20 members in total are attending the camping trip.
The club has decided that at least twice as many members must stay at Lower Creek than at
Bushman’s Track.
These constraints can be represented by the following four inequalities.
The graph below shows the four lines representing Inequalities 1 to 4.
 be the number of laptops repaired each day.
It takes 35 minutes to repair a phone and 50 minutes to repair a laptop.
The constraints on the company are as follows.
Constraint 1
Constraint 2
Constraint 3

Constraint 4

a. Explain the meaning of Constraint 3 in terms of the time available to repair phones and
laptops. (1 mark)
b. Constraint 4 describes the maximum number of phones that may be repaired relative to the
number of laptops repaired.
Use this constraint to complete the following sentence.
For every ten phones repaired, at most _______ laptops may be repaired. (1 mark)

The line is drawn on the graph below.

a. On the graph above, mark with a cross (×) the five integer points that satisfy Inequalities 1
to 4. (1 mark)
(answer on the graph above.)
The cost for one member to stay at Bushman’s Track is $130. The cost for one member to
stay at Lower Creek is $110.
For budgeting purposes, Robert needs to know the maximum cost of accommodation for
both camp sites given Inequalities 1 to 4.
b. Find the total maximum cost of accommodation. (1 mark)

c. When Robert finally made the booking, he was informed that, due to recent renovations,
there were two changes to the accommodation at Lower Creek:
A maximum of 22 members can now stay at Lower Creek.
The cost for one member to stay at Lower Creek is now $140.

Twenty members will be attending the camping trip.

Find the total minimum cost of accommodation for these 20 members. (1 mark)

c. Draw the line on the graph. (1 mark)

19. GRAPHS, FUR2 2012 VCAA 3
d. Within Constraints 1 to 4, what is the maximum number of laptops that can be repaired
A company repairs phones and laptops. each day? (1 mark)
Let be the number of phones repaired each day e. On a day in which exactly nine laptops are repaired, what is the maximum number of
phones that can be repaired? (1 mark)
 The profit from repairing one phone is $60 and the profit from repairing one laptop is $100. The profit, , that the company makes from the sale of the hockey sticks is given by
f.
i. Determine the number of phones and the number of laptops that should be repaired
c. Find the maximum profit that the company can make from the sale of the hockey sticks. (1
each day in order to maximise the total profit. (2 marks)
mark)
ii. What is the maximum total profit per day that the company can obtain from repairing
d. The company wants to change the selling price of the Flick and Jink hockey sticks in order
phones and laptops? (1 mark)
to increase its maximum profit to $42 000.
All of the constraints on the numbers of Flick and Jink hockey sticks that can be produced
20. GRAPHS, FUR2 2016 VCAA 3 each month remain the same.
The profit, , that is made from the sale of hockey sticks is now given by
A company produces two types of hockey stick, the ‘Flick’ and the ‘Jink’.
Let be the number of Flick hockey sticks that are produced each month.
The profit made on the Flick hockey sticks is dollars per hockey stick.
Let be the number of Jink hockey sticks that are produced each month.
The profit made on the Jink hockey sticks is dollars per hockey stick.
Each month, up to 500 hockey sticks in total can be produced.
The maximum profit of $42 000 is made by selling 400 Flick hockey sticks and 100 Jink
The inequalities below represent constraints on the number of each hockey stick that can be hockey sticks.
produced each month.
What are the values of and ? (2 marks)

Constraint 1 Constraint 2

Constraint 3 Constraint 4 VCE Mathematics examination questions reproduced by permission, VCAA. VCE is a registered trademark of the VCAA. The
VCAA does not endorse or make any warranties regarding this study resource. Current and past VCE exams and related
a. Interpret Constraint 4 in terms of the number of Flick hockey sticks and the number of Jink content can be accessed directly at www.vcaa.vic.edu.au.
hockey sticks produced each month. (1 mark)
There is another constraint, Constraint 5, on the number of each hockey stick that can be
produced each month.
Constraint 5 is bounded by Line , shown on the graph below.

The shaded region of the graph contains the points that satisfy constraints 1 to 5.
b. Write down the inequality that represents Constraint 5. (1 mark)
Worked Solutions 3. GRAPHS, FUR1 2007 VCAA 9 MC

1. GRAPHS, FUR1 2009 VCAA 5-6 MC

2. GRAPHS, FUR1 2006 VCAA 7 MC

4. GRAPHS, FUR1 2009 VCAA 7 MC
5. GRAPHS, FUR1 2014 VCAA 8 MC 6. GRAPHS, FUR1 2015 VCAA 9 MC

7. GRAPHS, FUR1 2011 VCAA 7-9 MC

8. GRAPHS, FUR1 2006 VCAA 9 MC

COMMENT: Students could

draw a quick sketch of the
feasible region to narrow down
the possible choices and
answer more efficiently.

9. GRAPHS, FUR1 2014 VCAA 9 MC

♦ Mean mark 45%.

10. GRAPHS, FUR1 2018 VCAA 07 MC 11. GRAPHS, FUR1 2008 VCAA 9 MC

♦ Mean mark 40%. ♦♦♦ Mean mark 17%.

MARKER'S COMMENT: Even
though (option E)
has a larger value at than
option A, its maximum value
occurs at the vertex (0, 60).
12. GRAPHS, FUR1 2013 VCAA 8 MC 14. GRAPHS, FUR1 2017 VCAA 8 MC

♦♦ Mean mark 35%.

15. GRAPHS, FUR2 2015 VCAA 5

a.

b.
13. GRAPHS, FUR1 2016 VCAA 5 MC

♦♦♦ Mean mark 29%.

MARKER'S COMMENT: The
majority of students had no
idea of the sliding rule
technique or applied it
inaccurately and answered E.

c.

16. GRAPHS, FUR2 2011 VCAA 1

a.
f.

b.

c.

d.i. & ii.

♦♦ Part f was "Poorly

answered" although exact data
unavailable.
MARKER'S COMMENT:
Ensure you incorporate the
new constraint!

17. GRAPHS, FUR2 2014 VCAA 1

e.
a.
b.

c.

d.i.

♦♦ Mean mark for parts (d)

and (e) combined was 32%.
MARKER'S COMMENT: A
majority of students didn't
identify Inequality 4 as relevant
to Line A.
d.ii.

e.i.

e.ii.
18. GRAPHS, FUR2 2018 VCAA 4

a.

b.

c.

b. ♦♦ Mean mark part (a) 45%,

part (b) 22%.
MARKER'S COMMENT: A
poor understanding of this
question type notable. Review
carefully.

c.

♦♦ Mean mark part (c) 22%.

d.

♦♦ Mean mark of parts (c) - (f)

combined was 32%.

e.

19. GRAPHS, FUR2 2012 VCAA 3

a.
 20. GRAPHS, FUR2 2016 VCAA 3
a.
f.i.
♦♦♦ Mean mark 25%.

b.

c.

f.ii.

d.

♦♦♦ Mean mark 7%.

MARKER'S COMMENT: Very
few students were able to
identify the need for the sliding
line concept and execute it
correctly in this question.

Copyright © 2016-2019 M2 Mathematics Pty Ltd (SmarterMaths.com.au)