| Exam Board | Edexcel |
|---|---|
| Module | D1 (Decision Mathematics 1) |
| Year | 2022 |
| Session | January |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Linear Programming |
| Type | Reverse engineering constraints from graph |
| Difficulty | Easy -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 \\
\hfill \mbox{\textit{Edexcel D1 2022 Q0}}