The constraints of a problem are listed below. What are the vertices of the feasible region?
2 answers:
Answer:
The vertices of the feasible region are:
(0,1), (0,7) and (4,3).
Step-by-step explanation:
We can observe the graph of the following Linear programming problem (LPP) to see which are the vertices of the feasible region.
We are given constraints as:
We observe that the common feasible region of these constraints is a triangle hence it will have three vertices.
The vertices of the triangle formed by the feasible region are:
(0,1), (0,7) and (4,3).
You might be interested in
Answer : option B
Parent Graph f(x) = is attached below
We analyze each option
A) f(x − 2) --> x - 2 shifts the graph 2 units to the right
B) f(x + 2) --> x + 2 shifts the graph 2 units to the left
C) f(x) − 2 --> f(x) - 2 shifts the graph 2 units down
D) f(x) + 2 --> f(x) + 2 shifts the graph 2 units up
In the graph of f(x)= , the x intercept at x=1
From the graph attached in the question, the x intercept at x=-1
Its means the parent graph is shifted 2 units to the left.
Option B: f(x + 2) --> x + 2 shifts the graph 2 units to the left
Answer: (1,-2) , (4,1)
Step-by-step explanation:
Given
The two curves are and
From the figure, it observed that the two curves intersect at (1,-2) and (4,1).
So, the ordered pair from least to greatest is (1,-2) and (4,1)
