The feasible region of a linear programming problem has vertices (-1,-2), (0,7), (2,5), (5,3), (8,-1) find the minimum and maximum values of the objective function C(x, y)=15x+9y

5+2x=a

asdasdsaadsaddsasds

probably the last option

step-by-step explanation:

step-by-step explanation:

points a and b are equidistant from the desired line, so the line you find by using them will go through point r.

using points other than a and b will give the desired line only if they are equidistant from r. if they are randomly located, the perpendicular line you create will not necessarily go through point r, hence will not be a solution to the problem.

the one below it is a function