A "catering" service has contracted a series of s dinners for 6 nights; the first 4 dinners are consecutive, then there area night when there is no dinner and on the sixth night the last supper is offered. The caterer must buy special napkins for these dinners because the club has requested a special type of napkin that has not been used before, and will not be used again. The number of dinners to be served each night is listed in the table below. A napkin is required for each dinner. Two types of laundry service are available for napkins. Regular service takes 2 days (for example, a napkin sent to be washed at the end of dinner on day 1 is can use again for a dinner on day 3) and charges $1 to wash it. A faster service takes 1 day (napkins sent to be washed end of a dinner on day 1 will be ready for use at dinner on the second day), it costs $2.28 per napkin but this service does not accept more than 205 napkins per day. New napkins cost $ 16.4 each. The caterer wants to minimize costs associated with buying and washing napkins # Dinner Foods 1 300 2 350 3 300 4 200 5 400 a. The table below shows a solution to this problem; for each of the dinners [1] the number of napkins to be indicated is indicated purchased for each of those five dinners; [2] the number of napkins to be sent to regular service; and (3] the number of napkins to be sent to the fastest service for washing. Is this solution feasible? clearly justify your answer. What is the total cost associated with the purchase and washing of napkins according to this proposed solution 2 3 4 # Dinner 1 bought 2 regular service 3 fast service 1 300 94 300 144 144 412 15 5 215 237 BB 206 206 212 185 163 b. Draw a network diagram (generic-without a particular number of napkins) illustrating the flow of napkins (sicx.clean sent to be washed...)generated by the 5 scheduled dinners during the 6 days. Use that diagram as a starting point to formulate a linear programming model to determine the number of napkins to buy each day, and the number to send to the regular and express laundry each day. Make sure you clearly define the decision variables, the objective function, and the constraints. c. Solve the linear programming model raised in part (b). Give your optimal solution and the total cost of buying and washing the napkins corresponding to this optimal solution. Making a table like part b A "catering" service has contracted a series of s dinners for 6 nights; the first 4 dinners are consecutive, then there area night when there is no dinner and on the sixth night the last supper is offered. The caterer must buy special napkins for these dinners because the club has requested a special type of napkin that has not been used before, and will not be used again. The number of dinners to be served each night is listed in the table below. A napkin is required for each dinner. Two types of laundry service are available for napkins. Regular service takes 2 days (for example, a napkin sent to be washed at the end of dinner on day 1 is can use again for a dinner on day 3) and charges $1 to wash it. A faster service takes 1 day (napkins sent to be washed end of a dinner on day 1 will be ready for use at dinner on the second day), it costs $2.28 per napkin but this service does not accept more than 205 napkins per day. New napkins cost $ 16.4 each. The caterer wants to minimize costs associated with buying and washing napkins # Dinner Foods 1 300 2 350 3 300 4 200 5 400 a. The table below shows a solution to this problem; for each of the dinners [1] the number of napkins to be indicated is indicated purchased for each of those five dinners; [2] the number of napkins to be sent to regular service; and (3] the number of napkins to be sent to the fastest service for washing. Is this solution feasible? clearly justify your answer. What is the total cost associated with the purchase and washing of napkins according to this proposed solution 2 3 4 # Dinner 1 bought 2 regular service 3 fast service 1 300 94 300 144 144 412 15 5 215 237 BB 206 206 212 185 163 b. Draw a network diagram (generic-without a particular number of napkins) illustrating the flow of napkins (sicx.clean sent to be washed...)generated by the 5 scheduled dinners during the 6 days. Use that diagram as a starting point to formulate a linear programming model to determine the number of napkins to buy each day, and the number to send to the regular and express laundry each day. Make sure you clearly define the decision variables, the objective function, and the constraints. c. Solve the linear programming model raised in part (b). Give your optimal solution and the total cost of buying and washing the napkins corresponding to this optimal solution. Making a table like part b