Consider the following linear programming problem. Min 6A + 7B s.t. 1A + 4B 21 2A + 1B 7 3A + 1.5B 21 2A + 6B 0 A, B 0

(a) Find the optimal solution using the graphical solution procedure and the value of the objective function. b) Determine the amount of slack or surplus for each constraint. slack for:

1A + 4B 21=___

Suppose the objective function is changed to max 5A + 2B. Find the optimal solution and the value of the objective function.

_____at (A, B) = (_____)