hand solved (option 1) is fine for solution

05. [Adapted from Factory Physics textbook] Noone Inc., a manufacturer of Freon recovery units for automotive air conditioner maintenance experiences a strongly seasonal demand pattern, driven by the summer air conditioning season. This year Nontrone has put together a 6-month production plan, where the monthly demands for TECOVERY units are given in the table below. Each recovery unit is manufactured from on chassis assembly plus a variety of other parts. The chassis assemblies are produced in the machining center. Since there is a single chassis assembly per recovery unit, the demands in the table below ako represent demands for chassis asumibles The unit od 550 fixed setup cost is $500, and monthly holding cost for chassis assemblies is Sl. The fired setup cost is the firm's estimate of the cost to change over the machining center to produce chassis assemblies, including labor and materials cost and the cost of disruption of other product lines Period Demand 1 000 2 1200 3 0 4 2001 1 0 2000 1000 You have two options to solve this problem Option 1: By hand Use the Wagner Whitin algorithm directly to compute an optimal production schedule for the first four months of chassis assemblies. Option 2: For those looking to practice dynamic programming in their favorite lugweg Right a short computer program to solve the full 6-month problem, using the recursive equations described in the Dynamic Inventory WW lecture, and described in further detail here. Worth 10 extra homework points for the semester Given a planning horizon of T periods, for all pairs (j) such that 1 Sicis T + 1, calculate the cost associated with producing in period i the full demand for periods through j-1 (that is, produce (D+D+1 + - + D-1) units) and carrying the inventory to the consumption period. The associated ordering production and inventory costs will be ROD Where is the unit production cost of $50 in the example, is the fixed cost of $500, and h-SI. Let be the minimum cost of a problem that starts in period i with no inventory and satisfies demands for periods through T-1. The optimal order schedule is equivalent to a minimum cost path from 1 to T+1 and can be found using hackwards recursion as follows Initializer = 0 For 1-1, 1-1,..., recursively calculate f. f = miny+f}