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
andrew-mc [135]
3 years ago
7

How do you work out this problem?3x+15=66

Mathematics
2 answers:
vivado [14]3 years ago
4 0

3x + 15 = 66

<u>      -15    -15</u>

3x =  51

Divide 51 by 3 which equals 17.

Alex3 years ago
4 0
Get 3x by itself then divide it by the number on th other side of the equation

You might be interested in
Four students took an exam the fraction of the total possible points that each received is given which students had the highest
Fittoniya [83]

Answer:

4% out of 100

Step-by-step explanation:

4% out of 100 students took the exam

7 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
What is probability of P(5)?m
olganol [36]
P(A) means "Probability of Event A" The complement is shown by a little mark after the letter such as A' (or sometimes Ac or A): P(A') means "Probability of the complement of Event A" The two probabilities always add to 1.
8 0
3 years ago
Find the measure of the missing angles. Both of them is wrong. (Picture included)
Ymorist [56]

Answer: you need to add them together then add BAND D to the same expersion

6 0
3 years ago
Y =2/3x + 20<br><br> when x = 21
nydimaria [60]

Answer:

34

Step-by-step explanation:

First we need to do 2/3*21, which equals 14 as 3 and 21 can be simplified to 1 and 7. 7 * 2/1= 14. Then we add the 20 to 14, 20+14= 34

6 0
3 years ago
Read 2 more answers
Other questions:
  • Eight times the reciprocal of a number equals 4 times the reciprocal of 8. find the number
    10·1 answer
  • What does berdmas mean
    10·2 answers
  • The cost of six hens and one duck at the university poultry farm is GH₵40. While four hens and three ducks cost GH₵36. What is t
    14·1 answer
  • If 50 empty soda cans weigh 3.5 pounds how much would 70 empty soda cans weigh ​
    9·1 answer
  • Help please the question is on the photo.
    9·1 answer
  • Find the perimeter of the triangle to the nearest unit A(-2,3) B(2,1) C(-2,1)​
    9·1 answer
  • Anyone know the answer to this question
    6·1 answer
  • PLEASE HELP WILL MARK AS BRAINLEST
    12·2 answers
  • Plz help I will mark branliest
    13·1 answer
  • Factor the following quadratic expression x^2 + 9x + 20
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!