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
ipn [44]
3 years ago
6

#9 - The Question

Mathematics
1 answer:
melamori03 [73]3 years ago
7 0

Answer:

  12

Step-by-step explanation:

There are many ways to approach this problem. I like a method that uses the least amount of computation. We could figure how much Wendy makes on a bag of chips, the additional amount Wendy wants to make, then divide the latter by the former to find the number of additional bags to sell.

We could use a proportion to figure the number of bags corresponding to $126 in earnings, then subtract the 72 bags already sold. Essentially, we will do this, but without the intermediate numbers.

__

The additional fraction of 72 bags will be ...

   (126/108) -1 = 18/108 = 1/6

Then Wendy must sell an additional ...

  (1/6)×(72 bags) = 12 bags

to increase her earnings to $126.

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
2(3 – 8y)
Hoochie [10]

Answer:

21

Step-by-step explanation:

7 0
3 years ago
Read 2 more answers
You cannot remember your 4-digit bike-lock combination. What is the probability that you guess the combination correctly? (Enter
Svetradugi [14.3K]
1/10000 every try














..................
3 0
3 years ago
Select the correct solution set. 50 ≥ 15x
Semenov [28]
The answer (i think) is 3 <span>≥</span> x. hope i helped
7 0
3 years ago
A car goes 125 miles on 12 1/2 gallons of gas. How far will the car travel on 1 gallon of gas?
fgiga [73]

Answer:

10

Step-by-step explanation:

125/12.5

5 0
3 years ago
Other questions:
  • Can someone plz help me with this answer is not A I’m not understanding it plz help
    15·1 answer
  • The number 28 please somebody help me...
    14·1 answer
  • Can someone please answer this questions please answer it correctly and please show work please help me I need it please
    15·1 answer
  • Find the surface area of the regular pyramid. round to the nearest tenth if necessary.
    8·1 answer
  • 7.) When rounding to the nearest 10, what is the largest number that will
    5·1 answer
  • Can someone please help me with this? help would be very much appreciated!
    11·2 answers
  • Help please will give brainiest
    13·1 answer
  • An 8-foot rope is tied from the top of a pole to a stake in the ground,as shown in the diagram below.
    6·1 answer
  • FOR 43 POINTS PLEASE HELP I don't want to fail I need as much help as i can get
    14·2 answers
  • A book fair worker needs to place 2,204 books on displays with 58 books on each display how many displays are needed to hold all
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!