You Are Given a Linear Programming Problem

You are given a linear programming problem. Use the method of corners to solve the problem.
Minimize = __________ = __________ = __________
Find the range of values that the coefficient of can assume without changing the optimal solution.
≤ c ≤
Find the range of values that requirement 1 can assume.
≤ b ≤
Find the shadow price for requirement 1. Enter your answer to two decimal places, if necessary.
$ __________
Identify the binding and nonbinding constraints.
Constraint 1 is __________
Constraint 2 is __________