The constraints of a problem are listed below. What are the vertices of the feasible region?

Answer:
The vertices are (0,0), (3,0), (1.5,2) and (0,2.5)
Step-by-step explanation:
We are given the constraints of the problem as,
[tex]4x+3y\leq 12[/tex]
[tex]2x+6y\leq 15[/tex]
[tex]x\geq 0[/tex]
[tex]y\geq 0[/tex]
Using 'Zero Test', which states 'If after substituting (0,0) in the inequalities the result is true, the solution region is towards the origin and if the result is false, the solution region is away from the origin'
So, after plotting the graph, we see that,
The end-points of the feasible region are given by,
(0,0), (3,0), (1.5,2) and (0,2.5)
Answer:
A (0, 0), (0, 2.5), (1.5, 2), (3, 0)
Step-by-step explanation:
edg 2022