Consider the following linear programming problem:
Min A + 2B
s.t.
A+ 4B <= 21
2A + B >= 7
3A = 1.5B >= 21
-2A + 6b >= 0
A, B >= 0
Find the optimal solution suing the graphical solution proceduce and the value of the objctive function
Determine the amount of slack or surplus for each contraint
Suppose the objective function is changed to max 5A + 2B. Find the optimal soultion and the value of the objective function.