AQA D1 2006 January — Question 4

Exam BoardAQA
ModuleD1 (Decision Mathematics 1)
Year2006
SessionJanuary
TopicLinear Programming
4 The diagram shows the feasible region of a linear programming problem.
\includegraphics[max width=\textwidth, alt={}, center]{4a186c87-5f84-4ec3-8cc3-a0ed8721b040-04_1349_1395_408_294}
  1. On the feasible region, find:
    1. the maximum value of \(2 x + 3 y\);
    2. the maximum value of \(3 x + 2 y\);
    3. the minimum value of \(- 2 x + y\).
  2. Find the 5 inequalities that define the feasible region.
This paper (9 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9