Standard +0.3 This is a standard linear programming formulation question requiring systematic translation of constraints into inequalities. While it involves 6 constraints and careful arithmetic (especially the percentage constraint), it follows a routine template with no novel problem-solving required. The multi-step nature and potential for algebraic errors place it slightly above average, but it remains a textbook exercise in D1.
9 A factory can make three different kinds of balloon pack: gold, silver and bronze. Each pack contains three different types of balloon: \(A , B\) and \(C\).
Each gold pack has 2 type \(A\) balloons, 3 type \(B\) balloons and 6 type \(C\) balloons.
Each silver pack has 3 type \(A\) balloons, 4 type \(B\) balloons and 2 type \(C\) balloons.
Each bronze pack has 5 type \(A\) balloons, 3 type \(B\) balloons and 2 type \(C\) balloons.
Every hour, the maximum number of each type of balloon available is 400 type \(A\), 400 type \(B\) and 400 type \(C\).
Every hour, the factory must pack at least 1000 balloons.
Every hour, the factory must pack more type \(A\) balloons than type \(B\) balloons.
Every hour, the factory must ensure that no more than \(40 \%\) of the total balloons packed are type \(C\) balloons.
Every hour, the factory makes \(x\) gold, \(y\) silver and \(z\) bronze packs.
Formulate the above situation as 6 inequalities, in addition to \(x \geqslant 0 , y \geqslant 0 , z \geqslant 0\), simplifying your answers.
(8 marks)
9 A factory can make three different kinds of balloon pack: gold, silver and bronze. Each pack contains three different types of balloon: $A , B$ and $C$.
Each gold pack has 2 type $A$ balloons, 3 type $B$ balloons and 6 type $C$ balloons.\\
Each silver pack has 3 type $A$ balloons, 4 type $B$ balloons and 2 type $C$ balloons.\\
Each bronze pack has 5 type $A$ balloons, 3 type $B$ balloons and 2 type $C$ balloons.\\
Every hour, the maximum number of each type of balloon available is 400 type $A$, 400 type $B$ and 400 type $C$.
Every hour, the factory must pack at least 1000 balloons.\\
Every hour, the factory must pack more type $A$ balloons than type $B$ balloons.\\
Every hour, the factory must ensure that no more than $40 \%$ of the total balloons packed are type $C$ balloons.
Every hour, the factory makes $x$ gold, $y$ silver and $z$ bronze packs.\\
Formulate the above situation as 6 inequalities, in addition to $x \geqslant 0 , y \geqslant 0 , z \geqslant 0$, simplifying your answers.\\
(8 marks)
\hfill \mbox{\textit{AQA D1 2013 Q9 [8]}}