Answer:
Following are the solution to the given equation:
Step-by-step explanation:
The graph file and correct question are defined in the attachment please find it.
According to the linear programming principle, we predict, that towards the intersections of the constraint points in the viability area, and its optimal solution exists. The sketch shows the points that are (0,16), (3,1), and (6,0).
by putting each point value into the objective function:
Thus, the objective of the function is reduced with a value of 183 at (3,1).
C is the answer since you are trying to make the ys number (-/+) of the value the other y contains
(3) so you will multiply the first equation by -3 to be able to eliminate y
Answer:
280,280
Step-by-step explanation:
i believe you just multiply 45.5 times 5280