There are no constraints on x and y, so let's assume (at least) that both are positive, then the minimum value is z=0 when both x and y are zero. The maximum value is unbounded due to lack of constraints. Normally, in a case of linear programming (which this question seems to be) constraints are applied to x and y. Check your question for further information regarding constraints.