Answer:
- 27 hot dogs
- 13 bags of popcorn
Step-by-step explanation:
Had all received popcorn, the bill would have been 40×$1.75 = $70. The bill was $13.50 more than that. Each hot dog purchased in place of popcorn adds $0.50 to the bill, so the number of hot dogs must be ...
$13.50/$0.50 = 27
Of course, the remainder of the 40 items were popcorn, so 13 bags of popcorn.
27 hot dogs and 13 bags of popcorn were purchased.
Answer:
40
Step-by-step explanation:
Based on the Proportional Transversal Theorem, the three parallel lines hat intersects the two transversals, divides the transversal lines proportionally.
Therefore, we would have the following ratio:
28/35 = ?/50
Cross multiply
35*? = 50*28
35*? = 1,400
Divide both sides by 35
? = 1400/35
? = 40
Let x be the number of people that can be seated.
The value of x is some number 0 or greater, such that this number is a whole number (we can't have half a person). This means that
which is the same as saying
The instructions state that we can seat up to 1200 people. This is the max capacity. We can't go over this amount. So we will also have
indicating that x can be less than 1200 or equal to 1200.
So putting the two inequalities together, we get
Note: if you haven't learned about compound inequalities yet, then the teacher may only want
as the answer.
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.
Step-by-step explanation:
2x²+3x-2=0
(2x-1)(x+2)
x+2=0
x=-2 (no, because x must be >0)
2x-1=0
2x=1
x=½ (yes, because x>0)
