4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{c8134d3b-71cb-4b92-ac54-81a4ff8f3011-06_1504_1733_210_173}
\captionsetup{labelformat=empty}
\caption{Figure 3}
\end{figure}
Figure 3 shows the constraints of a maximisation linear programming problem in \(x\) and \(y\), where \(x \geqslant 0\) and \(y \geqslant 0\). The unshaded area, including its boundaries, forms the feasible region, \(R\). An objective line has been drawn and labelled on the graph.
- List the constraints as simplified inequalities with integer coefficients.
The optimal value of the objective function is 216
- Calculate the exact coordinates of the optimal vertex.
- Hence derive the objective function.
Given that \(x\) represents the number of small flower pots and \(y\) represents the number of large flower pots supplied to a customer,
- deduce the optimal solution to the problem.
TOTAL FOR DECISION MATHEMATICS 1 IS 40 MARKS END