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
elena-14-01-66 [18.8K]
2 years ago
12

Please help I will mark Brainly

Mathematics
1 answer:
Sloan [31]2 years ago
7 0

Answer:

The answer to number 1 is 10. The answer to number 2 is 4-6, inclusive.


You might be interested in
Maria works as a ride loader on "Space Mountain". She averages twenty passengers every twenty minutes. Sal also works as a ride
Sati [7]

Answer:

36 passengers

Step-by-step explanation:

Maria averages 20 passengers every 20 minutes, so she places 1 passenger per minute.

Sal averages 20 passengers every 25 minutes, so he places 0.8 passenger per minute.

If they work together, they can place (1 + 0.8) passengers = 1.8 passengers per minute.

In 20 minutes, they can load

1.8 passengers/minute * 20 minutes = 36 passengers

3 0
3 years ago
A study has demonstrated that the more television a person watches, the lower that person’s level of physical fitness. However,
Murljashka [212]

Answer: D

Step-by-step explanation:

3 0
2 years ago
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
I will mark you brainiest if you can answer this
Korvikt [17]

Answer:

12^4 or 20736

Step by Step Instructions:

really all you have to do is subtract the exponents. 12^7-12^3=12^4, if you want to expand the numbers you can do it that way too. 12^7=35831808, 12^3=1728, 35831808/1728=20736 (which is the same as 12^4)

4 0
2 years ago
How much does the 6 cats weights in pounds.
maksim [4K]
Add them all up and divide 6 (the number of terms given). The answer is 9.66 or 9.7 rounded to the nearest tenth.
8 0
3 years ago
Read 2 more answers
Other questions:
  • Please help this is confusing
    7·1 answer
  • Jane earns $10 per hour babysitting she also earned a one time fee of $40 she earns a total of $100 Write and solve and equation
    11·1 answer
  • I need help getting the answer
    12·1 answer
  • Solve each equation mentally for x.
    14·1 answer
  • I NEED HELP! simplify this expression
    6·1 answer
  • What is the simplified fractional equivalent of the terminating decimal 0.85?
    5·1 answer
  • PLEASE HELP NEED TO GET THIS TURNED IN!!!!!!!!!!!!!!
    5·1 answer
  • Describe the transformations from the parent function f(x)=x2 to the function g(x)=(x-2)^2+5
    13·1 answer
  • What are the last two digits of 7^1867? ​
    11·1 answer
  • The table represents the cost of flowers at the Tigerlily Flower Shop.
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!