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

Could I get some help it’s important

Mathematics
2 answers:
babunello [35]3 years ago
7 0

Answer: yo plug it into desmos its ez

Step-by-step explanation:

garri49 [273]3 years ago
6 0

Answer:

plot a point at (0,-7) and plot a point at (1, -4). Draw a line through those points.

Step-by-step explanation:

The equation tells you that your y intercept will be negative 7. The 3x means that your slope will be equal to up 3, and over 1 (or 3/1, which is equal to 3.)

You might be interested in
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
1. On Tuesday, Elena completed 20 items of her math homework in 36 minutes. At that same rate, how long will it take her to comp
zepelin [54]
The correct answer is 63 minutes, what you do is divide 36/20 to get 1.8 then multiply 35*1.8 to get 63.
Brainliest answer?
4 0
3 years ago
JOIN MY ZOOOm guys! 945 8081 2458 passowrd: Cgx6Nm : all are allowed:)
Ket [755]

Answer: cool!

Step-by-step explanation: ;)

8 0
2 years ago
Michelle and Natasha each had to repair their new iPhones. The initial cost of each repair is $ 100. Michelle and Natasha each h
worty [1.4K]

Answer:Michelle

And 50

Step-by-step explanation:

6 0
3 years ago
Answer the question in the picture please
iogann1982 [59]

Answer:

B

Step-by-step explanation:

Since 1.5 is the y-intercept, B (0,1.5) is the only option.

~theLocoCoco

5 0
2 years ago
Other questions:
  • What is the volume of thiss figure ?
    8·2 answers
  • Graph the equation <br><br> f(x)= 4(x)+5
    9·2 answers
  • How do I do these? I don’t understand how my teacher is teaching it so can someone explain
    6·1 answer
  • Fred bought 4 liters of liquid laundry detergent 3250 mL of fabric softener and 2.5 L of bleach which date that is true
    12·1 answer
  • Write an expression for the sequence of operations described below.
    15·1 answer
  • Is the following a function ?
    15·2 answers
  • Please this is due today.
    9·2 answers
  • Solve using the quadratic formula 2x^2 + 7x - 15 = 0
    13·1 answer
  • A table is shaped like a regular hexagon. The length of one side is (7x + 4) in. and the length of another side is (8x − 1) in.
    8·1 answer
  • There are 680 restaurants in downtown Metropolis. 20% of them serve pizza. How many of them serve pizza?
    6·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!