posted by Anonymous on .
Given the system of inequalities below, find the vertices of the feasible region. Report your vertices starting with the one which has the smallest x-value. If more than one vertex has the same, smallest x-value, start with the one that has the smallest y-value. Proceed clockwise from the first vertex.
x>0 y> 0
if someone could explain it to me that would be wonderful!
where did you get 10?
x and y equals 10
x>0 y> 0
Graphically, draw the four inequalities as through they are lines,
They should intersect at six distinct points.
Create the figure that represents the region of feasibility.
The goal is to find the boundaries of the region of feasibility bounded by four intersection points, and the correspoinding segments of straight line representing the inequalities.
This can be achieved (as described in the question) by starting at the origin (intersection of x>0 and y>0) and proceeding along the x-axis to the next intersection point. If this point satisfies all constraints, or at the border of it, proceed along the straight line. If not, go back to the previous point and continue with the intersecting line.