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
Cloud [144]
2 years ago
10

Given that p(n)=4n2+4n−6 and q(n)=n2−5n+8, find (p−q)(3).

Mathematics
1 answer:
seropon [69]2 years ago
4 0

Answer:

(p-q) (3) = 40 The anwser is c

Step-by-step explanation:

You might be interested in
What was the date of when the "Little Rock Nine" students entered a white public school?
Alika [10]

Answer: 1957

Step-by-step explanation:

3 0
2 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
2. Which of the following states that if the product of two real numbers is zero, then either of the two is
tatyana61 [14]

Answer:

b

B zero product property

4 0
2 years ago
A right triangle has coordinates A(6, 0), B(0, 0), and C(0, 8). What is the perimeter of the triangle?
dimulka [17.4K]

Answer:

C

Step-by-step explanation:

From the given coordinates

A(6, 0), B(0, 0) then AB = 6 - 0 = 6

B(0, 0), C(0, 8) then BC = 8 - 0 = 8

To calculate AC use Pythagoras' theorem on the right triangle formed

AC² = AB² + BC² = 6² + 8² = 36 + 64 = 100

Take the square root of both sides, hence

AC = \sqrt{100} = 10

Perimeter = AB + BC + AC = 6 + 8 + 10 = 24 → C

5 0
3 years ago
Of 960 pages 384 had an add. What's the probability it contains an add
kramer
384/960
Thus, answer=2/5
4 0
3 years ago
Other questions:
  • Divide write in simplest form 1/8 ÷ 1/2=
    6·2 answers
  • 949,500 round to the hunderd thusand
    5·1 answer
  • Bethany and her brother ben decided to go through a corn maze. Bethany starts and walks 10 feet north, 30 feet west and then 20
    11·1 answer
  • Could some body help with this? Please and thank you :)
    10·1 answer
  • Flip a coin and toss a 1-6 number cube. Probability of: (heads and not a 3)
    14·1 answer
  • Replace the ? with one of the following symbols (<, >, =, or ≠) for 4 + 3 + 7 ? 7 + 0 +7 A. ≠ B. = C. < D. >
    12·1 answer
  • What term number will have 400 square in it?
    6·1 answer
  • The perimeter of a square is 32 inches. what is the side length of the square
    12·2 answers
  • Which expression is equivalent to -15x + 5?
    13·1 answer
  • Plz quick answer this is due tomorrow morning :(
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!