Let the linear programming problem given below:
Min A + 2B
s.t.
A + 4B <= 21
2A + B => 7
3A + 1.5B <= 21
-2A + 6B => 0
A,B => 0
i) Determine optimal solution using graphical solution procedure and the value of objective function.
ii) Find the amount of slack or surplus for every constraint.
iii) Assume objective function is changed to max 5A + 2B. Determine optimal solution and value of objective function.