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
padilas [110]
3 years ago
7

Diana earns $8.50 an hour working as a life guard. Write a function to find Diana’s money earned m for any number of hours h. Ho

w much does she make in 9 hours ?
Mathematics
1 answer:
Alborosie3 years ago
3 0

Answer:

76.5$

Step-by-step explanation:

8.5 x 9 = 76.5

You might be interested in
What is 7/16 simplified
Georgia [21]
You cant simplify it . it is already simplified 
7 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
Please help . I’ll mark you as brainliest if correct
Oxana [17]

Answer:

30m

Step-by-step explanation:

51-21=30 that is the length of the long piece

8 0
3 years ago
Solve the following system of equations by elimination​
olya-2409 [2.1K]

Answer:

y = -6

x = 1

Step-by-step explanation:

-x + 2y = -13

-x - 2y = 11

Sum the equations:

-x -x = -2x

+2y - 2y = 0

-13 + 11 = -2

then

-2x = -2

x = -2/-2

x = 1

from the first eq.

-x + 2y = -13

-1 + 2y = -13

2y = -13 + 1

2y = -12

y = -12/2

y = -6

check:

from the second eq.

-x -2y = 11

-1 -(2*-6) = 11

-1 -(-12) = 11

-1 + 12 = 11

5 0
2 years ago
Last year, the school library had a total of x books. Over the summer, the library acquired another 31 books and now has a total
tester [92]

Answer:

A is your answer.

Step-by-step explanation:

6 0
3 years ago
Other questions:
  • How much more rain fell in May than in April <br><br> May is 4 1/4 &amp; April is 2 5/8
    6·1 answer
  • Very numbers suck as distances in space and very numbers
    13·1 answer
  • Can I get some help im stuck???
    9·1 answer
  • 105 is a perfect square. Question 1 options: True False
    13·1 answer
  • Pls answer fast so you will get so much points fast pls
    14·2 answers
  • I need help i will give brainliest pls and also thanks
    10·2 answers
  • I need help really don’t understand
    8·2 answers
  • Grade 8th Math Question answer
    13·1 answer
  • Help ASAP I’ll mark you as brainlister
    13·1 answer
  • What is the independent quantity?<br> A) not enough information<br> B) types of food I eat
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!