In general, you solve a problem like this by identifying the vertices of the feasible region. Graphing is often a good way to do it, or you can solve the equations pairwise to identify the x- and y-values that are at the limits of the region.
In the attached graph, the solution spaces of the last two constraints are shown in red and blue, and their overlap is shown in purple. Hence the vertices of the feasible region are the vertices of the purple area: (0, 0), (0, 1), (1.5, 1.5), and (3, 0).
The signs of the variables in the contraint function (+ for x, - for y) tell you that to maximize C, you want to make y as small as possible, while making x as large as possible at the same time. The solution space vertex that does that is (3, 0).
It’ll be length= 12ft width= 26ft
(76-24)/2= width
1. She could get 9 envelopes for 4 dollars each (or the other way around)
2. She could get 12 envelopes for 3 dollars each (or the other way around)
3. She could get 18 envelopes for 2 dollars each (or the other way around)
Answer:
it’s B
Step-by-step explanation: I think..?
2. definition of bisector
3.definition of perpendicular
4.∠AXP=~∠AXQ
6.SAS congruence postulate
7.Corresponding parts of congruent triangles are congruent