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
slega [8]
3 years ago
6

Last year 80 students signed up for a summer trip to Washington, DC. This summer 50 students have signed up to go. What is the p

ercent decrease in the number of students?
Mathematics
2 answers:
erastovalidia [21]3 years ago
8 0
50/80 = 0.625

100 - 0.625 = 0.375

0.375 = 37.5% (move the decimal point to the right 2 spaces)

37.5% decrease is your answer

hope this helps
liq [111]3 years ago
5 0
The decrease percent is 30% why? Well because you subtract 80 minus 50 which equals 30 so it's 30%
You might be interested in
HELP ME PLEASEE real quick just answer
nordsb [41]
B 1/2 because there is a 6/12 chance simpllify that and it's 1/2
6 0
3 years ago
Oliver is buying his new soccer uniform his jersey was $21.50 his cleats for $44.95 and his water bottle was $12 if you paid wit
Anon25 [30]

Answer:

$21.55

Step-by-step explanation:

21.50 + 44.95 + 12 = $78.45

100 - 78.45= $21.55

8 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
The equation with one change and no solutions: 8x + 6 =
Lisa [10]
The answer is 2 ........
6 0
3 years ago
In 2015 the population of 895 quail increases at an annual rate of 3.5%. In writing an
spayn [35]

Answer:

y=895•1.07^x Y is the population of quails and X is the amount of years that have passed.

Step-by-step explanation:

hope this helps

7 0
3 years ago
Other questions:
  • The perimeter of a square is 56cm. What is the approximate length of its diagonal?
    5·2 answers
  • -an initial charge of $20 to create the silk
    11·1 answer
  • Mateo has y pairs of shoes his brother has 5 fewer than him. write an expression in its simplest form that represent the total a
    9·1 answer
  • How do you write the decimal 0.7 as a fraction in simplest form
    10·1 answer
  • Madison Middle School spends $750 per year on club activities. They spend at least twice the amount on after school activities.
    5·1 answer
  • PLEASE HELP!!!
    6·1 answer
  • A washer and a dryer cost $1039 combined. The washer costs $89 more than the dryer. What is the cost of the dryer?
    11·2 answers
  • HELP PLEASE !! .................................................................................................................
    5·2 answers
  • The number of copies made each week by teachers at Lamley High School follows a bell-shaped distribution with a
    5·1 answer
  • Help how can I show work for this???
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!