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
RideAnS [48]
3 years ago
9

What is the length of segment BC. ( ) units

Mathematics
2 answers:
weqwewe [10]3 years ago
8 0

Answer:

BC = 144 units

Step-by-step explanation:

It is given a line segment BC.

D is the point on the line segment.

<u>To find the length of BC</u>

BC = 8x

CD = 3x + 8  and BD = 4x + 10

BC = CD + BD

8x = 3x + 8 + 4x + 10

8x = 7x + 18

x = 18

BC = 8x = 8 * 18 = 144 units

Therefore the length of segment BC = 144 units

pentagon [3]3 years ago
4 0

Segment BC is 144 units

You might be interested in
Yesny had $240 to spend on five pairs of jeans. How much did each pair of
krek1111 [17]

Answer:

5x + 10 = 240

Step-by-step explanation:

3 0
3 years ago
Read 2 more answers
What is the value of the blue dot​
Sergio [31]
30000000000000000000000000000000 trust me bro
4 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
A six-sided dice is thrown once
g100num [7]
A : 1/6 is the answer hope it helps
8 0
3 years ago
Read 2 more answers
What is the average of -2.6, 1.8, -3.3, -2.7, 2.2 ?<br> I dont understand this.
olya-2409 [2.1K]
Average = Mean

To find the mean, add up the numbers and divide it by how many numbers there are.

So,  -2.6+1.8+(-3.3)+(-2.7)+2.2=-4.6

There are 5 numbers in total.

-4.6 \div 5=-0.92

To do these types of division, ignore the decimal and add a 0 at the end.

So we can do:
-460\div5=-92

And put back the decimal.
Hope this helps :)
4 0
2 years ago
Other questions:
  • What is the answer to number two? Please help asap
    11·2 answers
  • A).$ -16.72<br> b).$75.50<br> c).$98.28<br> d).$16.72<br> e).$ -18.78
    6·1 answer
  • Luke’s that seven pieces of wood on top of one another if each piece was 4/8 of a foot tall how tall was his pile
    15·1 answer
  • ANSWER QUICKLY WILL MARK BRAIN!
    8·2 answers
  • If you use 25,26,27 witch number should you choose if you want to move spaces as possible? explain
    9·1 answer
  • Help me please this is probably easy for y’all hit not for me:(
    8·1 answer
  • Help me please and thank you
    13·1 answer
  • What is the simplified form of the expression 8x + 3 – 4x – 5?
    14·1 answer
  • Bailey got a 75% on a quiz. They got 15 questions
    8·1 answer
  • I need help with this trig question
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!