15.2k views
2 votes
Identify the vertices of the feasible region for the given linear programming constraints

Identify the vertices of the feasible region for the given linear programming constraints-example-1
User Lululu
by
3.6k points

1 Answer

4 votes

Solution

- 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}

Identify the vertices of the feasible region for the given linear programming constraints-example-1
User Sebcoe
by
3.5k points