The vertices of the feasible region are as follows,
(-14, -11), (9, -11) and (6, 4)
What is a Feasible Region?
The area of the graph where all constraints are satisfied is the feasible solution zone or feasible region. It might also be thought of as the point where each constraint line's valid regions intersect. Any decision in this region would lead to a workable resolution for our objective function.
Vertices of the Feasible Region
As it can be seen in the graph, the vertices of the feasible region surrounded by the given constraints are:
(-14, -11), (9, -11) and (6, 4)
Learn more about feasible region here:
brainly.com/question/7243840
#SPJ1
Learn how to find the distance between two points by using the distance formula, which is an application of the Pythagorean theorem. We can rewrite the Pythagorean theorem as d=√((x_2-x_1)²+(y_2-y_1)²) to find the distance between any two points.
I found it quicker than i thought i would! the positive x-intercept is (4,0). negative x intercept is (-

,0)
Answer: y=-2x+6
Step-by-step explanation:

So
. We can substitute (0, 6) to get:
6 = 2(0)+b
b=6.
Meaning y=-2x+6.