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
iren2701 [21]
3 years ago
12

Need help asap will make you brainiest

Mathematics
1 answer:
Lemur [1.5K]3 years ago
7 0

Answer:

A

Step-by-step explanation:

Hopefully this helps

You might be interested in
Natalie drives from her home to the art museum. She knows that when she passes the fire station,
scoundrel [369]

Answer:

is it maryann or natalie lol

Step-by-step explanation:

7 0
2 years ago
The area of the rectangle window is4779 cm to the second power if the length of the window is 81 cm what is the width
TiliK225 [7]

9514 1404 393

Answer:

  59 cm

Step-by-step explanation:

The area is the product of length and width. Using the given numbers, we have ...

  A = LW

  4779 cm² = (81 cm)W

  W = (4779 cm²)/(81 cm) = 59 cm

The width of the window is 59 cm.

8 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
On a scale drawing of Princeton, two landmarks are shown 2 centimeters apart. If the scale of the map is 1 centimeter : 35 kilom
tankabanditka [31]

Answer:

  70 km

Step-by-step explanation:

2 cm is twice as much as 1 cm. So, the distance between landmarks will be twice as much as 35 km.

The actual distance is 70 km.

3 0
3 years ago
6m + 2 - 4m =<br><br><br>help with this please ​
devlian [24]

The answer is: 2(m+1)


First combine like terms.
<em>we do 6m-4m which is 2m</em>
2m+2=?

Second we factor. We notice that both terms have 2.
2(m+1)

<em>by distributive law, the 2 is distributed to m and 1.
</em>

8 0
2 years ago
Other questions:
  • Geometry Question with a picture upload
    5·2 answers
  • Moriah pays $25 to join a lunch club that allows her to buy fancy lunches for $5 each. Let L represent the number of lunches she
    13·1 answer
  • How can you use remainders in divison problems
    9·2 answers
  • Explanation please how to do it
    7·1 answer
  • A = p + prt solve for t
    5·1 answer
  • If you shift the linear parent function, f(x) = x, down 6 units, what is the
    13·1 answer
  • Factor each<br> x^3 +2x^2 -4x -8 =0
    13·2 answers
  • Х = 2y + 3<br> х = Зу — 4​
    11·2 answers
  • Exponents of the multiple 3
    8·1 answer
  • To create a graph from an equation, evaluate the function at different ______. Use the input-output pairs to identify and plot _
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!