1. P, Q and R are three buildings. A car began its journey at P, drove to Q, then to R and returned to P. The bearing of Q from
P is 058° and R is due east of Q. PQ = 114 km and QR = 70 km. ( Draw a clearly labelled diagram to represent the above information. Show on the diagram (a) the north/south direction (b) the bearing 058° (c) the distances 114 km and 70 km.
1 answer:
You might be interested in
Answer:
The dimensions of the can that will minimize the cost are a Radius of 3.17cm and a Height of 12.67cm.
Step-by-step explanation:
Volume of the Cylinder=400 cm³
Volume of a Cylinder=πr²h
Therefore: πr²h=400
Total Surface Area of a Cylinder=2πr²+2πrh
Cost of the materials for the Top and Bottom=0.06 cents per square centimeter
Cost of the materials for the sides=0.03 cents per square centimeter
Cost of the Cylinder=0.06(2πr²)+0.03(2πrh)
C=0.12πr²+0.06πrh
Recall:
Therefore:
The minimum cost occurs when the derivative of the Cost =0.
r=3.17 cm
Recall that:
h=12.67cm
The dimensions of the can that will minimize the cost are a Radius of 3.17cm and a Height of 12.67cm.
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
