1) find the vertices of the feasible region. 2) what is the maximum and the minimum value of the function q = 70x + 82y on the feasible region?

If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore, if the objective function P is optimized at two adjacent vertices of S, then it is optimized at every point on the line segment joining these two vertices, in which case there are infinitely many solutions to the problem. Suppose we are given a linear programming problem with a feasible set S and an objective function P = ax+by. Then, If S is bounded then P has both a maximum and minimum value on S If S is unbounded and both a and b are nonnegative, then P has a minimum value on S provided that the constraints defining S include the inequalities x≥ 0 and y≥ 0. If S is the empty set, then the linear programming problem has no solution; that is, P has neither a maximum nor a minimum value.

Idrk but i think u should figure out the n dia n then the units it will make it way more easier