Given the following graph of a linear programming model with a single constraint and the objective function maximize Z = 30x1 + 50x2 , determine the optimal solution point:
Determine the values by which c1 and c2 must decrease or increase in order to change the current solution point to the other extremepoint.

Transcribed Image Text:

100 90 80 70 60 50 40 30 20 10 10 20 30 40 50 60 70 80 90 100 x