AS October 2020 Q4

EdexcelAS paperCurrent spec9 marksLinear Programming

4.

Figure 3: graph for x from 0 to 12 and y from -2 to 12 showing three constraint lines, through (0, 12) and (6, 0), through (0, 12) and (10, 0), and a steep line through about (6.3, 0); the unshaded feasible region R with optimal vertex V, and an objective line from (0, 5) to (3, 0)
Figure 3

Figure 3 shows the constraints of a linear programming problem in \(x\) and \(y\), where \(R\) is the feasible region. Figure 3 also shows an objective line for the problem and the optimal vertex, which is labelled as \(V\).

The value of the objective at \(V\) is 556

Express the linear programming problem in algebraic form. List the constraints as simplified inequalities with integer coefficients and determine the objective. (9)