Giapetto's Woodcarving Inc, (GW) manufactures two types of wooden boys: soldiers and trains. A soldier sells for $27 and uses $10 worth of raw materials. Each soldier that is manufactured increases Giapetto's variable labor and overhead costs by $14. A train sells for $21 and uses $9 worth of raw materials. Each train built increases Giapetto's variable labor and overhead costs by $10. The manufacture of wooden soldiers and trains requires two types of skilled labor: carpentry and finishing. A soldier requires 2 hours of finishing labor and 1 hour carpentry labor. A train requires 1 hour of finishing and 1 hour of carpentry labor. Each week, Giapetto can obtain all the needed raw material but only 100 finishing hours and 80 carpentry hours. Demand for trains is unlimited, but at most 40 soldiers are bought each week. Giapetto wants to maximize weekly profit (revenue - costs). Next, we consider following subquestions on a mathematical model of Giapetto's situation that can be used to maximize Giapetto's weekly profit. With decision variables 21: number of soldiers produced each week 12: number of trains produced each week, write the objective function z to be maximized. List all constraints. List all sign restrictions. Solve for the graphical solution and the optimal value. List all binding constraints. Giapetto's Woodcarving Inc, (GW) manufactures two types of wooden boys: soldiers and trains. A soldier sells for $27 and uses $10 worth of raw materials. Each soldier that is manufactured increases Giapetto's variable labor and overhead costs by $14. A train sells for $21 and uses $9 worth of raw materials. Each train built increases Giapetto's variable labor and overhead costs by $10. The manufacture of wooden soldiers and trains requires two types of skilled labor: carpentry and finishing. A soldier requires 2 hours of finishing labor and 1 hour carpentry labor. A train requires 1 hour of finishing and 1 hour of carpentry labor. Each week, Giapetto can obtain all the needed raw material but only 100 finishing hours and 80 carpentry hours. Demand for trains is unlimited, but at most 40 soldiers are bought each week. Giapetto wants to maximize weekly profit (revenue - costs). Next, we consider following subquestions on a mathematical model of Giapetto's situation that can be used to maximize Giapetto's weekly profit. With decision variables 21: number of soldiers produced each week 12: number of trains produced each week, write the objective function z to be maximized. List all constraints. List all sign restrictions. Solve for the graphical solution and the optimal value. List all binding constraints