A certain linear programming model involving two activities has the feasible region shown below.

The objective is to maximize the total profit from the two activities. The unit profit for activity 1 is $1,000 and the unit profit for activity 2 is $2,000.

(a) Calculate the total profit for each CPF solution. Use this information to find an optimal solution.

(b) Use the solution concepts of the simplex method given in Sec. 4.1 to identify the sequence of CPF solutions that would be examined by the simplex method to reach an optimal solution.

Transcribed Image Text:

8 (0,6 ) 6 (5, 5) 4 (6. 4) Feasible 2 (8,0) 0 2 4 6 呂 Level of Activity 1