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
a) Determine the optimal solution to this problem.
b) Convert problem standard LP form.
c) Determine the values of the slack and surplus variables and interpret them.
d) Which constraints are binding constraints? Describe.