Consider the following linear programming problem:
Min 40A + 10B
s.t.
A + B ≥ 250
2A – B ≥ 0
B ≥ 90
A, B ≥ 0
a. Rewrite this problem in standard form.
b. At the optimal solution to this problem B = 90; and constraint 1 is binding, what is the value of A?
c. What is the objective function value at the optimal solution?
d. Find the slack/surplus for each constraint and determine which constraints are binding. Use the information in the standard form to make your calculations.