What 2+3+5+6+7+8+9+10=
2 answers:
You might be interested in
Answer:
Step-by-step explanation:
By the definition of an angle bisector, we have that .
We can add to both sides to get
.
We can then subtract from both sides to get
.
We can finally divide both sides by to get
Answer:
(3, 0).
Step-by-step explanation:
dentifying 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.
Hence, The Answer is ( 3, 0)
