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
olga55 [171]
2 years ago
6

Whats the area of the shape

Mathematics
2 answers:
Brums [2.3K]2 years ago
8 0

Answer:

Step-by-step explanation: what are the dimensions

Len [333]2 years ago
7 0
28kekic01 i can't answer the question with out a picture or numbers.

Step-by-step explanation:
You might be interested in
Use the following federal tax table for biweekly gross earnings of a single person to help answer the question below.
Novay_Z [31]
a. Is the answer hope you passed!!!
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
Look below at the image provided.
vesna_86 [32]

That would be angle 2. It is on the opposite of angle 7 and it is inside the two parallel lines

Hope this helped!

~Just a girl in love with Shawn Mendes

5 0
3 years ago
Determine whether the value is a discrete random​ variable, continuous random​ variable, or not a random variable.
gulaghasi [49]
As a rule of thumb, a discrete random variable is countable.
A continuous random variable is measurable but not countable.

a. Discrete
The number of hits to a website is countable.

b. Continuous
The weight of a T-bone steak is measurable.

c. Discrete
The political party affiliations of adults are countable.

d. Discrete
The number of bald eagles in a country is countable.

e. Continuous
The amount of snowfall in December is measurable.

f. Discrete
The number of textbook authors is countable.
6 0
3 years ago
Read 2 more answers
Rice costs $x per kilogram.
liq [111]

Answer:

$1.3

Step-by-step explanation:

12x+7x+7=31.7

x=1.3

PLS GIVE BRAINLIEST

4 0
3 years ago
Other questions:
  • What can multiply to give you 80 but add up to give you 11
    13·1 answer
  • Help me please asap​
    9·1 answer
  • A country is planning to decrease government spending in order to reduce the national debt. If the outlined changes are put into
    7·2 answers
  • Suppose both employees work the same amount of time determine which employee earns more money
    10·1 answer
  • Ten people stand in line. The first goes to the back of the line and the next person sits down, so that the person who was third
    8·1 answer
  • jo divides a rectangle into parts. each part is 1/4 the area of the whole rectagle. how many parys did ko divide the rectanhle i
    6·2 answers
  • F(x) = -3x – 1<br> g(x) = 3x2 – 5x + 14<br> Find: f(g(x))
    11·1 answer
  • Let T:R²-&gt;R² be a linear transformation ,and assume that T (1,2)=(-1,1) and T(1,-1)=(2,3)
    7·1 answer
  • Foiuhgfdknsmlaeszxcyfvugbihnoj
    10·1 answer
  • Nth term of the sequence 8,48,288
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!