1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
snow_lady [41]
3 years ago
14

At noon, ship A is 130 km west of ship B. Ship A is sailing east at 30 km/h and ship B is sailing north at 20 km/h. How fast is

the distance between the ships changing at 4:00 PM?

Mathematics
2 answers:
Sergeeva-Olga [200]3 years ago
8 0

Answer:

36.1 km/h

Step-by-step explanation:

rate at which the distance is changing is given by relative velocity(vR)

Look at the diagram. THe diagram shows relative motion. From relative motion diagram, velocity vector diagram is drawn.

From velocity vector diagram, it can be seen that relative velocity or vR can be calculated using pythagoras theorem.

vR²= vA² + vB²

vR²= 30²+ 20²

vR= 36.1 km/h

lesya692 [45]3 years ago
7 0

Answer:

At 4:00pm, the distance between ship A and B is increasing at the rate of 16.12 km/hr

Step-by-step explanation:

The illustration forms a right angle triangle.  At noon the distance between ship A and Ship B is 130 km . But ship A is west of ship B . Ship A is sailing east towards the starting point of ship B which means the distance is shrinking  at 30 km/hr and ship B is sailing north at 20 km/hr .This means ship B distance is extending.

The distance covered by ship A is  

distance = speed × time

noon to 4 pm  =  4 hrs

distance = 30 × 4

distance = 120 km

The distance covered by ship B is  

distance = speed × time

distance = 20 × 4

distance = 80 km

The distance from Ship A present position to ship B after moving east is 130 km - 120 km = 10 km.

Using Pythagorean theorem

c = ?

a = 10 km

b = 80 km

c² = a² + b²

c² = 10² + 80²

c² = 100 + 6400

c² = 6500

c = √6500

The question ask us how fast is the distance between the ships changing at 4:00 pm. This means calculating the rate .

c² = a² + b²

differentiate with respect to time

2c(dc/dt) = 2a(da/dt) + 2b(db/dt)

divide through by 2

c(dc/dt) = a(da/dt) + b(db/dt)

since we are looking for the rate of c we make dc/dt subject of the formula

dc/dt = (a(da/dt) + b(db/dt)) / c

Note Ship A travelling to the east is shrinking. so the speed which is da/dt = - 30 km/hr

c = √6500

a = 10 km

b = 80 km

dc/dt =  10(-30) + 80(20) / √6500

dc/dt = (-300 + 1600)/√6500

dc/dt = 1300 /√6500

dc/dt = 1300/80.622577483

dc/dt = 16.1245154966 km / hr

At 4:00pm, the distance between ship A and B is increasing at the rate of 16.12 km/hr

You might be interested in
What is the lateral surface area on a square pyramid with base edges of 10 and the height of 12
8_murik_8 [283]

Answer:

joe mama

Step-by-step explanation:

7 0
3 years ago
Solve t/12=4 what is the solution for t?
GaryK [48]

Answer:

thx for the points the answer is 3

Step-by-step explanation:

4 0
3 years ago
Read 2 more answers
Round 5.9496 to the nearest thousandth
Evgesh-ka [11]

Answer:

5.95

Step-by-step explanation:

that is because 96 is rounded too 100

so its 5.9500 = 5.95

4 0
3 years ago
Read 2 more answers
Provide an example of optimization problem
Mashutka [201]

Answer:

a. Convex solutions ,GO Methods

b. market efficiency

Explanation :

Step-by-step explanation:

A globally optimal solution is one where there are no other feasible solutions with better objective function values. A locally optimal solution is one where there are no other feasible solutions "in the vicinity" with better objective function values. You can picture this as a point at the top of a "peak" or at the bottom of a "valley" which may be formed by the objective function and/or the constraints -- but there may be a higher peak or a deeper valley far away from the current point.

In convex optimization problems, a locally optimal solution is also globally optimal. These include LP problems; QP problems where the objective is positive definite (if minimizing; negative definite if maximizing); and NLP problems where the objective is a convex function (if minimizing; concave if maximizing) and the constraints form a convex set. But many nonlinear problems are non-convex and are likely to have multiple locally optimal solutions, as in the chart below. (Click the chart to see a full-size image.) These problems are intrinsically very difficult to solve; and the time required to solve these problems to increases rapidly with the number of variables and constraints.

GO Methods

Multistart methods are a popular way to seek globally optimal solutions with the aid of a "classical" smooth nonlinear solver (that by itself finds only locally optimal solutions). The basic idea here is to automatically start the nonlinear Solver from randomly selected starting points, reaching different locally optimal solutions, then select the best of these as the proposed globally optimal solution. Multistart methods have a limited guarantee that (given certain assumptions about the problem) they will "converge in probability" to a globally optimal solution. This means that as the number of runs of the nonlinear Solver increases, the probability that the globally optimal solution has been found also increases towards 100%.

Where Multistart methods rely on random sampling of starting points, Continuous Branch and Bound methods are designed to systematically subdivide the feasible region into successively smaller subregions, and find locally optimal solutions in each subregion. The best of the locally optimally solutions is proposed as the globally optimal solution. Continuous Branch and Bound methods have a theoretical guarantee of convergence to the globally optimal solution, but this guarantee usually cannot be realized in a reasonable amount of computing time, for problems of more than a small number of variables. Hence many Continuous Branch and Bound methods also use some kind of random or statistical sampling to improve performance.

Genetic Algorithms, Tabu Search and Scatter Search are designed to find "good" solutions to nonsmooth optimization problems, but they can also be applied to smooth nonlinear problems to seek a globally optimal solution. They are often effective at finding better solutions than a "classic" smooth nonlinear solver alone, but they usually take much more computing time, and they offer no guarantees of convergence, or tests for having reached the globally optimal solution.

5 0
3 years ago
This really hard help please
bonufazy [111]

Answer:

is it 4.8, I don't really know

8 0
3 years ago
Other questions:
  • 9.80x10^-3 + 1.60x10^-4 scientific notation
    9·2 answers
  • Any help for this question , please !
    10·1 answer
  • Jorge needs to ship a thin metal rod to a metalworking shop. The only boxes available for shipping are 7-inch cubes. To the near
    6·2 answers
  • Please answer this multiple choice question only if you know the answer!! 25 points and brainliest!
    6·1 answer
  • In 2010, the average duration of long-distance telephone calls originating in one town was 9.4 minutes. A long-distance telephon
    6·1 answer
  • How might you use a perpendicular bisector or an angle bisector in your everyday life?
    12·1 answer
  • PLEASE HELP MY QUESTION IS IN PNG
    13·2 answers
  • To celebrate the first day of winter, Lin is putting magnets on some of the lockers (pre-COV ID of course). There are 100 locker
    7·2 answers
  • Yx divide 2 use x=7 and y=2
    14·1 answer
  • Find the equation of the axis of symmetry
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!