6.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{e02c4a9a-d2ab-489f-b838-9b4d902c4457-7_2226_1628_299_221}
\captionsetup{labelformat=empty}
\caption{Figure 6}
\end{figure}
Edgar has recently bought a field in which he intends to plant apple trees and plum trees.
He can use linear programming to determine the number of each type of tree he should plant.
Let \(x\) be the number of apple trees he plants and \(y\) be the number of plum trees he plants.
Two of the constraints are
$$\begin{aligned}
& x \geqslant 40
& y \leqslant 50
\end{aligned}$$
These are shown on the graph in Figure 6, where the rejected region is shaded out.
- Use these two constraints to write down two statements that describe the number of apple trees and plum trees Edgar can plant.
Two further constraints are
$$\begin{aligned}
3 x + 4 y & \leqslant 360
x & \leqslant 2 y
\end{aligned}$$ - Add two lines and shading to Diagram 1 in your answer book to represent these inequalities. Hence determine the feasible region and label it R .
Edgar will make a profit of \(\pounds 60\) from each apple tree and \(\pounds 20\) from each plum tree. He wishes to maximise his profit, P.
- Write down the objective function.
- Use an objective line to determine the optimal point of the feasible region, R . You must make your method clear.
- Find Edgar's maximum profit.