Question

Identify the vertices of the feasible region for the given linear programming constraints

Answer 1

- Plotting the three inequalities, we can find the feasible regions for the constrains as follows:

- The vertices have been highlighted above.

- Thus, the feasible region is bounded by:

`\begin{gathered} (0,2) \\ (2,5) \\ (3,0) \end{gathered}`