Consider the following linear program. Max 2A + 3B s.t. 5A + 5B 0 Constraint 1 Constraint 2 Constraint 3 The figure shows a graph of the constraint lines. B 100 80 60 40 20 20 40 60 80 100 (a) Place a number (1, 2, or 3) next to each constraint line to identify which constraint it B 100 100 (3) 80 (2) 80 (1) 60 60 (c) Identify the optimal extreme point. What is the optimal solution? (A, B) = ( (d) Which constraints are binding? Explain. The optimal solution occurs at the intersection of constraints --Select--- so these are the binding constraints. (e) How much slack or surplus is associated with the nonbinding constraint? Constraint? is the nonbinding constraint. There is a ---Select--- vof associated with this constraint. Need Help? Read It