ConceptConceptDocsDocuments

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

Exam points

  • Translate resource, ratio and total conditions into simplified linear inequalities.
  • Graph constraints, label the feasible region and test vertices with the objective function.
  • Adjust the optimum when variables must be integers and check feasibility in context.

D1.5 - Linear programming question 1

[Maximum number: 12]

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.

Question (a)

(a)

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.

[ 7 ]

Question (b)

(b)

Determine

[ 5 ]

Question (i)

(i)

the total number of reams of paper to be ordered,

[ 2 ]

Question (ii)

(ii)

the number of reams of graph paper to be ordered.

[ 3 ]

D1.5 - Linear programming question 2

[Maximum number: 6]
Figure 5

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

Question (a)

(a)

Represent these four constraints on Diagram 1 in the answer book.

[ 4 ]

Question (b)

(b)

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.

[ 2 ]
All question bank results loaded