Graph h (x) = 3 cos (2x) - 1 Use 3.14 for T. Use the sine tool to graph the function. The first point must be on the midline and
the second point must be a maximum or minimum value on the graph closest to the first point.
1 answer:
Answer:
See attachment
Step-by-step explanation:
We want to graph .
We can graph this function easily by applying transformations to the parent function.
The base function is
The transformed function has an amplitude of 3 but is shifted 1 unit down, so the minimum value is -4 and the maximum is 2.
The function is shrunk horizontally by a factor of 1/2.
The graph of the transformed function is shown in the attachment
You might be interested in
one simple way to tell if both equations do ever meet or have a solution is by checking their slope, notice in this case the slopes are the same for both, meaning the lines are parallel lines, however, notice both equations are really the same, namely the 2nd equation is really the 1st one in disguise.
since both equations are equal, their graph will be of one line pancaked on top of the other, and the solutions is where they meet, hell, they meet everywhere since one is on top of the other, so infinitely many solutions.
Step-by-step explanation:
We have to find the point in the feasible region which maximizes the objective function. To find that point first we need to graph the given inequalities to find the feasible region.
Steps to graph 3x + y ≤ 12:
First we graph 3x + y = 12 then shade the graph for ≤.
plug any value of x say x=0 and x=2 into 3x + y = 12 to find points.
plug x=0
3x + y = 12
3(0) + y = 12
0 + y = 12
y = 12
Hence first point is (0,12)
Similarly plugging x=2 will give y=6
Hence second point is (2,6)
Now graph both points and joint them by a straight line.
test for shading.
plug any test point which is not on the graph of line like (0,0) into original inequality 3x + y ≤ 12:
3(0) + (0) ≤ 12
0 + 0 ≤ 12
0 ≤ 12
Which is true so shading will be in the direction of test point (0,0)
We can repeat same procedure to graph other inequalities.
From graph we see that ABCD is feasible region whose corner points will result into maximum or minimu for objective function.
Since objective function is not given in the question so i will explain the process.
To find the maximum value of objective function we plug each corner point of feasible region into objective function. Whichever point gives maximum value will be the answer
