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
Marat540 [252]
3 years ago
5

What is 0.118 in expanded form

Mathematics
1 answer:
antoniya [11.8K]3 years ago
4 0

Answer:

zero and one-hundred eighteen-thousandths

You might be interested in
Changing decimal into fraction and percent 0.15 =
Anarel [89]

Answer:

15% & 3/20

Step-by-step explanation:

convert decimals to % by multiplying by 100

.15 * 100 = 15%

15/100

simplify

3/20

4 0
3 years ago
Read 2 more answers
Morgan is making accessories for the soccer team. She uses 822.48 inches of fabric on headbands for 43 players and 3 coaches. Sh
emmasim [6.3K]

Answer:

headband 17.88

Wristband 9.31

Step-by-step explanation:

headband: 822.48/(43+3)

Wristband: 400.33/43

6 0
3 years ago
At what position on the number line is the red dot located?
raketka [301]

Answer:

C. 0.5..................

3 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
The original retail of a leather chair is listed at $121.40 and is discounted by 60% in a summer sale. What is the discount and
olga2289 [7]

Answer:48.56

Step-by-step explanation: 121.40-60%=

5 0
3 years ago
Other questions:
  • The mayor of Brookmarsh is running a campaign to revitalize his city. Currently, the population of Brookmarsh is 10,000 and is i
    10·2 answers
  • I=w/12.6r^2 where I is the intensity of light, w is the wattage of the light bulb and r is the distance to the light bulb. Let w
    14·1 answer
  • What are all the values of 7/8?
    7·1 answer
  • What is the equation of the line in slope-intercept form?<br><br> y = _ x+_=
    7·1 answer
  • Given [12 -13 17 -22] [x y] = [7 -51] what is |Ay|?<br> Please help
    7·2 answers
  • Grade 4
    5·1 answer
  • A line contains (4,2) and (0,-1). What is the equation line?
    15·2 answers
  • Which statement correctly compares the function shown on this graph with
    13·2 answers
  • A freight elevator has a weight limit of 2 tons. Each crate that is loaded weighs 80 pounds. What is the greatest number of crat
    14·1 answer
  • Where is mean by g(x)​
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!