Edexcel IAL Mathematics D1.5 linear programming
Practise linear programming by formulating constraints, graphing feasible regions and choosing optimal continuous or integer solutions.
- Syllabus
- First assessment 2019
- Course
- Mathematics YMA01
- Level
- AS
Practise linear programming by formulating constraints, graphing feasible regions and choosing optimal continuous or integer solutions.
The head of a Mathematics department needs to order three types of paper. The three types of paper are plain, lined and graph.
All three types of paper are sold in reams. (A ream is 500 sheets of paper.)
Based on the last academic year the head of department formed the following constraints.
- At least half the paper must be lined
- No more than 15% of the paper must be graph paper
- The ratio of plain paper to graph paper must be 5: 2
The cost of each ream of plain, lined and graph paper is £ 5, £ 12 and £ 15 respectively. The head of department has at most £ 834 to spend on paper.
The head of department wants to maximise the total number of reams of paper ordered.
Let x, y and z represent the number of reams of plain paper, lined paper and graph paper ordered respectively.
Formulate this information as a linear programming problem in x and y only, stating the objective and listing the constraints as simplified inequalities with integer coefficients.
The head of department decides to order exactly 42 reams of lined paper and still wishes to maximise the total number of reams of paper ordered.
21(x+y+z)≤y(⇒x−y+z≤0)
M1
203(x+y+z)≥z(⇒3x+3y−17z≥0)
M1
2x=5z
B1
5x+12y+15z≤834
B1
Eliminating z from the objective x+y+z and at least one correct constraint, or stating the objective and eliminating z from at least two correct constraints.
M1
Maximise P=1.4x+y, subject to
11x+12y7x−5y19x−15yx≤834≤0≤0≥0,y≥0
A1 A1
(7)
Determine
the total number of reams of paper to be ordered,
Substitute y=42 into the LP:
x≤30,x≤30,x≤19630
so x=30.
M1
Total number of reams ordered:
1.4(30)+42=84
A1
the number of reams of graph paper to be ordered.
12 reams of graph paper ordered.
A1
(3)

Figure 5
Figure 5 shows a weighted graph that contains 12 arcs and 8 vertices.
It is given that
- no two arcs have the same weight
- x and y are positive integers
- arc CD is not in the minimum spanning tree for the graph
Represent these four constraints on Diagram 1 in the answer book.

B 1
Using Diagram 1 only, write down the possible pairs of values that x and y can take in the form (x, y).
The minimum spanning tree for the weighted graph in Figure 5 has total weight 73 Six of the seven arcs in the minimum spanning tree are AB, AD, BC, CE, EF and GH.
dentroom.
B1ft.Wordyrees
B1
B1ft
B1
)
Total weight of the MST is therefore 14 x+5 y-4
A1
14 x+5 y-4=73 and testing integer value points inside FR
M1dep
x=3 and y=7
A1
15 marks
Notes for Question 7
a1M1: Explaining that if CD is not in the tree than AD must be e.g. 'the MST must contain D so if CD is not in the tree then AD is'. Must explicitly mention arc AD for this mark, so as a minimum accept, 'AD must be in the MST'
a1A1: Correct reasoning and derivation of the given result ( 2y+x>3y−7⇒y<x+7 ) - as the answer is given we must see at least 2 y+x>3 y-7 or 3 y-7<2 y+x before the required answer
SC (Special Case) in (a): 2y+x>3y−7⇒y<x+7 without any explanation given (or if explanation is incorrect) can score M1A0
b1B1: CAO - must see at least 4 x+1<2 y+1 before the given answer of y>2 x and not just arc AB<arc AC or 4 x<2 y
b2B1: CAO (x>1) - but allow equivalents, e.g., x-1>0,1<x, 4 x>4, etc. but must be two terms only b3B1: CAO (3 y>4 x+8) - but allow exact equivalents e.g. y>34x+38,4x−3y<−8,4x+8−3y<0, or equivalent but must be three terms only
In (c), the lines can be drawn as either dashed or non-dashed lines (or a combination of the two). The lines must be long enough to define the correct feasible region and pass through one small square of the points stated below:
y=2 x must pass within one small square of (0,0) and (7,14)
y=x+7 must pass within one small square of (0,7) and (7,14)
x=1 must pass within one small square of (1,0) and (1,10)
3 y=4 x+8 must pass within one small square of (1,4) and (7,12)
c1B1: Any one line correctly drawn (ignore any shading)
c2B1: Any two lines correctly drawn (ignore any shading)
c3B1: Any three lines correctly drawn (ignore any shading)
c4B1: All four lines correctly drawn and shading which implies the correct region (but region need not be labelled)

d1B1ft: At least 4 pairs of integer coordinates correctly stated for points inside their region. Thesy mark is dependent on scoring at least the first two marks in (c) (so must have drawn at least two lines corregtly) and the candidate must have drawn exactly four lines. The region must not be infinite but need not ncessaujly be bounded by all four lines. If the candidate's region does not contain 4 integer coordinates then B0. Notechat integer points on the lines that define the boundary of the region are not counted as being inside the regiorisss (regardless of if the candidate has strict inequalities or not)
d2B1: All 9 coordinates correct (and no others) - dependent on all four lines correctly drawn in (c)