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
valina [46]
2 years ago
8

Help me Simplify: 7s + 7 - 4s - 3

Mathematics
2 answers:
attashe74 [19]2 years ago
7 0
<h2>Answer:</h2><h2>3s + 4</h2><h2 /><h2>Hope this helps!!!</h2>

igor_vitrenko [27]2 years ago
6 0

Answer:

3s+4

Step-by-step explanation:

rewrite

7s-4s+7-3

solve

7s-4s   +    7-3

3s        +      4

You might be interested in
if the side length of the cube is 5 inches the volume of the cube is how many cubic inches and its total surface area is how man
valina [46]
Volume= 125cm cubed
Total Surface area=150 cm squared
5 0
3 years ago
Solve by completing the square, x^2 + 6x - 6 = 0
MArishka [77]

Answer:

X= 6.87298334

3 0
3 years ago
EXPAND it please and explain <br> (9r-s/7)(9r+s/7)
Mars2501 [29]

Answer:

2. 2

81r - s/49

Step-by-step explanation: I don’t know how to explain it but yeah

( I’m probably wrong so if I am I’m sorry)

4 0
3 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
100 POINTS!!!!!! HELP
irga5000 [103]
A - 1766! I hope this helps
7 0
3 years ago
Other questions:
  • Determine the critical value(s) of the test statistic for each of the following small sample tests for the population mean where
    12·1 answer
  • Which angle is included angle forJL and KL
    10·1 answer
  • Alicia cashed her paycheck and used half her earnings to take three friends to dinner. She spent $42.15 on dinner and she brough
    12·2 answers
  • Flowers sell for $15 per dozen. which equation represents y, the total cost of flowers for dozens?
    9·1 answer
  • 6x - 1 = x + 19. What is x?
    6·2 answers
  • A dirt bike chain fits tightly around two circular gears. Find the distance between the centers of the gears.
    14·1 answer
  • What percent of the data lies between 109 minutes and 138 minutes?
    15·2 answers
  • What is the least common multiple of 25, 10 and 30?
    13·2 answers
  • Loook below find the area
    12·1 answer
  • Mr. Harris works in a pet store. The number of food pellets he puts in an aquarium is proportional to the number of fish in the
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!