Looks good to me. Now, since there are two variables, , and , graph each constraint on an " ", " , graph. Each constraint, with "= " rather than " ", will be a straight line and the "feasible region", the region in which all constraints are satisfied is bounded by those lines. The maximum or minimum or a linear "target function" will lie on a vertex of that boundary. So find the vertices (which are always where two of the lines intersect) and evaluate the target function at each vertex.