We have successfully calculated that the maximum value for Z is 73.75, when x is 14.5 and y is 5.25.
This method of testing every vertex is only feasible for a small number of variables and constraints.
As the numbers of constraints and variables increase, it becomes far more difficult to graph these problems and work out all the vertices.
For example, if there were a third variable:
$Z = Ax + By + Cz$
We would have to graph in three dimensions (x, y and z).
In the next few notebooks, we’ll take a look at how we can use python and the PuLP package to solve this linear programming problem, as well as some more complex problems