Easy -1.8 This is a straightforward recall question requiring only identification of the optimal vertex from a given graph with the feasible region and objective line already drawn. It tests basic understanding that for maximization, the optimal vertex is where the objective line last touches the feasible region, requiring no calculation, construction, or problem-solving—just visual interpretation of a completed diagram.
3 A student is solving a maximising linear programming problem.
The graph below shows the constraints, feasible region and objective line for the student's linear programming problem.
\includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-03_1248_1184_502_427}
Which vertex is the optimal vertex?
Circle your answer.
\(A\)
B
C
D
3 A student is solving a maximising linear programming problem.
The graph below shows the constraints, feasible region and objective line for the student's linear programming problem.\\
\includegraphics[max width=\textwidth, alt={}, center]{5ff6e3bb-6392-49cf-b64d-23bc595cd92e-03_1248_1184_502_427}
Which vertex is the optimal vertex?
Circle your answer.\\
$A$\\
B\\
C\\
D
\hfill \mbox{\textit{AQA Further Paper 3 Discrete 2023 Q3 [1]}}