1. Analyze the given graph of a linear programming model with a single constraint and the objective function:
Use the information given in the graph to answer the following questions:
a. Maximize Z = 30x1 + 50x2.
b. Determine the optimal solution point.
c. Determine the values by which the constraints c1 and c2 must decrease or increase in order to change the current solution point shown in the graph to the other extreme point.