Using the Graphical Method, we can draw out the feasible region of the presented model as such:

with the feasible region of the model being the darkest region that is the intersection of all the constraints, and $a$ being the $x$-axis and $b$ being the $y$-axis.
It has been pointed out that the original problem may have been a maximization problem, so let’s take it as both interpretations starting with the minimization problem:

Depicting the objective function as the black line, we can see the most-minimum point to exist in the feasible region to satisfy the minimized model is the point where $a=0$ and $b=0$.
The maximization problem is a little more tricky, be we can see that if we slide the objective function’s line all the way to the right, we’ll reach a point that’s the highest possible value for the model like so:

and that point will correlate to intersection of the constraints $2a+5b\le60$ and $a+b\le18$. After solving for that intersection, we should find $a=10$ and $b=8$ such that $z=28$, which is the maximum value for the model.