ConceptConceptDocsDocuments

Pearson Edexcel IAL Mathematics D1.3.3 Determination of upper & lower

Practise finding TSP bounds from network data, using deleted-node RMST methods, shortest-distance tables and interval comparisons.

Syllabus
First assessment 2019
Course
Mathematics YMA01
Level
AS

Exam points

  • delete a node and combine an RMST with two incident arcs to form a lower bound
  • use shortest-distance tables or missing arc values to calculate a route bound
  • write the interval containing the optimum by comparing lower and upper bounds

D1.3.3 - Determination of upper and lower question 1

[Maximum number: 3]
Table 1

Table 1

Table 1 represents a network that shows the travel times, in minutes, between eight towns, A, B, C, D, E, F, G and H.

Determine the value of x. You must make your method and working clear.

All question bank results loaded