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
Ad libitum [116K]
3 years ago
15

What's is the numerator and denominator of a fraction in simplest form that is equivalent to

Mathematics
2 answers:
Olenka [21]3 years ago
7 0
\frac{941}{999}
Romashka [77]3 years ago
4 0
94/100= 47/50, I'm not sure which number your teacher wanted you to round to so I just did the normal first two after dot
You might be interested in
suppose you write an equation that gives "a" as a function of "b". Which is the dependent variable and which is the independent
blondinia [14]
If im not wrong which i may not the
Dependent is A
Independent is B
4 0
3 years ago
Read 2 more answers
Help what’s the answer
aivan3 [116]

Answer: 2⁴ * 5

<u>Step-by-step explanation:</u>

                    80

                     ∧

                  8    10

                 ∧      ∧

               4  2   2  5

               ∧        

              2  2

80: 2 x 2 x 2 x 2 x 5


7 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
How much higher is 500 than -400 meters
aleksandr82 [10.1K]

I believe 900 meters your welcomes

7 0
2 years ago
Read 2 more answers
Last question<br> will give Brainliest<br> sorry if its a little blurry
vovangra [49]

Answer:

it would take 16 minutes

Step-by-step explanation:

32,000 (height) ÷ 2000 (decent) = 16 (time it takes to land)

5 0
2 years ago
Read 2 more answers
Other questions:
  • Find the value of X
    8·1 answer
  • {1, 4, 9, 4, 10, 8, 42} What is the best measure of center for this data set?
    13·2 answers
  • Can you help me please?
    9·1 answer
  • PLEASE HELP ME WITH THIS!!!
    7·1 answer
  • A line perpendicular to the line y=5x+6
    9·1 answer
  • Y/9+5=0<br> solve equation
    11·2 answers
  • Which ordered pair makes the equation true? 2x – 8y = –4
    13·1 answer
  • Two puppies eat 2 cans of dog food in 2 days. How many cans of dog food can 8 puppies eat in 8 days? Note: All puppies eat at th
    15·1 answer
  • Guys please help me with this question
    14·1 answer
  • X + 3( x + 2) + 2 in the simplest form
    6·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!