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).
Hope this helps (sorry if u cant see that)
Answer: 60y+48
12•5y=60y
12•4=48
The answer is letter D.
In the graph, you simply determine what we called the "x-intercept" and "y-intercept". The x-intercept of the point is located at y = 0. On the other hand, the y-intercept of the point is located at x = 0. Based on the graph, the x-intercept is -2 on the x-axis and the y-intercept is -4 on the y-axis.