In: Math
Consider the following linear programming problem: Min 2x+2y s.t. x+3y <= 12 3x+y>=13 x-y<=3 x,y>=0
a) Find the optimal solution using the graphical solution procedure.
b) Find the value of the objective function at optimal solution.
c) Determine the amount of slack or surplus for each constraint.
d) Suppose the objective function is changed to mac 5A +2B. Find the optimal solution and the value of the objective function.