CourseCourseConceptConceptDocsDocuments

Edexcel A-Level Mathematics AS D1.5.3 Consideration of Problems Where Solutions Must Have Integer Questions

Practise integer linear-programming decisions by checking whole-number feasible points against constraints and the problem context.

Syllabus
First assessment 2019
Course
Mathematics YMA01
Level
AS

Exam points

  • Choose whole-number candidates from the feasible region when variables count items or orders.
  • Check integer points against every constraint before stating the final quantity or total.

Edexcel A-Level Mathematics AS D1.5.3 Consideration of Problems Where Solutions Must Have Integer Questions question 1

[Maximum number: 2]
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

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.

All question bank results loaded