Identify the vertices of the feasible region for the given linear programming constraints.
1 answer:
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:
#SPJ1
You might be interested in
Option A: It is vertically stretched
Option B: it is shifted down
Solution:
The exponential function undergoes two transformations to
.
<u>To determine how the graph changes:</u>
Consider the given exponential function .
Let y = f(x)
Vertically compressed or stretched:
A vertically compression (stretched) of a graph is compressing the graph toward x-axis.
• if k > 1 , then the graph y = k• f(x) , the graph will be vertically stretched by multiplying each y coordinate by k.
• if 0 < k < 1 if 0 < k < 1 , the graph is f(x) vertically shrunk (or compressed) by multiplying each of its y-coordinates by k.
• if k should be negative, the vertical stretch or shrink is followed by a reflection across the x-axis.
Here, k = 5
So the graph will be vertically stretched.
Also, Adding 3 to the graph will move the graph 3 units down so, the graph is shifted down.
So, The graph is shifted down.
Hence option A and option B is the correct answer.