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
garik1379 [7]
3 years ago
10

Solve this x/5 = 2 1/2

Mathematics
1 answer:
ANTONII [103]3 years ago
7 0
12.5 because if you multiply 5 by 2.5 you get 12.5
You might be interested in
The total current of a parallel circuit is 9+j2 amps and the current of one component of the circuit is 3−j5 amps. What is the c
stealth61 [152]

Apply law of total resistance in parallel circuit

\\ \tt\hookrightarrow \dfrac{1}{R}=\dfrac{1}{R_1}+\dfrac{1}{R_2}

\\ \tt\hookrightarrow \dfrac{1}{9+2J}=\dfrac{1}{3-5j}+\dfrac{1}{R_2}

\\ \tt\hookrightarrow \dfrac{1}{R_2}=\dfrac{1}{9+2J}-\dfrac{1}{3-5J}

\\ \tt\hookrightarrow \dfrac{1}{R_2}=\dfrac{3-5J-9-2J}{(9+2J)(3-5J)}

\\ \tt\hookrightarrow R_2=\dfrac{(9+2J)(3-5J)}{-6-7J}

4 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
654.29 divided by 19
AleksAgata [21]

Answer:

It would be 34.43631578 but you can just say 34.4

Step-by-step explanation:

6 0
3 years ago
Read 2 more answers
Does anyone get this??
kirill115 [55]

Answer:

The distance from the feet to the wall is 9 ft

Step-by-step explanation:

Using trig,

We must use cosine to find the missing side.

The equation is cos 60 = \frac{adjacent}{18}

The cosine of 60 is 1/2

So, we multiply 1/2 by 18

to get 9

Hope this helps!

Branliest would really be nice!

6 0
3 years ago
ist three services of a bank other than checking accounts, savings accounts, loans, and credit cards.
Fiesta28 [93]

Answer:

Business loans.

Checking accounts.

Savings accounts.

Debit and credit cards.

Merchant services (credit card processing, reconciliation and reporting, check collection)

Treasury services (payroll services, deposit services, etc.)

Step-by-step explanation:

Can we talk

5 0
3 years ago
Other questions:
  • HURRY!!!!!! Describe the error in the work shown.
    10·2 answers
  • Write two decimals that are equivalent to 3.7
    9·2 answers
  • K=5r-11s solve for r<br>​
    9·2 answers
  • Let f(x)=x^2-2x-4
    7·2 answers
  • A collector has 120 movie posters and 100 band posters. She wants
    15·1 answer
  • (URGENT) need answer for today​
    9·1 answer
  • NEED HELP ASAP!!
    9·2 answers
  • an equation that is perpendicular to x-3y=3 and pases through the point (5,-9) in slope-intercept form
    12·1 answer
  • Find the volume of the sphere need help
    12·1 answer
  • Explain the term least significant bit (LSB).
    6·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!