The constraints of a linear programming problem along with their graphs is shown below:
x + 2y ≥ 3
x ≥ 10
y ≥ 0
Which of the following objective functions has an optimal solution with respect to the above set of constraints?
A. Minimise Z = x + y
B. Minimise Z = 0.5x + y
C. Maximise Z = x + y
D. Maximise Z = 2x + y