Edexcel D1 2022 January — Question 0

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2022
SessionJanuary
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicLinear Programming
TypeReverse engineering constraints from graph
DifficultyEasy -1.8 This appears to be an incomplete constraint from a linear programming problem, likely just stating a simple bound on a variable. If this is the entire question, it requires only reading a basic inequality with no problem-solving. Even complete D1 linear programming questions (graphing feasible regions, finding optimal points) are typically routine algorithmic exercises scoring around -1.0 to -0.5, so an isolated constraint would be even more trivial.

0 \leqslant x & \leqslant 27

0 \leqslant x & \leqslant 27 \\

\hfill \mbox{\textit{Edexcel D1 2022 Q0}}