Consider the following linear program:
Max2A+3B
s.t.
5A+5B≤400 Constraint 1
-1A+1B≤10 Constraint 2
1A+3B≥90 Constraint 3
A, B > 0
Identify the optimal extreme point. What is the optimal solution?
Optimal solution is
A = ,
B = ,
Max =
Which constraints are binding?
Constraint 1 =
Constraint 2 =
Constraint 3 =
How much slack or surplus is associated with the nonbinding constraint?