Question 7 - A-Level Maths

Exam Board	AQA
Module	Further AS Paper 2 Discrete (Further AS Paper 2 Discrete)
Year	2018
Session	June
Topic	Linear Programming

1. Complete Figure 4 to identify the feasible region for the problem. \begin{figure}[h]
  \captionsetup{labelformat=empty} \caption{Figure 4} \includegraphics[alt={},max width=\textwidth]{5a826f8b-4751-4589-ad0a-109fc5c821f2-12_922_940_849_552}
  \end{figure} 7
(ii) Determine the maximum value of \(5 x + 4 y\) subject to the constraints.
7
The simple-connected graph \(G\) has seven vertices. The vertices of \(G\) have degree \(1,2,3 , v , w , x\) and \(y\)
7
1. Explain why \(x \geq 1\) and \(y \geq 1\)
  7
(ii) Explain why \(x \leq 6\) and \(y \leq 6\)
7
(iii) Explain why \(x + y \leq 11\)
7
(iv) State an additional constraint that applies to the values of \(x\) and \(y\) in this context.
7
The graph \(G\) also has eight edges. The inequalities used in part (a)(i) apply to the graph \(G\). 7
1. Given that \(v + w = 4\), find all the feasible values of \(x\) and \(y\).
  7
(ii) It is also given that the graph \(G\) is semi-Eulerian. On Figure 5, draw \(G\). Figure 5