Professional Documents
Culture Documents
Graphs and Relations Worksheet 5
Graphs and Relations Worksheet 5
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.
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.
B.
C.
D.
E.
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
c. Determine the maximum number of lessons in English that Ben can attend. (1 mark)
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)
d.
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)
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.
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
b.
13. GRAPHS, FUR1 2016 VCAA 5 MC
c.
b.
c.
c.
d.i.
e.i.
e.ii.
18. GRAPHS, FUR2 2018 VCAA 4
a.
b.
c.
c.
d.
e.
b.
c.
f.ii.
d.