linear programming- optimal tableau

The Giapetto LP problem (without the 1121 S 40 constraint) that we have been studying in class is given by max z = $3931 + $2932 (Objective Function) at. 21101 + x2 5 100 (Finishing Constraint) 3:1 + m2 5 80 (Carpentry Constraint) $1, 332 Z 0 (Sign Restrictions) where 331 = the number of soldiers produced, 332 = the number of trains produced. The optimal tableau for this problem is given as follows. Optimal Tableau a.) (10 points) Suppose that Giapetto is thinking about making dolls and that a doll requires 2 nishing hours and 3 carpentry hours. Determine What the prot per doll must be in order for it to be protable to make dolls. b.) (15 points) Suppose that the prot per doll is $1 more than your answer in part (a). Determine how Giapetto should now plan in order to optimize his weekly prot