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
Ratling [72]
3 years ago
12

Find the missing angle measure, arc measure or solve for x. Show all work!

Mathematics
1 answer:
n200080 [17]3 years ago
5 0

Answer:

mYW = 151°

Step-by-step explanation:

∠XWY is an inscribed angle because it has a vertex on the circle. This means that m∠XWY is half of the arc it intercepts, which is XY. We can model the situation using an equation:

m∠XWY = mXY / 2

37° = mXY / 2

mXY = 74°

All arcs in a circle add up to 360°. Because of this, we can say:

mXY + mYW + mWX = 360°

74° + mYW + 135° = 360°

209° + mYW = 360°

mYW = 151°

You might be interested in
How many people will 5 pitchers serve if pitcher serves 1/8 one person?
Marianna [84]
So if a person has 1/8 of a pitcher then you have 8 people per pitcher. Then if you have 5 pitchers you do 5 x 8 and get 40 so 40 people will be served. Hope this helps :)
7 0
3 years ago
A=1/2 bh for b i need help
qwelly [4]
You said that                      <u>  A = 1/2 b h</u>

Multiply each side by 2 :    2A  =  b h

Divide each side by 'h' :    <em>2A/h  =  b</em>
5 0
3 years ago
THE BEST MOST CORRECT ANSWER WINS BRAINIEST!!
expeople1 [14]
I found 3 sides and muliplied the answer by 2 because there are 6 sides.  
60+108+45=213
213 x 2 = 426 m squared.

4 0
3 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
This makes no sense, I don’t understand
julsineya [31]

Answer:

the range where we see the function is between x=0 and x=7

its B

A is impossible btw, no number is smaller or equal to 0 AND bigger or equal to 7

please brainliest

8 0
2 years ago
Other questions:
  • How many terms are in the expression x²-10xy+3y+y-1
    13·1 answer
  • Solve the equation on the interval [0, 2π). tan^2x sin x = tan^2x
    8·1 answer
  • In circle O, AE and FC are diameters.Arc ED measure 17 degrees
    14·2 answers
  • Factor the trinomial by grouping.<br> 6x^2 - 7x-20
    10·1 answer
  • Using base ten blocks to divide with double digits
    7·1 answer
  • FOR 12 POINTS I NEED HELP ASAP! Consider the system of linear equations. 5 x + 10 y = 15. 10 x + 3 y = 13 To use the linear comb
    5·1 answer
  • At a game show, there are 7 people (including you and your friend) in the front
    9·2 answers
  • Help me it’s not D !!!!
    11·1 answer
  • A 12 pack of soda costs $5.69. How much is one can?
    15·2 answers
  • A small box measures 3 in. by 6 in. by 3/4in. high. <br> Find the volume of the box.
    8·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!