Consider the following linear programming problem: Min A + 2B Subject to A + 4B <= 21 2A + B >= 7 3A + 1.5B <= 21 -2A + 6B >=0 A,B >= 0
Find the optimal solution using te graphical solution procedure and the value of the objective function
Determine the amount of slack or surplus for each constraint
Suppose the objective function was changed to max 5A + 2B. Find the optiml solution ad the value of the objective function.